[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 ubi-io-inv-fillcount0
n < # apebs ⊦ apebs[n] = mkpeb(aehdr, avhdr, buf, 0, false) ∧ ubi-io-inv(apebs) → (buf = mkempbuf(LEB_SIZE) ↔ true)
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
prepost-atomic-leb-change
,
prepost-write-once
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 6
Used lemmas:
ubi-io-inv-fwd
,
Used spec theorems:
ubi-io-inv
/
inv
ubi-io-inv
/
peb-inv
Used simplifier rules:
nat-basic
/
f
nat
/
ls-le-simp
nat
/
lels
apeb
/
sel-06
apeb
/
sel-08
apeb
/
sel-04
apeb
/
sel-05
apeb
/
sel-07
nat
/
lez
eraseblock
/
page-size
align
/
is-aligned-zero
nat
/
sub-base
array-copy
/buffer/
subarray-elim