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

Theorem rexbi 3154
Description: Distribute restricted quantification over a biconditional. (Contributed by Scott Fenton, 7-Aug-2024.)
Assertion
Ref Expression
rexbi (∀𝑥𝐴 (𝜑𝜓) → (∃𝑥𝐴 𝜑 ↔ ∃𝑥𝐴 𝜓))

Proof of Theorem rexbi
StepHypRef Expression
1 ralbi 3080 . . 3 (∀𝑥𝐴𝜑 ↔ ¬ 𝜓) → (∀𝑥𝐴 ¬ 𝜑 ↔ ∀𝑥𝐴 ¬ 𝜓))
21notbid 321 . 2 (∀𝑥𝐴𝜑 ↔ ¬ 𝜓) → (¬ ∀𝑥𝐴 ¬ 𝜑 ↔ ¬ ∀𝑥𝐴 ¬ 𝜓))
3 notbi 322 . . 3 ((𝜑𝜓) ↔ (¬ 𝜑 ↔ ¬ 𝜓))
43ralbii 3078 . 2 (∀𝑥𝐴 (𝜑𝜓) ↔ ∀𝑥𝐴𝜑 ↔ ¬ 𝜓))
5 dfrex2 3151 . . 3 (∃𝑥𝐴 𝜑 ↔ ¬ ∀𝑥𝐴 ¬ 𝜑)
6 dfrex2 3151 . . 3 (∃𝑥𝐴 𝜓 ↔ ¬ ∀𝑥𝐴 ¬ 𝜓)
75, 6bibi12i 343 . 2 ((∃𝑥𝐴 𝜑 ↔ ∃𝑥𝐴 𝜓) ↔ (¬ ∀𝑥𝐴 ¬ 𝜑 ↔ ¬ ∀𝑥𝐴 ¬ 𝜓))
82, 4, 73imtr4i 295 1 (∀𝑥𝐴 (𝜑𝜓) → (∃𝑥𝐴 𝜑 ↔ ∃𝑥𝐴 𝜓))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 209  wral 3051  wrex 3052
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817
This theorem depends on definitions:  df-bi 210  df-an 400  df-ex 1788  df-ral 3056  df-rex 3057
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator