[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 inv-inverts-last
⊦ stutf(nσ) ∧ # nσ = ⌜n⌝ + ⌜1⌝ → inv(nσ)[nσ[n]] = n
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
leninv-invlast-inv
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 17
Proof steps: 39
Used lemmas:
leninv-invlast
,
leninv-zero
,
maxinf-fin
,
maxinf-inf
,
inv-def
,
Used spec theorems:
stream
/natstream/
get-infto
Used simplifier rules:
stream
/natstream/
to-inf
stream
/natstream/
sel-inf
nat-inf-basic
/
elim
stream
/natstream/
sel-fin
nat
/
lels
nat-basic2
/
succ
nat-inf
/
add-fin
nat-basic1
/
ref-1
stream
/natstream/
get-infto
nat
/
le-add
nat
/
lez
stream
/natstream/
to-zero-nf
stream
/natstream/
size-inf
nat-inf
/
add-inf-02
nat-inf-basic
/
disj
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
s
nat-inf
/
inf-inseq-reduce
nat-inf
/
add-comm
nat-inf
/
add-assoc
nat-basic1
/
lf-02
nat-basic1
/
f
nat-basic1
/
neq-01