[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 abs-reduce
⊦ n < # apebs ∧ abs(pebs, apebs) ∧ ubi-io-inv(apebs) → (abs(pebs[n, peb], apebs[n, apeb]) ↔ abs-peb(pebs[n], apebs[n]) → abs-peb(peb, apeb))
Type: A user defined theorem
Validity: The proof is valid.
Features: ss,
Comment:
Used by:
Used by units in proved state:
ubi-io-refine
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 22
Used lemmas:
abs-vidhdr
,
abs-echdr
,
abs-peb
,
abs
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
f
array
/apebs/
Size-put
array
/pebs/
Size-put
apeb
/
elim
peb
/
elim
peb
/
sel-05
apeb
/
sel-08
peb
/
sel-06
apeb
/
sel-04
apeb
/
sel-05
apeb
/
sel-07
peb
/
sel-07
aecheader
/
disj-01
avidheader
/
disj-01
apeb
/
sel-06
nat-basic
/
lf-01
array
/apebs/
Put-other
array
/pebs/
Put-other
peb
/
inj
apeb
/
inj
array
/apebs/
Put-same
nat
/
lels
nat
/
ls-le-simp
array
/pebs/
cgetput