[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 12 from proof log-disjoint-istore (previous step)

lpt[n] = mklp(m, m0, LP_INDEX_NODES, m1), istore[n] = indexblock(indx, lax, m), elems nx ∩ ginval = ∅, dom gstore0 ∪ elems nx = dom gstore ∪ ginval, n < # lpt, abs-leb(avol[n], indexblock(indx, lax, m), mklp(m, m0, LP_INDEX_NODES, m1)), n ∈ gstore, n ∈ nx, n ∈ istore, ∀ n. (n < # lpt ∧ lpt[n].flags = LP_GROUP_NODES ↔ n ∈ gstore) ∧ (n ∈ gstore ∧ ¬ n ∈ ginval → abs-leb(avol[n], gstore[n], lpt[n])) ∧ (n ∈ gstore → lpt[n].ref-size = gstore[n].ref-size) ⊦ #(dom istore ∩ elems nx) = 0, n ∈ ginval

User applied rule all left

And closed the goal!

Rule argument

pos: left 10 terms: n abort: F discard: T computed: T

Additional information

Used simplifier rules: ⊦ mklp(n2, n3, lpf, m).ref-size = n2; (s)% ⊦ mklp(n2, n3, lpf, m).flags = lpf; (s)% ⊦ LP_GROUP_NODES ≠ LP_INDEX_NODES; (s) Used terms: n