fprodm1 - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > fprodm1		GIF version

Theorem fprodm1 12222

Description: Separate out the last term in a finite product. (Contributed by Scott Fenton, 16-Dec-2017.)

**Hypotheses**
Ref	Expression
fprodm1.1	⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘𝑀))
fprodm1.2	⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → 𝐴 ∈ ℂ)
fprodm1.3	⊢ (𝑘 = 𝑁 → 𝐴 = 𝐵)

**Assertion**
Ref	Expression
fprodm1	⊢ (𝜑 → ∏𝑘 ∈ (𝑀...𝑁)𝐴 = (∏𝑘 ∈ (𝑀...(𝑁 − 1))𝐴 · 𝐵))

Distinct variable groups: 𝐵,𝑘 𝜑,𝑘 𝑘,𝑀 𝑘,𝑁 Allowed substitution hint: 𝐴(𝑘)

Proof of Theorem fprodm1 Dummy variable 𝑗 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fzp1nel 10384	. . . . 5 ⊢ ¬ ((𝑁 − 1) + 1) ∈ (𝑀...(𝑁 − 1))
2		fprodm1.1	. . . . . . . . 9 ⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘𝑀))
3		eluzelz 9809	. . . . . . . . 9 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑁 ∈ ℤ)
4	2, 3	syl 14	. . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ ℤ)
5	4	zcnd 9647	. . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ ℂ)
6		1cnd 8238	. . . . . . 7 ⊢ (𝜑 → 1 ∈ ℂ)
7	5, 6	npcand 8536	. . . . . 6 ⊢ (𝜑 → ((𝑁 − 1) + 1) = 𝑁)
8	7	eleq1d 2300	. . . . 5 ⊢ (𝜑 → (((𝑁 − 1) + 1) ∈ (𝑀...(𝑁 − 1)) ↔ 𝑁 ∈ (𝑀...(𝑁 − 1))))
9	1, 8	mtbii 681	. . . 4 ⊢ (𝜑 → ¬ 𝑁 ∈ (𝑀...(𝑁 − 1)))
10		disjsn 3735	. . . 4 ⊢ (((𝑀...(𝑁 − 1)) ∩ {𝑁}) = ∅ ↔ ¬ 𝑁 ∈ (𝑀...(𝑁 − 1)))
11	9, 10	sylibr 134	. . 3 ⊢ (𝜑 → ((𝑀...(𝑁 − 1)) ∩ {𝑁}) = ∅)
12		eluzel2 9804	. . . . . 6 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑀 ∈ ℤ)
13	2, 12	syl 14	. . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℤ)
14		peano2zm 9561	. . . . . . 7 ⊢ (𝑀 ∈ ℤ → (𝑀 − 1) ∈ ℤ)
15	13, 14	syl 14	. . . . . 6 ⊢ (𝜑 → (𝑀 − 1) ∈ ℤ)
16	13	zcnd 9647	. . . . . . . . 9 ⊢ (𝜑 → 𝑀 ∈ ℂ)
17	16, 6	npcand 8536	. . . . . . . 8 ⊢ (𝜑 → ((𝑀 − 1) + 1) = 𝑀)
18	17	fveq2d 5652	. . . . . . 7 ⊢ (𝜑 → (ℤ_≥‘((𝑀 − 1) + 1)) = (ℤ_≥‘𝑀))
19	2, 18	eleqtrrd 2311	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘((𝑀 − 1) + 1)))
20		eluzp1m1 9824	. . . . . 6 ⊢ (((𝑀 − 1) ∈ ℤ ∧ 𝑁 ∈ (ℤ_≥‘((𝑀 − 1) + 1))) → (𝑁 − 1) ∈ (ℤ_≥‘(𝑀 − 1)))
21	15, 19, 20	syl2anc 411	. . . . 5 ⊢ (𝜑 → (𝑁 − 1) ∈ (ℤ_≥‘(𝑀 − 1)))
22		fzsuc2 10359	. . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ (𝑁 − 1) ∈ (ℤ_≥‘(𝑀 − 1))) → (𝑀...((𝑁 − 1) + 1)) = ((𝑀...(𝑁 − 1)) ∪ {((𝑁 − 1) + 1)}))
23	13, 21, 22	syl2anc 411	. . . 4 ⊢ (𝜑 → (𝑀...((𝑁 − 1) + 1)) = ((𝑀...(𝑁 − 1)) ∪ {((𝑁 − 1) + 1)}))
24	7	oveq2d 6044	. . . 4 ⊢ (𝜑 → (𝑀...((𝑁 − 1) + 1)) = (𝑀...𝑁))
25	7	sneqd 3686	. . . . 5 ⊢ (𝜑 → {((𝑁 − 1) + 1)} = {𝑁})
26	25	uneq2d 3363	. . . 4 ⊢ (𝜑 → ((𝑀...(𝑁 − 1)) ∪ {((𝑁 − 1) + 1)}) = ((𝑀...(𝑁 − 1)) ∪ {𝑁}))
27	23, 24, 26	3eqtr3d 2272	. . 3 ⊢ (𝜑 → (𝑀...𝑁) = ((𝑀...(𝑁 − 1)) ∪ {𝑁}))
28	13, 4	fzfigd 10739	. . 3 ⊢ (𝜑 → (𝑀...𝑁) ∈ Fin)
29		elfzelz 10305	. . . . . 6 ⊢ (𝑗 ∈ (𝑀...𝑁) → 𝑗 ∈ ℤ)
30	29	adantl 277	. . . . 5 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝑀...𝑁)) → 𝑗 ∈ ℤ)
31	13	adantr 276	. . . . 5 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝑀...𝑁)) → 𝑀 ∈ ℤ)
32	4	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝑀...𝑁)) → 𝑁 ∈ ℤ)
33		peano2zm 9561	. . . . . 6 ⊢ (𝑁 ∈ ℤ → (𝑁 − 1) ∈ ℤ)
34	32, 33	syl 14	. . . . 5 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝑀...𝑁)) → (𝑁 − 1) ∈ ℤ)
35		fzdcel 10320	. . . . 5 ⊢ ((𝑗 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ (𝑁 − 1) ∈ ℤ) → DECID 𝑗 ∈ (𝑀...(𝑁 − 1)))
36	30, 31, 34, 35	syl3anc 1274	. . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝑀...𝑁)) → DECID 𝑗 ∈ (𝑀...(𝑁 − 1)))
37	36	ralrimiva 2606	. . 3 ⊢ (𝜑 → ∀𝑗 ∈ (𝑀...𝑁)DECID 𝑗 ∈ (𝑀...(𝑁 − 1)))
38		fprodm1.2	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → 𝐴 ∈ ℂ)
39	11, 27, 28, 37, 38	fprodsplitdc 12220	. 2 ⊢ (𝜑 → ∏𝑘 ∈ (𝑀...𝑁)𝐴 = (∏𝑘 ∈ (𝑀...(𝑁 − 1))𝐴 · ∏𝑘 ∈ {𝑁}𝐴))
40		fprodm1.3	. . . . . 6 ⊢ (𝑘 = 𝑁 → 𝐴 = 𝐵)
41	40	eleq1d 2300	. . . . 5 ⊢ (𝑘 = 𝑁 → (𝐴 ∈ ℂ ↔ 𝐵 ∈ ℂ))
42	38	ralrimiva 2606	. . . . 5 ⊢ (𝜑 → ∀𝑘 ∈ (𝑀...𝑁)𝐴 ∈ ℂ)
43		eluzfz2 10312	. . . . . 6 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑁 ∈ (𝑀...𝑁))
44	2, 43	syl 14	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ (𝑀...𝑁))
45	41, 42, 44	rspcdva 2916	. . . 4 ⊢ (𝜑 → 𝐵 ∈ ℂ)
46	40	prodsn 12217	. . . 4 ⊢ ((𝑁 ∈ (ℤ_≥‘𝑀) ∧ 𝐵 ∈ ℂ) → ∏𝑘 ∈ {𝑁}𝐴 = 𝐵)
47	2, 45, 46	syl2anc 411	. . 3 ⊢ (𝜑 → ∏𝑘 ∈ {𝑁}𝐴 = 𝐵)
48	47	oveq2d 6044	. 2 ⊢ (𝜑 → (∏𝑘 ∈ (𝑀...(𝑁 − 1))𝐴 · ∏𝑘 ∈ {𝑁}𝐴) = (∏𝑘 ∈ (𝑀...(𝑁 − 1))𝐴 · 𝐵))
49	39, 48	eqtrd 2264	1 ⊢ (𝜑 → ∏𝑘 ∈ (𝑀...𝑁)𝐴 = (∏𝑘 ∈ (𝑀...(𝑁 − 1))𝐴 · 𝐵))

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 DECID wdc 842 = wceq 1398 ∈ wcel 2202 ∪ cun 3199 ∩ cin 3200 ∅c0 3496 {csn 3673 ‘cfv 5333 (class class class)co 6028 ℂcc 8073 1c1 8076 + caddc 8078 · cmul 8080 − cmin 8392 ℤcz 9523 ℤ_≥cuz 9799 ...cfz 10288 ∏cprod 12174

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4209 ax-sep 4212 ax-nul 4220 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-iinf 4692 ax-cnex 8166 ax-resscn 8167 ax-1cn 8168 ax-1re 8169 ax-icn 8170 ax-addcl 8171 ax-addrcl 8172 ax-mulcl 8173 ax-mulrcl 8174 ax-addcom 8175 ax-mulcom 8176 ax-addass 8177 ax-mulass 8178 ax-distr 8179 ax-i2m1 8180 ax-0lt1 8181 ax-1rid 8182 ax-0id 8183 ax-rnegex 8184 ax-precex 8185 ax-cnre 8186 ax-pre-ltirr 8187 ax-pre-ltwlin 8188 ax-pre-lttrn 8189 ax-pre-apti 8190 ax-pre-ltadd 8191 ax-pre-mulgt0 8192 ax-pre-mulext 8193 ax-arch 8194 ax-caucvg 8195

This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-nel 2499 df-ral 2516 df-rex 2517 df-reu 2518 df-rmo 2519 df-rab 2520 df-v 2805 df-sbc 3033 df-csb 3129 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-nul 3497 df-if 3608 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-iun 3977 df-br 4094 df-opab 4156 df-mpt 4157 df-tr 4193 df-id 4396 df-po 4399 df-iso 4400 df-iord 4469 df-on 4471 df-ilim 4472 df-suc 4474 df-iom 4695 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fo 5339 df-f1o 5340 df-fv 5341 df-isom 5342 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-1st 6312 df-2nd 6313 df-recs 6514 df-irdg 6579 df-frec 6600 df-1o 6625 df-oadd 6629 df-er 6745 df-en 6953 df-dom 6954 df-fin 6955 df-pnf 8258 df-mnf 8259 df-xr 8260 df-ltxr 8261 df-le 8262 df-sub 8394 df-neg 8395 df-reap 8797 df-ap 8804 df-div 8895 df-inn 9186 df-2 9244 df-3 9245 df-4 9246 df-n0 9445 df-z 9524 df-uz 9800 df-q 9898 df-rp 9933 df-fz 10289 df-fzo 10423 df-seqfrec 10756 df-exp 10847 df-ihash 11084 df-cj 11465 df-re 11466 df-im 11467 df-rsqrt 11621 df-abs 11622 df-clim 11902 df-proddc 12175

This theorem is referenced by: fprodp1 12224 fprodm1s 12225

W3C validator