[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 20 from proof btree-inv-alloc (previous step)

((btree(null, null, adr, height0, false, fi, nodes(istore0), alladrs0, alladrs0, ok) * true))(zh0), ((btree(null, rp, adr, height, dirty, ri, nodes(istore), as, alladrs, ok) * true))(zh0), inv(istore), refsize-cons(istore0, alladrs0), refsize-cons(istore, as), adr ∈ istore, as ⊆ alladrs, as ⊆ dom nodes(istore), alladrs0 ⊆ dom nodes(istore), alladrs ⊆ dom nodes(istore), alladrs0 ⊆ dom nodes(istore0) ⊦ n ∈ istore, alladrs0 ⊆ dom nodes(istore[n, indexblock(indx, lax, 0)]), dom nodes(istore0) ⊆ dom nodes(istore[n, indexblock(indx, lax, 0)]), dom nodes(istore) ⊆ dom nodes(istore[n, indexblock(indx, lax, 0)])

User applied rule insert rewrite lemma

And obtained the following new goals

Rule argument

spec: set-basic, inst: node-store name: Subset seq: ⊦ as ⊆ as0 ↔ (∀ adr. adr ∈ as → adr ∈ as0) subst: [as0, as] → [dom nodes(istore[n, indexblock(indx, lax, 0)]), alladrs0] flags: <all paths>

Additional information

Used simplifier rules: ⊦ adr ∈ dom iast ↔ adr ∈ iast; (s)% ⊦ adr ∈ nodes(istore) ↔ adr ∈ istore; (s)%sub-in: ⊦ adr ∈ as ∧ as ⊆ as0 → adr ∈ as0; (forward) from specification set-basic[node-store]%ne-01: ⊦ adr ∈ as → as ≠ ∅; (forward) from specification set-basic[node-store]% ⊦ ¬ n ∈ istore ∧ adr ∈ istore → adr ∈ istore[n, iblock]; (ss) Used terms: dom nodes(istore[n, indexblock(indx, lax, 0)]), alladrs0