[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 eq-leninv
⊦ ⌜n⌝ < # nσ ∧ stutf(nσ) → (⌜nσ[n]⌝ = leninv(nσ) ↔ # nσ = ∞ ∧ (∀ m. n < m ∧ ⌜m⌝ < # nσ → nσ[m] = nσ[n]))
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: 25
Proof steps: 51
Used lemmas:
stutf-alltakenmax
,
stutf-nonempty
,
leninv-succ
,
stutf-monle
,
monle-leq
,
leninv-zero
,
Used spec theorems:
stream-old
/
extensionality
nat-inf
/
add-fin
Used simplifier rules:
stream-old
/
size-inf
nat-inf
/
less-inf2
stream-old
/
sel-inf
nat
/
lels
nat
/
lez-01
nat-basic
/
succ
nat-basic
/
c
nat-basic
/
a
nat-basic
/
oz
nat-basic
/
f
nat-basic
/
lf-02
nat
/
lels-02
nat
/
lels-03
nat
/
fle
nat-basic
/
l-02
nat-inf
/
elim-rqui
nat-inf
/
less-fin
nat-inf
/
disj-rqui-infty
stream-old
/
size-empty-equiv
nat
/
elim-pred-c
nat-basic
/
s-04
nat-inf
/
add-fin
nat-inf
/
add-assoc
nat-inf
/
add-comm
nat-inf
/
inf-inseq-reduce
nat-basic
/
refl-nat
nat
/
eq
nat-basic
/
lf-01
nat
/
ler
nat
/
eqle-one
nat-basic
/
trans-nat
nat-basic
/
lf
nat
/
succ-01
nat-basic
/
ls-02