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

Theorem 2rexbiia 3037
 Description: Inference adding two restricted existential quantifiers to both sides of an equivalence. (Contributed by NM, 1-Aug-2004.)
Hypothesis
Ref Expression
2rexbiia.1 ((𝑥𝐴𝑦𝐵) → (𝜑𝜓))
Assertion
Ref Expression
2rexbiia (∃𝑥𝐴𝑦𝐵 𝜑 ↔ ∃𝑥𝐴𝑦𝐵 𝜓)
Distinct variable groups:   𝑥,𝑦   𝑦,𝐴
Allowed substitution hints:   𝜑(𝑥,𝑦)   𝜓(𝑥,𝑦)   𝐴(𝑥)   𝐵(𝑥,𝑦)

Proof of Theorem 2rexbiia
StepHypRef Expression
1 2rexbiia.1 . . 3 ((𝑥𝐴𝑦𝐵) → (𝜑𝜓))
21rexbidva 3031 . 2 (𝑥𝐴 → (∃𝑦𝐵 𝜑 ↔ ∃𝑦𝐵 𝜓))
32rexbiia 3022 1 (∃𝑥𝐴𝑦𝐵 𝜑 ↔ ∃𝑥𝐴𝑦𝐵 𝜓)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 195   ∧ wa 383   ∈ wcel 1977  ∃wrex 2897 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827 This theorem depends on definitions:  df-bi 196  df-an 385  df-ex 1696  df-rex 2902 This theorem is referenced by:  cnref1o  11703  mndpfo  17137  mdsymlem8  28653  xlt2addrd  28913  elunirnmbfm  29642  icoreelrnab  32378
 Copyright terms: Public domain W3C validator