[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 ls-ext
⊦ nx < m ↔ (∀ n. n ∈ nx → n < m)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
ls-add
,
ls-bound-notin
,
ls-prepend-bound-add1
,
Used by units in proved state:
array-indices
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 11
Used lemmas:
ls-rec
,
ls-base
,
Used spec theorems:
Used simplifier rules:
list
/nat-list-set/
in-empty
list
/nat-list-set/
in-rec
list
/nat-list-set/
c
nat
/
fle
nat
/
lels
nat
/
le-ls-simp
nat-basic
/
f
list
/nat-list-set/
a