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

Theorem rmoeq1f 3356
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
raleq1f.1 𝑥𝐴
raleq1f.2 𝑥𝐵
Assertion
Ref Expression
rmoeq1f (𝐴 = 𝐵 → (∃*𝑥𝐴 𝜑 ↔ ∃*𝑥𝐵 𝜑))

Proof of Theorem rmoeq1f
StepHypRef Expression
1 raleq1f.1 . . . 4 𝑥𝐴
2 raleq1f.2 . . . 4 𝑥𝐵
31, 2nfeq 2971 . . 3 𝑥 𝐴 = 𝐵
4 eleq2 2881 . . . 4 (𝐴 = 𝐵 → (𝑥𝐴𝑥𝐵))
54anbi1d 632 . . 3 (𝐴 = 𝐵 → ((𝑥𝐴𝜑) ↔ (𝑥𝐵𝜑)))
63, 5mobid 2612 . 2 (𝐴 = 𝐵 → (∃*𝑥(𝑥𝐴𝜑) ↔ ∃*𝑥(𝑥𝐵𝜑)))
7 df-rmo 3117 . 2 (∃*𝑥𝐴 𝜑 ↔ ∃*𝑥(𝑥𝐴𝜑))
8 df-rmo 3117 . 2 (∃*𝑥𝐵 𝜑 ↔ ∃*𝑥(𝑥𝐵𝜑))
96, 7, 83bitr4g 317 1 (𝐴 = 𝐵 → (∃*𝑥𝐴 𝜑 ↔ ∃*𝑥𝐵 𝜑))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 399   = wceq 1538  wcel 2112  ∃*wmo 2599  wnfc 2939  ∃*wrmo 3112
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 1911  ax-6 1970  ax-7 2015  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2159  ax-12 2176  ax-ext 2773
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-tru 1541  df-ex 1782  df-nf 1786  df-mo 2601  df-cleq 2794  df-clel 2873  df-nfc 2941  df-rmo 3117
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator