[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-idexpt-below
n < m0, m0 + m1 ≤ # avol1 ⊦ id○(avol1, avol0, n) → lebs(avol1, m0, m1) = lebs(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: 4
Proof steps: 9
Used lemmas:
lebs-rec
,
lebs-base
,
Used spec theorems:
array-copy
/avolume/
Idexcept
Used simplifier rules:
array-copy
/avolume/
idexcept-size
nat-basic
/
lf-01
nat-basic
/
f
nat
/
succ-01
nat-basic
/
succ
array-splice
/buffer/
append-a
array-splice
/buffer/
append-eq-left
nat
/
lels-03
nat-basic
/
l-02
nat-basic
/
a
nat-basic
/
c