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

fi2[key] = @(m, m0, m1), remove-refsize0(gstore1) = gstore1, elems nx ∩ jro = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ jro, p_os < pmaxino, fi2.inos < jmaxino, fi1.inos < pmaxino, inv(gstore2 \ jro), inv(gstore1), refsize-cons(gstore2, range fi2), refsize-cons(gstore1, range fi1), ri-cons(fi2, nodes(gstore2 ↓, jro)), ri-inj(fi2), ri-inj(fi1), fi2[key] ∈ gstore2, key ∈ fi2, pmaxino ≤ jmaxino, fi2.lebs ⊆ dom gstore2, fi1.lebs ⊆ dom gstore1, jvalid2 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro) ⊦ ⟪fail_or_success#(; ; err); if err = ESUCCESS then gnd := gstore2[fi2[key]] else gnd := ?; if err = ESUCCESS then nd := gnd.nd⟫ true, pmaxino = 0, dups(nx), m ∈ jro

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 24:
fi2[key] = @(m, m0, m1), remove-refsize0(gstore1) = gstore1, elems nx ∩ jro = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ jro, pmaxino ≠ 0, p_os < pmaxino, fi2.inos < jmaxino, fi1.inos < pmaxino, inv(gstore2 \ jro), inv(gstore1), refsize-cons(gstore2, range fi2), refsize-cons(gstore1, range fi1), ri-cons(fi2, nodes(gstore2 ↓, jro)), ri-inj(fi2), ri-inj(fi1), @(m, m0, m1) ∈ gstore2, key ∈ fi2, m ∈ gstore2, pmaxino ≤ jmaxino, fi2.lebs ⊆ dom gstore2, fi1.lebs ⊆ dom gstore1, ¬ dups(nx), ¬ m ∈ jro, jvalid2 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro) ⊦ ⟪fail_or_success#(; ; err); if err = ESUCCESS then gnd := gstore2[fi2[key]] else gnd := ?; if err = ESUCCESS then nd := gnd.nd⟫ true

Rule argument

Additional information

Used simplifier rules: ⊦ @(m, m0, m1).lnum = m; (s)%lebs-in-ri-in-gstore-explicit: ⊦ key ∈ ri ∧ ri[key] = adr ∧ ri.lebs ⊆ dom gstore → adr.lnum ∈ gstore; (forward) from specification gjournal-base