[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 stutf-alltakenmax
⊦ stutf(nσ) ∧ ⌜m⌝ < # nσ ∧ n < nσ[m] → (∃ m0. m0 < m ∧ nσ[m0] = n ∧ nσ[m0 + 1] = n + 1)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
eq-leninv
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 8
Proof steps: 20
Used lemmas:
stutf-nonempty
,
stutf-def
,
stutf-zero
,
Used spec theorems:
Used simplifier rules:
nat-inf
/
add-fin
nat-basic2
/
eq
nat-inf
/
lsle-trans
nat-inf
/
ls-natinf-to-nat-2-1
nat-basic2
/
l-02
nat-inf
/
add-assoc
nat-inf
/
add-comm
nat-basic2
/
succ
nat-basic2
/
s
nat-basic1
/
ref-1
nat-basic1
/
ls-02
nat-basic2
/
neq-01
nat-basic2
/
oz
nat-basic1
/
lf-01
nat
/
succ-01
nat-basic2
/
c
nat-basic2
/
a
nat
/
eqle-one
nat-basic1
/
lf-02
nat-basic1
/
f