[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 wf-equiv-noethind
⊦ wf(wf≪) ↔ (∀ p. (∀ a. (∀ a0. wf≪(a0, a) → p(a0)) → p(a)) → (∀ a. p(a)))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
twf-noethind
,
wf-lexical
,
wf-lexicalind
,
wf-noethind
,
wfinv-equiv-noethind
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 42
Proof steps: 83
Used lemmas:
wf-def
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
c
nat-basic
/
a
nat-basic
/
s-04
nat
/
lep
nat-basic
/
refl-nat
nat-basic
/
succ
nat
/
lez
nat-basic
/
f
nat
/
succ-01
nat
/
lels-03
nat-basic
/
less-zero
nat
/
lels
nat-basic
/
eq-01
nat-basic
/
oz
nat-basic
/
eq-02
nat
/
ler
nat
/
lels-02
nat-basic
/
l-02