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

Theorem rexcom4a 3330
 Description: Specialized existential commutation lemma. (Contributed by Jeff Madsen, 1-Jun-2011.)
Assertion
Ref Expression
rexcom4a (∃𝑥𝑦𝐴 (𝜑𝜓) ↔ ∃𝑦𝐴 (𝜑 ∧ ∃𝑥𝜓))
Distinct variable groups:   𝑥,𝐴   𝑥,𝑦   𝜑,𝑥
Allowed substitution hints:   𝜑(𝑦)   𝜓(𝑥,𝑦)   𝐴(𝑦)

Proof of Theorem rexcom4a
StepHypRef Expression
1 rexcom4 3329 . 2 (∃𝑦𝐴𝑥(𝜑𝜓) ↔ ∃𝑥𝑦𝐴 (𝜑𝜓))
2 19.42v 1994 . . 3 (∃𝑥(𝜑𝜓) ↔ (𝜑 ∧ ∃𝑥𝜓))
32rexbii 3143 . 2 (∃𝑦𝐴𝑥(𝜑𝜓) ↔ ∃𝑦𝐴 (𝜑 ∧ ∃𝑥𝜓))
41, 3bitr3i 266 1 (∃𝑥𝑦𝐴 (𝜑𝜓) ↔ ∃𝑦𝐴 (𝜑 ∧ ∃𝑥𝜓))
 Colors of variables: wff setvar class Syntax hints:   ↔ wb 196   ∧ wa 383  ∃wex 1817  ∃wrex 3015 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1835  ax-4 1850  ax-5 1952  ax-6 2018  ax-7 2054  ax-9 2112  ax-10 2132  ax-11 2147  ax-12 2160  ax-13 2355  ax-ext 2704 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-tru 1599  df-ex 1818  df-nf 1823  df-sb 2011  df-clab 2711  df-cleq 2717  df-clel 2720  df-nfc 2855  df-ral 3019  df-rex 3020  df-v 3306 This theorem is referenced by:  rexcom4b  3331
 Copyright terms: Public domain W3C validator