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

Theorem rmobiia 3132
Description: Formula-building rule for restricted existential quantifier (inference rule). (Contributed by NM, 16-Jun-2017.)
Hypothesis
Ref Expression
rmobiia.1 (𝑥𝐴 → (𝜑𝜓))
Assertion
Ref Expression
rmobiia (∃*𝑥𝐴 𝜑 ↔ ∃*𝑥𝐴 𝜓)

Proof of Theorem rmobiia
StepHypRef Expression
1 rmobiia.1 . . . 4 (𝑥𝐴 → (𝜑𝜓))
21pm5.32i 669 . . 3 ((𝑥𝐴𝜑) ↔ (𝑥𝐴𝜓))
32mobii 2493 . 2 (∃*𝑥(𝑥𝐴𝜑) ↔ ∃*𝑥(𝑥𝐴𝜓))
4 df-rmo 2920 . 2 (∃*𝑥𝐴 𝜑 ↔ ∃*𝑥(𝑥𝐴𝜑))
5 df-rmo 2920 . 2 (∃*𝑥𝐴 𝜓 ↔ ∃*𝑥(𝑥𝐴𝜓))
63, 4, 53bitr4i 292 1 (∃*𝑥𝐴 𝜑 ↔ ∃*𝑥𝐴 𝜓)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 384  wcel 1990  ∃*wmo 2471  ∃*wrmo 2915
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-12 2047
This theorem depends on definitions:  df-bi 197  df-an 386  df-tru 1486  df-ex 1705  df-nf 1710  df-eu 2474  df-mo 2475  df-rmo 2920
This theorem is referenced by:  rmobii  3133
  Copyright terms: Public domain W3C validator