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

remove-refsize0(gstore1) = gstore1, as0 ∩ range(fi1 \ datakeys(key, n0, fi1)) = ∅, elems nx ∩ jro = ∅, dom gstore1 ∪ elems nx = dom gstore3 ∪ jro, fi2.inos < pmaxino, fi1.inos < jmaxino, p_os < pmaxino, gstore2 =○refsize gstore3, inv(gstore2 \ jro), inv(gstore1), inv(gstore3 \ jro), refsize-cons(gstore2, range(fi1 \ datakeys(key, n0, fi1)) ∪ as0), refsize-cons(gstore1, range fi2), refsize-cons(gstore3, range fi1), ri-inj(fi2), ri-inj(fi1), ri-inj(fi1 \ datakeys(key, n0, fi1)), @(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), ∀ n. n ∈ gstore2 ↔ n ∈ gstore3 ⊦ # as0 = 0, as0 = ∅, pmaxino = 0, dups(nx), m ∈ gstore2

User applied rule all left

And obtained the following new goals

Proof step 75:
m ∈ gstore2 ↔ m ∈ gstore3, remove-refsize0(gstore1) = gstore1, elems nx ∩ jro = ∅, as0 ∩ range(fi1 \ datakeys(key, n0, fi1)) = ∅, dom gstore1 ∪ elems nx = dom gstore3 ∪ jro, p_os < pmaxino, fi1.inos < jmaxino, fi2.inos < pmaxino, gstore2 =○refsize gstore3, inv(gstore3 \ jro), inv(gstore1), inv(gstore2 \ jro), refsize-cons(gstore3, range fi1), refsize-cons(gstore1, range fi2), refsize-cons(gstore2, range(fi1 \ datakeys(key, n0, fi1)) ∪ as0), ri-inj(fi1 \ datakeys(key, n0, fi1)), ri-inj(fi1), ri-inj(fi2), @(m, m0, m1) ∈ as0, pmaxino ≤ jmaxino, fi1.lebs ⊆ dom gstore3, fi2.lebs ⊆ dom gstore1, as0.lebs ⊆ dom gstore3, jvalid2 ∧ nx ≠ [] → valid-journal-head(nx, gstore3, jro), jvalid2 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro) ⊦ # as0 = 0, as0 = ∅, pmaxino = 0, dups(nx), m ∈ gstore2

Rule argument

pos: left 25 terms: m abort: F discard: T computed: T

Additional information

Used terms: m