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

Theorem rmobida 3318
Description: Formula-building rule for restricted existential quantifier (deduction form). (Contributed by NM, 16-Jun-2017.)
Hypotheses
Ref Expression
rmobida.1 𝑥𝜑
rmobida.2 ((𝜑𝑥𝐴) → (𝜓𝜒))
Assertion
Ref Expression
rmobida (𝜑 → (∃*𝑥𝐴 𝜓 ↔ ∃*𝑥𝐴 𝜒))

Proof of Theorem rmobida
StepHypRef Expression
1 rmobida.1 . . 3 𝑥𝜑
2 rmobida.2 . . . 4 ((𝜑𝑥𝐴) → (𝜓𝜒))
32pm5.32da 578 . . 3 (𝜑 → ((𝑥𝐴𝜓) ↔ (𝑥𝐴𝜒)))
41, 3mobid 2550 . 2 (𝜑 → (∃*𝑥(𝑥𝐴𝜓) ↔ ∃*𝑥(𝑥𝐴𝜒)))
5 df-rmo 3071 . 2 (∃*𝑥𝐴 𝜓 ↔ ∃*𝑥(𝑥𝐴𝜓))
6 df-rmo 3071 . 2 (∃*𝑥𝐴 𝜒 ↔ ∃*𝑥(𝑥𝐴𝜒))
74, 5, 63bitr4g 313 1 (𝜑 → (∃*𝑥𝐴 𝜓 ↔ ∃*𝑥𝐴 𝜒))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395  wnf 1787  wcel 2108  ∃*wmo 2538  ∃*wrmo 3066
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-12 2173
This theorem depends on definitions:  df-bi 206  df-an 396  df-ex 1784  df-nf 1788  df-mo 2540  df-rmo 3071
This theorem is referenced by:  rmobidva  3319  reuan  3825
  Copyright terms: Public domain W3C validator