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

Theorem prodfdivap 12101
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.
StepHypRef Expression
1 prodfdiv.1 . . . 4 (𝜑𝑁 ∈ (ℤ𝑀))
2 prodfdivap.3 . . . 4 ((𝜑𝑘 ∈ (ℤ𝑀)) → (𝐺𝑘) ∈ ℂ)
3 elfzuz 10249 . . . . 5 (𝑘 ∈ (𝑀...𝑁) → 𝑘 ∈ (ℤ𝑀))
4 prodfdivap.4 . . . . 5 ((𝜑𝑘 ∈ (ℤ𝑀)) → (𝐺𝑘) # 0)
53, 4sylan2 286 . . . 4 ((𝜑𝑘 ∈ (𝑀...𝑁)) → (𝐺𝑘) # 0)
6 eqid 2229 . . . . . 6 (𝑛 ∈ (ℤ𝑀) ↦ (1 / (𝐺𝑛))) = (𝑛 ∈ (ℤ𝑀) ↦ (1 / (𝐺𝑛)))
7 fveq2 5635 . . . . . . 7 (𝑛 = 𝑘 → (𝐺𝑛) = (𝐺𝑘))
87oveq2d 6029 . . . . . 6 (𝑛 = 𝑘 → (1 / (𝐺𝑛)) = (1 / (𝐺𝑘)))
9 simpr 110 . . . . . 6 ((𝜑𝑘 ∈ (ℤ𝑀)) → 𝑘 ∈ (ℤ𝑀))
102, 4recclapd 8954 . . . . . 6 ((𝜑𝑘 ∈ (ℤ𝑀)) → (1 / (𝐺𝑘)) ∈ ℂ)
116, 8, 9, 10fvmptd3 5736 . . . . 5 ((𝜑𝑘 ∈ (ℤ𝑀)) → ((𝑛 ∈ (ℤ𝑀) ↦ (1 / (𝐺𝑛)))‘𝑘) = (1 / (𝐺𝑘)))
123, 11sylan2 286 . . . 4 ((𝜑𝑘 ∈ (𝑀...𝑁)) → ((𝑛 ∈ (ℤ𝑀) ↦ (1 / (𝐺𝑛)))‘𝑘) = (1 / (𝐺𝑘)))
1311, 10eqeltrd 2306 . . . 4 ((𝜑𝑘 ∈ (ℤ𝑀)) → ((𝑛 ∈ (ℤ𝑀) ↦ (1 / (𝐺𝑛)))‘𝑘) ∈ ℂ)
141, 2, 5, 12, 13prodfrecap 12100 . . 3 (𝜑 → (seq𝑀( · , (𝑛 ∈ (ℤ𝑀) ↦ (1 / (𝐺𝑛))))‘𝑁) = (1 / (seq𝑀( · , 𝐺)‘𝑁)))
1514oveq2d 6029 . 2 (𝜑 → ((seq𝑀( · , 𝐹)‘𝑁) · (seq𝑀( · , (𝑛 ∈ (ℤ𝑀) ↦ (1 / (𝐺𝑛))))‘𝑁)) = ((seq𝑀( · , 𝐹)‘𝑁) · (1 / (seq𝑀( · , 𝐺)‘𝑁))))
16 prodfdivap.2 . . 3 ((𝜑𝑘 ∈ (ℤ𝑀)) → (𝐹𝑘) ∈ ℂ)
17 eleq1w 2290 . . . . . . . . 9 (𝑘 = 𝑛 → (𝑘 ∈ (ℤ𝑀) ↔ 𝑛 ∈ (ℤ𝑀)))
1817anbi2d 464 . . . . . . . 8 (𝑘 = 𝑛 → ((𝜑𝑘 ∈ (ℤ𝑀)) ↔ (𝜑𝑛 ∈ (ℤ𝑀))))
19 fveq2 5635 . . . . . . . . 9 (𝑘 = 𝑛 → (𝐺𝑘) = (𝐺𝑛))
2019eleq1d 2298 . . . . . . . 8 (𝑘 = 𝑛 → ((𝐺𝑘) ∈ ℂ ↔ (𝐺𝑛) ∈ ℂ))
2118, 20imbi12d 234 . . . . . . 7 (𝑘 = 𝑛 → (((𝜑𝑘 ∈ (ℤ𝑀)) → (𝐺𝑘) ∈ ℂ) ↔ ((𝜑𝑛 ∈ (ℤ𝑀)) → (𝐺𝑛) ∈ ℂ)))
2221, 2chvarvv 1955 . . . . . 6 ((𝜑𝑛 ∈ (ℤ𝑀)) → (𝐺𝑛) ∈ ℂ)
2319breq1d 4096 . . . . . . . 8 (𝑘 = 𝑛 → ((𝐺𝑘) # 0 ↔ (𝐺𝑛) # 0))
2418, 23imbi12d 234 . . . . . . 7 (𝑘 = 𝑛 → (((𝜑𝑘 ∈ (ℤ𝑀)) → (𝐺𝑘) # 0) ↔ ((𝜑𝑛 ∈ (ℤ𝑀)) → (𝐺𝑛) # 0)))
2524, 4chvarvv 1955 . . . . . 6 ((𝜑𝑛 ∈ (ℤ𝑀)) → (𝐺𝑛) # 0)
2622, 25recclapd 8954 . . . . 5 ((𝜑𝑛 ∈ (ℤ𝑀)) → (1 / (𝐺𝑛)) ∈ ℂ)
2726fmpttd 5798 . . . 4 (𝜑 → (𝑛 ∈ (ℤ𝑀) ↦ (1 / (𝐺𝑛))):(ℤ𝑀)⟶ℂ)
2827ffvelcdmda 5778 . . 3 ((𝜑𝑘 ∈ (ℤ𝑀)) → ((𝑛 ∈ (ℤ𝑀) ↦ (1 / (𝐺𝑛)))‘𝑘) ∈ ℂ)
2916, 2, 4divrecapd 8966 . . . 4 ((𝜑𝑘 ∈ (ℤ𝑀)) → ((𝐹𝑘) / (𝐺𝑘)) = ((𝐹𝑘) · (1 / (𝐺𝑘))))
30 prodfdivap.5 . . . 4 ((𝜑𝑘 ∈ (ℤ𝑀)) → (𝐻𝑘) = ((𝐹𝑘) / (𝐺𝑘)))
3111oveq2d 6029 . . . 4 ((𝜑𝑘 ∈ (ℤ𝑀)) → ((𝐹𝑘) · ((𝑛 ∈ (ℤ𝑀) ↦ (1 / (𝐺𝑛)))‘𝑘)) = ((𝐹𝑘) · (1 / (𝐺𝑘))))
3229, 30, 313eqtr4d 2272 . . 3 ((𝜑𝑘 ∈ (ℤ𝑀)) → (𝐻𝑘) = ((𝐹𝑘) · ((𝑛 ∈ (ℤ𝑀) ↦ (1 / (𝐺𝑛)))‘𝑘)))
331, 16, 28, 32prod3fmul 12095 . 2 (𝜑 → (seq𝑀( · , 𝐻)‘𝑁) = ((seq𝑀( · , 𝐹)‘𝑁) · (seq𝑀( · , (𝑛 ∈ (ℤ𝑀) ↦ (1 / (𝐺𝑛))))‘𝑁)))
34 eqid 2229 . . . . 5 (ℤ𝑀) = (ℤ𝑀)
35 eluzel2 9753 . . . . . 6 (𝑁 ∈ (ℤ𝑀) → 𝑀 ∈ ℤ)
361, 35syl 14 . . . . 5 (𝜑𝑀 ∈ ℤ)
3734, 36, 16prodf 12092 . . . 4 (𝜑 → seq𝑀( · , 𝐹):(ℤ𝑀)⟶ℂ)
3837, 1ffvelcdmd 5779 . . 3 (𝜑 → (seq𝑀( · , 𝐹)‘𝑁) ∈ ℂ)
3934, 36, 2prodf 12092 . . . 4 (𝜑 → seq𝑀( · , 𝐺):(ℤ𝑀)⟶ℂ)
4039, 1ffvelcdmd 5779 . . 3 (𝜑 → (seq𝑀( · , 𝐺)‘𝑁) ∈ ℂ)
411, 2, 5prodfap0 12099 . . 3 (𝜑 → (seq𝑀( · , 𝐺)‘𝑁) # 0)
4238, 40, 41divrecapd 8966 . 2 (𝜑 → ((seq𝑀( · , 𝐹)‘𝑁) / (seq𝑀( · , 𝐺)‘𝑁)) = ((seq𝑀( · , 𝐹)‘𝑁) · (1 / (seq𝑀( · , 𝐺)‘𝑁))))
4315, 33, 423eqtr4d 2272 1 (𝜑 → (seq𝑀( · , 𝐻)‘𝑁) = ((seq𝑀( · , 𝐹)‘𝑁) / (seq𝑀( · , 𝐺)‘𝑁)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1395  wcel 2200   class class class wbr 4086  cmpt 4148  cfv 5324  (class class class)co 6013  cc 8023  0cc0 8025  1c1 8026   · cmul 8030   # cap 8754   / cdiv 8845  cz 9472  cuz 9748  ...cfz 10236  seqcseq 10702
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 4202  ax-sep 4205  ax-nul 4213  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-iinf 4684  ax-cnex 8116  ax-resscn 8117  ax-1cn 8118  ax-1re 8119  ax-icn 8120  ax-addcl 8121  ax-addrcl 8122  ax-mulcl 8123  ax-mulrcl 8124  ax-addcom 8125  ax-mulcom 8126  ax-addass 8127  ax-mulass 8128  ax-distr 8129  ax-i2m1 8130  ax-0lt1 8131  ax-1rid 8132  ax-0id 8133  ax-rnegex 8134  ax-precex 8135  ax-cnre 8136  ax-pre-ltirr 8137  ax-pre-ltwlin 8138  ax-pre-lttrn 8139  ax-pre-apti 8140  ax-pre-ltadd 8141  ax-pre-mulgt0 8142  ax-pre-mulext 8143
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 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-tr 4186  df-id 4388  df-po 4391  df-iso 4392  df-iord 4461  df-on 4463  df-ilim 4464  df-suc 4466  df-iom 4687  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-riota 5966  df-ov 6016  df-oprab 6017  df-mpo 6018  df-1st 6298  df-2nd 6299  df-recs 6466  df-frec 6552  df-pnf 8209  df-mnf 8210  df-xr 8211  df-ltxr 8212  df-le 8213  df-sub 8345  df-neg 8346  df-reap 8748  df-ap 8755  df-div 8846  df-inn 9137  df-n0 9396  df-z 9473  df-uz 9749  df-fz 10237  df-fzo 10371  df-seqfrec 10703
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator