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

Theorem reueqd 3360
Description: Equality deduction for restricted unique existential quantifier. (Contributed by NM, 5-Apr-2004.)
Hypothesis
Ref Expression
raleqd.1 (𝐴 = 𝐵 → (𝜑𝜓))
Assertion
Ref Expression
reueqd (𝐴 = 𝐵 → (∃!𝑥𝐴 𝜑 ↔ ∃!𝑥𝐵 𝜓))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑥)

Proof of Theorem reueqd
StepHypRef Expression
1 reueq1 3352 . 2 (𝐴 = 𝐵 → (∃!𝑥𝐴 𝜑 ↔ ∃!𝑥𝐵 𝜑))
2 raleqd.1 . . 3 (𝐴 = 𝐵 → (𝜑𝜓))
32reubidv 3338 . 2 (𝐴 = 𝐵 → (∃!𝑥𝐵 𝜑 ↔ ∃!𝑥𝐵 𝜓))
41, 3bitrd 271 1 (𝐴 = 𝐵 → (∃!𝑥𝐴 𝜑 ↔ ∃!𝑥𝐵 𝜓))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 198   = wceq 1656  ∃!wreu 3119
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1894  ax-4 1908  ax-5 2009  ax-6 2075  ax-7 2112  ax-9 2173  ax-10 2192  ax-11 2207  ax-12 2220  ax-ext 2803
This theorem depends on definitions:  df-bi 199  df-an 387  df-or 879  df-tru 1660  df-ex 1879  df-nf 1883  df-mo 2605  df-eu 2640  df-cleq 2818  df-clel 2821  df-nfc 2958  df-reu 3124
This theorem is referenced by:  aceq1  9260
  Copyright terms: Public domain W3C validator