fprod1p - Intuitionistic Logic Explorer

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

Theorem fprod1p 11489

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

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

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

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

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

Step	Hyp	Ref	Expression
1		fprod1p.1	. . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘𝑀))
2		eluzfz1 9926	. . . . . . . 8 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑀 ∈ (𝑀...𝑁))
3	1, 2	syl 14	. . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ (𝑀...𝑁))
4		elfzelz 9921	. . . . . . 7 ⊢ (𝑀 ∈ (𝑀...𝑁) → 𝑀 ∈ ℤ)
5	3, 4	syl 14	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℤ)
6		fzsn 9961	. . . . . 6 ⊢ (𝑀 ∈ ℤ → (𝑀...𝑀) = {𝑀})
7	5, 6	syl 14	. . . . 5 ⊢ (𝜑 → (𝑀...𝑀) = {𝑀})
8	7	ineq1d 3307	. . . 4 ⊢ (𝜑 → ((𝑀...𝑀) ∩ ((𝑀 + 1)...𝑁)) = ({𝑀} ∩ ((𝑀 + 1)...𝑁)))
9	5	zred 9280	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℝ)
10	9	ltp1d 8795	. . . . 5 ⊢ (𝜑 → 𝑀 < (𝑀 + 1))
11		fzdisj 9947	. . . . 5 ⊢ (𝑀 < (𝑀 + 1) → ((𝑀...𝑀) ∩ ((𝑀 + 1)...𝑁)) = ∅)
12	10, 11	syl 14	. . . 4 ⊢ (𝜑 → ((𝑀...𝑀) ∩ ((𝑀 + 1)...𝑁)) = ∅)
13	8, 12	eqtr3d 2192	. . 3 ⊢ (𝜑 → ({𝑀} ∩ ((𝑀 + 1)...𝑁)) = ∅)
14		fzsplit 9946	. . . . 5 ⊢ (𝑀 ∈ (𝑀...𝑁) → (𝑀...𝑁) = ((𝑀...𝑀) ∪ ((𝑀 + 1)...𝑁)))
15	3, 14	syl 14	. . . 4 ⊢ (𝜑 → (𝑀...𝑁) = ((𝑀...𝑀) ∪ ((𝑀 + 1)...𝑁)))
16	7	uneq1d 3260	. . . 4 ⊢ (𝜑 → ((𝑀...𝑀) ∪ ((𝑀 + 1)...𝑁)) = ({𝑀} ∪ ((𝑀 + 1)...𝑁)))
17	15, 16	eqtrd 2190	. . 3 ⊢ (𝜑 → (𝑀...𝑁) = ({𝑀} ∪ ((𝑀 + 1)...𝑁)))
18		eluzelz 9442	. . . . 5 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑁 ∈ ℤ)
19	1, 18	syl 14	. . . 4 ⊢ (𝜑 → 𝑁 ∈ ℤ)
20	5, 19	fzfigd 10323	. . 3 ⊢ (𝜑 → (𝑀...𝑁) ∈ Fin)
21		elfzelz 9921	. . . . . 6 ⊢ (𝑗 ∈ (𝑀...𝑁) → 𝑗 ∈ ℤ)
22		zdceq 9233	. . . . . 6 ⊢ ((𝑗 ∈ ℤ ∧ 𝑀 ∈ ℤ) → DECID 𝑗 = 𝑀)
23	21, 5, 22	syl2anr 288	. . . . 5 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝑀...𝑁)) → DECID 𝑗 = 𝑀)
24		velsn 3577	. . . . . 6 ⊢ (𝑗 ∈ {𝑀} ↔ 𝑗 = 𝑀)
25	24	dcbii 826	. . . . 5 ⊢ (DECID 𝑗 ∈ {𝑀} ↔ DECID 𝑗 = 𝑀)
26	23, 25	sylibr 133	. . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝑀...𝑁)) → DECID 𝑗 ∈ {𝑀})
27	26	ralrimiva 2530	. . 3 ⊢ (𝜑 → ∀𝑗 ∈ (𝑀...𝑁)DECID 𝑗 ∈ {𝑀})
28		fprod1p.2	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → 𝐴 ∈ ℂ)
29	13, 17, 20, 27, 28	fprodsplitdc 11486	. 2 ⊢ (𝜑 → ∏𝑘 ∈ (𝑀...𝑁)𝐴 = (∏𝑘 ∈ {𝑀}𝐴 · ∏𝑘 ∈ ((𝑀 + 1)...𝑁)𝐴))
30		fprod1p.3	. . . . . 6 ⊢ (𝑘 = 𝑀 → 𝐴 = 𝐵)
31	30	eleq1d 2226	. . . . 5 ⊢ (𝑘 = 𝑀 → (𝐴 ∈ ℂ ↔ 𝐵 ∈ ℂ))
32	28	ralrimiva 2530	. . . . 5 ⊢ (𝜑 → ∀𝑘 ∈ (𝑀...𝑁)𝐴 ∈ ℂ)
33	31, 32, 3	rspcdva 2821	. . . 4 ⊢ (𝜑 → 𝐵 ∈ ℂ)
34	30	prodsn 11483	. . . 4 ⊢ ((𝑀 ∈ (𝑀...𝑁) ∧ 𝐵 ∈ ℂ) → ∏𝑘 ∈ {𝑀}𝐴 = 𝐵)
35	3, 33, 34	syl2anc 409	. . 3 ⊢ (𝜑 → ∏𝑘 ∈ {𝑀}𝐴 = 𝐵)
36	35	oveq1d 5836	. 2 ⊢ (𝜑 → (∏𝑘 ∈ {𝑀}𝐴 · ∏𝑘 ∈ ((𝑀 + 1)...𝑁)𝐴) = (𝐵 · ∏𝑘 ∈ ((𝑀 + 1)...𝑁)𝐴))
37	29, 36	eqtrd 2190	1 ⊢ (𝜑 → ∏𝑘 ∈ (𝑀...𝑁)𝐴 = (𝐵 · ∏𝑘 ∈ ((𝑀 + 1)...𝑁)𝐴))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 103 DECID wdc 820 = wceq 1335 ∈ wcel 2128 ∪ cun 3100 ∩ cin 3101 ∅c0 3394 {csn 3560 class class class wbr 3965 ‘cfv 5169 (class class class)co 5821 ℂcc 7724 1c1 7727 + caddc 7729 · cmul 7731 < clt 7906 ℤcz 9161 ℤ_≥cuz 9433 ...cfz 9905 ∏cprod 11440

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1427 ax-7 1428 ax-gen 1429 ax-ie1 1473 ax-ie2 1474 ax-8 1484 ax-10 1485 ax-11 1486 ax-i12 1487 ax-bndl 1489 ax-4 1490 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-13 2130 ax-14 2131 ax-ext 2139 ax-coll 4079 ax-sep 4082 ax-nul 4090 ax-pow 4135 ax-pr 4169 ax-un 4393 ax-setind 4495 ax-iinf 4546 ax-cnex 7817 ax-resscn 7818 ax-1cn 7819 ax-1re 7820 ax-icn 7821 ax-addcl 7822 ax-addrcl 7823 ax-mulcl 7824 ax-mulrcl 7825 ax-addcom 7826 ax-mulcom 7827 ax-addass 7828 ax-mulass 7829 ax-distr 7830 ax-i2m1 7831 ax-0lt1 7832 ax-1rid 7833 ax-0id 7834 ax-rnegex 7835 ax-precex 7836 ax-cnre 7837 ax-pre-ltirr 7838 ax-pre-ltwlin 7839 ax-pre-lttrn 7840 ax-pre-apti 7841 ax-pre-ltadd 7842 ax-pre-mulgt0 7843 ax-pre-mulext 7844 ax-arch 7845 ax-caucvg 7846

This theorem depends on definitions: df-bi 116 df-dc 821 df-3or 964 df-3an 965 df-tru 1338 df-fal 1341 df-nf 1441 df-sb 1743 df-eu 2009 df-mo 2010 df-clab 2144 df-cleq 2150 df-clel 2153 df-nfc 2288 df-ne 2328 df-nel 2423 df-ral 2440 df-rex 2441 df-reu 2442 df-rmo 2443 df-rab 2444 df-v 2714 df-sbc 2938 df-csb 3032 df-dif 3104 df-un 3106 df-in 3108 df-ss 3115 df-nul 3395 df-if 3506 df-pw 3545 df-sn 3566 df-pr 3567 df-op 3569 df-uni 3773 df-int 3808 df-iun 3851 df-br 3966 df-opab 4026 df-mpt 4027 df-tr 4063 df-id 4253 df-po 4256 df-iso 4257 df-iord 4326 df-on 4328 df-ilim 4329 df-suc 4331 df-iom 4549 df-xp 4591 df-rel 4592 df-cnv 4593 df-co 4594 df-dm 4595 df-rn 4596 df-res 4597 df-ima 4598 df-iota 5134 df-fun 5171 df-fn 5172 df-f 5173 df-f1 5174 df-fo 5175 df-f1o 5176 df-fv 5177 df-isom 5178 df-riota 5777 df-ov 5824 df-oprab 5825 df-mpo 5826 df-1st 6085 df-2nd 6086 df-recs 6249 df-irdg 6314 df-frec 6335 df-1o 6360 df-oadd 6364 df-er 6477 df-en 6683 df-dom 6684 df-fin 6685 df-pnf 7908 df-mnf 7909 df-xr 7910 df-ltxr 7911 df-le 7912 df-sub 8042 df-neg 8043 df-reap 8444 df-ap 8451 df-div 8540 df-inn 8828 df-2 8886 df-3 8887 df-4 8888 df-n0 9085 df-z 9162 df-uz 9434 df-q 9522 df-rp 9554 df-fz 9906 df-fzo 10035 df-seqfrec 10338 df-exp 10412 df-ihash 10643 df-cj 10735 df-re 10736 df-im 10737 df-rsqrt 10891 df-abs 10892 df-clim 11169 df-proddc 11441

This theorem is referenced by: (None)

W3C validator