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

Theorem rmoeq1f 3413
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 2944 . . 3 𝑥 𝐴 = 𝐵
4 eleq2 2858 . . . 4 (𝐴 = 𝐵 → (𝑥𝐴𝑥𝐵))
54anbi1d 642 . . 3 (𝐴 = 𝐵 → ((𝑥𝐴𝜑) ↔ (𝑥𝐵𝜑)))
63, 5mobid 2584 . 2 (𝐴 = 𝐵 → (∃*𝑥(𝑥𝐴𝜑) ↔ ∃*𝑥(𝑥𝐵𝜑)))
7 df-rmo 3376 . 2 (∃*𝑥𝐴 𝜑 ↔ ∃*𝑥(𝑥𝐴𝜑))
8 df-rmo 3376 . 2 (∃*𝑥𝐵 𝜑 ↔ ∃*𝑥(𝑥𝐵𝜑))
96, 7, 83bitr4g 317 1 (𝐴 = 𝐵 → (∃*𝑥𝐴 𝜑 ↔ ∃*𝑥𝐵 𝜑))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400   = wceq 1567  wcel 2149  ∃*wmo 2571  wnfc 2916  ∃*wrmo 3375
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1570  df-ex 1807  df-nf 1811  df-mo 2573  df-cleq 2761  df-clel 2844  df-nfc 2918  df-rmo 3376
This theorem is referenced by:  reueq1f  3414
  Copyright terms: Public domain W3C validator