Theorem prodfdivap 12110

Description: The quotient of two products. (Contributed by Scott Fenton, 15-Jan-2018.) (Revised by Jim Kingdon, 24-Mar-2024.)

Hypotheses

Ref	Expression
prodfdiv.1	⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀))
prodfdivap.2	⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → (𝐹‘𝑘) ∈ ℂ)
prodfdivap.3	⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → (𝐺‘𝑘) ∈ ℂ)
prodfdivap.4	⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → (𝐺‘𝑘) # 0)
prodfdivap.5	⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → (𝐻‘𝑘) = ((𝐹‘𝑘) / (𝐺‘𝑘)))

Assertion

Ref	Expression
prodfdivap	⊢ (𝜑 → (seq𝑀( · , 𝐻)‘𝑁) = ((seq𝑀( · , 𝐹)‘𝑁) / (seq𝑀( · , 𝐺)‘𝑁)))

Distinct variable groups:   𝑘,𝐹   𝑘,𝐺   𝑘,𝐻   𝜑,𝑘   𝑘,𝑀   𝑘,𝑁

Proof of Theorem prodfdivap

Dummy variable 𝑛 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		prodfdiv.1	. . . 4 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀))
2		prodfdivap.3	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → (𝐺‘𝑘) ∈ ℂ)
3		elfzuz 10256	. . . . 5 ⊢ (𝑘 ∈ (𝑀...𝑁) → 𝑘 ∈ (ℤ≥‘𝑀))
4		prodfdivap.4	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → (𝐺‘𝑘) # 0)
5	3, 4	sylan2 286	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → (𝐺‘𝑘) # 0)
6		eqid 2231	. . . . . 6 ⊢ (𝑛 ∈ (ℤ≥‘𝑀) ↦ (1 / (𝐺‘𝑛))) = (𝑛 ∈ (ℤ≥‘𝑀) ↦ (1 / (𝐺‘𝑛)))
7		fveq2 5639	. . . . . . 7 ⊢ (𝑛 = 𝑘 → (𝐺‘𝑛) = (𝐺‘𝑘))
8	7	oveq2d 6034	. . . . . 6 ⊢ (𝑛 = 𝑘 → (1 / (𝐺‘𝑛)) = (1 / (𝐺‘𝑘)))
9		simpr 110	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → 𝑘 ∈ (ℤ≥‘𝑀))
10	2, 4	recclapd 8961	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → (1 / (𝐺‘𝑘)) ∈ ℂ)
11	6, 8, 9, 10	fvmptd3 5740	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → ((𝑛 ∈ (ℤ≥‘𝑀) ↦ (1 / (𝐺‘𝑛)))‘𝑘) = (1 / (𝐺‘𝑘)))
12	3, 11	sylan2 286	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → ((𝑛 ∈ (ℤ≥‘𝑀) ↦ (1 / (𝐺‘𝑛)))‘𝑘) = (1 / (𝐺‘𝑘)))
13	11, 10	eqeltrd 2308	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → ((𝑛 ∈ (ℤ≥‘𝑀) ↦ (1 / (𝐺‘𝑛)))‘𝑘) ∈ ℂ)
14	1, 2, 5, 12, 13	prodfrecap 12109	. . 3 ⊢ (𝜑 → (seq𝑀( · , (𝑛 ∈ (ℤ≥‘𝑀) ↦ (1 / (𝐺‘𝑛))))‘𝑁) = (1 / (seq𝑀( · , 𝐺)‘𝑁)))
15	14	oveq2d 6034	. 2 ⊢ (𝜑 → ((seq𝑀( · , 𝐹)‘𝑁) · (seq𝑀( · , (𝑛 ∈ (ℤ≥‘𝑀) ↦ (1 / (𝐺‘𝑛))))‘𝑁)) = ((seq𝑀( · , 𝐹)‘𝑁) · (1 / (seq𝑀( · , 𝐺)‘𝑁))))
16		prodfdivap.2	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → (𝐹‘𝑘) ∈ ℂ)
17		eleq1w 2292	. . . . . . . . 9 ⊢ (𝑘 = 𝑛 → (𝑘 ∈ (ℤ≥‘𝑀) ↔ 𝑛 ∈ (ℤ≥‘𝑀)))
18	17	anbi2d 464	. . . . . . . 8 ⊢ (𝑘 = 𝑛 → ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) ↔ (𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀))))
19		fveq2 5639	. . . . . . . . 9 ⊢ (𝑘 = 𝑛 → (𝐺‘𝑘) = (𝐺‘𝑛))
20	19	eleq1d 2300	. . . . . . . 8 ⊢ (𝑘 = 𝑛 → ((𝐺‘𝑘) ∈ ℂ ↔ (𝐺‘𝑛) ∈ ℂ))
21	18, 20	imbi12d 234	. . . . . . 7 ⊢ (𝑘 = 𝑛 → (((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → (𝐺‘𝑘) ∈ ℂ) ↔ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (𝐺‘𝑛) ∈ ℂ)))
22	21, 2	chvarvv 1957	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (𝐺‘𝑛) ∈ ℂ)
23	19	breq1d 4098	. . . . . . . 8 ⊢ (𝑘 = 𝑛 → ((𝐺‘𝑘) # 0 ↔ (𝐺‘𝑛) # 0))
24	18, 23	imbi12d 234	. . . . . . 7 ⊢ (𝑘 = 𝑛 → (((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → (𝐺‘𝑘) # 0) ↔ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (𝐺‘𝑛) # 0)))
25	24, 4	chvarvv 1957	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (𝐺‘𝑛) # 0)
26	22, 25	recclapd 8961	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (1 / (𝐺‘𝑛)) ∈ ℂ)
27	26	fmpttd 5802	. . . 4 ⊢ (𝜑 → (𝑛 ∈ (ℤ≥‘𝑀) ↦ (1 / (𝐺‘𝑛))):(ℤ≥‘𝑀)⟶ℂ)
28	27	ffvelcdmda 5782	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → ((𝑛 ∈ (ℤ≥‘𝑀) ↦ (1 / (𝐺‘𝑛)))‘𝑘) ∈ ℂ)
29	16, 2, 4	divrecapd 8973	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → ((𝐹‘𝑘) / (𝐺‘𝑘)) = ((𝐹‘𝑘) · (1 / (𝐺‘𝑘))))
30		prodfdivap.5	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → (𝐻‘𝑘) = ((𝐹‘𝑘) / (𝐺‘𝑘)))
31	11	oveq2d 6034	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → ((𝐹‘𝑘) · ((𝑛 ∈ (ℤ≥‘𝑀) ↦ (1 / (𝐺‘𝑛)))‘𝑘)) = ((𝐹‘𝑘) · (1 / (𝐺‘𝑘))))
32	29, 30, 31	3eqtr4d 2274	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → (𝐻‘𝑘) = ((𝐹‘𝑘) · ((𝑛 ∈ (ℤ≥‘𝑀) ↦ (1 / (𝐺‘𝑛)))‘𝑘)))
33	1, 16, 28, 32	prod3fmul 12104	. 2 ⊢ (𝜑 → (seq𝑀( · , 𝐻)‘𝑁) = ((seq𝑀( · , 𝐹)‘𝑁) · (seq𝑀( · , (𝑛 ∈ (ℤ≥‘𝑀) ↦ (1 / (𝐺‘𝑛))))‘𝑁)))
34		eqid 2231	. . . . 5 ⊢ (ℤ≥‘𝑀) = (ℤ≥‘𝑀)
35		eluzel2 9760	. . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℤ)
36	1, 35	syl 14	. . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℤ)
37	34, 36, 16	prodf 12101	. . . 4 ⊢ (𝜑 → seq𝑀( · , 𝐹):(ℤ≥‘𝑀)⟶ℂ)
38	37, 1	ffvelcdmd 5783	. . 3 ⊢ (𝜑 → (seq𝑀( · , 𝐹)‘𝑁) ∈ ℂ)
39	34, 36, 2	prodf 12101	. . . 4 ⊢ (𝜑 → seq𝑀( · , 𝐺):(ℤ≥‘𝑀)⟶ℂ)
40	39, 1	ffvelcdmd 5783	. . 3 ⊢ (𝜑 → (seq𝑀( · , 𝐺)‘𝑁) ∈ ℂ)
41	1, 2, 5	prodfap0 12108	. . 3 ⊢ (𝜑 → (seq𝑀( · , 𝐺)‘𝑁) # 0)
42	38, 40, 41	divrecapd 8973	. 2 ⊢ (𝜑 → ((seq𝑀( · , 𝐹)‘𝑁) / (seq𝑀( · , 𝐺)‘𝑁)) = ((seq𝑀( · , 𝐹)‘𝑁) · (1 / (seq𝑀( · , 𝐺)‘𝑁))))
43	15, 33, 42	3eqtr4d 2274	1 ⊢ (𝜑 → (seq𝑀( · , 𝐻)‘𝑁) = ((seq𝑀( · , 𝐹)‘𝑁) / (seq𝑀( · , 𝐺)‘𝑁)))

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1397   ∈ wcel 2202   class class class wbr 4088   ↦ cmpt 4150  ‘cfv 5326  (class class class)co 6018  ℂcc 8030  0cc0 8032  1c1 8033   · cmul 8037   # cap 8761   / cdiv 8852  ℤcz 9479  ℤ_≥cuz 9755  ...cfz 10243  seqcseq 10710

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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686  ax-cnex 8123  ax-resscn 8124  ax-1cn 8125  ax-1re 8126  ax-icn 8127  ax-addcl 8128  ax-addrcl 8129  ax-mulcl 8130  ax-mulrcl 8131  ax-addcom 8132  ax-mulcom 8133  ax-addass 8134  ax-mulass 8135  ax-distr 8136  ax-i2m1 8137  ax-0lt1 8138  ax-1rid 8139  ax-0id 8140  ax-rnegex 8141  ax-precex 8142  ax-cnre 8143  ax-pre-ltirr 8144  ax-pre-ltwlin 8145  ax-pre-lttrn 8146  ax-pre-apti 8147  ax-pre-ltadd 8148  ax-pre-mulgt0 8149  ax-pre-mulext 8150

This theorem depends on definitions:  df-bi 117  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-id 4390  df-po 4393  df-iso 4394  df-iord 4463  df-on 4465  df-ilim 4466  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5971  df-ov 6021  df-oprab 6022  df-mpo 6023  df-1st 6303  df-2nd 6304  df-recs 6471  df-frec 6557  df-pnf 8216  df-mnf 8217  df-xr 8218  df-ltxr 8219  df-le 8220  df-sub 8352  df-neg 8353  df-reap 8755  df-ap 8762  df-div 8853  df-inn 9144  df-n0 9403  df-z 9480  df-uz 9756  df-fz 10244  df-fzo 10378  df-seqfrec 10711

This theorem is referenced by: (None)