fprodm1 - Intuitionistic Logic Explorer

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

Theorem fprodm1 11994

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 10256	. . . . 5 ⊢ ¬ ((𝑁 − 1) + 1) ∈ (𝑀...(𝑁 − 1))
2		fprodm1.1	. . . . . . . . 9 ⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘𝑀))
3		eluzelz 9687	. . . . . . . . 9 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑁 ∈ ℤ)
4	2, 3	syl 14	. . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ ℤ)
5	4	zcnd 9526	. . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ ℂ)
6		1cnd 8118	. . . . . . 7 ⊢ (𝜑 → 1 ∈ ℂ)
7	5, 6	npcand 8417	. . . . . 6 ⊢ (𝜑 → ((𝑁 − 1) + 1) = 𝑁)
8	7	eleq1d 2275	. . . . 5 ⊢ (𝜑 → (((𝑁 − 1) + 1) ∈ (𝑀...(𝑁 − 1)) ↔ 𝑁 ∈ (𝑀...(𝑁 − 1))))
9	1, 8	mtbii 676	. . . 4 ⊢ (𝜑 → ¬ 𝑁 ∈ (𝑀...(𝑁 − 1)))
10		disjsn 3700	. . . 4 ⊢ (((𝑀...(𝑁 − 1)) ∩ {𝑁}) = ∅ ↔ ¬ 𝑁 ∈ (𝑀...(𝑁 − 1)))
11	9, 10	sylibr 134	. . 3 ⊢ (𝜑 → ((𝑀...(𝑁 − 1)) ∩ {𝑁}) = ∅)
12		eluzel2 9683	. . . . . 6 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑀 ∈ ℤ)
13	2, 12	syl 14	. . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℤ)
14		peano2zm 9440	. . . . . . 7 ⊢ (𝑀 ∈ ℤ → (𝑀 − 1) ∈ ℤ)
15	13, 14	syl 14	. . . . . 6 ⊢ (𝜑 → (𝑀 − 1) ∈ ℤ)
16	13	zcnd 9526	. . . . . . . . 9 ⊢ (𝜑 → 𝑀 ∈ ℂ)
17	16, 6	npcand 8417	. . . . . . . 8 ⊢ (𝜑 → ((𝑀 − 1) + 1) = 𝑀)
18	17	fveq2d 5598	. . . . . . 7 ⊢ (𝜑 → (ℤ_≥‘((𝑀 − 1) + 1)) = (ℤ_≥‘𝑀))
19	2, 18	eleqtrrd 2286	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘((𝑀 − 1) + 1)))
20		eluzp1m1 9702	. . . . . 6 ⊢ (((𝑀 − 1) ∈ ℤ ∧ 𝑁 ∈ (ℤ_≥‘((𝑀 − 1) + 1))) → (𝑁 − 1) ∈ (ℤ_≥‘(𝑀 − 1)))
21	15, 19, 20	syl2anc 411	. . . . 5 ⊢ (𝜑 → (𝑁 − 1) ∈ (ℤ_≥‘(𝑀 − 1)))
22		fzsuc2 10231	. . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ (𝑁 − 1) ∈ (ℤ_≥‘(𝑀 − 1))) → (𝑀...((𝑁 − 1) + 1)) = ((𝑀...(𝑁 − 1)) ∪ {((𝑁 − 1) + 1)}))
23	13, 21, 22	syl2anc 411	. . . 4 ⊢ (𝜑 → (𝑀...((𝑁 − 1) + 1)) = ((𝑀...(𝑁 − 1)) ∪ {((𝑁 − 1) + 1)}))
24	7	oveq2d 5978	. . . 4 ⊢ (𝜑 → (𝑀...((𝑁 − 1) + 1)) = (𝑀...𝑁))
25	7	sneqd 3651	. . . . 5 ⊢ (𝜑 → {((𝑁 − 1) + 1)} = {𝑁})
26	25	uneq2d 3331	. . . 4 ⊢ (𝜑 → ((𝑀...(𝑁 − 1)) ∪ {((𝑁 − 1) + 1)}) = ((𝑀...(𝑁 − 1)) ∪ {𝑁}))
27	23, 24, 26	3eqtr3d 2247	. . 3 ⊢ (𝜑 → (𝑀...𝑁) = ((𝑀...(𝑁 − 1)) ∪ {𝑁}))
28	13, 4	fzfigd 10608	. . 3 ⊢ (𝜑 → (𝑀...𝑁) ∈ Fin)
29		elfzelz 10177	. . . . . 6 ⊢ (𝑗 ∈ (𝑀...𝑁) → 𝑗 ∈ ℤ)
30	29	adantl 277	. . . . 5 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝑀...𝑁)) → 𝑗 ∈ ℤ)
31	13	adantr 276	. . . . 5 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝑀...𝑁)) → 𝑀 ∈ ℤ)
32	4	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝑀...𝑁)) → 𝑁 ∈ ℤ)
33		peano2zm 9440	. . . . . 6 ⊢ (𝑁 ∈ ℤ → (𝑁 − 1) ∈ ℤ)
34	32, 33	syl 14	. . . . 5 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝑀...𝑁)) → (𝑁 − 1) ∈ ℤ)
35		fzdcel 10192	. . . . 5 ⊢ ((𝑗 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ (𝑁 − 1) ∈ ℤ) → DECID 𝑗 ∈ (𝑀...(𝑁 − 1)))
36	30, 31, 34, 35	syl3anc 1250	. . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝑀...𝑁)) → DECID 𝑗 ∈ (𝑀...(𝑁 − 1)))
37	36	ralrimiva 2580	. . 3 ⊢ (𝜑 → ∀𝑗 ∈ (𝑀...𝑁)DECID 𝑗 ∈ (𝑀...(𝑁 − 1)))
38		fprodm1.2	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → 𝐴 ∈ ℂ)
39	11, 27, 28, 37, 38	fprodsplitdc 11992	. 2 ⊢ (𝜑 → ∏𝑘 ∈ (𝑀...𝑁)𝐴 = (∏𝑘 ∈ (𝑀...(𝑁 − 1))𝐴 · ∏𝑘 ∈ {𝑁}𝐴))
40		fprodm1.3	. . . . . 6 ⊢ (𝑘 = 𝑁 → 𝐴 = 𝐵)
41	40	eleq1d 2275	. . . . 5 ⊢ (𝑘 = 𝑁 → (𝐴 ∈ ℂ ↔ 𝐵 ∈ ℂ))
42	38	ralrimiva 2580	. . . . 5 ⊢ (𝜑 → ∀𝑘 ∈ (𝑀...𝑁)𝐴 ∈ ℂ)
43		eluzfz2 10184	. . . . . 6 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑁 ∈ (𝑀...𝑁))
44	2, 43	syl 14	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ (𝑀...𝑁))
45	41, 42, 44	rspcdva 2886	. . . 4 ⊢ (𝜑 → 𝐵 ∈ ℂ)
46	40	prodsn 11989	. . . 4 ⊢ ((𝑁 ∈ (ℤ_≥‘𝑀) ∧ 𝐵 ∈ ℂ) → ∏𝑘 ∈ {𝑁}𝐴 = 𝐵)
47	2, 45, 46	syl2anc 411	. . 3 ⊢ (𝜑 → ∏𝑘 ∈ {𝑁}𝐴 = 𝐵)
48	47	oveq2d 5978	. 2 ⊢ (𝜑 → (∏𝑘 ∈ (𝑀...(𝑁 − 1))𝐴 · ∏𝑘 ∈ {𝑁}𝐴) = (∏𝑘 ∈ (𝑀...(𝑁 − 1))𝐴 · 𝐵))
49	39, 48	eqtrd 2239	1 ⊢ (𝜑 → ∏𝑘 ∈ (𝑀...𝑁)𝐴 = (∏𝑘 ∈ (𝑀...(𝑁 − 1))𝐴 · 𝐵))

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 DECID wdc 836 = wceq 1373 ∈ wcel 2177 ∪ cun 3168 ∩ cin 3169 ∅c0 3464 {csn 3638 ‘cfv 5285 (class class class)co 5962 ℂcc 7953 1c1 7956 + caddc 7958 · cmul 7960 − cmin 8273 ℤcz 9402 ℤ_≥cuz 9678 ...cfz 10160 ∏cprod 11946

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 615 ax-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2179 ax-14 2180 ax-ext 2188 ax-coll 4170 ax-sep 4173 ax-nul 4181 ax-pow 4229 ax-pr 4264 ax-un 4493 ax-setind 4598 ax-iinf 4649 ax-cnex 8046 ax-resscn 8047 ax-1cn 8048 ax-1re 8049 ax-icn 8050 ax-addcl 8051 ax-addrcl 8052 ax-mulcl 8053 ax-mulrcl 8054 ax-addcom 8055 ax-mulcom 8056 ax-addass 8057 ax-mulass 8058 ax-distr 8059 ax-i2m1 8060 ax-0lt1 8061 ax-1rid 8062 ax-0id 8063 ax-rnegex 8064 ax-precex 8065 ax-cnre 8066 ax-pre-ltirr 8067 ax-pre-ltwlin 8068 ax-pre-lttrn 8069 ax-pre-apti 8070 ax-pre-ltadd 8071 ax-pre-mulgt0 8072 ax-pre-mulext 8073 ax-arch 8074 ax-caucvg 8075

This theorem depends on definitions: df-bi 117 df-dc 837 df-3or 982 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-ne 2378 df-nel 2473 df-ral 2490 df-rex 2491 df-reu 2492 df-rmo 2493 df-rab 2494 df-v 2775 df-sbc 3003 df-csb 3098 df-dif 3172 df-un 3174 df-in 3176 df-ss 3183 df-nul 3465 df-if 3576 df-pw 3623 df-sn 3644 df-pr 3645 df-op 3647 df-uni 3860 df-int 3895 df-iun 3938 df-br 4055 df-opab 4117 df-mpt 4118 df-tr 4154 df-id 4353 df-po 4356 df-iso 4357 df-iord 4426 df-on 4428 df-ilim 4429 df-suc 4431 df-iom 4652 df-xp 4694 df-rel 4695 df-cnv 4696 df-co 4697 df-dm 4698 df-rn 4699 df-res 4700 df-ima 4701 df-iota 5246 df-fun 5287 df-fn 5288 df-f 5289 df-f1 5290 df-fo 5291 df-f1o 5292 df-fv 5293 df-isom 5294 df-riota 5917 df-ov 5965 df-oprab 5966 df-mpo 5967 df-1st 6244 df-2nd 6245 df-recs 6409 df-irdg 6474 df-frec 6495 df-1o 6520 df-oadd 6524 df-er 6638 df-en 6846 df-dom 6847 df-fin 6848 df-pnf 8139 df-mnf 8140 df-xr 8141 df-ltxr 8142 df-le 8143 df-sub 8275 df-neg 8276 df-reap 8678 df-ap 8685 df-div 8776 df-inn 9067 df-2 9125 df-3 9126 df-4 9127 df-n0 9326 df-z 9403 df-uz 9679 df-q 9771 df-rp 9806 df-fz 10161 df-fzo 10295 df-seqfrec 10625 df-exp 10716 df-ihash 10953 df-cj 11238 df-re 11239 df-im 11240 df-rsqrt 11394 df-abs 11395 df-clim 11675 df-proddc 11947

This theorem is referenced by: fprodp1 11996 fprodm1s 11997

W3C validator