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

gstore3 = gstore, jro1 = jro, nx1 = nx, remove-refsize0(gstore0) = gstore0, elems nx ∩ jro = ∅, dom gstore0 ∪ elems nx = dom gstore ∪ jro, pmaxino ≠ 0, fi1.inos < pmaxino, fi2.inos < jmaxino1, p_os < pmaxino, inv(gstore0), inv(gstore \ jro), refsize-cons(gstore0, range fi1), refsize-cons(gstore, range fi2), ri-inj(fi1), ri-inj(fi2), pmaxino ≤ jmaxino1, fi1.lebs ⊆ dom gstore0, fi2.lebs ⊆ dom gstore, ¬ dups(nx), jvalid4 ∧ nx ≠ [] → valid-journal-head(nx, gstore, jro) ⊦ [gjournal_journal_addn#(nd0 ' + nd ', jvalid1, fi2, fi1, gstore0, pmaxino, p_os; ax, jvalid4, jmaxino, jro, gstore, nx, jvalid; err)] ( (jvalid4 ∧ nx ≠ [] → valid-journal-head(nx, gstore, jro)) ∧ fi2.lebs ⊆ dom gstore ∧ refsize-cons(gstore, range fi2) ∧ inv(gstore \ jro) ∧ elems nx ∩ jro = ∅ ∧ ¬ dups(nx) ∧ dom gstore0 ∪ elems nx = dom gstore ∪ jro ∧ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ dom gstore3 ⊆ dom gstore ∧ (nx.toSet \ nx1.toSet) ∩ dom gstore3 = ∅ ∧ ( err = ESUCCESS → # ax = 2 ∧ ¬ dups(ax) ∧ nodes-cons(ax, nd0 ' + nd ', gstore, jro) ∧ abs-log(nx, gstore ↓) = abs-log(nx1, gstore3 ↓) + ax ∧ nodes(gstore ↓, jro) = nodes(gstore3 ↓, jro1)[ax, nd0 ' + nd '] ∧ new(ax, nodes(gstore3 ↓, jro1))) ∧ (err ≠ ESUCCESS → abs-log(nx, gstore ↓) = abs-log(nx1, gstore3 ↓) ∧ nodes(gstore ↓, jro) = nodes(gstore3 ↓, jro1)) → ⟪if err = ESUCCESS then {adr0 := ax[0]; adr := ax[1]}⟫ (jvalid4 ∧ nx ≠ [] → valid-journal-head(nx, gstore, jro)))

User applied rule skip call

And obtained the following new goals

Rule argument

pos: right 1

Additional information