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

Theorem reueq1f 3386
Description: Equality theorem for restricted unique existential 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
rmoeq1f.1 𝑥𝐴
rmoeq1f.2 𝑥𝐵
Assertion
Ref Expression
reueq1f (𝐴 = 𝐵 → (∃!𝑥𝐴 𝜑 ↔ ∃!𝑥𝐵 𝜑))

Proof of Theorem reueq1f
StepHypRef Expression
1 rmoeq1f.1 . . . 4 𝑥𝐴
2 rmoeq1f.2 . . . 4 𝑥𝐵
31, 2rexeqf 3322 . . 3 (𝐴 = 𝐵 → (∃𝑥𝐴 𝜑 ↔ ∃𝑥𝐵 𝜑))
41, 2rmoeq1f 3385 . . 3 (𝐴 = 𝐵 → (∃*𝑥𝐴 𝜑 ↔ ∃*𝑥𝐵 𝜑))
53, 4anbi12d 632 . 2 (𝐴 = 𝐵 → ((∃𝑥𝐴 𝜑 ∧ ∃*𝑥𝐴 𝜑) ↔ (∃𝑥𝐵 𝜑 ∧ ∃*𝑥𝐵 𝜑)))
6 reu5 3348 . 2 (∃!𝑥𝐴 𝜑 ↔ (∃𝑥𝐴 𝜑 ∧ ∃*𝑥𝐴 𝜑))
7 reu5 3348 . 2 (∃!𝑥𝐵 𝜑 ↔ (∃𝑥𝐵 𝜑 ∧ ∃*𝑥𝐵 𝜑))
85, 6, 73bitr4g 314 1 (𝐴 = 𝐵 → (∃!𝑥𝐴 𝜑 ↔ ∃!𝑥𝐵 𝜑))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1541  wnfc 2879  wrex 3056  ∃!wreu 3344  ∃*wrmo 3345
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1544  df-ex 1781  df-nf 1785  df-mo 2535  df-eu 2564  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ral 3048  df-rex 3057  df-rmo 3346  df-reu 3347
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator