[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 restr-add-notin (previous step)

n0 = n ∨ n0 ∈ ns \ dom gstore ⊦ n ∈ gstore, (n0 = n ∨ n0 ∈ ns) ∧ ¬ n0 ∈ gstore

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 10:
⊦ n ∈ ns \ ns0 ↔ n ∈ ns ∧ ¬ n ∈ ns0
Proof step 11:
n0 = n ∨ n0 ∈ ns ∧ ¬ n0 ∈ dom gstore ⊦ n ∈ gstore, (n0 = n ∨ n0 ∈ ns) ∧ ¬ n0 ∈ gstore

Rule argument

spec: set-union, inst: nat-set name: Difference seq: ⊦ n ∈ ns \ ns0 ↔ n ∈ ns ∧ ¬ n ∈ ns0 subst: [ns0, ns, n] → [dom gstore, ns, n0] flags: <all paths>

Additional information

Used terms: dom gstore, ns, n0