[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 monls-exists-maxleq
mon<(nσ), nσ[0] < n, n ≤ nσ[m], ⌜m⌝ < # nσ ⊦ ∃ m0. nσ[m0] < n ∧ n ≤ nσ[m0 + 1] ∧ m0 ≤ m
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: 9
Proof steps: 18
Used lemmas:
monls-exists-maxls
,
monls-ls
,
Used spec theorems:
Used simplifier rules:
stream
/natstream/
zero-len
nat
/
lep
nat
/
lels-02
nat
/
fle-01
nat-basic1
/
lf-02
nat-basic1
/
lf-01
nat
/
anti
nat
/
lez
nat-basic1
/
trans-1
nat-basic1
/
lf
nat
/
succ-01
nat-basic2
/
succ
nat-basic1
/
f
nat
/
fle
nat
/
lels
nat
/
lels-03
nat
/
ler
nat-basic2
/
s
nat-basic1
/
ref-1
nat-basic2
/
a
nat-basic2
/
c
nat-inf
/
add-fin
nat
/
le-ls-simp
nat-inf
/
lsle-trans
nat-inf
/
less-succ-leq
nat-inf
/
less-fin
nat-inf
/
add-assoc
nat-inf
/
add-comm