Theorem sbceqal 3799

Description: Class version of one implication of equvelv 2063. (Contributed by Andrew Salmon, 28-Jun-2011.) (Proof shortened by SN, 26-Oct-2024.)

Assertion

Ref	Expression
sbceqal	⊢ (𝐴 ∈ 𝑉 → (∀𝑥(𝑥 = 𝐴 → 𝑥 = 𝐵) → 𝐴 = 𝐵))

Distinct variable groups:   𝑥,𝐵   𝑥,𝐴

Allowed substitution hint:   𝑉(𝑥)

Proof of Theorem sbceqal

Step	Hyp	Ref	Expression
1		eqeq1 2764	. . . 4 ⊢ (𝑥 = 𝐴 → (𝑥 = 𝐴 ↔ 𝐴 = 𝐴))
2		eqeq1 2764	. . . 4 ⊢ (𝑥 = 𝐴 → (𝑥 = 𝐵 ↔ 𝐴 = 𝐵))
3	1, 2	imbi12d 347	. . 3 ⊢ (𝑥 = 𝐴 → ((𝑥 = 𝐴 → 𝑥 = 𝐵) ↔ (𝐴 = 𝐴 → 𝐴 = 𝐵)))
4		eqid 2760	. . . 4 ⊢ 𝐴 = 𝐴
5	4	a1bi 365	. . 3 ⊢ (𝐴 = 𝐵 ↔ (𝐴 = 𝐴 → 𝐴 = 𝐵))
6	3, 5	bitr4di 292	. 2 ⊢ (𝑥 = 𝐴 → ((𝑥 = 𝐴 → 𝑥 = 𝐵) ↔ 𝐴 = 𝐵))
7	6	spcgv 3550	1 ⊢ (𝐴 ∈ 𝑉 → (∀𝑥(𝑥 = 𝐴 → 𝑥 = 𝐵) → 𝐴 = 𝐵))

This proof depends on syntax axioms:   → wi 4  ∀wal 1567   = wceq 1569   ∈ wcel 2144

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-v 3452

This theorem is used by:  sbeqalb  3800