[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 34 from proof nextnli-lemma (
previous step
)
⊦ ∃ lf. lf(0) = x ∧ (∀ m. m < 0 → lf(m + 1) = nextnli(lf(m), m))
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 35
:
⊦ ∃ lf. lf(0) = x
Rule argument
Additional information
Used simplifier rules: zero-01: ⊦ ¬ m < 0; from specification nat-basic1