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

Theorem reueq1OLD 3417
Description: Obsolete version of reueq1 3415 as of 12-Mar-2025. (Contributed by NM, 5-Apr-2004.) Remove usage of ax-10 2137, ax-11 2154, and ax-12 2171. (Revised by Steven Nguyen, 30-Apr-2023.) (New usage is discouraged.) (Proof modification is discouraged.)
Assertion
Ref Expression
reueq1OLD (𝐴 = 𝐵 → (∃!𝑥𝐴 𝜑 ↔ ∃!𝑥𝐵 𝜑))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵
Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem reueq1OLD
StepHypRef Expression
1 eleq2 2822 . . . 4 (𝐴 = 𝐵 → (𝑥𝐴𝑥𝐵))
21anbi1d 630 . . 3 (𝐴 = 𝐵 → ((𝑥𝐴𝜑) ↔ (𝑥𝐵𝜑)))
32eubidv 2580 . 2 (𝐴 = 𝐵 → (∃!𝑥(𝑥𝐴𝜑) ↔ ∃!𝑥(𝑥𝐵𝜑)))
4 df-reu 3377 . 2 (∃!𝑥𝐴 𝜑 ↔ ∃!𝑥(𝑥𝐴𝜑))
5 df-reu 3377 . 2 (∃!𝑥𝐵 𝜑 ↔ ∃!𝑥(𝑥𝐵𝜑))
63, 4, 53bitr4g 313 1 (𝐴 = 𝐵 → (∃!𝑥𝐴 𝜑 ↔ ∃!𝑥𝐵 𝜑))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396   = wceq 1541  wcel 2106  ∃!weu 2562  ∃!wreu 3374
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2703
This theorem depends on definitions:  df-bi 206  df-an 397  df-ex 1782  df-mo 2534  df-eu 2563  df-cleq 2724  df-clel 2810  df-reu 3377
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator