[Imprint]
[Data Privacy Statement]
[E-Mail]
View
long theorem info
. View
the proof
. Back to
main index
. View
the specification
. View
theorem base summary
, View
theorem base listing
, the
used properties by spec
, the
dependency list
, the
symbol table
,
Proof step 4 from proof intrace-expand (
previous step
)
⊦ nf(n) = (n = 0 ⊃ nf(0);nf((n - 1) + 1))
Heuristic if-then-else split applied rule case distinction
And obtained the following new goals
Proof step 5
:
n ≠ 0 ⊦ nf(n) = nf((n - 1) + 1)
Rule argument
pos: right 1
Additional information