Here is a proof:
theory Example
imports Main
begin
datatype natural = Zero | Succ natural
lemma "⋀ n. n = Succ m ⟹ n ≠ Zero"
proof -
fix n
assume "n = Succ m"
from this show "n ≠ Zero" by (metis natural.distinct(2))
qed
end
The depth
value is 0 throughout the proof but after
show "n ≠ Zero"
it changes to
proof (prove): depth 1
What does depth
mean here? Is it any important when carrying out a proof?