[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 21 from proof refsize-cons-crash (previous step)

(∅)[n] = groupblock(gndx0, lax0, m), n ∈ dom gstore ∪ ginval, n ∈ dom gstore0 ∪ elems nx, n ∈ ginval, fi.lebs ⊆ dom gstore0 ⊦ # ginval = 0, #(dom gstore ∪ ginval) = 0, #(dom gstore0 ∪ elems nx) = 0, ginval = ∅, m = 0, dom gstore ∪ ginval = ∅, dom gstore0 ∪ elems nx = ∅, n ∈ nx, n ∈ gstore0

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 22:
⊦ n ∈ ns ∪ ns0 ↔ n ∈ ns ∨ n ∈ ns0

Rule argument

spec: set-union, inst: nat-set name: Union seq: ⊦ n ∈ ns ∪ ns0 ↔ n ∈ ns ∨ n ∈ ns0 subst: [ns0, ns, n] → [elems nx, dom gstore0, n] flags: <all paths>

Additional information

Used simplifier rules: ⊦ n ∈ dom gstore ↔ n ∈ gstore; (s)% ⊦ n ∈ elems nx ↔ n ∈ nx; (s) Used terms: elems nx, dom gstore0, n