[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-notsmall
⊦ mon<(nσ) ∧ nσ[0] = 0 ∧ ⌜n + 1⌝ < # nσ → (n < nσ[n + 1] ↔ true)
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
monlsinf-notsmall
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 10
Used lemmas:
monls-def
,
Used spec theorems:
Used simplifier rules:
stream
/natstream/
size-empty-equiv
nat-inf
/
onels-neqzero
nat-basic
/
c
nat-basic
/
a
nat-basic
/
zero
nat-inf
/
add-all-zero
nat-inf
/
add-assoc
nat-inf
/
add-comm
nat-basic
/
f
nat-inf
/
add-fin
nat
/
lels
nat-basic
/
succ
nat
/
le-one
nat-inf
/
less-fin
nat-inf
/
add-ls-cancel-01
nat-inf
/
lsle-trans
nat-inf
/
num-add
nat
/
le-ls-simp