[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 66 from proof inv-truncate (previous step)

m2 + m1 = ((range(fi1 \ datakeys(key, n0, fi1)) | m) ∪ (as0 | m)).size, gstore2[m] = groupblock(gndx1, lax1, m2 + m1), dom gstore2 = dom gstore3, remove-refsize0(gstore1) = gstore1, elems nx ∩ jro = ∅, dom gstore1 ∪ elems nx = dom gstore3 ∪ jro, fi2.inos < pmaxino, fi1.inos < jmaxino, p_os < pmaxino, gstore2 =○refsize gstore3, inv(gstore2[m, groupblock(gndx1, lax1, m2)] \ jro), inv(gstore2 \ jro), inv(gstore1), inv(gstore3 \ jro), refsize-cons(gstore1, range fi2), refsize-cons(gstore3, range fi1), ri-inj(fi2), ri-inj(fi1 \ datakeys(key, n0, fi1)), ri-inj(fi1), @(m, m0, m1) ∈ fi1 \ datakeys(key, n0, fi1), m ∈ gstore2, @(m, m0, m1) ∈ as0, pmaxino ≤ jmaxino, as0.lebs ⊆ dom gstore3, fi2.lebs ⊆ dom gstore1, fi1.lebs ⊆ dom gstore3, jvalid2 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro), jvalid2 ∧ nx ≠ [] → valid-journal-head(nx, gstore3, jro), ∀ adr. ¬ adr ∈ as0 ∩ range(fi1 \ datakeys(key, n0, fi1)) ⊦ # as0 = 0, as0 = ∅, m1 = 0, pmaxino = 0, dups(nx)

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 29 terms: @(m, m0, m1)

Additional information

Used simplifier rules: ⊦ adr ∈ as ∩ as0 ↔ adr ∈ as ∧ adr ∈ as0; (ws)% ⊦ adr ∈ range ri ↔ adr ∈ ri; (s)%int-a: ⊦ (as ∩ as0) ∩ as1 = as ∩ as0 ∩ as1; from specification set-union[node-store]%int-c: ⊦ as ∩ as0 = as0 ∩ as; from specification set-union[node-store] Used terms: @(m, m0, m1)