[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 term-restore-log (previous step)

elems nx2 ∩ ginval = ∅, ginval ∩ elems nx1 = ∅, inv(gstore2), n ∈ gstore2, elems nx2 ⊆ dom gstore2, elems nx1 ⊆ dom gstore2, ¬ n ∈ ginval ⊦ ⟪gjournal_remove_nonend_blocks#(n, fi0, fi, ginval, gstore2, gstore, nx, pmaxino, p_os, jvalid; log; err); nx0 := nx1⟫ (elems nx0 ⊆ dom gstore2 ∧ elems nx0 ∩ ginval = ∅ ∧ ¬ # nx1 < # nx0)

User applied rule insert program lemma

And obtained the following new goals

Rule argument

spec: <toplevel> name: term-remove-nonend-blocks seq: n ∈ gstore, ¬ n ∈ ginval, inv(gstore) ⊦ ⟪gjournal_remove_nonend_blocks# (n, ri, fi, ginval, gstore, gstore0, nx0, maxino, ns, boolvar0 ; log ; err)⟫ true subst: [boolvar0, ns, maxino, nx0, gstore0, gstore, ginval, fi, ri, n, log, err] → [jvalid, p_os, pmaxino, nx, gstore, gstore2, ginval, fi, fi0, n, log, err] flags: <all paths>

Additional information