Theorem ceqsex6v 3539

Description: Elimination of six existential quantifiers, using implicit substitution. (Contributed by NM, 21-Sep-2011.)

Hypotheses

Ref	Expression
ceqsex6v.1	⊢ 𝐴 ∈ V
ceqsex6v.2	⊢ 𝐵 ∈ V
ceqsex6v.3	⊢ 𝐶 ∈ V
ceqsex6v.4	⊢ 𝐷 ∈ V
ceqsex6v.5	⊢ 𝐸 ∈ V
ceqsex6v.6	⊢ 𝐹 ∈ V
ceqsex6v.7	⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
ceqsex6v.8	⊢ (𝑦 = 𝐵 → (𝜓 ↔ 𝜒))
ceqsex6v.9	⊢ (𝑧 = 𝐶 → (𝜒 ↔ 𝜃))
ceqsex6v.10	⊢ (𝑤 = 𝐷 → (𝜃 ↔ 𝜏))
ceqsex6v.11	⊢ (𝑣 = 𝐸 → (𝜏 ↔ 𝜂))
ceqsex6v.12	⊢ (𝑢 = 𝐹 → (𝜂 ↔ 𝜁))

Assertion

Ref	Expression
ceqsex6v	⊢ (∃𝑥∃𝑦∃𝑧∃𝑤∃𝑣∃𝑢((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) ∧ (𝑤 = 𝐷 ∧ 𝑣 = 𝐸 ∧ 𝑢 = 𝐹) ∧ 𝜑) ↔ 𝜁)

Distinct variable groups:   𝑥,𝑦,𝑧,𝑤,𝑣,𝑢,𝐴   𝑥,𝐵,𝑦,𝑧,𝑤,𝑣,𝑢   𝑥,𝐶,𝑦,𝑧,𝑤,𝑣,𝑢   𝑥,𝐷,𝑦,𝑧,𝑤,𝑣,𝑢   𝑥,𝐸,𝑦,𝑧,𝑤,𝑣,𝑢   𝑥,𝐹,𝑦,𝑧,𝑤,𝑣,𝑢   𝜓,𝑥   𝜒,𝑦   𝜃,𝑧   𝜏,𝑤   𝜂,𝑣   𝜁,𝑢

Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧,𝑤,𝑣,𝑢)   𝜓(𝑦,𝑧,𝑤,𝑣,𝑢)   𝜒(𝑥,𝑧,𝑤,𝑣,𝑢)   𝜃(𝑥,𝑦,𝑤,𝑣,𝑢)   𝜏(𝑥,𝑦,𝑧,𝑣,𝑢)   𝜂(𝑥,𝑦,𝑧,𝑤,𝑢)   𝜁(𝑥,𝑦,𝑧,𝑤,𝑣)

Proof of Theorem ceqsex6v

