[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 subset-put-01 (conclusion) (back to tree)

⊦ st ⊆ st0[a := d] ↔ st ⊆ st0 ∧ ¬ a ∈ st ∨ a ∈ st ∧ st[a] = d ∧ st -- a ⊆ st0 -- a

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof subset-put-01 (previous step) (back to tree)

¬(st ⊆ st0[a := d] ↔ st ⊆ st0 ∧ ¬ a ∈ st ∨ a ∈ st ∧ st[a] = d ∧ st -- a ⊆ st0 -- a) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: Subset: ⊦ st1 ⊆ st2 ↔ (∀ a. a ∈ st1 → a ∈ st2 ∧ st1[a] = st2[a]);

Proof step 3 from proof subset-put-01 (previous step) (back to tree)

⊦ (∀ a0. a0 ∈ st → a0 ∈ st0[a := d] ∧ st[a0] = (st0[a := d])[a0]) ↔ (∀ a. a ∈ st → a ∈ st0 ∧ st[a] = st0[a]) ∧ ¬ a ∈ st ∨ a ∈ st ∧ st[a] = d ∧ (∀ a0. a0 ∈ st -- a → a0 ∈ st0 -- a ∧ (st -- a)[a0] = (st0 -- a)[a0])

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 4 from proof subset-put-01 (previous step) (back to tree)

∀ a0. a0 ∈ st → a0 ∈ st0[a := d] ∧ st[a0] = (st0[a := d])[a0] ⊦ (∀ a. a ∈ st → a ∈ st0 ∧ st[a] = st0[a]) ∧ ¬ a ∈ st, a ∈ st ∧ st[a] = d ∧ (∀ a0. a0 ∈ st -- a → a0 ∈ st0 -- a ∧ (st -- a)[a0] = (st0 -- a)[a0])

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 5 from proof subset-put-01 (previous step) (back to tree)

∀ a0. a0 ∈ st → a0 ∈ st0[a := d] ∧ st[a0] = (st0[a := d])[a0] ⊦ a ∈ st ∧ st[a] = d ∧ (a0 ∈ st -- a → a0 ∈ st0 -- a ∧ (st -- a)[a0] = (st0 -- a)[a0]), (a1 ∈ st → a1 ∈ st0 ∧ st[a1] = st0[a1]) ∧ ¬ a ∈ st

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 1 terms: a abort: F discard: F computed: T

Additional information

Used terms: a

Proof step 6 from proof subset-put-01 (previous step) (back to tree)

a ∈ st → a ∈ st0[a := d] ∧ st[a] = (st0[a := d])[a], ∀ a0. a0 ∈ st → a0 ∈ st0[a := d] ∧ st[a0] = (st0[a := d])[a0] ⊦ (a1 ∈ st → a1 ∈ st0 ∧ st[a1] = st0[a1]) ∧ ¬ a ∈ st, a ∈ st ∧ st[a] = d ∧ (a0 ∈ st -- a → a0 ∈ st0 -- a ∧ (st -- a)[a0] = (st0 -- a)[a0])

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: At-same: ⊦ (st[a := d])[a] = d;

Proof step 7 from proof subset-put-01 (previous step) (back to tree)

a ∈ st → a ∈ st0[a := st[a]] ∧ st[a] = d, ∀ a0. a0 ∈ st → a0 ∈ st0[a := d] ∧ st[a0] = (st0[a := d])[a0] ⊦ a ∈ st ∧ st[a] = d ∧ (a0 ∈ st -- a → a0 ∈ st0 -- a ∧ (st -- a)[a0] = (st0 -- a)[a0]), (a1 ∈ st → a1 ∈ st0 ∧ st[a1] = st0[a1]) ∧ ¬ a ∈ st

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 2 terms: a0 abort: F discard: F computed: T

Additional information

Used terms: a0

Proof step 8 from proof subset-put-01 (previous step) (back to tree)

a ∈ st → a ∈ st0[a := st[a]] ∧ st[a] = d, a0 ∈ st → a0 ∈ st0[a := d] ∧ st[a0] = (st0[a := d])[a0], ∀ a0. a0 ∈ st → a0 ∈ st0[a := d] ∧ st[a0] = (st0[a := d])[a0] ⊦ (a1 ∈ st → a1 ∈ st0 ∧ st[a1] = st0[a1]) ∧ ¬ a ∈ st, a ∈ st ∧ st[a] = d ∧ (a0 ∈ st -- a → a0 ∈ st0 -- a ∧ (st -- a)[a0] = (st0 -- a)[a0])

Heuristic weak cut applied rule cut formula

And obtained the following new goals

Rule argument

fma: a0 = a

Additional information

Used formulas: a0 = a

Proof step 9 from proof subset-put-01 (previous step) (back to tree)

a0 = a, a0 ∈ st → a0 ∈ st0[a := d] ∧ st[a0] = (st0[a := d])[a0], a ∈ st → a ∈ st0[a := st[a]] ∧ st[a] = d, ∀ a0. a0 ∈ st → a0 ∈ st0[a := d] ∧ st[a0] = (st0[a := d])[a0] ⊦ a ∈ st ∧ st[a] = d ∧ (a0 ∈ st -- a → a0 ∈ st0 -- a ∧ (st -- a)[a0] = (st0 -- a)[a0]), (a1 ∈ st → a1 ∈ st0 ∧ st[a1] = st0[a1]) ∧ ¬ a ∈ st

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: At-same: ⊦ (st[a := d])[a] = d;

Proof step 10 from proof subset-put-01 (previous step) (back to tree)

a ∈ st → a ∈ st0[a := st[a]] ∧ st[a] = d, ∀ a0. a0 ∈ st → a0 ∈ st0[a := d] ∧ st[a0] = (st0[a := d])[a0] ⊦ (a1 ∈ st → a1 ∈ st0 ∧ st[a1] = st0[a1]) ∧ ¬ a ∈ st, a ∈ st ∧ st[a] = d ∧ (a ∈ st -- a → a ∈ st0 -- a ∧ (st -- a)[a] = (st0 -- a)[a])

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 2 terms: a1 abort: F discard: F computed: T

Additional information

Used terms: a1

Proof step 11 from proof subset-put-01 (previous step) (back to tree)

a ∈ st → a ∈ st0[a := st[a]] ∧ st[a] = d, a1 ∈ st → a1 ∈ st0[a := d] ∧ st[a1] = (st0[a := d])[a1], ∀ a0. a0 ∈ st → a0 ∈ st0[a := d] ∧ st[a0] = (st0[a := d])[a0] ⊦ a ∈ st ∧ st[a] = d ∧ (a ∈ st -- a → a ∈ st0 -- a ∧ (st -- a)[a] = (st0 -- a)[a]), (a1 ∈ st → a1 ∈ st0 ∧ st[a1] = st0[a1]) ∧ ¬ a ∈ st

Heuristic weak cut applied rule cut formula

And closed the goal!

Rule argument

fma: a1 = a

Additional information

Used simplifier rules: Del-in: ⊦ a ∈ st -- b ↔ a ≠ b ∧ a ∈ st; in-neq: ⊦ a ≠ b → (a ∈ st[b := d] ↔ a ∈ st); At-other: ⊦ a ≠ b → (st[b := d])[a] = st[a]; Del-in: ⊦ a ∈ st -- b ↔ a ≠ b ∧ a ∈ st; Used formulas: a1 = a

Proof step 12 from proof subset-put-01 (previous step) (back to tree)

a0 ≠ a, a0 ∈ st → a0 ∈ st0[a := d] ∧ st[a0] = (st0[a := d])[a0], a ∈ st → a ∈ st0[a := st[a]] ∧ st[a] = d, ∀ a0. a0 ∈ st → a0 ∈ st0[a := d] ∧ st[a0] = (st0[a := d])[a0] ⊦ a ∈ st ∧ st[a] = d ∧ (a0 ∈ st -- a → a0 ∈ st0 -- a ∧ (st -- a)[a0] = (st0 -- a)[a0]), (a1 ∈ st → a1 ∈ st0 ∧ st[a1] = st0[a1]) ∧ ¬ a ∈ st

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: In-insert: ⊦ a ∈ st[b := d] ↔ a = b ∨ a ∈ st; At-other: ⊦ a ≠ b → (st[b := d])[a] = st[a];

Proof step 13 from proof subset-put-01 (previous step) (back to tree)

a0 ≠ a, a ∈ st → a ∈ st0[a := st[a]] ∧ st[a] = d, a0 ∈ st → a0 ∈ st0 ∧ st[a0] = st0[a0], ∀ a0. a0 ∈ st → a0 ∈ st0[a := d] ∧ st[a0] = (st0[a := d])[a0] ⊦ (a1 ∈ st → a1 ∈ st0 ∧ st[a1] = st0[a1]) ∧ ¬ a ∈ st, a ∈ st ∧ st[a] = d ∧ (a0 ∈ st -- a → a0 ∈ st0 -- a ∧ (st -- a)[a0] = (st0 -- a)[a0])

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 4 terms: a1 abort: F discard: F computed: T

Additional information

Used terms: a1

Proof step 14 from proof subset-put-01 (previous step) (back to tree)

a0 ≠ a, a0 ∈ st → a0 ∈ st0 ∧ st[a0] = st0[a0], a ∈ st → a ∈ st0[a := st[a]] ∧ st[a] = d, a1 ∈ st → a1 ∈ st0[a := d] ∧ st[a1] = (st0[a := d])[a1], ∀ a0. a0 ∈ st → a0 ∈ st0[a := d] ∧ st[a0] = (st0[a := d])[a0] ⊦ a ∈ st ∧ st[a] = d ∧ (a0 ∈ st -- a → a0 ∈ st0 -- a ∧ (st -- a)[a0] = (st0 -- a)[a0]), (a1 ∈ st → a1 ∈ st0 ∧ st[a1] = st0[a1]) ∧ ¬ a ∈ st

Heuristic weak cut applied rule cut formula

And closed the goal!

Rule argument

fma: a1 = a

Additional information

Used simplifier rules: Del-at-strong: a ≠ b ⊦ (st -- b)[a] = st[a]; Del-in: ⊦ a ∈ st -- b ↔ a ≠ b ∧ a ∈ st; in-neq: ⊦ a ≠ b → (a ∈ st[b := d] ↔ a ∈ st); At-other: ⊦ a ≠ b → (st[b := d])[a] = st[a]; Del-at-strong: a ≠ b ⊦ (st -- b)[a] = st[a]; Del-in: ⊦ a ∈ st -- b ↔ a ≠ b ∧ a ∈ st; Used formulas: a1 = a

Proof step 15 from proof subset-put-01 (previous step) (back to tree)

(∀ a. a ∈ st → a ∈ st0 ∧ st[a] = st0[a]) ∧ ¬ a ∈ st ∨ a ∈ st ∧ st[a] = d ∧ (∀ a0. a0 ∈ st -- a → a0 ∈ st0 -- a ∧ (st -- a)[a0] = (st0 -- a)[a0]) ⊦ ∀ a0. a0 ∈ st → a0 ∈ st0[a := d] ∧ st[a0] = (st0[a := d])[a0]

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: Del-in: ⊦ a ∈ st -- b ↔ a ≠ b ∧ a ∈ st; Del-at-strong: a ≠ b ⊦ (st -- b)[a] = st[a];

Proof step 16 from proof subset-put-01 (previous step) (back to tree)

a0 ∈ st, (∀ a. a ∈ st → a ∈ st0 ∧ st[a] = st0[a]) ∧ ¬ a ∈ st ∨ a ∈ st ∧ st[a] = d ∧ (∀ a1. a1 ∈ st -- a → a1 ∈ st0 -- a ∧ st[a1] = st0[a1]) ⊦ a0 ∈ st0[a := d] ∧ st[a0] = (st0[a := d])[a0]

Heuristic weak cut applied rule cut formula

And obtained the following new goals

Rule argument

fma: a0 = a

Additional information

Used simplifier rules: At-same: ⊦ (st[a := d])[a] = d; In-insert: ⊦ a ∈ st[b := d] ↔ a = b ∨ a ∈ st; Used formulas: a0 = a

Proof step 17 from proof subset-put-01 (previous step) (back to tree)

a0 ≠ a, a0 ∈ st, (∀ a. a ∈ st → a ∈ st0 ∧ st[a] = st0[a]) ∧ ¬ a ∈ st ∨ a ∈ st ∧ st[a] = d ∧ (∀ a1. a1 ∈ st -- a → a1 ∈ st0 -- a ∧ st[a1] = st0[a1]) ⊦ a0 ∈ st0[a := d] ∧ st[a0] = (st0[a := d])[a0]

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: in-neq: ⊦ a ≠ b → (a ∈ st[b := d] ↔ a ∈ st); At-other: ⊦ a ≠ b → (st[b := d])[a] = st[a];

Proof step 18 from proof subset-put-01 (previous step) (back to tree)

a0 ≠ a, a0 ∈ st, (∀ a. a ∈ st → a ∈ st0 ∧ st[a] = st0[a]) ∧ ¬ a ∈ st ∨ a ∈ st ∧ st[a] = d ∧ (∀ a1. a1 ∈ st -- a → a1 ∈ st0 -- a ∧ st[a1] = st0[a1]) ⊦ a0 ∈ st0 ∧ st[a0] = st0[a0]

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 3

Additional information

Proof step 19 from proof subset-put-01 (previous step) (back to tree)

a0 ≠ a, a0 ∈ st, ¬ a ∈ st, ∀ a. a ∈ st → a ∈ st0 ∧ st[a] = st0[a] ⊦ a0 ∈ st0 ∧ st[a0] = st0[a0]

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 20 from proof subset-put-01 (previous step) (back to tree)

a0 ≠ a, a0 ∈ st, ¬ a ∈ st, ∀ a. a ∈ st → a ∈ st0 ∧ st[a] = st0[a] ⊦ a0 ∈ st0 ∧ st[a0] = st0[a0]

User applied rule all left

And closed the goal!

Rule argument

pos: left 4 terms: a0 abort: F discard: F computed: T

Additional information

Used terms: a0

Proof step 21 from proof subset-put-01 (previous step) (back to tree)

st[a] = d, a0 ≠ a, a0 ∈ st, a ∈ st, ∀ a1. a1 ∈ st -- a → a1 ∈ st0 -- a ∧ st[a1] = st0[a1] ⊦ a0 ∈ st0 ∧ st[a0] = st0[a0]

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 22 from proof subset-put-01 (previous step) (back to tree)

a0 ≠ a, a ∈ st, a0 ∈ st, ∀ a1. a1 ∈ st -- a → a1 ∈ st0 -- a ∧ st[a1] = st0[a1] ⊦ a0 ∈ st0 ∧ st[a0] = st0[a0]

User applied rule all left

And closed the goal!

Rule argument

pos: left 4 terms: a0 abort: F discard: F computed: T

Additional information

Used simplifier rules: Del-in: ⊦ a ∈ st -- b ↔ a ≠ b ∧ a ∈ st; Used terms: a0

Proof Tree for subset-put-01 (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