Theorem cgsex4g 3538

Description: An implicit substitution inference for 4 general classes. (Contributed by NM, 5-Aug-1995.) Avoid ax-10 2141, ax-11 2158. (Revised by GG, 28-Jun-2024.) Avoid ax-9 2118, ax-ext 2711. (Revised by Wolf Lammen, 21-Mar-2025.)

Hypotheses

Ref	Expression
cgsex4g.1	⊢ (((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∧ (𝑧 = 𝐶 ∧ 𝑤 = 𝐷)) → 𝜒)
cgsex4g.2	⊢ (𝜒 → (𝜑 ↔ 𝜓))

Assertion

Ref	Expression
cgsex4g	⊢ (((𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑅 ∧ 𝐷 ∈ 𝑆)) → (∃𝑥∃𝑦∃𝑧∃𝑤(𝜒 ∧ 𝜑) ↔ 𝜓))

Distinct variable groups:   𝑥,𝑦,𝑧,𝑤,𝐴   𝑥,𝐵,𝑦,𝑧,𝑤   𝑥,𝐶,𝑦,𝑧,𝑤   𝑥,𝐷,𝑦,𝑧,𝑤   𝜓,𝑥,𝑦,𝑧,𝑤

Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧,𝑤)   𝜒(𝑥,𝑦,𝑧,𝑤)   𝑅(𝑥,𝑦,𝑧,𝑤)   𝑆(𝑥,𝑦,𝑧,𝑤)

Proof of Theorem cgsex4g

