MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  sbceqal Structured version   Visualization version   GIF version

Theorem sbceqal 3803
Description: Class version of one implication of equvelv 2066. (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
StepHypRef Expression
1 eqeq1 2767 . . . 4 (𝑥 = 𝐴 → (𝑥 = 𝐴 ↔ 𝐴 = 𝐴))
2 eqeq1 2767 . . . 4 (𝑥 = 𝐴 → (𝑥 = 𝐵 ↔ 𝐴 = 𝐵))
31, 2imbi12d 347 . . 3 (𝑥 = 𝐴 → ((𝑥 = 𝐴 → 𝑥 = 𝐵) ↔ (𝐴 = 𝐴 → 𝐴 = 𝐵)))
4 eqid 2763 . . . 4 𝐴 = 𝐴
54a1bi 365 . . 3 (𝐴 = 𝐵 ↔ (𝐴 = 𝐴 → 𝐴 = 𝐵))
63, 5bitr4di 292 . 2 (𝑥 = 𝐴 → ((𝑥 = 𝐴 → 𝑥 = 𝐵) ↔ 𝐴 = 𝐵))
76spcgv 3554 1 (𝐴 ∈ 𝑉 → (∀𝑥(𝑥 = 𝐴 → 𝑥 = 𝐵) → 𝐴 = 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4  ∀wal 1568   = wceq 1570   ∈ wcel 2147
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-v 3456
This theorem is used by:  sbeqalb  3804
  Copyright terms: Public domain W3C validator