[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 lebs-crash
n + m ≤ # avol0 ⊦ mapped-full?(avol0, n, m) ∧ avol0 ⊆ avol1 → lebs(avol1, n, m) = lebs(avol0, n, m)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
persistence-io-refine
,
persistence-io-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 8
Proof steps: 17
Used lemmas:
lebs-rec
,
lebs-base
,
mapped-full
,
Used spec theorems:
ebm-vol-inv
/
ebm-vol-le
Used simplifier rules:
nat-basic
/
s-04
nat
/
succ-01
ebm-vol-inv
/
le-size-1
nat
/
lels-03
nat-basic
/
l-01
nat-basic
/
succ
nat
/
fle-01
oelem
/nat-set/
transitivity
nat-basic
/
lf
nat-basic
/
f
nat-basic
/
ls-02
array-splice
/buffer/
append-eq-left
array-splice
/buffer/
mkemparray0-append-right
aleb
/
ex
ebm-vol-inv
/
le-mapped
nat
/
ls-le-simp
nat
/
lels
oelem
/nat-set/
irreflexivity
nat-basic
/
l
nat-basic
/
c
nat-basic
/
a
nat
/
lep
nat-basic
/
lf-01
aleb
/
disj
aleb
/
test-02
aleb
/
sel
array-splice
/buffer/
append-prefix-left
array-splice
/buffer/
emparray-len
array-splice
/buffer/
append-a
nat
/
zero