[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(apebs) → (ubi-io-initial(apebs[n, apeb]) ↔ n < # apebs ∧ ubi-io-peb-initial(apebs[n]) → ubi-io-peb-initial(apeb))
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: 1
Proof steps: 17
Used lemmas:
peb-inv
,
peb-initial
,
initial
,
Used spec theorems:
Used simplifier rules:
array
/apebs/
Size-put
apeb
/
elim
nat-basic
/
f
apeb
/
inj
array
/apebs/
Put-same
apeb
/
sel-06
apeb
/
sel-08
apeb
/
sel-04
apeb
/
sel-05
apeb
/
sel-07
array
/apebs/
Put-other