Theorem prodfdivap 12079

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 10234	. . . . 5 ⊢ (𝑘 ∈ (𝑀...𝑁) → 𝑘 ∈ (ℤ≥‘𝑀))
4		prodfdivap.4	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → (𝐺‘𝑘) # 0)
5	3, 4	sylan2 286	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → (𝐺‘𝑘) # 0)
6		eqid 2229	. . . . . 6 ⊢ (𝑛 ∈ (ℤ≥‘𝑀) ↦ (1 / (𝐺‘𝑛))) = (𝑛 ∈ (ℤ≥‘𝑀) ↦ (1 / (𝐺‘𝑛)))
7		fveq2 5632	. . . . . . 7 ⊢ (𝑛 = 𝑘 → (𝐺‘𝑛) = (𝐺‘𝑘))
8	7	oveq2d 6026	. . . . . 6 ⊢ (𝑛 = 𝑘 → (1 / (𝐺‘𝑛)) = (1 / (𝐺‘𝑘)))
9		simpr 110	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → 𝑘 ∈ (ℤ≥‘𝑀))
10	2, 4	recclapd 8944	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → (1 / (𝐺‘𝑘)) ∈ ℂ)
11	6, 8, 9, 10	fvmptd3 5733	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → ((𝑛 ∈ (ℤ≥‘𝑀) ↦ (1 / (𝐺‘𝑛)))‘𝑘) = (1 / (𝐺‘𝑘)))
12	3, 11	sylan2 286	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → ((𝑛 ∈ (ℤ≥‘𝑀) ↦ (1 / (𝐺‘𝑛)))‘𝑘) = (1 / (𝐺‘𝑘)))
13	11, 10	eqeltrd 2306	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → ((𝑛 ∈ (ℤ≥‘𝑀) ↦ (1 / (𝐺‘𝑛)))‘𝑘) ∈ ℂ)
14	1, 2, 5, 12, 13	prodfrecap 12078	. . 3 ⊢ (𝜑 → (seq𝑀( · , (𝑛 ∈ (ℤ≥‘𝑀) ↦ (1 / (𝐺‘𝑛))))‘𝑁) = (1 / (seq𝑀( · , 𝐺)‘𝑁)))
15	14	oveq2d 6026	. 2 ⊢ (𝜑 → ((seq𝑀( · , 𝐹)‘𝑁) · (seq𝑀( · , (𝑛 ∈ (ℤ≥‘𝑀) ↦ (1 / (𝐺‘𝑛))))‘𝑁)) = ((seq𝑀( · , 𝐹)‘𝑁) · (1 / (seq𝑀( · , 𝐺)‘𝑁))))
16		prodfdivap.2	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → (𝐹‘𝑘) ∈ ℂ)
17		eleq1w 2290	. . . . . . . . 9 ⊢ (𝑘 = 𝑛 → (𝑘 ∈ (ℤ≥‘𝑀) ↔ 𝑛 ∈ (ℤ≥‘𝑀)))
18	17	anbi2d 464	. . . . . . . 8 ⊢ (𝑘 = 𝑛 → ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) ↔ (𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀))))
19		fveq2 5632	. . . . . . . . 9 ⊢ (𝑘 = 𝑛 → (𝐺‘𝑘) = (𝐺‘𝑛))
20	19	eleq1d 2298	. . . . . . . 8 ⊢ (𝑘 = 𝑛 → ((𝐺‘𝑘) ∈ ℂ ↔ (𝐺‘𝑛) ∈ ℂ))
21	18, 20	imbi12d 234	. . . . . . 7 ⊢ (𝑘 = 𝑛 → (((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → (𝐺‘𝑘) ∈ ℂ) ↔ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (𝐺‘𝑛) ∈ ℂ)))
22	21, 2	chvarvv 1955	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (𝐺‘𝑛) ∈ ℂ)
23	19	breq1d 4093	. . . . . . . 8 ⊢ (𝑘 = 𝑛 → ((𝐺‘𝑘) # 0 ↔ (𝐺‘𝑛) # 0))
24	18, 23	imbi12d 234	. . . . . . 7 ⊢ (𝑘 = 𝑛 → (((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → (𝐺‘𝑘) # 0) ↔ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (𝐺‘𝑛) # 0)))
25	24, 4	chvarvv 1955	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (𝐺‘𝑛) # 0)
26	22, 25	recclapd 8944	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (1 / (𝐺‘𝑛)) ∈ ℂ)
27	26	fmpttd 5795	. . . 4 ⊢ (𝜑 → (𝑛 ∈ (ℤ≥‘𝑀) ↦ (1 / (𝐺‘𝑛))):(ℤ≥‘𝑀)⟶ℂ)
28	27	ffvelcdmda 5775	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → ((𝑛 ∈ (ℤ≥‘𝑀) ↦ (1 / (𝐺‘𝑛)))‘𝑘) ∈ ℂ)
29	16, 2, 4	divrecapd 8956	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → ((𝐹‘𝑘) / (𝐺‘𝑘)) = ((𝐹‘𝑘) · (1 / (𝐺‘𝑘))))
30		prodfdivap.5	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → (𝐻‘𝑘) = ((𝐹‘𝑘) / (𝐺‘𝑘)))
31	11	oveq2d 6026	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → ((𝐹‘𝑘) · ((𝑛 ∈ (ℤ≥‘𝑀) ↦ (1 / (𝐺‘𝑛)))‘𝑘)) = ((𝐹‘𝑘) · (1 / (𝐺‘𝑘))))
32	29, 30, 31	3eqtr4d 2272	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → (𝐻‘𝑘) = ((𝐹‘𝑘) · ((𝑛 ∈ (ℤ≥‘𝑀) ↦ (1 / (𝐺‘𝑛)))‘𝑘)))
33	1, 16, 28, 32	prod3fmul 12073	. 2 ⊢ (𝜑 → (seq𝑀( · , 𝐻)‘𝑁) = ((seq𝑀( · , 𝐹)‘𝑁) · (seq𝑀( · , (𝑛 ∈ (ℤ≥‘𝑀) ↦ (1 / (𝐺‘𝑛))))‘𝑁)))
34		eqid 2229	. . . . 5 ⊢ (ℤ≥‘𝑀) = (ℤ≥‘𝑀)
35		eluzel2 9743	. . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℤ)
36	1, 35	syl 14	. . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℤ)
37	34, 36, 16	prodf 12070	. . . 4 ⊢ (𝜑 → seq𝑀( · , 𝐹):(ℤ≥‘𝑀)⟶ℂ)
38	37, 1	ffvelcdmd 5776	. . 3 ⊢ (𝜑 → (seq𝑀( · , 𝐹)‘𝑁) ∈ ℂ)
39	34, 36, 2	prodf 12070	. . . 4 ⊢ (𝜑 → seq𝑀( · , 𝐺):(ℤ≥‘𝑀)⟶ℂ)
40	39, 1	ffvelcdmd 5776	. . 3 ⊢ (𝜑 → (seq𝑀( · , 𝐺)‘𝑁) ∈ ℂ)
41	1, 2, 5	prodfap0 12077	. . 3 ⊢ (𝜑 → (seq𝑀( · , 𝐺)‘𝑁) # 0)
42	38, 40, 41	divrecapd 8956	. 2 ⊢ (𝜑 → ((seq𝑀( · , 𝐹)‘𝑁) / (seq𝑀( · , 𝐺)‘𝑁)) = ((seq𝑀( · , 𝐹)‘𝑁) · (1 / (seq𝑀( · , 𝐺)‘𝑁))))
43	15, 33, 42	3eqtr4d 2272	1 ⊢ (𝜑 → (seq𝑀( · , 𝐻)‘𝑁) = ((seq𝑀( · , 𝐹)‘𝑁) / (seq𝑀( · , 𝐺)‘𝑁)))

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1395   ∈ wcel 2200   class class class wbr 4083   ↦ cmpt 4145  ‘cfv 5321  (class class class)co 6010  ℂcc 8013  0cc0 8015  1c1 8016   · cmul 8020   # cap 8744   / cdiv 8835  ℤcz 9462  ℤ_≥cuz 9738  ...cfz 10221  seqcseq 10686

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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-nul 4210  ax-pow 4259  ax-pr 4294  ax-un 4525  ax-setind 4630  ax-iinf 4681  ax-cnex 8106  ax-resscn 8107  ax-1cn 8108  ax-1re 8109  ax-icn 8110  ax-addcl 8111  ax-addrcl 8112  ax-mulcl 8113  ax-mulrcl 8114  ax-addcom 8115  ax-mulcom 8116  ax-addass 8117  ax-mulass 8118  ax-distr 8119  ax-i2m1 8120  ax-0lt1 8121  ax-1rid 8122  ax-0id 8123  ax-rnegex 8124  ax-precex 8125  ax-cnre 8126  ax-pre-ltirr 8127  ax-pre-ltwlin 8128  ax-pre-lttrn 8129  ax-pre-apti 8130  ax-pre-ltadd 8131  ax-pre-mulgt0 8132  ax-pre-mulext 8133

This theorem depends on definitions:  df-bi 117  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-tr 4183  df-id 4385  df-po 4388  df-iso 4389  df-iord 4458  df-on 4460  df-ilim 4461  df-suc 4463  df-iom 4684  df-xp 4726  df-rel 4727  df-cnv 4728  df-co 4729  df-dm 4730  df-rn 4731  df-res 4732  df-ima 4733  df-iota 5281  df-fun 5323  df-fn 5324  df-f 5325  df-f1 5326  df-fo 5327  df-f1o 5328  df-fv 5329  df-riota 5963  df-ov 6013  df-oprab 6014  df-mpo 6015  df-1st 6295  df-2nd 6296  df-recs 6462  df-frec 6548  df-pnf 8199  df-mnf 8200  df-xr 8201  df-ltxr 8202  df-le 8203  df-sub 8335  df-neg 8336  df-reap 8738  df-ap 8745  df-div 8836  df-inn 9127  df-n0 9386  df-z 9463  df-uz 9739  df-fz 10222  df-fzo 10356  df-seqfrec 10687

This theorem is referenced by: (None)