Step	Hyp	Ref	Expression
1		cgsex4g.2	. . . . 5 ⊢ (𝜒 → (𝜑 ↔ 𝜓))
2	1	biimpa 476	. . . 4 ⊢ ((𝜒 ∧ 𝜑) → 𝜓)
3	2	exlimivv 1931	. . 3 ⊢ (∃𝑧∃𝑤(𝜒 ∧ 𝜑) → 𝜓)
4	3	exlimivv 1931	. 2 ⊢ (∃𝑥∃𝑦∃𝑧∃𝑤(𝜒 ∧ 𝜑) → 𝜓)
5		elisset 2826	. . . . . . 7 ⊢ (𝐴 ∈ 𝑅 → ∃𝑥 𝑥 = 𝐴)
6		elisset 2826	. . . . . . 7 ⊢ (𝐵 ∈ 𝑆 → ∃𝑦 𝑦 = 𝐵)
7	5, 6	anim12i 612	. . . . . 6 ⊢ ((𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑆) → (∃𝑥 𝑥 = 𝐴 ∧ ∃𝑦 𝑦 = 𝐵))
8		elisset 2826	. . . . . . 7 ⊢ (𝐶 ∈ 𝑅 → ∃𝑧 𝑧 = 𝐶)
9		elisset 2826	. . . . . . 7 ⊢ (𝐷 ∈ 𝑆 → ∃𝑤 𝑤 = 𝐷)
10	8, 9	anim12i 612	. . . . . 6 ⊢ ((𝐶 ∈ 𝑅 ∧ 𝐷 ∈ 𝑆) → (∃𝑧 𝑧 = 𝐶 ∧ ∃𝑤 𝑤 = 𝐷))
11	7, 10	anim12i 612	. . . . 5 ⊢ (((𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑅 ∧ 𝐷 ∈ 𝑆)) → ((∃𝑥 𝑥 = 𝐴 ∧ ∃𝑦 𝑦 = 𝐵) ∧ (∃𝑧 𝑧 = 𝐶 ∧ ∃𝑤 𝑤 = 𝐷)))
12		19.42vv 1957	. . . . . . 7 ⊢ (∃𝑧∃𝑤((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∧ (𝑧 = 𝐶 ∧ 𝑤 = 𝐷)) ↔ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∧ ∃𝑧∃𝑤(𝑧 = 𝐶 ∧ 𝑤 = 𝐷)))
13	12	2exbii 1847	. . . . . 6 ⊢ (∃𝑥∃𝑦∃𝑧∃𝑤((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∧ (𝑧 = 𝐶 ∧ 𝑤 = 𝐷)) ↔ ∃𝑥∃𝑦((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∧ ∃𝑧∃𝑤(𝑧 = 𝐶 ∧ 𝑤 = 𝐷)))
14		19.41vv 1950	. . . . . 6 ⊢ (∃𝑥∃𝑦((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∧ ∃𝑧∃𝑤(𝑧 = 𝐶 ∧ 𝑤 = 𝐷)) ↔ (∃𝑥∃𝑦(𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∧ ∃𝑧∃𝑤(𝑧 = 𝐶 ∧ 𝑤 = 𝐷)))
15		exdistrv 1955	. . . . . . 7 ⊢ (∃𝑥∃𝑦(𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ↔ (∃𝑥 𝑥 = 𝐴 ∧ ∃𝑦 𝑦 = 𝐵))
16		exdistrv 1955	. . . . . . 7 ⊢ (∃𝑧∃𝑤(𝑧 = 𝐶 ∧ 𝑤 = 𝐷) ↔ (∃𝑧 𝑧 = 𝐶 ∧ ∃𝑤 𝑤 = 𝐷))
17	15, 16	anbi12i 627	. . . . . 6 ⊢ ((∃𝑥∃𝑦(𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∧ ∃𝑧∃𝑤(𝑧 = 𝐶 ∧ 𝑤 = 𝐷)) ↔ ((∃𝑥 𝑥 = 𝐴 ∧ ∃𝑦 𝑦 = 𝐵) ∧ (∃𝑧 𝑧 = 𝐶 ∧ ∃𝑤 𝑤 = 𝐷)))
18	13, 14, 17	3bitri 297	. . . . 5 ⊢ (∃𝑥∃𝑦∃𝑧∃𝑤((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∧ (𝑧 = 𝐶 ∧ 𝑤 = 𝐷)) ↔ ((∃𝑥 𝑥 = 𝐴 ∧ ∃𝑦 𝑦 = 𝐵) ∧ (∃𝑧 𝑧 = 𝐶 ∧ ∃𝑤 𝑤 = 𝐷)))
19	11, 18	sylibr 234	. . . 4 ⊢ (((𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑅 ∧ 𝐷 ∈ 𝑆)) → ∃𝑥∃𝑦∃𝑧∃𝑤((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∧ (𝑧 = 𝐶 ∧ 𝑤 = 𝐷)))
20		cgsex4g.1	. . . . . 6 ⊢ (((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∧ (𝑧 = 𝐶 ∧ 𝑤 = 𝐷)) → 𝜒)
21	20	2eximi 1834	. . . . 5 ⊢ (∃𝑧∃𝑤((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∧ (𝑧 = 𝐶 ∧ 𝑤 = 𝐷)) → ∃𝑧∃𝑤𝜒)
22	21	2eximi 1834	. . . 4 ⊢ (∃𝑥∃𝑦∃𝑧∃𝑤((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∧ (𝑧 = 𝐶 ∧ 𝑤 = 𝐷)) → ∃𝑥∃𝑦∃𝑧∃𝑤𝜒)
23	19, 22	syl 17	. . 3 ⊢ (((𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑅 ∧ 𝐷 ∈ 𝑆)) → ∃𝑥∃𝑦∃𝑧∃𝑤𝜒)
24	1	biimprcd 250	. . . . . 6 ⊢ (𝜓 → (𝜒 → 𝜑))
25	24	ancld 550	. . . . 5 ⊢ (𝜓 → (𝜒 → (𝜒 ∧ 𝜑)))
26	25	2eximdv 1918	. . . 4 ⊢ (𝜓 → (∃𝑧∃𝑤𝜒 → ∃𝑧∃𝑤(𝜒 ∧ 𝜑)))
27	26	2eximdv 1918	. . 3 ⊢ (𝜓 → (∃𝑥∃𝑦∃𝑧∃𝑤𝜒 → ∃𝑥∃𝑦∃𝑧∃𝑤(𝜒 ∧ 𝜑)))
28	23, 27	syl5com 31	. 2 ⊢ (((𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑅 ∧ 𝐷 ∈ 𝑆)) → (𝜓 → ∃𝑥∃𝑦∃𝑧∃𝑤(𝜒 ∧ 𝜑)))
29	4, 28	impbid2 226	1 ⊢ (((𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑅 ∧ 𝐷 ∈ 𝑆)) → (∃𝑥∃𝑦∃𝑧∃𝑤(𝜒 ∧ 𝜑) ↔ 𝜓))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1537  ∃wex 1777   ∈ wcel 2108

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1540  df-ex 1778  df-sb 2065  df-clab 2718  df-clel 2819

This theorem is referenced by:  copsex4g  5514  brecop  8868