prodfzo03 - Mathbox for Thierry Arnoux

	Mathbox for Thierry Arnoux		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > prodfzo03		Structured version Visualization version GIF version

Theorem prodfzo03 35315

Description: A product of three factors, indexed starting with zero. (Contributed by Thierry Arnoux, 14-Dec-2021.)

**Hypotheses**
Ref	Expression
prodfzo03.1	⊢ (𝑘 = 0 → 𝐷 = 𝐴)
prodfzo03.2	⊢ (𝑘 = 1 → 𝐷 = 𝐵)
prodfzo03.3	⊢ (𝑘 = 2 → 𝐷 = 𝐶)
prodfzo03.a	⊢ ((𝜑 ∧ 𝑘 ∈ (0..^3)) → 𝐷 ∈ ℂ)

**Assertion**
Ref	Expression
prodfzo03	⊢ (𝜑 → ∏𝑘 ∈ (0..^3)𝐷 = (𝐴 · (𝐵 · 𝐶)))

Distinct variable groups: 𝐴,𝑘 𝐵,𝑘 𝐶,𝑘 𝜑,𝑘 Allowed substitution hint: 𝐷(𝑘)

**Proof of Theorem prodfzo03**
Step	Hyp	Ref	Expression
1		fzodisjsn 13862	. . . . 5 ⊢ ((0..^2) ∩ {2}) = ∅
2	1	a1i 11	. . . 4 ⊢ (𝜑 → ((0..^2) ∩ {2}) = ∅)
3		2p1e3 12514	. . . . . . 7 ⊢ (2 + 1) = 3
4	3	oveq2i 7457	. . . . . 6 ⊢ (0..^(2 + 1)) = (0..^3)
5		2eluzge0 13038	. . . . . . 7 ⊢ 2 ∈ (ℤ_≥‘0)
6		fzosplitsn 13941	. . . . . . 7 ⊢ (2 ∈ (ℤ_≥‘0) → (0..^(2 + 1)) = ((0..^2) ∪ {2}))
7	5, 6	ax-mp 5	. . . . . 6 ⊢ (0..^(2 + 1)) = ((0..^2) ∪ {2})
8	4, 7	eqtr3i 2788	. . . . 5 ⊢ (0..^3) = ((0..^2) ∪ {2})
9	8	a1i 11	. . . 4 ⊢ (𝜑 → (0..^3) = ((0..^2) ∪ {2}))
10		fzofi 14147	. . . . 5 ⊢ (0..^3) ∈ Fin
11	10	a1i 11	. . . 4 ⊢ (𝜑 → (0..^3) ∈ Fin)
12		prodfzo03.a	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^3)) → 𝐷 ∈ ℂ)
13	2, 9, 11, 12	fprodsplit 16165	. . 3 ⊢ (𝜑 → ∏𝑘 ∈ (0..^3)𝐷 = (∏𝑘 ∈ (0..^2)𝐷 · ∏𝑘 ∈ {2}𝐷))
14		0ne1 12444	. . . . . 6 ⊢ 0 ≠ 1
15		disjsn2 4673	. . . . . 6 ⊢ (0 ≠ 1 → ({0} ∩ {1}) = ∅)
16	14, 15	mp1i 14	. . . . 5 ⊢ (𝜑 → ({0} ∩ {1}) = ∅)
17		fzo0to2pr 13915	. . . . . . 7 ⊢ (0..^2) = {0, 1}
18		df-pr 4591	. . . . . . 7 ⊢ {0, 1} = ({0} ∪ {1})
19	17, 18	eqtri 2786	. . . . . 6 ⊢ (0..^2) = ({0} ∪ {1})
20	19	a1i 11	. . . . 5 ⊢ (𝜑 → (0..^2) = ({0} ∪ {1}))
21		fzofi 14147	. . . . . 6 ⊢ (0..^2) ∈ Fin
22	21	a1i 11	. . . . 5 ⊢ (𝜑 → (0..^2) ∈ Fin)
23		2z 12758	. . . . . . . . 9 ⊢ 2 ∈ ℤ
24		3z 12759	. . . . . . . . 9 ⊢ 3 ∈ ℤ
25		2re 12447	. . . . . . . . . 10 ⊢ 2 ∈ ℝ
26		3re 12453	. . . . . . . . . 10 ⊢ 3 ∈ ℝ
27		2lt3 12546	. . . . . . . . . 10 ⊢ 2 < 3
28	25, 26, 27	ltleii 11463	. . . . . . . . 9 ⊢ 2 ≤ 3
29		eluz2 13001	. . . . . . . . 9 ⊢ (3 ∈ (ℤ_≥‘2) ↔ (2 ∈ ℤ ∧ 3 ∈ ℤ ∧ 2 ≤ 3))
30	23, 24, 28, 29	mpbir3an 1360	. . . . . . . 8 ⊢ 3 ∈ (ℤ_≥‘2)
31		fzoss2 13852	. . . . . . . 8 ⊢ (3 ∈ (ℤ_≥‘2) → (0..^2) ⊆ (0..^3))
32	30, 31	ax-mp 5	. . . . . . 7 ⊢ (0..^2) ⊆ (0..^3)
33	32	sseli 3909	. . . . . 6 ⊢ (𝑘 ∈ (0..^2) → 𝑘 ∈ (0..^3))
34	33, 12	sylan2 605	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^2)) → 𝐷 ∈ ℂ)
35	16, 20, 22, 34	fprodsplit 16165	. . . 4 ⊢ (𝜑 → ∏𝑘 ∈ (0..^2)𝐷 = (∏𝑘 ∈ {0}𝐷 · ∏𝑘 ∈ {1}𝐷))
36	35	oveq1d 7461	. . 3 ⊢ (𝜑 → (∏𝑘 ∈ (0..^2)𝐷 · ∏𝑘 ∈ {2}𝐷) = ((∏𝑘 ∈ {0}𝐷 · ∏𝑘 ∈ {1}𝐷) · ∏𝑘 ∈ {2}𝐷))
37	13, 36	eqtrd 2798	. 2 ⊢ (𝜑 → ∏𝑘 ∈ (0..^3)𝐷 = ((∏𝑘 ∈ {0}𝐷 · ∏𝑘 ∈ {1}𝐷) · ∏𝑘 ∈ {2}𝐷))
38		snfi 9102	. . . . 5 ⊢ {0} ∈ Fin
39	38	a1i 11	. . . 4 ⊢ (𝜑 → {0} ∈ Fin)
40		velsn 4600	. . . . 5 ⊢ (𝑘 ∈ {0} ↔ 𝑘 = 0)
41		prodfzo03.1	. . . . . . 7 ⊢ (𝑘 = 0 → 𝐷 = 𝐴)
42	41	adantl 487	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 = 0) → 𝐷 = 𝐴)
43		simpr 490	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ (0..^3)) ∧ 𝐷 = 𝐴) → 𝐷 = 𝐴)
44	12	adantr 486	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ (0..^3)) ∧ 𝐷 = 𝐴) → 𝐷 ∈ ℂ)
45	43, 44	eqeltrrd 2865	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ (0..^3)) ∧ 𝐷 = 𝐴) → 𝐴 ∈ ℂ)
46		c0ex 11330	. . . . . . . . . . . 12 ⊢ 0 ∈ V
47	46	tpid1 4729	. . . . . . . . . . 11 ⊢ 0 ∈ {0, 1, 2}
48		fzo0to3tp 13917	. . . . . . . . . . 11 ⊢ (0..^3) = {0, 1, 2}
49	47, 48	eleqtrri 2863	. . . . . . . . . 10 ⊢ 0 ∈ (0..^3)
50		eqid 2763	. . . . . . . . . 10 ⊢ 𝐴 = 𝐴
51	41	eqeq1d 2765	. . . . . . . . . . 11 ⊢ (𝑘 = 0 → (𝐷 = 𝐴 ↔ 𝐴 = 𝐴))
52	51	rspcev 3580	. . . . . . . . . 10 ⊢ ((0 ∈ (0..^3) ∧ 𝐴 = 𝐴) → ∃𝑘 ∈ (0..^3)𝐷 = 𝐴)
53	49, 50, 52	mp2an 705	. . . . . . . . 9 ⊢ ∃𝑘 ∈ (0..^3)𝐷 = 𝐴
54	53	a1i 11	. . . . . . . 8 ⊢ (𝜑 → ∃𝑘 ∈ (0..^3)𝐷 = 𝐴)
55	45, 54	r19.29a 3174	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ℂ)
56	55	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 = 0) → 𝐴 ∈ ℂ)
57	42, 56	eqeltrd 2864	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 = 0) → 𝐷 ∈ ℂ)
58	40, 57	sylan2b 606	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ {0}) → 𝐷 ∈ ℂ)
59	39, 58	fprodcl 16151	. . 3 ⊢ (𝜑 → ∏𝑘 ∈ {0}𝐷 ∈ ℂ)
60		snfi 9102	. . . . 5 ⊢ {1} ∈ Fin
61	60	a1i 11	. . . 4 ⊢ (𝜑 → {1} ∈ Fin)
62		velsn 4600	. . . . 5 ⊢ (𝑘 ∈ {1} ↔ 𝑘 = 1)
63		prodfzo03.2	. . . . . . 7 ⊢ (𝑘 = 1 → 𝐷 = 𝐵)
64	63	adantl 487	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 = 1) → 𝐷 = 𝐵)
65		simpr 490	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ (0..^3)) ∧ 𝐷 = 𝐵) → 𝐷 = 𝐵)
66	12	adantr 486	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ (0..^3)) ∧ 𝐷 = 𝐵) → 𝐷 ∈ ℂ)
67	65, 66	eqeltrrd 2865	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ (0..^3)) ∧ 𝐷 = 𝐵) → 𝐵 ∈ ℂ)
68		1eltp012 12443	. . . . . . . . . . 11 ⊢ 1 ∈ {0, 1, 2}
69	68, 48	eleqtrri 2863	. . . . . . . . . 10 ⊢ 1 ∈ (0..^3)
70		eqid 2763	. . . . . . . . . 10 ⊢ 𝐵 = 𝐵
71	63	eqeq1d 2765	. . . . . . . . . . 11 ⊢ (𝑘 = 1 → (𝐷 = 𝐵 ↔ 𝐵 = 𝐵))
72	71	rspcev 3580	. . . . . . . . . 10 ⊢ ((1 ∈ (0..^3) ∧ 𝐵 = 𝐵) → ∃𝑘 ∈ (0..^3)𝐷 = 𝐵)
73	69, 70, 72	mp2an 705	. . . . . . . . 9 ⊢ ∃𝑘 ∈ (0..^3)𝐷 = 𝐵
74	73	a1i 11	. . . . . . . 8 ⊢ (𝜑 → ∃𝑘 ∈ (0..^3)𝐷 = 𝐵)
75	67, 74	r19.29a 3174	. . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ ℂ)
76	75	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 = 1) → 𝐵 ∈ ℂ)
77	64, 76	eqeltrd 2864	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 = 1) → 𝐷 ∈ ℂ)
78	62, 77	sylan2b 606	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ {1}) → 𝐷 ∈ ℂ)
79	61, 78	fprodcl 16151	. . 3 ⊢ (𝜑 → ∏𝑘 ∈ {1}𝐷 ∈ ℂ)
80		snfi 9102	. . . . 5 ⊢ {2} ∈ Fin
81	80	a1i 11	. . . 4 ⊢ (𝜑 → {2} ∈ Fin)
82		velsn 4600	. . . . 5 ⊢ (𝑘 ∈ {2} ↔ 𝑘 = 2)
83		prodfzo03.3	. . . . . . 7 ⊢ (𝑘 = 2 → 𝐷 = 𝐶)
84	83	adantl 487	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 = 2) → 𝐷 = 𝐶)
85		simpr 490	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ (0..^3)) ∧ 𝐷 = 𝐶) → 𝐷 = 𝐶)
86	12	adantr 486	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ (0..^3)) ∧ 𝐷 = 𝐶) → 𝐷 ∈ ℂ)
87	85, 86	eqeltrrd 2865	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ (0..^3)) ∧ 𝐷 = 𝐶) → 𝐶 ∈ ℂ)
88		2ex 12450	. . . . . . . . . . . 12 ⊢ 2 ∈ V
89	88	tpid3 4734	. . . . . . . . . . 11 ⊢ 2 ∈ {0, 1, 2}
90	89, 48	eleqtrri 2863	. . . . . . . . . 10 ⊢ 2 ∈ (0..^3)
91		eqid 2763	. . . . . . . . . 10 ⊢ 𝐶 = 𝐶
92	83	eqeq1d 2765	. . . . . . . . . . 11 ⊢ (𝑘 = 2 → (𝐷 = 𝐶 ↔ 𝐶 = 𝐶))
93	92	rspcev 3580	. . . . . . . . . 10 ⊢ ((2 ∈ (0..^3) ∧ 𝐶 = 𝐶) → ∃𝑘 ∈ (0..^3)𝐷 = 𝐶)
94	90, 91, 93	mp2an 705	. . . . . . . . 9 ⊢ ∃𝑘 ∈ (0..^3)𝐷 = 𝐶
95	94	a1i 11	. . . . . . . 8 ⊢ (𝜑 → ∃𝑘 ∈ (0..^3)𝐷 = 𝐶)
96	87, 95	r19.29a 3174	. . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ ℂ)
97	96	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 = 2) → 𝐶 ∈ ℂ)
98	84, 97	eqeltrd 2864	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 = 2) → 𝐷 ∈ ℂ)
99	82, 98	sylan2b 606	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ {2}) → 𝐷 ∈ ℂ)
100	81, 99	fprodcl 16151	. . 3 ⊢ (𝜑 → ∏𝑘 ∈ {2}𝐷 ∈ ℂ)
101	59, 79, 100	mulassd 11362	. 2 ⊢ (𝜑 → ((∏𝑘 ∈ {0}𝐷 · ∏𝑘 ∈ {1}𝐷) · ∏𝑘 ∈ {2}𝐷) = (∏𝑘 ∈ {0}𝐷 · (∏𝑘 ∈ {1}𝐷 · ∏𝑘 ∈ {2}𝐷)))
102		0nn0 12651	. . . . 5 ⊢ 0 ∈ ℕ₀
103	102	a1i 11	. . . 4 ⊢ (𝜑 → 0 ∈ ℕ₀)
104	41	prodsn 16161	. . . 4 ⊢ ((0 ∈ ℕ₀ ∧ 𝐴 ∈ ℂ) → ∏𝑘 ∈ {0}𝐷 = 𝐴)
105	103, 55, 104	syl2anc 596	. . 3 ⊢ (𝜑 → ∏𝑘 ∈ {0}𝐷 = 𝐴)
106		1nn0 12652	. . . . . 6 ⊢ 1 ∈ ℕ₀
107	106	a1i 11	. . . . 5 ⊢ (𝜑 → 1 ∈ ℕ₀)
108	63	prodsn 16161	. . . . 5 ⊢ ((1 ∈ ℕ₀ ∧ 𝐵 ∈ ℂ) → ∏𝑘 ∈ {1}𝐷 = 𝐵)
109	107, 75, 108	syl2anc 596	. . . 4 ⊢ (𝜑 → ∏𝑘 ∈ {1}𝐷 = 𝐵)
110		2nn0 12653	. . . . . 6 ⊢ 2 ∈ ℕ₀
111	110	a1i 11	. . . . 5 ⊢ (𝜑 → 2 ∈ ℕ₀)
112	83	prodsn 16161	. . . . 5 ⊢ ((2 ∈ ℕ₀ ∧ 𝐶 ∈ ℂ) → ∏𝑘 ∈ {2}𝐷 = 𝐶)
113	111, 96, 112	syl2anc 596	. . . 4 ⊢ (𝜑 → ∏𝑘 ∈ {2}𝐷 = 𝐶)
114	109, 113	oveq12d 7464	. . 3 ⊢ (𝜑 → (∏𝑘 ∈ {1}𝐷 · ∏𝑘 ∈ {2}𝐷) = (𝐵 · 𝐶))
115	105, 114	oveq12d 7464	. 2 ⊢ (𝜑 → (∏𝑘 ∈ {0}𝐷 · (∏𝑘 ∈ {1}𝐷 · ∏𝑘 ∈ {2}𝐷)) = (𝐴 · (𝐵 · 𝐶)))
116	37, 101, 115	3eqtrd 2802	1 ⊢ (𝜑 → ∏𝑘 ∈ (0..^3)𝐷 = (𝐴 · (𝐵 · 𝐶)))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 ∃wrex 3090 ⊆ wss 3900 ∩ cin 4092 ∪ cun 4152 ∅c0 4281 {csn 4588 {cpr 4590 {ctp 4592 class class class wbr 5106 ‘cfv 6561 (class class class)co 7446 Fincfn 9004 ℂcc 11228 0cc0 11230 1c1 11231 + caddc 11233 · cmul 11235 ≤ cle 11374 2c2 12427 3c3 12428 ℕ₀cn0 12636 ℤcz 12723 ℤ_≥cuz 12995 ..^cfzo 13818 ∏cprod 16104

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5236 ax-sep 5253 ax-nul 5264 ax-pow 5332 ax-pr 5396 ax-un 7778 ax-inf2 9672 ax-cnex 11286 ax-resscn 11287 ax-1cn 11288 ax-icn 11289 ax-addcl 11290 ax-addrcl 11291 ax-mulcl 11292 ax-mulrcl 11293 ax-mulcom 11294 ax-addass 11295 ax-mulass 11296 ax-distr 11297 ax-i2m1 11298 ax-1ne0 11299 ax-1rid 11300 ax-rnegex 11301 ax-rrecex 11302 ax-cnre 11303 ax-pre-lttri 11304 ax-pre-lttrn 11305 ax-pre-ltadd 11306 ax-pre-mulgt0 11307 ax-pre-sup 11308

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4839 df-uni 4871 df-int 4911 df-iun 4956 df-br 5107 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5551 df-eprel 5556 df-po 5564 df-so 5565 df-fr 5609 df-se 5610 df-we 5611 df-xp 5662 df-rel 5663 df-cnv 5664 df-co 5665 df-dm 5666 df-rn 5667 df-res 5668 df-ima 5669 df-pred 6325 df-ord 6386 df-on 6387 df-lim 6388 df-suc 6389 df-iota 6515 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-isom 6570 df-riota 7403 df-ov 7449 df-oprab 7450 df-mpo 7451 df-om 7905 df-1st 8028 df-2nd 8029 df-frecs 8330 df-wrecs 8361 df-recs 8410 df-rdg 8449 df-1o 8507 df-er 8748 df-en 9005 df-dom 9006 df-sdom 9007 df-fin 9008 df-sup 9464 df-oi 9534 df-card 10050 df-pnf 11375 df-mnf 11376 df-xr 11377 df-ltxr 11378 df-le 11379 df-sub 11573 df-neg 11574 df-div 12004 df-nn 12366 df-2 12435 df-3 12436 df-n0 12637 df-z 12724 df-uz 12996 df-rp 13151 df-fz 13670 df-fzo 13819 df-seq 14175 df-exp 14235 df-hash 14505 df-cj 15298 df-re 15299 df-im 15300 df-sqrt 15434 df-abs 15435 df-clim 15687 df-prod 16105

This theorem is used by: circlevma 35354 circlemethhgt 35355

W3C validator