Proof step 1 from proof del-01 (conclusion) (back to tree)

⊦ a ∈ st.keys → (st -- a).keys = st.keys -- a

System applied rule normalize

And obtained the following new goals

Proof step 2:
(st -- a).keys ≠ st.keys -- a, a ∈ st.keys ⊦

Rule argument

Additional information

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

(st -- a).keys ≠ st.keys -- a, a ∈ st.keys ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 3:
(st -- a).keys ≠ st.keys -- a, a ∈ st, ¬ a < st.min ⊦

Rule argument

Additional information

Used simplifier rules: Min-min: ⊦ a ∈ st → ¬ a < st.min; inf: ⊦ a ∈ st → a ∈ st.keys; Keys: ⊦ a ∈ st.keys ↔ a ∈ st;

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

(st -- a).keys ≠ st.keys -- a, a ∈ st, ¬ a < st.min ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Proof step 4:
⊦ s1 = s2 ↔ (∀ a. a ∈ s1 ↔ a ∈ s2)

Rule argument

spec: set-basic, name:Extension, seq: ⊦ s1 = s2 ↔ (∀ a. a ∈ s1 ↔ a ∈ s2), subst:[s2, s1] → [st.keys -- a, (st -- a).keys], <all paths>

Additional information

Used simplifier rules: del: ⊦ a ∈ (st -- b).keys ↔ a ∈ st.keys ∧ a ≠ b; Keys: ⊦ a ∈ st.keys ↔ a ∈ st; ⊦ a ∈ s -- b ↔ a ≠ b ∧ a ∈ s; (s) ⊦ a ∈ st -- b ↔ a ≠ b ∧ a ∈ st; (ws) Used terms: st.keys -- a, (st -- a).keys

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

⊦ s1 = s2 ↔ (∀ a. a ∈ s1 ↔ a ∈ s2)

A spec-lemma

Proof Tree for del-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.