[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-leq
⊦ stutf(nσ) ∧ ⌜n⌝ < # nσ ∧ ⌜nσ[n]⌝ < leninv(nσ) → (¬ ¬ inv(nσ)[nσ[n]] < n ↔ false)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
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: 65
Used lemmas:
stutf-nonempty
,
maxinf-fin
,
leninv-succ
,
stutf-monle
,
monle-leq
,
leninv-inf
,
maxinf-inf
,
maxinf-def
,
inv-def
,
Used spec theorems:
Used simplifier rules:
stream
/natstream/
to-inf
stream
/natstream/
sel-inf
nat-inf-basic
/
fin-inject-embed
nat-basic1
/
lf-02
nat
/
lels-03
nat
/
ls-le-simp
nat-inf-basic
/
elim
stream
/natstream/
sel-fin
stream
/natstream/
get-infto
nat-basic1
/
zero-01
nat
/
let
nat-inf
/
less-inf2
nat
/
succ-01
nat-basic1
/
ref-1
nat
/
eq
nat-basic2
/
succ
nat-basic1
/
trans-1
nat-basic1
/
lf
nat-inf
/
less-fin
stream
/natstream/
size-empty-equiv
nat
/
elim-pred-c
nat-basic1
/
f
nat
/
lels
nat-basic2
/
l
nat-basic2
/
s
nat-basic2
/
oz
nat-inf
/
add-fin
nat-basic2
/
nls-fst
nat-basic2
/
a
nat-basic2
/
c
nat
/
le-ls-simp
nat-inf-basic
/
disj
nat
/
fle
nat-basic1
/
ls-02