Step	Hyp	Ref	Expression
1		3anass 1095	. . . . 5 ⊢ (((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) ∧ (𝑤 = 𝐷 ∧ 𝑣 = 𝐸 ∧ 𝑢 = 𝐹) ∧ 𝜑) ↔ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) ∧ ((𝑤 = 𝐷 ∧ 𝑣 = 𝐸 ∧ 𝑢 = 𝐹) ∧ 𝜑)))
2	1	3exbii 1850	. . . 4 ⊢ (∃𝑤∃𝑣∃𝑢((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) ∧ (𝑤 = 𝐷 ∧ 𝑣 = 𝐸 ∧ 𝑢 = 𝐹) ∧ 𝜑) ↔ ∃𝑤∃𝑣∃𝑢((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) ∧ ((𝑤 = 𝐷 ∧ 𝑣 = 𝐸 ∧ 𝑢 = 𝐹) ∧ 𝜑)))
3		19.42vvv 1959	. . . 4 ⊢ (∃𝑤∃𝑣∃𝑢((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) ∧ ((𝑤 = 𝐷 ∧ 𝑣 = 𝐸 ∧ 𝑢 = 𝐹) ∧ 𝜑)) ↔ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) ∧ ∃𝑤∃𝑣∃𝑢((𝑤 = 𝐷 ∧ 𝑣 = 𝐸 ∧ 𝑢 = 𝐹) ∧ 𝜑)))
4	2, 3	bitri 275	. . 3 ⊢ (∃𝑤∃𝑣∃𝑢((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) ∧ (𝑤 = 𝐷 ∧ 𝑣 = 𝐸 ∧ 𝑢 = 𝐹) ∧ 𝜑) ↔ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) ∧ ∃𝑤∃𝑣∃𝑢((𝑤 = 𝐷 ∧ 𝑣 = 𝐸 ∧ 𝑢 = 𝐹) ∧ 𝜑)))
5	4	3exbii 1850	. 2 ⊢ (∃𝑥∃𝑦∃𝑧∃𝑤∃𝑣∃𝑢((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) ∧ (𝑤 = 𝐷 ∧ 𝑣 = 𝐸 ∧ 𝑢 = 𝐹) ∧ 𝜑) ↔ ∃𝑥∃𝑦∃𝑧((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) ∧ ∃𝑤∃𝑣∃𝑢((𝑤 = 𝐷 ∧ 𝑣 = 𝐸 ∧ 𝑢 = 𝐹) ∧ 𝜑)))
6		ceqsex6v.1	. . 3 ⊢ 𝐴 ∈ V
7		ceqsex6v.2	. . 3 ⊢ 𝐵 ∈ V
8		ceqsex6v.3	. . 3 ⊢ 𝐶 ∈ V
9		ceqsex6v.7	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
10	9	anbi2d 630	. . . 4 ⊢ (𝑥 = 𝐴 → (((𝑤 = 𝐷 ∧ 𝑣 = 𝐸 ∧ 𝑢 = 𝐹) ∧ 𝜑) ↔ ((𝑤 = 𝐷 ∧ 𝑣 = 𝐸 ∧ 𝑢 = 𝐹) ∧ 𝜓)))
11	10	3exbidv 1925	. . 3 ⊢ (𝑥 = 𝐴 → (∃𝑤∃𝑣∃𝑢((𝑤 = 𝐷 ∧ 𝑣 = 𝐸 ∧ 𝑢 = 𝐹) ∧ 𝜑) ↔ ∃𝑤∃𝑣∃𝑢((𝑤 = 𝐷 ∧ 𝑣 = 𝐸 ∧ 𝑢 = 𝐹) ∧ 𝜓)))
12		ceqsex6v.8	. . . . 5 ⊢ (𝑦 = 𝐵 → (𝜓 ↔ 𝜒))
13	12	anbi2d 630	. . . 4 ⊢ (𝑦 = 𝐵 → (((𝑤 = 𝐷 ∧ 𝑣 = 𝐸 ∧ 𝑢 = 𝐹) ∧ 𝜓) ↔ ((𝑤 = 𝐷 ∧ 𝑣 = 𝐸 ∧ 𝑢 = 𝐹) ∧ 𝜒)))
14	13	3exbidv 1925	. . 3 ⊢ (𝑦 = 𝐵 → (∃𝑤∃𝑣∃𝑢((𝑤 = 𝐷 ∧ 𝑣 = 𝐸 ∧ 𝑢 = 𝐹) ∧ 𝜓) ↔ ∃𝑤∃𝑣∃𝑢((𝑤 = 𝐷 ∧ 𝑣 = 𝐸 ∧ 𝑢 = 𝐹) ∧ 𝜒)))
15		ceqsex6v.9	. . . . 5 ⊢ (𝑧 = 𝐶 → (𝜒 ↔ 𝜃))
16	15	anbi2d 630	. . . 4 ⊢ (𝑧 = 𝐶 → (((𝑤 = 𝐷 ∧ 𝑣 = 𝐸 ∧ 𝑢 = 𝐹) ∧ 𝜒) ↔ ((𝑤 = 𝐷 ∧ 𝑣 = 𝐸 ∧ 𝑢 = 𝐹) ∧ 𝜃)))
17	16	3exbidv 1925	. . 3 ⊢ (𝑧 = 𝐶 → (∃𝑤∃𝑣∃𝑢((𝑤 = 𝐷 ∧ 𝑣 = 𝐸 ∧ 𝑢 = 𝐹) ∧ 𝜒) ↔ ∃𝑤∃𝑣∃𝑢((𝑤 = 𝐷 ∧ 𝑣 = 𝐸 ∧ 𝑢 = 𝐹) ∧ 𝜃)))
18	6, 7, 8, 11, 14, 17	ceqsex3v 3537	. 2 ⊢ (∃𝑥∃𝑦∃𝑧((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) ∧ ∃𝑤∃𝑣∃𝑢((𝑤 = 𝐷 ∧ 𝑣 = 𝐸 ∧ 𝑢 = 𝐹) ∧ 𝜑)) ↔ ∃𝑤∃𝑣∃𝑢((𝑤 = 𝐷 ∧ 𝑣 = 𝐸 ∧ 𝑢 = 𝐹) ∧ 𝜃))
19		ceqsex6v.4	. . 3 ⊢ 𝐷 ∈ V
20		ceqsex6v.5	. . 3 ⊢ 𝐸 ∈ V
21		ceqsex6v.6	. . 3 ⊢ 𝐹 ∈ V
22		ceqsex6v.10	. . 3 ⊢ (𝑤 = 𝐷 → (𝜃 ↔ 𝜏))
23		ceqsex6v.11	. . 3 ⊢ (𝑣 = 𝐸 → (𝜏 ↔ 𝜂))
24		ceqsex6v.12	. . 3 ⊢ (𝑢 = 𝐹 → (𝜂 ↔ 𝜁))
25	19, 20, 21, 22, 23, 24	ceqsex3v 3537	. 2 ⊢ (∃𝑤∃𝑣∃𝑢((𝑤 = 𝐷 ∧ 𝑣 = 𝐸 ∧ 𝑢 = 𝐹) ∧ 𝜃) ↔ 𝜁)
26	5, 18, 25	3bitri 297	1 ⊢ (∃𝑥∃𝑦∃𝑧∃𝑤∃𝑣∃𝑢((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) ∧ (𝑤 = 𝐷 ∧ 𝑣 = 𝐸 ∧ 𝑢 = 𝐹) ∧ 𝜑) ↔ 𝜁)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1540  ∃wex 1779   ∈ wcel 2108  Vcvv 3480

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110

This theorem depends on definitions:  df-bi 207  df-an 396  df-3an 1089  df-ex 1780  df-clel 2816

This theorem is referenced by: (None)