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

remove-refsize0(gstore0) = gstore0, elems nx ∩ jro = ∅, dom gstore0 ∪ elems nx = dom gstore ∪ jro, pmaxino ≠ 0, p_os < pmaxino, fi.inos < jmaxino, fi0.inos < pmaxino, inv(gstore \ jro), inv(gstore0), refsize-cons(gstore, range fi), refsize-cons(gstore0, range fi0), ri-inj(fi), ri-inj(fi0), @(m, m0, m1) ∈ gstore, pmaxino ≤ jmaxino, fi.lebs ⊆ dom gstore, fi0.lebs ⊆ dom gstore0, ¬ dups(nx), ¬ m ∈ jro, jvalid ∧ nx ≠ [] → valid-journal-head(nx, gstore, jro) ⊦ ⟪gjournal_journal_get#(@(m, m0, m1), fi, fi0, jro, gstore, gstore0, nx, pmaxino, p_os, jvalid0; nd; err)⟫ true

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 6:
jvalid ↔ jvalid0, adr = @(m, m0, m1), fi = fi1, fi0 = fi2, gstore = gstore1, gstore0 = gstore2, remove-refsize0(gstore1) = gstore1, elems nx ∩ jro = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ jro, fi1.inos < pmaxino, fi2.inos < jmaxino, p_os < pmaxino, inv(gstore1), inv(gstore2 \ jro), refsize-cons(gstore1, range fi1), refsize-cons(gstore2, range fi2), ri-inj(fi1), ri-inj(fi2), @(m, m0, m1) ∈ gstore2, pmaxino ≤ jmaxino, fi1.lebs ⊆ dom gstore1, fi2.lebs ⊆ dom gstore2, jvalid1 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro) ⊦ ⟪if adr ∈ gstore0 ∧ ¬ adr.lnum ∈ jro then choose gnd with true in {index_read_gnd#(adr, fi0, fi, jro, gstore0, gstore, nx, pmaxino, p_os, jvalid; gnd; err); if err = ESUCCESS then nd := gnd.nd} else abort⟫ true, pmaxino = 0, dups(nx), m ∈ jro

Rule argument

pos: right 1

Additional information

Used simplifier rules: get: ⊦ ;