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

Theorem rmobidva 3326
Description: Formula-building rule for restricted existential quantifier (deduction form). (Contributed by NM, 16-Jun-2017.) Avoid ax-6 1975, ax-7 2015, ax-12 2175. (Revised by Wolf Lammen, 23-Nov-2024.)
Hypothesis
Ref Expression
rmobidva.1 ((𝜑𝑥𝐴) → (𝜓𝜒))
Assertion
Ref Expression
rmobidva (𝜑 → (∃*𝑥𝐴 𝜓 ↔ ∃*𝑥𝐴 𝜒))
Distinct variable group:   𝜑,𝑥
Allowed substitution hints:   𝜓(𝑥)   𝜒(𝑥)   𝐴(𝑥)

Proof of Theorem rmobidva
StepHypRef Expression
1 rmobidva.1 . . . 4 ((𝜑𝑥𝐴) → (𝜓𝜒))
21pm5.32da 579 . . 3 (𝜑 → ((𝑥𝐴𝜓) ↔ (𝑥𝐴𝜒)))
32mobidv 2551 . 2 (𝜑 → (∃*𝑥(𝑥𝐴𝜓) ↔ ∃*𝑥(𝑥𝐴𝜒)))
4 df-rmo 3074 . 2 (∃*𝑥𝐴 𝜓 ↔ ∃*𝑥(𝑥𝐴𝜓))
5 df-rmo 3074 . 2 (∃*𝑥𝐴 𝜒 ↔ ∃*𝑥(𝑥𝐴𝜒))
63, 4, 53bitr4g 314 1 (𝜑 → (∃*𝑥𝐴 𝜓 ↔ ∃*𝑥𝐴 𝜒))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396  wcel 2110  ∃*wmo 2540  ∃*wrmo 3069
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917
This theorem depends on definitions:  df-bi 206  df-an 397  df-ex 1787  df-mo 2542  df-rmo 3074
This theorem is referenced by:  rmobidv  3328  brdom7disj  10298  phpreu  35770
  Copyright terms: Public domain W3C validator