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 32295

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 13280	. . . . 5 ⊢ ((0..^2) ∩ {2}) = ∅
2	1	a1i 11	. . . 4 ⊢ (𝜑 → ((0..^2) ∩ {2}) = ∅)
3		2p1e3 11972	. . . . . . 7 ⊢ (2 + 1) = 3
4	3	oveq2i 7224	. . . . . 6 ⊢ (0..^(2 + 1)) = (0..^3)
5		2eluzge0 12489	. . . . . . 7 ⊢ 2 ∈ (ℤ_≥‘0)
6		fzosplitsn 13350	. . . . . . 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 2767	. . . . 5 ⊢ (0..^3) = ((0..^2) ∪ {2})
9	8	a1i 11	. . . 4 ⊢ (𝜑 → (0..^3) = ((0..^2) ∪ {2}))
10		fzofi 13547	. . . . 5 ⊢ (0..^3) ∈ Fin
11	10	a1i 11	. . . 4 ⊢ (𝜑 → (0..^3) ∈ Fin)
12		prodfzo03.a	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^3)) → 𝐷 ∈ ℂ)
13	2, 9, 11, 12	fprodsplit 15528	. . 3 ⊢ (𝜑 → ∏𝑘 ∈ (0..^3)𝐷 = (∏𝑘 ∈ (0..^2)𝐷 · ∏𝑘 ∈ {2}𝐷))
14		0ne1 11901	. . . . . 6 ⊢ 0 ≠ 1
15		disjsn2 4628	. . . . . 6 ⊢ (0 ≠ 1 → ({0} ∩ {1}) = ∅)
16	14, 15	mp1i 13	. . . . 5 ⊢ (𝜑 → ({0} ∩ {1}) = ∅)
17		fzo0to2pr 13327	. . . . . . 7 ⊢ (0..^2) = {0, 1}
18		df-pr 4544	. . . . . . 7 ⊢ {0, 1} = ({0} ∪ {1})
19	17, 18	eqtri 2765	. . . . . 6 ⊢ (0..^2) = ({0} ∪ {1})
20	19	a1i 11	. . . . 5 ⊢ (𝜑 → (0..^2) = ({0} ∪ {1}))
21		fzofi 13547	. . . . . 6 ⊢ (0..^2) ∈ Fin
22	21	a1i 11	. . . . 5 ⊢ (𝜑 → (0..^2) ∈ Fin)
23		2z 12209	. . . . . . . . 9 ⊢ 2 ∈ ℤ
24		3z 12210	. . . . . . . . 9 ⊢ 3 ∈ ℤ
25		2re 11904	. . . . . . . . . 10 ⊢ 2 ∈ ℝ
26		3re 11910	. . . . . . . . . 10 ⊢ 3 ∈ ℝ
27		2lt3 12002	. . . . . . . . . 10 ⊢ 2 < 3
28	25, 26, 27	ltleii 10955	. . . . . . . . 9 ⊢ 2 ≤ 3
29		eluz2 12444	. . . . . . . . 9 ⊢ (3 ∈ (ℤ_≥‘2) ↔ (2 ∈ ℤ ∧ 3 ∈ ℤ ∧ 2 ≤ 3))
30	23, 24, 28, 29	mpbir3an 1343	. . . . . . . 8 ⊢ 3 ∈ (ℤ_≥‘2)
31		fzoss2 13270	. . . . . . . 8 ⊢ (3 ∈ (ℤ_≥‘2) → (0..^2) ⊆ (0..^3))
32	30, 31	ax-mp 5	. . . . . . 7 ⊢ (0..^2) ⊆ (0..^3)
33	32	sseli 3896	. . . . . 6 ⊢ (𝑘 ∈ (0..^2) → 𝑘 ∈ (0..^3))
34	33, 12	sylan2 596	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^2)) → 𝐷 ∈ ℂ)
35	16, 20, 22, 34	fprodsplit 15528	. . . 4 ⊢ (𝜑 → ∏𝑘 ∈ (0..^2)𝐷 = (∏𝑘 ∈ {0}𝐷 · ∏𝑘 ∈ {1}𝐷))
36	35	oveq1d 7228	. . 3 ⊢ (𝜑 → (∏𝑘 ∈ (0..^2)𝐷 · ∏𝑘 ∈ {2}𝐷) = ((∏𝑘 ∈ {0}𝐷 · ∏𝑘 ∈ {1}𝐷) · ∏𝑘 ∈ {2}𝐷))
37	13, 36	eqtrd 2777	. 2 ⊢ (𝜑 → ∏𝑘 ∈ (0..^3)𝐷 = ((∏𝑘 ∈ {0}𝐷 · ∏𝑘 ∈ {1}𝐷) · ∏𝑘 ∈ {2}𝐷))
38		snfi 8721	. . . . 5 ⊢ {0} ∈ Fin
39	38	a1i 11	. . . 4 ⊢ (𝜑 → {0} ∈ Fin)
40		velsn 4557	. . . . 5 ⊢ (𝑘 ∈ {0} ↔ 𝑘 = 0)
41		prodfzo03.1	. . . . . . 7 ⊢ (𝑘 = 0 → 𝐷 = 𝐴)
42	41	adantl 485	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 = 0) → 𝐷 = 𝐴)
43		simpr 488	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ (0..^3)) ∧ 𝐷 = 𝐴) → 𝐷 = 𝐴)
44	12	adantr 484	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ (0..^3)) ∧ 𝐷 = 𝐴) → 𝐷 ∈ ℂ)
45	43, 44	eqeltrrd 2839	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ (0..^3)) ∧ 𝐷 = 𝐴) → 𝐴 ∈ ℂ)
46		c0ex 10827	. . . . . . . . . . . 12 ⊢ 0 ∈ V
47	46	tpid1 4684	. . . . . . . . . . 11 ⊢ 0 ∈ {0, 1, 2}
48		fzo0to3tp 13328	. . . . . . . . . . 11 ⊢ (0..^3) = {0, 1, 2}
49	47, 48	eleqtrri 2837	. . . . . . . . . 10 ⊢ 0 ∈ (0..^3)
50		eqid 2737	. . . . . . . . . 10 ⊢ 𝐴 = 𝐴
51	41	eqeq1d 2739	. . . . . . . . . . 11 ⊢ (𝑘 = 0 → (𝐷 = 𝐴 ↔ 𝐴 = 𝐴))
52	51	rspcev 3537	. . . . . . . . . 10 ⊢ ((0 ∈ (0..^3) ∧ 𝐴 = 𝐴) → ∃𝑘 ∈ (0..^3)𝐷 = 𝐴)
53	49, 50, 52	mp2an 692	. . . . . . . . 9 ⊢ ∃𝑘 ∈ (0..^3)𝐷 = 𝐴
54	53	a1i 11	. . . . . . . 8 ⊢ (𝜑 → ∃𝑘 ∈ (0..^3)𝐷 = 𝐴)
55	45, 54	r19.29a 3208	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ℂ)
56	55	adantr 484	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 = 0) → 𝐴 ∈ ℂ)
57	42, 56	eqeltrd 2838	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 = 0) → 𝐷 ∈ ℂ)
58	40, 57	sylan2b 597	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ {0}) → 𝐷 ∈ ℂ)
59	39, 58	fprodcl 15514	. . 3 ⊢ (𝜑 → ∏𝑘 ∈ {0}𝐷 ∈ ℂ)
60		snfi 8721	. . . . 5 ⊢ {1} ∈ Fin
61	60	a1i 11	. . . 4 ⊢ (𝜑 → {1} ∈ Fin)
62		velsn 4557	. . . . 5 ⊢ (𝑘 ∈ {1} ↔ 𝑘 = 1)
63		prodfzo03.2	. . . . . . 7 ⊢ (𝑘 = 1 → 𝐷 = 𝐵)
64	63	adantl 485	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 = 1) → 𝐷 = 𝐵)
65		simpr 488	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ (0..^3)) ∧ 𝐷 = 𝐵) → 𝐷 = 𝐵)
66	12	adantr 484	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ (0..^3)) ∧ 𝐷 = 𝐵) → 𝐷 ∈ ℂ)
67	65, 66	eqeltrrd 2839	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ (0..^3)) ∧ 𝐷 = 𝐵) → 𝐵 ∈ ℂ)
68		1ex 10829	. . . . . . . . . . . 12 ⊢ 1 ∈ V
69	68	tpid2 4686	. . . . . . . . . . 11 ⊢ 1 ∈ {0, 1, 2}
70	69, 48	eleqtrri 2837	. . . . . . . . . 10 ⊢ 1 ∈ (0..^3)
71		eqid 2737	. . . . . . . . . 10 ⊢ 𝐵 = 𝐵
72	63	eqeq1d 2739	. . . . . . . . . . 11 ⊢ (𝑘 = 1 → (𝐷 = 𝐵 ↔ 𝐵 = 𝐵))
73	72	rspcev 3537	. . . . . . . . . 10 ⊢ ((1 ∈ (0..^3) ∧ 𝐵 = 𝐵) → ∃𝑘 ∈ (0..^3)𝐷 = 𝐵)
74	70, 71, 73	mp2an 692	. . . . . . . . 9 ⊢ ∃𝑘 ∈ (0..^3)𝐷 = 𝐵
75	74	a1i 11	. . . . . . . 8 ⊢ (𝜑 → ∃𝑘 ∈ (0..^3)𝐷 = 𝐵)
76	67, 75	r19.29a 3208	. . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ ℂ)
77	76	adantr 484	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 = 1) → 𝐵 ∈ ℂ)
78	64, 77	eqeltrd 2838	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 = 1) → 𝐷 ∈ ℂ)
79	62, 78	sylan2b 597	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ {1}) → 𝐷 ∈ ℂ)
80	61, 79	fprodcl 15514	. . 3 ⊢ (𝜑 → ∏𝑘 ∈ {1}𝐷 ∈ ℂ)
81		snfi 8721	. . . . 5 ⊢ {2} ∈ Fin
82	81	a1i 11	. . . 4 ⊢ (𝜑 → {2} ∈ Fin)
83		velsn 4557	. . . . 5 ⊢ (𝑘 ∈ {2} ↔ 𝑘 = 2)
84		prodfzo03.3	. . . . . . 7 ⊢ (𝑘 = 2 → 𝐷 = 𝐶)
85	84	adantl 485	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 = 2) → 𝐷 = 𝐶)
86		simpr 488	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ (0..^3)) ∧ 𝐷 = 𝐶) → 𝐷 = 𝐶)
87	12	adantr 484	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ (0..^3)) ∧ 𝐷 = 𝐶) → 𝐷 ∈ ℂ)
88	86, 87	eqeltrrd 2839	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ (0..^3)) ∧ 𝐷 = 𝐶) → 𝐶 ∈ ℂ)
89		2ex 11907	. . . . . . . . . . . 12 ⊢ 2 ∈ V
90	89	tpid3 4689	. . . . . . . . . . 11 ⊢ 2 ∈ {0, 1, 2}
91	90, 48	eleqtrri 2837	. . . . . . . . . 10 ⊢ 2 ∈ (0..^3)
92		eqid 2737	. . . . . . . . . 10 ⊢ 𝐶 = 𝐶
93	84	eqeq1d 2739	. . . . . . . . . . 11 ⊢ (𝑘 = 2 → (𝐷 = 𝐶 ↔ 𝐶 = 𝐶))
94	93	rspcev 3537	. . . . . . . . . 10 ⊢ ((2 ∈ (0..^3) ∧ 𝐶 = 𝐶) → ∃𝑘 ∈ (0..^3)𝐷 = 𝐶)
95	91, 92, 94	mp2an 692	. . . . . . . . 9 ⊢ ∃𝑘 ∈ (0..^3)𝐷 = 𝐶
96	95	a1i 11	. . . . . . . 8 ⊢ (𝜑 → ∃𝑘 ∈ (0..^3)𝐷 = 𝐶)
97	88, 96	r19.29a 3208	. . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ ℂ)
98	97	adantr 484	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 = 2) → 𝐶 ∈ ℂ)
99	85, 98	eqeltrd 2838	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 = 2) → 𝐷 ∈ ℂ)
100	83, 99	sylan2b 597	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ {2}) → 𝐷 ∈ ℂ)
101	82, 100	fprodcl 15514	. . 3 ⊢ (𝜑 → ∏𝑘 ∈ {2}𝐷 ∈ ℂ)
102	59, 80, 101	mulassd 10856	. 2 ⊢ (𝜑 → ((∏𝑘 ∈ {0}𝐷 · ∏𝑘 ∈ {1}𝐷) · ∏𝑘 ∈ {2}𝐷) = (∏𝑘 ∈ {0}𝐷 · (∏𝑘 ∈ {1}𝐷 · ∏𝑘 ∈ {2}𝐷)))
103		0nn0 12105	. . . . 5 ⊢ 0 ∈ ℕ₀
104	103	a1i 11	. . . 4 ⊢ (𝜑 → 0 ∈ ℕ₀)
105	41	prodsn 15524	. . . 4 ⊢ ((0 ∈ ℕ₀ ∧ 𝐴 ∈ ℂ) → ∏𝑘 ∈ {0}𝐷 = 𝐴)
106	104, 55, 105	syl2anc 587	. . 3 ⊢ (𝜑 → ∏𝑘 ∈ {0}𝐷 = 𝐴)
107		1nn0 12106	. . . . . 6 ⊢ 1 ∈ ℕ₀
108	107	a1i 11	. . . . 5 ⊢ (𝜑 → 1 ∈ ℕ₀)
109	63	prodsn 15524	. . . . 5 ⊢ ((1 ∈ ℕ₀ ∧ 𝐵 ∈ ℂ) → ∏𝑘 ∈ {1}𝐷 = 𝐵)
110	108, 76, 109	syl2anc 587	. . . 4 ⊢ (𝜑 → ∏𝑘 ∈ {1}𝐷 = 𝐵)
111		2nn0 12107	. . . . . 6 ⊢ 2 ∈ ℕ₀
112	111	a1i 11	. . . . 5 ⊢ (𝜑 → 2 ∈ ℕ₀)
113	84	prodsn 15524	. . . . 5 ⊢ ((2 ∈ ℕ₀ ∧ 𝐶 ∈ ℂ) → ∏𝑘 ∈ {2}𝐷 = 𝐶)
114	112, 97, 113	syl2anc 587	. . . 4 ⊢ (𝜑 → ∏𝑘 ∈ {2}𝐷 = 𝐶)
115	110, 114	oveq12d 7231	. . 3 ⊢ (𝜑 → (∏𝑘 ∈ {1}𝐷 · ∏𝑘 ∈ {2}𝐷) = (𝐵 · 𝐶))
116	106, 115	oveq12d 7231	. 2 ⊢ (𝜑 → (∏𝑘 ∈ {0}𝐷 · (∏𝑘 ∈ {1}𝐷 · ∏𝑘 ∈ {2}𝐷)) = (𝐴 · (𝐵 · 𝐶)))
117	37, 102, 116	3eqtrd 2781	1 ⊢ (𝜑 → ∏𝑘 ∈ (0..^3)𝐷 = (𝐴 · (𝐵 · 𝐶)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 399 = wceq 1543 ∈ wcel 2110 ≠ wne 2940 ∃wrex 3062 ∪ cun 3864 ∩ cin 3865 ⊆ wss 3866 ∅c0 4237 {csn 4541 {cpr 4543 {ctp 4545 class class class wbr 5053 ‘cfv 6380 (class class class)co 7213 Fincfn 8626 ℂcc 10727 0cc0 10729 1c1 10730 + caddc 10732 · cmul 10734 ≤ cle 10868 2c2 11885 3c3 11886 ℕ₀cn0 12090 ℤcz 12176 ℤ_≥cuz 12438 ..^cfzo 13238 ∏cprod 15467

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2708 ax-rep 5179 ax-sep 5192 ax-nul 5199 ax-pow 5258 ax-pr 5322 ax-un 7523 ax-inf2 9256 ax-cnex 10785 ax-resscn 10786 ax-1cn 10787 ax-icn 10788 ax-addcl 10789 ax-addrcl 10790 ax-mulcl 10791 ax-mulrcl 10792 ax-mulcom 10793 ax-addass 10794 ax-mulass 10795 ax-distr 10796 ax-i2m1 10797 ax-1ne0 10798 ax-1rid 10799 ax-rnegex 10800 ax-rrecex 10801 ax-cnre 10802 ax-pre-lttri 10803 ax-pre-lttrn 10804 ax-pre-ltadd 10805 ax-pre-mulgt0 10806 ax-pre-sup 10807

This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3or 1090 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2071 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2886 df-ne 2941 df-nel 3047 df-ral 3066 df-rex 3067 df-reu 3068 df-rmo 3069 df-rab 3070 df-v 3410 df-sbc 3695 df-csb 3812 df-dif 3869 df-un 3871 df-in 3873 df-ss 3883 df-pss 3885 df-nul 4238 df-if 4440 df-pw 4515 df-sn 4542 df-pr 4544 df-tp 4546 df-op 4548 df-uni 4820 df-int 4860 df-iun 4906 df-br 5054 df-opab 5116 df-mpt 5136 df-tr 5162 df-id 5455 df-eprel 5460 df-po 5468 df-so 5469 df-fr 5509 df-se 5510 df-we 5511 df-xp 5557 df-rel 5558 df-cnv 5559 df-co 5560 df-dm 5561 df-rn 5562 df-res 5563 df-ima 5564 df-pred 6160 df-ord 6216 df-on 6217 df-lim 6218 df-suc 6219 df-iota 6338 df-fun 6382 df-fn 6383 df-f 6384 df-f1 6385 df-fo 6386 df-f1o 6387 df-fv 6388 df-isom 6389 df-riota 7170 df-ov 7216 df-oprab 7217 df-mpo 7218 df-om 7645 df-1st 7761 df-2nd 7762 df-wrecs 8047 df-recs 8108 df-rdg 8146 df-1o 8202 df-er 8391 df-en 8627 df-dom 8628 df-sdom 8629 df-fin 8630 df-sup 9058 df-oi 9126 df-card 9555 df-pnf 10869 df-mnf 10870 df-xr 10871 df-ltxr 10872 df-le 10873 df-sub 11064 df-neg 11065 df-div 11490 df-nn 11831 df-2 11893 df-3 11894 df-n0 12091 df-z 12177 df-uz 12439 df-rp 12587 df-fz 13096 df-fzo 13239 df-seq 13575 df-exp 13636 df-hash 13897 df-cj 14662 df-re 14663 df-im 14664 df-sqrt 14798 df-abs 14799 df-clim 15049 df-prod 15468

This theorem is referenced by: circlevma 32334 circlemethhgt 32335

W3C validator