Theorem sbeqalb 3801

Description: Theorem *14.121 in [WhiteheadRussell] p. 185. (Contributed by Andrew Salmon, 28-Jun-2011.) (Proof shortened by Wolf Lammen, 9-May-2013.)

Assertion

Ref	Expression
sbeqalb	⊢ (𝐴 ∈ 𝑉 → ((∀𝑥(𝜑 ↔ 𝑥 = 𝐴) ∧ ∀𝑥(𝜑 ↔ 𝑥 = 𝐵)) → 𝐴 = 𝐵))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Allowed substitution hints:   𝜑(𝑥)   𝑉(𝑥)

Proof of Theorem sbeqalb

Step	Hyp	Ref	Expression
1		bibi1 354	. . . . 5 ⊢ ((𝜑 ↔ 𝑥 = 𝐴) → ((𝜑 ↔ 𝑥 = 𝐵) ↔ (𝑥 = 𝐴 ↔ 𝑥 = 𝐵)))
2	1	biimpa 482	. . . 4 ⊢ (((𝜑 ↔ 𝑥 = 𝐴) ∧ (𝜑 ↔ 𝑥 = 𝐵)) → (𝑥 = 𝐴 ↔ 𝑥 = 𝐵))
3	2	biimpd 232	. . 3 ⊢ (((𝜑 ↔ 𝑥 = 𝐴) ∧ (𝜑 ↔ 𝑥 = 𝐵)) → (𝑥 = 𝐴 → 𝑥 = 𝐵))
4	3	alanimi 1849	. 2 ⊢ ((∀𝑥(𝜑 ↔ 𝑥 = 𝐴) ∧ ∀𝑥(𝜑 ↔ 𝑥 = 𝐵)) → ∀𝑥(𝑥 = 𝐴 → 𝑥 = 𝐵))
5		sbceqal 3800	. 2 ⊢ (𝐴 ∈ 𝑉 → (∀𝑥(𝑥 = 𝐴 → 𝑥 = 𝐵) → 𝐴 = 𝐵))
6	4, 5	syl5 35	1 ⊢ (𝐴 ∈ 𝑉 → ((∀𝑥(𝜑 ↔ 𝑥 = 𝐴) ∧ ∀𝑥(𝜑 ↔ 𝑥 = 𝐵)) → 𝐴 = 𝐵))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570   ∈ wcel 2145

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-v 3453

This theorem is used by: (None)