[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 9 from proof btree-ri-unique (
previous step
)
⊦ r = null ∨ ¬ zh0[r].dirty → ( ((btree(rp, r, adr, height, dirty, ri, iast, as, alladrs, nstat) * P))(zh0) ↔ ((btree(rp, r, adr, height, false, ri, iast, as, alladrs, nstat) * P))(zh0))
Lemma
btree-null-or-clean-below