[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 alllerange-reclow
m < n, m < # x ⊦ all≤(x, m, n, a) ↔ ¬ a < x[m] ∧ all≤(x, m + 1, 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: 0
Proof steps: 10
Used lemmas:
allle-range-def
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
f
list-data
/
l
nat-basic
/
c
nat-basic
/
a
nat
/
succ-01
nat
/
ler
nat-basic
/
succ
nat-basic
/
trans-nat
nat-basic
/
lf
nat
/
lels-03
weakord
/tord/
nll
nat
/
fle-01
nat
/
lels
nat
/
anti