[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
,
Proof step 4 from proof btree-istore-reduce (
previous step
)
⊦ iast0 | as ⊆ iast1 ∧ ((btree(rp, rp0, adr, height, dirty, ri, iast0, as, alladrs, nstat) * P))(zh) → ((btree(rp, rp0, adr, height, dirty, ri, iast1, as, alladrs, nstat) * P))(zh)
Lemma
btree-istore-reduce-refed