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

Theorem eeeanv 2347
Description: Distribute three existential quantifiers over a conjunction. (Contributed by NM, 26-Jul-1995.) (Proof shortened by Andrew Salmon, 25-May-2011.) Reduce distinct variable restrictions. (Revised by Wolf Lammen, 20-Jan-2018.)
Assertion
Ref Expression
eeeanv (∃𝑥𝑦𝑧(𝜑𝜓𝜒) ↔ (∃𝑥𝜑 ∧ ∃𝑦𝜓 ∧ ∃𝑧𝜒))
Distinct variable groups:   𝜑,𝑦   𝜑,𝑧   𝜓,𝑥   𝜓,𝑧   𝜒,𝑥   𝜒,𝑦
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦)   𝜒(𝑧)

Proof of Theorem eeeanv
StepHypRef Expression
1 eeanv 2346 . . 3 (∃𝑥𝑦(𝜑𝜓) ↔ (∃𝑥𝜑 ∧ ∃𝑦𝜓))
21anbi1i 625 . 2 ((∃𝑥𝑦(𝜑𝜓) ∧ ∃𝑧𝜒) ↔ ((∃𝑥𝜑 ∧ ∃𝑦𝜓) ∧ ∃𝑧𝜒))
3 df-3an 1089 . . . . . 6 ((𝜑𝜓𝜒) ↔ ((𝜑𝜓) ∧ 𝜒))
43exbii 1850 . . . . 5 (∃𝑧(𝜑𝜓𝜒) ↔ ∃𝑧((𝜑𝜓) ∧ 𝜒))
5 19.42v 1957 . . . . 5 (∃𝑧((𝜑𝜓) ∧ 𝜒) ↔ ((𝜑𝜓) ∧ ∃𝑧𝜒))
64, 5bitri 275 . . . 4 (∃𝑧(𝜑𝜓𝜒) ↔ ((𝜑𝜓) ∧ ∃𝑧𝜒))
762exbii 1851 . . 3 (∃𝑥𝑦𝑧(𝜑𝜓𝜒) ↔ ∃𝑥𝑦((𝜑𝜓) ∧ ∃𝑧𝜒))
8 nfv 1917 . . . . . 6 𝑦𝜒
98nfex 2318 . . . . 5 𝑦𝑧𝜒
10919.41 2228 . . . 4 (∃𝑦((𝜑𝜓) ∧ ∃𝑧𝜒) ↔ (∃𝑦(𝜑𝜓) ∧ ∃𝑧𝜒))
1110exbii 1850 . . 3 (∃𝑥𝑦((𝜑𝜓) ∧ ∃𝑧𝜒) ↔ ∃𝑥(∃𝑦(𝜑𝜓) ∧ ∃𝑧𝜒))
12 nfv 1917 . . . . 5 𝑥𝜒
1312nfex 2318 . . . 4 𝑥𝑧𝜒
141319.41 2228 . . 3 (∃𝑥(∃𝑦(𝜑𝜓) ∧ ∃𝑧𝜒) ↔ (∃𝑥𝑦(𝜑𝜓) ∧ ∃𝑧𝜒))
157, 11, 143bitri 297 . 2 (∃𝑥𝑦𝑧(𝜑𝜓𝜒) ↔ (∃𝑥𝑦(𝜑𝜓) ∧ ∃𝑧𝜒))
16 df-3an 1089 . 2 ((∃𝑥𝜑 ∧ ∃𝑦𝜓 ∧ ∃𝑧𝜒) ↔ ((∃𝑥𝜑 ∧ ∃𝑦𝜓) ∧ ∃𝑧𝜒))
172, 15, 163bitr4i 303 1 (∃𝑥𝑦𝑧(𝜑𝜓𝜒) ↔ (∃𝑥𝜑 ∧ ∃𝑦𝜓 ∧ ∃𝑧𝜒))
Colors of variables: wff setvar class
Syntax hints:  wb 205  wa 397  w3a 1087  wex 1781
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-10 2137  ax-11 2154  ax-12 2171
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 846  df-3an 1089  df-ex 1782  df-nf 1786
This theorem is referenced by:  eloprabgaOLD  7449
  Copyright terms: Public domain W3C validator