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

Theorem reean 3287
 Description: Rearrange restricted existential quantifiers. (Contributed by NM, 27-Oct-2010.) (Proof shortened by Andrew Salmon, 30-May-2011.)
Hypotheses
Ref Expression
reean.1 𝑦𝜑
reean.2 𝑥𝜓
Assertion
Ref Expression
reean (∃𝑥𝐴𝑦𝐵 (𝜑𝜓) ↔ (∃𝑥𝐴 𝜑 ∧ ∃𝑦𝐵 𝜓))
Distinct variable groups:   𝑦,𝐴   𝑥,𝐵   𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥,𝑦)   𝜓(𝑥,𝑦)   𝐴(𝑥)   𝐵(𝑦)

Proof of Theorem reean
StepHypRef Expression
1 an4 647 . . . 4 (((𝑥𝐴𝑦𝐵) ∧ (𝜑𝜓)) ↔ ((𝑥𝐴𝜑) ∧ (𝑦𝐵𝜓)))
212exbii 1945 . . 3 (∃𝑥𝑦((𝑥𝐴𝑦𝐵) ∧ (𝜑𝜓)) ↔ ∃𝑥𝑦((𝑥𝐴𝜑) ∧ (𝑦𝐵𝜓)))
3 nfv 2010 . . . . 5 𝑦 𝑥𝐴
4 reean.1 . . . . 5 𝑦𝜑
53, 4nfan 1999 . . . 4 𝑦(𝑥𝐴𝜑)
6 nfv 2010 . . . . 5 𝑥 𝑦𝐵
7 reean.2 . . . . 5 𝑥𝜓
86, 7nfan 1999 . . . 4 𝑥(𝑦𝐵𝜓)
95, 8eean 2362 . . 3 (∃𝑥𝑦((𝑥𝐴𝜑) ∧ (𝑦𝐵𝜓)) ↔ (∃𝑥(𝑥𝐴𝜑) ∧ ∃𝑦(𝑦𝐵𝜓)))
102, 9bitri 267 . 2 (∃𝑥𝑦((𝑥𝐴𝑦𝐵) ∧ (𝜑𝜓)) ↔ (∃𝑥(𝑥𝐴𝜑) ∧ ∃𝑦(𝑦𝐵𝜓)))
11 r2ex 3242 . 2 (∃𝑥𝐴𝑦𝐵 (𝜑𝜓) ↔ ∃𝑥𝑦((𝑥𝐴𝑦𝐵) ∧ (𝜑𝜓)))
12 df-rex 3095 . . 3 (∃𝑥𝐴 𝜑 ↔ ∃𝑥(𝑥𝐴𝜑))
13 df-rex 3095 . . 3 (∃𝑦𝐵 𝜓 ↔ ∃𝑦(𝑦𝐵𝜓))
1412, 13anbi12i 621 . 2 ((∃𝑥𝐴 𝜑 ∧ ∃𝑦𝐵 𝜓) ↔ (∃𝑥(𝑥𝐴𝜑) ∧ ∃𝑦(𝑦𝐵𝜓)))
1510, 11, 143bitr4i 295 1 (∃𝑥𝐴𝑦𝐵 (𝜑𝜓) ↔ (∃𝑥𝐴 𝜑 ∧ ∃𝑦𝐵 𝜓))
 Colors of variables: wff setvar class Syntax hints:   ↔ wb 198   ∧ wa 385  ∃wex 1875  Ⅎwnf 1879   ∈ wcel 2157  ∃wrex 3090 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1891  ax-4 1905  ax-5 2006  ax-6 2072  ax-7 2107  ax-10 2185  ax-11 2200  ax-12 2213 This theorem depends on definitions:  df-bi 199  df-an 386  df-or 875  df-tru 1657  df-ex 1876  df-nf 1880  df-ral 3094  df-rex 3095 This theorem is referenced by:  reeanv  3288  disjrnmpt2  40129
 Copyright terms: Public domain W3C validator