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

ginval ∩ elems nx1 = ∅, elems nx2 ∩ ginval = ∅, inv(gstore2), n ∈ gstore2, elems nx1 ⊆ dom gstore2, elems nx2 ⊆ dom gstore2 ⊦ ∀ log, err. ⟪nx0 := nx1⟫ (elems nx0 ⊆ dom gstore2 ∧ elems nx0 ∩ ginval = ∅ ∧ ¬ # nx1 < # nx0), n ∈ ginval

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 14:
elems nx2 ∩ ginval = ∅, ginval ∩ elems nx1 = ∅, inv(gstore2), n ∈ gstore2, elems nx2 ⊆ dom gstore2, elems nx1 ⊆ dom gstore2, ¬ n ∈ ginval ⊦ ⟪nx0 := nx1⟫ (elems nx0 ⊆ dom gstore2 ∧ elems nx0 ∩ ginval = ∅ ∧ ¬ # nx1 < # nx0)

Proof step 13 from proof term-restore-log (previous step)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information