[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-get-inverse
⊦ stutf(nσ) ∧ ⌜n⌝ < leninv(nσ) → nσ[inv(nσ)[n]] = n
Type: A user defined theorem
Validity: The proof is valid.
Features: simp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 34
Proof steps: 73
Used lemmas:
stutf-nonempty
,
leninv-succ
,
maxinf-fin
,
stutf-alltaken
,
stutf-zero
,
stutf-monle
,
monle-leq
,
maxinf-inf
,
leninv-inf
,
inv-def
,
Used spec theorems:
Used simplifier rules:
stream
/natstream/
to-inf
stream
/natstream/
sel-inf
nat-basic1
/
zero
nat-basic1
/
lf-02
nat-basic1
/
trans-1
nat-basic1
/
lf
nat
/
lels-03
nat
/
ls-le-simp
nat
/
eqle-one
nat-inf
/
less-inf2
nat
/
succ-01
nat-inf-basic
/
elim
stream
/natstream/
sel-fin
nat-basic1
/
f
stream
/natstream/
get-infto
nat-basic1
/
zero-01
nat
/
lels
nat-basic2
/
succ
nat
/
eq
nat-inf-basic
/
disj
nat-inf
/
less-fin
stream
/natstream/
size-empty-equiv
nat
/
elim-pred-c
nat-basic2
/
oz
nat-inf
/
add-fin
nat-basic2
/
c
nat-basic2
/
a
nat-basic1
/
ref-1
nat-basic2
/
s
nat-inf
/
inf-inseq-reduce
nat-inf
/
add-comm
nat-inf
/
add-assoc
nat
/
le-ls-simp