[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 1 from proof restrict-intersect-empty-write-add (conclusion) (back to tree)

⊦ dom st ∩ s = ∅ → st[a := d] \ (s -- a) = st[a := d]

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof restrict-intersect-empty-write-add (previous step) (back to tree)

dom st ∩ s = ∅, st[a := d] \ (s -- a) ≠ st[a := d] ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 3 from proof restrict-intersect-empty-write-add (previous step) (back to tree)

dom st ∩ s = ∅, st[a := d] \ (s -- a) ≠ st[a := d] ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:restrict-intersect-empty, seq: ⊦ dom st ∩ s = ∅ → st \ s = st, subst:[s, st] → [s -- a, st[a := d]], <all paths>

Additional information

Used simplifier rules: dom-ins: ⊦ dom st[a := d] = dom st ++ a; ⊦ (s0 ++ a) ∩ (s1 -- a) = (s0 ∩ s1) -- a; (s) int-a: ⊦ (s ∩ s0) ∩ s1 = s ∩ s0 ∩ s1; from specification polyset-union int-c: ⊦ s ∩ s0 = s0 ∩ s; from specification polyset-union ⊦ s -- a = ∅ ↔ s = ∅ ∨ s = ∅ ++ a; (ws) Used terms: s -- a, st[a := d]

Proof step 4 from proof restrict-intersect-empty-write-add (previous step) (back to tree)

⊦ dom st ∩ s = ∅ → st \ s = st

Lemma restrict-intersect-empty

Proof Tree for restrict-intersect-empty-write-add (View conclusion)

The following image shows the proof tree of sequent calculus. The proved goal is at the bottom. You can click on the nodes to view additional rules. See here for details on colors in a proof tree.

the proof tree