[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 succlessleninv-invsize
⊦ ⌜n⌝ + ⌜1⌝ < leninv(nσ) ∧ stutf(nσ) → (¬ # nσ ≠ ⌜inv(nσ)[n]⌝ + ⌜1⌝ ↔ 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: 3
Proof steps: 6
Used lemmas:
leninv-invlast-inv
,
leninv-is-len-inv
,
stutf-invmonls
,
monls-ls
,
leninv-inf-strong
,
Used spec theorems:
Used simplifier rules:
nat-inf
/
sum-notinf
nat-inf
/
ls-natinf-to-nat-2-1
nat-basic1
/
f
nat-basic2
/
l
nat-basic2
/
oz
nat-inf
/
add-fin
nat-basic2
/
succ
nat-inf
/
add-assoc
nat-inf
/
add-comm
nat-inf
/
inf-inseq-reduce
nat-basic2
/
s
nat-basic1
/
ref-1
nat-basic2
/
a
nat-basic2
/
c