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

Theorem rmoeq1f 3418
Description: Equality theorem for restricted at-most-one quantifier, with bound-variable hypotheses instead of distinct variable restrictions. (Contributed by Alexander van der Vekens, 17-Jun-2017.)
Hypotheses
Ref Expression
rmoeq1f.1 𝑥𝐴
rmoeq1f.2 𝑥𝐵
Assertion
Ref Expression
rmoeq1f (𝐴 = 𝐵 → (∃*𝑥𝐴 𝜑 ↔ ∃*𝑥𝐵 𝜑))

Proof of Theorem rmoeq1f
StepHypRef Expression
1 rmoeq1f.1 . . . 4 𝑥𝐴
2 rmoeq1f.2 . . . 4 𝑥𝐵
31, 2nfeq 2914 . . 3 𝑥 𝐴 = 𝐵
4 eleq2 2820 . . . 4 (𝐴 = 𝐵 → (𝑥𝐴𝑥𝐵))
54anbi1d 628 . . 3 (𝐴 = 𝐵 → ((𝑥𝐴𝜑) ↔ (𝑥𝐵𝜑)))
63, 5mobid 2542 . 2 (𝐴 = 𝐵 → (∃*𝑥(𝑥𝐴𝜑) ↔ ∃*𝑥(𝑥𝐵𝜑)))
7 df-rmo 3374 . 2 (∃*𝑥𝐴 𝜑 ↔ ∃*𝑥(𝑥𝐴𝜑))
8 df-rmo 3374 . 2 (∃*𝑥𝐵 𝜑 ↔ ∃*𝑥(𝑥𝐵𝜑))
96, 7, 83bitr4g 313 1 (𝐴 = 𝐵 → (∃*𝑥𝐴 𝜑 ↔ ∃*𝑥𝐵 𝜑))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 394   = wceq 1539  wcel 2104  ∃*wmo 2530  wnfc 2881  ∃*wrmo 3373
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-10 2135  ax-11 2152  ax-12 2169  ax-ext 2701
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 844  df-tru 1542  df-ex 1780  df-nf 1784  df-mo 2532  df-cleq 2722  df-clel 2808  df-nfc 2883  df-rmo 3374
This theorem is referenced by:  reueq1f  3419
  Copyright terms: Public domain W3C validator