[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 less-leninv
⊦ stutf(nσ) ∧ # nσ = ∞ ∧ nσ[n + 1] = nσ[n] + 1 → (¬ ⌜nσ[n]⌝ < leninv(nσ) ↔ false)
Type: A user defined theorem
Validity: The proof is valid.
Features: localsimp, simp,
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: 15
Used lemmas:
stutf-monle
,
monle-leq
,
leninv-succ
,
leninv-zero
,
Used spec theorems:
Used simplifier rules:
nat
/
lels
nat-inf
/
less-fin
nat
/
lez
stream
/natstream/
sel-inf
nat
/
succ-01
nat-inf
/
add-fin
nat-basic2
/
succ
nat-basic1
/
lf-02
nat-basic1
/
ref-1
nat
/
ler
nat-basic1
/
f
nat
/
eqle-one
nat
/
lels-01
nat-inf
/
less-inf2
nat
/
ls-le-simp
nat-basic2
/
s
nat-basic1
/
ls-02
nat-basic2
/
a
nat-basic2
/
c
nat-basic2
/
eqs
nat-basic1
/
lf-01
nat-basic2
/
eq