[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 mapped-full-idexpt-below
n < m0 ⊦ id○(avol1, avol0, n) → (mapped-full?(avol1, m0, m1) ↔ mapped-full?(avol0, m0, m1))
Type: A user defined theorem
Validity: The proof is valid.
Features: s,
Comment:
Used by:
Used by units in proved state:
persistence-io-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 13
Used lemmas:
mapped-full
,
Used spec theorems:
array-copy
/avolume/
Idexcept
Used simplifier rules:
array-copy
/avolume/
idexcept-size
nat-basic
/
succ
oelem
/nat-set/
transitivity
nat-basic
/
lf
nat-basic
/
c
nat-basic
/
a
nat-basic
/
l-01
nat
/
fle-01
nat-basic
/
lf-01
nat-basic
/
f
nat
/
fle
aleb
/
ex
nat
/
ls-le-simp
aleb
/
test-02
aleb
/
sel