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

Theorem rmoeq1f 3402
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 2993 . . 3 𝑥 𝐴 = 𝐵
4 eleq2 2903 . . . 4 (𝐴 = 𝐵 → (𝑥𝐴𝑥𝐵))
54anbi1d 631 . . 3 (𝐴 = 𝐵 → ((𝑥𝐴𝜑) ↔ (𝑥𝐵𝜑)))
63, 5mobid 2634 . 2 (𝐴 = 𝐵 → (∃*𝑥(𝑥𝐴𝜑) ↔ ∃*𝑥(𝑥𝐵𝜑)))
7 df-rmo 3148 . 2 (∃*𝑥𝐴 𝜑 ↔ ∃*𝑥(𝑥𝐴𝜑))
8 df-rmo 3148 . 2 (∃*𝑥𝐵 𝜑 ↔ ∃*𝑥(𝑥𝐵𝜑))
96, 7, 83bitr4g 316 1 (𝐴 = 𝐵 → (∃*𝑥𝐴 𝜑 ↔ ∃*𝑥𝐵 𝜑))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398   = wceq 1537  wcel 2114  ∃*wmo 2620  wnfc 2963  ∃*wrmo 3143
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 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1540  df-ex 1781  df-nf 1785  df-mo 2622  df-cleq 2816  df-clel 2895  df-nfc 2965  df-rmo 3148
This theorem is referenced by:  rmoeq1OLD  3414
  Copyright terms: Public domain W3C validator