[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 leninv-inf-strong
⊦ stutf(nσ) → (¬ leninv(nσ) ≠ ∞ ↔ # nσ = ∞ ∧ (∀ m. ∃ m0. m < m0 ∧ nσ[m] < nσ[m0]) ∧ (∀ m. ∃ m0. m < nσ[m0]))
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
inv-get-inverse-between
,
inv-get-inverse-succ
,
inv-get-lslen
,
inv-inverts
,
succlessleninv-invsize
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 15
Used lemmas:
stutf-zero
,
leninv-inf
,
Used spec theorems:
Used simplifier rules:
nat-basic1
/
zero
nat-basic2
/
succ
nat-basic1
/
ref-1
nat-basic2
/
s
nat-basic2
/
oz
nat-basic1
/
lf-01
nat
/
eqle-one
nat-basic2
/
c
nat-basic2
/
a
nat
/
les
nat
/
lels
nat-basic1
/
lf-02
nat-basic1
/
f