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

Theorem reueq1f 3113
Description: Equality theorem for restricted uniqueness quantifier, with bound-variable hypotheses instead of distinct variable restrictions. (Contributed by NM, 5-Apr-2004.) (Revised by Andrew Salmon, 11-Jul-2011.)
Hypotheses
Ref Expression
raleq1f.1 𝑥𝐴
raleq1f.2 𝑥𝐵
Assertion
Ref Expression
reueq1f (𝐴 = 𝐵 → (∃!𝑥𝐴 𝜑 ↔ ∃!𝑥𝐵 𝜑))

Proof of Theorem reueq1f
StepHypRef Expression
1 raleq1f.1 . . . 4 𝑥𝐴
2 raleq1f.2 . . . 4 𝑥𝐵
31, 2nfeq 2762 . . 3 𝑥 𝐴 = 𝐵
4 eleq2 2677 . . . 4 (𝐴 = 𝐵 → (𝑥𝐴𝑥𝐵))
54anbi1d 737 . . 3 (𝐴 = 𝐵 → ((𝑥𝐴𝜑) ↔ (𝑥𝐵𝜑)))
63, 5eubid 2476 . 2 (𝐴 = 𝐵 → (∃!𝑥(𝑥𝐴𝜑) ↔ ∃!𝑥(𝑥𝐵𝜑)))
7 df-reu 2903 . 2 (∃!𝑥𝐴 𝜑 ↔ ∃!𝑥(𝑥𝐴𝜑))
8 df-reu 2903 . 2 (∃!𝑥𝐵 𝜑 ↔ ∃!𝑥(𝑥𝐵𝜑))
96, 7, 83bitr4g 302 1 (𝐴 = 𝐵 → (∃!𝑥𝐴 𝜑 ↔ ∃!𝑥𝐵 𝜑))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 195  wa 383   = wceq 1475  wcel 1977  ∃!weu 2458  wnfc 2738  ∃!wreu 2898
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-ext 2590
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-tru 1478  df-ex 1696  df-nf 1701  df-eu 2462  df-cleq 2603  df-clel 2606  df-nfc 2740  df-reu 2903
This theorem is referenced by:  reueq1  3117
  Copyright terms: Public domain W3C validator