[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 12 from proof fwd-inv-loghead (previous step)

ginval ∩ elems nx0 = ∅, ∀ n0. n0 = n ∨ n0 ∈ elems nx0 ∪ dom gstore0 ↔ n0 ∈ dom gstore ∪ ginval ⊦ inv((∅)[n]), n ∈ gstore, n ∈ ginval

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 2 terms: n

Additional information

Used simplifier rules: ⊦ ¬ n ∈ ns → (n ∈ ns ∪ ns0 ↔ n ∈ ns0); (s)% ⊦ n ∈ dom gstore ↔ n ∈ gstore; (s)%una: ⊦ (ns ∪ ns0) ∪ ns1 = ns ∪ ns0 ∪ ns1; from specification set-union[nat-set]%unc: ⊦ ns ∪ ns0 = ns0 ∪ ns; from specification set-union[nat-set] Used terms: n