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

Theorem ceqsex3v 3493
 Description: Elimination of three existential quantifiers, using implicit substitution. (Contributed by NM, 16-Aug-2011.)
Hypotheses
Ref Expression
ceqsex3v.1 𝐴 ∈ V
ceqsex3v.2 𝐵 ∈ V
ceqsex3v.3 𝐶 ∈ V
ceqsex3v.4 (𝑥 = 𝐴 → (𝜑𝜓))
ceqsex3v.5 (𝑦 = 𝐵 → (𝜓𝜒))
ceqsex3v.6 (𝑧 = 𝐶 → (𝜒𝜃))
Assertion
Ref Expression
ceqsex3v (∃𝑥𝑦𝑧((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) ∧ 𝜑) ↔ 𝜃)
Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝐵,𝑦,𝑧   𝑥,𝐶,𝑦,𝑧   𝜓,𝑥   𝜒,𝑦   𝜃,𝑧
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧)   𝜓(𝑦,𝑧)   𝜒(𝑥,𝑧)   𝜃(𝑥,𝑦)

Proof of Theorem ceqsex3v
StepHypRef Expression
1 anass 472 . . . . . 6 (((𝑥 = 𝐴 ∧ (𝑦 = 𝐵𝑧 = 𝐶)) ∧ 𝜑) ↔ (𝑥 = 𝐴 ∧ ((𝑦 = 𝐵𝑧 = 𝐶) ∧ 𝜑)))
2 3anass 1092 . . . . . . 7 ((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) ↔ (𝑥 = 𝐴 ∧ (𝑦 = 𝐵𝑧 = 𝐶)))
32anbi1i 626 . . . . . 6 (((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) ∧ 𝜑) ↔ ((𝑥 = 𝐴 ∧ (𝑦 = 𝐵𝑧 = 𝐶)) ∧ 𝜑))
4 df-3an 1086 . . . . . . 7 ((𝑦 = 𝐵𝑧 = 𝐶𝜑) ↔ ((𝑦 = 𝐵𝑧 = 𝐶) ∧ 𝜑))
54anbi2i 625 . . . . . 6 ((𝑥 = 𝐴 ∧ (𝑦 = 𝐵𝑧 = 𝐶𝜑)) ↔ (𝑥 = 𝐴 ∧ ((𝑦 = 𝐵𝑧 = 𝐶) ∧ 𝜑)))
61, 3, 53bitr4i 306 . . . . 5 (((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) ∧ 𝜑) ↔ (𝑥 = 𝐴 ∧ (𝑦 = 𝐵𝑧 = 𝐶𝜑)))
762exbii 1850 . . . 4 (∃𝑦𝑧((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) ∧ 𝜑) ↔ ∃𝑦𝑧(𝑥 = 𝐴 ∧ (𝑦 = 𝐵𝑧 = 𝐶𝜑)))
8 19.42vv 1958 . . . 4 (∃𝑦𝑧(𝑥 = 𝐴 ∧ (𝑦 = 𝐵𝑧 = 𝐶𝜑)) ↔ (𝑥 = 𝐴 ∧ ∃𝑦𝑧(𝑦 = 𝐵𝑧 = 𝐶𝜑)))
97, 8bitri 278 . . 3 (∃𝑦𝑧((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) ∧ 𝜑) ↔ (𝑥 = 𝐴 ∧ ∃𝑦𝑧(𝑦 = 𝐵𝑧 = 𝐶𝜑)))
109exbii 1849 . 2 (∃𝑥𝑦𝑧((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) ∧ 𝜑) ↔ ∃𝑥(𝑥 = 𝐴 ∧ ∃𝑦𝑧(𝑦 = 𝐵𝑧 = 𝐶𝜑)))
11 ceqsex3v.1 . . . 4 𝐴 ∈ V
12 ceqsex3v.4 . . . . . 6 (𝑥 = 𝐴 → (𝜑𝜓))
13123anbi3d 1439 . . . . 5 (𝑥 = 𝐴 → ((𝑦 = 𝐵𝑧 = 𝐶𝜑) ↔ (𝑦 = 𝐵𝑧 = 𝐶𝜓)))
14132exbidv 1925 . . . 4 (𝑥 = 𝐴 → (∃𝑦𝑧(𝑦 = 𝐵𝑧 = 𝐶𝜑) ↔ ∃𝑦𝑧(𝑦 = 𝐵𝑧 = 𝐶𝜓)))
1511, 14ceqsexv 3489 . . 3 (∃𝑥(𝑥 = 𝐴 ∧ ∃𝑦𝑧(𝑦 = 𝐵𝑧 = 𝐶𝜑)) ↔ ∃𝑦𝑧(𝑦 = 𝐵𝑧 = 𝐶𝜓))
16 ceqsex3v.2 . . . 4 𝐵 ∈ V
17 ceqsex3v.3 . . . 4 𝐶 ∈ V
18 ceqsex3v.5 . . . 4 (𝑦 = 𝐵 → (𝜓𝜒))
19 ceqsex3v.6 . . . 4 (𝑧 = 𝐶 → (𝜒𝜃))
2016, 17, 18, 19ceqsex2v 3492 . . 3 (∃𝑦𝑧(𝑦 = 𝐵𝑧 = 𝐶𝜓) ↔ 𝜃)
2115, 20bitri 278 . 2 (∃𝑥(𝑥 = 𝐴 ∧ ∃𝑦𝑧(𝑦 = 𝐵𝑧 = 𝐶𝜑)) ↔ 𝜃)
2210, 21bitri 278 1 (∃𝑥𝑦𝑧((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) ∧ 𝜑) ↔ 𝜃)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   ∧ w3a 1084   = wceq 1538  ∃wex 1781   ∈ wcel 2111  Vcvv 3441 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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-12 2175  ax-ext 2770 This theorem depends on definitions:  df-bi 210  df-an 400  df-3an 1086  df-ex 1782  df-nf 1786  df-cleq 2791  df-clel 2870 This theorem is referenced by:  ceqsex6v  3495
 Copyright terms: Public domain W3C validator