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