[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 14 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 ⊦ ⟪nx0 := nx1⟫ (elems nx0 ⊆ dom gstore2 ∧ elems nx0 ∩ ginval = ∅ ∧ ¬ # nx1 < # nx0)

Heuristic symbolic execution applied rule assign right

And closed the goal!

Rule argument

Additional information

Used simplifier rules: int-c: ⊦ ns ∩ ns0 = ns0 ∩ ns; from specification set-union[nat-set]% ⊦ ¬ n < n; (s)