[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 choice
ok(a), ∀ b. ok(b) → (∃ c. rel(b, c) ∧ ok(c)) ⊦ ∃ nf. nf(0) = a ∧ (∀ n. ok(nf(n)) ∧ rel(nf(n), nf(n + 1)))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 19
Proof steps: 36
Used lemmas:
choice-aux
,
Used spec theorems:
Used simplifier rules:
nat-basic1
/
zero-01
nat-basic1
/
f
nat-basic1
/
zero
nat-basic1
/
ref-1
nat-basic2
/
s
nat-basic2
/
succ
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
nls-fst