[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
,
Theorem nextnli-lemma
⊦ ∃ lf. lf(0) = x ∧ (∀ n. lf(n + 1) = nextnli(lf(n), n))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
infinite-append-prefixnextnli
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 20
Proof steps: 45
Used lemmas:
Used spec theorems:
Used simplifier rules:
nat
/
lep
nat
/
ler
nat-basic1
/
ref-1
nat
/
lez
nat
/
let
nat
/
fle
nat
/
succ-01
nat
/
lels-03
nat-basic1
/
zero-01
nat-basic2
/
s
nat-basic2
/
succ
nat
/
lels
nat-basic2
/
eq-01
nat-basic2
/
oz
nat-basic1
/
f
nat
/
lels-02
nat-basic2
/
a
nat-basic2
/
c
nat-basic2
/
eq
nat-basic2
/
l-02