Theorem pm13.183 3620

Description: Compare theorem *13.183 in [WhiteheadRussell] p. 178. Only 𝐴 is required to be a set. (Contributed by Andrew Salmon, 3-Jun-2011.) Avoid ax-13 2402. (Revised by Wolf Lammen, 29-Apr-2023.)

Assertion

Ref	Expression
pm13.183	⊢ (𝐴 ∈ 𝑉 → (𝐴 = 𝐵 ↔ ∀𝑧(𝑧 = 𝐴 ↔ 𝑧 = 𝐵)))

Distinct variable groups:   𝑧,𝐴   𝑧,𝐵

Allowed substitution hint:   𝑉(𝑧)

Proof of Theorem pm13.183

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqeq1 2765	. 2 ⊢ (𝑦 = 𝐴 → (𝑦 = 𝐵 ↔ 𝐴 = 𝐵))
2		eqeq2 2773	. . . 4 ⊢ (𝑦 = 𝐴 → (𝑧 = 𝑦 ↔ 𝑧 = 𝐴))
3	2	bibi1d 346	. . 3 ⊢ (𝑦 = 𝐴 → ((𝑧 = 𝑦 ↔ 𝑧 = 𝐵) ↔ (𝑧 = 𝐴 ↔ 𝑧 = 𝐵)))
4	3	albidv 1953	. 2 ⊢ (𝑦 = 𝐴 → (∀𝑧(𝑧 = 𝑦 ↔ 𝑧 = 𝐵) ↔ ∀𝑧(𝑧 = 𝐴 ↔ 𝑧 = 𝐵)))
5		eqeq2 2773	. . . 4 ⊢ (𝑦 = 𝐵 → (𝑧 = 𝑦 ↔ 𝑧 = 𝐵))
6	5	alrimiv 1960	. . 3 ⊢ (𝑦 = 𝐵 → ∀𝑧(𝑧 = 𝑦 ↔ 𝑧 = 𝐵))
7		stdpc4 2105	. . . 4 ⊢ (∀𝑧(𝑧 = 𝑦 ↔ 𝑧 = 𝐵) → [𝑦 / 𝑧](𝑧 = 𝑦 ↔ 𝑧 = 𝐵))
8		sbbi 2341	. . . . 5 ⊢ ([𝑦 / 𝑧](𝑧 = 𝑦 ↔ 𝑧 = 𝐵) ↔ ([𝑦 / 𝑧]𝑧 = 𝑦 ↔ [𝑦 / 𝑧]𝑧 = 𝐵))
9		equsb1v 2142	. . . . . . 7 ⊢ [𝑦 / 𝑧]𝑧 = 𝑦
10	9	tbt 372	. . . . . 6 ⊢ ([𝑦 / 𝑧]𝑧 = 𝐵 ↔ ([𝑦 / 𝑧]𝑧 = 𝐵 ↔ [𝑦 / 𝑧]𝑧 = 𝑦))
11		bicom 225	. . . . . 6 ⊢ (([𝑦 / 𝑧]𝑧 = 𝐵 ↔ [𝑦 / 𝑧]𝑧 = 𝑦) ↔ ([𝑦 / 𝑧]𝑧 = 𝑦 ↔ [𝑦 / 𝑧]𝑧 = 𝐵))
12	10, 11	bitri 278	. . . . 5 ⊢ ([𝑦 / 𝑧]𝑧 = 𝐵 ↔ ([𝑦 / 𝑧]𝑧 = 𝑦 ↔ [𝑦 / 𝑧]𝑧 = 𝐵))
13		eqsb1 2887	. . . . 5 ⊢ ([𝑦 / 𝑧]𝑧 = 𝐵 ↔ 𝑦 = 𝐵)
14	8, 12, 13	3bitr2i 302	. . . 4 ⊢ ([𝑦 / 𝑧](𝑧 = 𝑦 ↔ 𝑧 = 𝐵) ↔ 𝑦 = 𝐵)
15	7, 14	sylib 221	. . 3 ⊢ (∀𝑧(𝑧 = 𝑦 ↔ 𝑧 = 𝐵) → 𝑦 = 𝐵)
16	6, 15	impbii 212	. 2 ⊢ (𝑦 = 𝐵 ↔ ∀𝑧(𝑧 = 𝑦 ↔ 𝑧 = 𝐵))
17	1, 4, 16	vtoclbg 3520	1 ⊢ (𝐴 ∈ 𝑉 → (𝐴 = 𝐵 ↔ ∀𝑧(𝑧 = 𝐴 ↔ 𝑧 = 𝐵)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wal 1568   = wceq 1570  [wsb 2099   ∈ 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-10 2178  ax-12 2213  ax-ext 2733

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

This theorem is used by:  mpo2eqb  7544