[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 reduce-initial
⊦ ubi-io-initial(pebs) → (ubi-io-initial(pebs[n, peb]) ↔ n < # pebs ∧ ubi-io-peb-initial(pebs[n]) → ubi-io-peb-initial(peb))
Type: A user defined theorem
Validity: The proof is valid.
Features: ss,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 24
Used lemmas:
ubi-io-peb-initial
,
ubi-io-initial
,
Used spec theorems:
Used simplifier rules:
mtd-base
/
mtd-valid-peb
array
/pebs/
Size-put
peb
/
elim
nat-basic
/
f
peb
/
inj
array
/pebs/
Put-same
align
/
is-aligned-same
eraseblock
/
page-size
nat
/
le-def
eraseblock
/
pebsize-le-page-size
nat
/
elim-sub
nat-mult
/
mult-c
nat-mult
/
mult-a
eraseblock
/
lebsize-pebsize
nat-mult
/
two-02
nat-basic
/
c
nat-basic
/
a
eraseblock
/
pebsize-minus-eb-page-size
array
/pebs/
Put-other
peb
/
sel-07
peb
/
sel-05
peb
/
sel-06
encoding-page-size-nonempty
/encoding-echeader/
is-encoded-unique
echeader
/
inj