Theorem eleq2w2 2756

Description: A weaker version of eleq2 2849 (but stronger than ax-9 2154 and elequ2 2159) that uses ax-12 2212 to avoid ax-8 2146 and df-clel 2835. Compare eleq2w 2844, whose setvars appear where the class variables are in this theorem, and vice versa. (Contributed by BJ, 24-Jun-2019.) Strengthen from setvar variables to class variables. (Revised by WL and SN, 23-Aug-2024.)

Assertion

Ref	Expression
eleq2w2	⊢ (𝐴 = 𝐵 → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem eleq2w2

Step	Hyp	Ref	Expression
1		dfcleq 2753	. . 3 ⊢ (𝐴 = 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))
2	1	biimpi 219	. 2 ⊢ (𝐴 = 𝐵 → ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))
3	2	19.21bi 2225	1 ⊢ (𝐴 = 𝐵 → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀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-9 2154  ax-12 2212  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1812  df-cleq 2752

This theorem is used by:  nfceqdf  2918  drnfc1  2941  drnfc2  2942  plngval  29264  prlngplngtr  29446  r1omhfb  35796  fineqvrep  35850  fineqvpow  35851  fineqvac  35852  r1omhfbregs  35873  fvineqsneu  38471  sge0f1o  47528  f1omoOLD  50144  discthing  50732