[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 allge-alt-def
⊦ all≥(x, a) ↔ (∀ n. n < # x → ¬ x[n] < a)
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: 1
Proof steps: 10
Used lemmas:
allge-def
,
Used spec theorems:
list-del
/
in-get
Used simplifier rules:
list-data
/
l
nat-basic
/
f
list-del
/
get-in
nat-basic
/
refl-nat