MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  prodmolem3 Structured version   Visualization version   GIF version

Theorem prodmolem3 15966
Description: Lemma for prodmo 15969. (Contributed by Scott Fenton, 4-Dec-2017.)
Hypotheses
Ref Expression
prodmo.1 𝐹 = (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))
prodmo.2 ((𝜑𝑘𝐴) → 𝐵 ∈ ℂ)
prodmo.3 𝐺 = (𝑗 ∈ ℕ ↦ (𝑓𝑗) / 𝑘𝐵)
prodmolem3.4 𝐻 = (𝑗 ∈ ℕ ↦ (𝐾𝑗) / 𝑘𝐵)
prodmolem3.5 (𝜑 → (𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ))
prodmolem3.6 (𝜑𝑓:(1...𝑀)–1-1-onto𝐴)
prodmolem3.7 (𝜑𝐾:(1...𝑁)–1-1-onto𝐴)
Assertion
Ref Expression
prodmolem3 (𝜑 → (seq1( · , 𝐺)‘𝑀) = (seq1( · , 𝐻)‘𝑁))
Distinct variable groups:   𝐴,𝑘   𝑘,𝐹   𝜑,𝑘   𝐵,𝑗   𝑓,𝑗,𝑘   𝑗,𝐺   𝑗,𝑘,𝜑   𝑗,𝐾   𝑗,𝑀
Allowed substitution hints:   𝜑(𝑓)   𝐴(𝑓,𝑗)   𝐵(𝑓,𝑘)   𝐹(𝑓,𝑗)   𝐺(𝑓,𝑘)   𝐻(𝑓,𝑗,𝑘)   𝐾(𝑓,𝑘)   𝑀(𝑓,𝑘)   𝑁(𝑓,𝑗,𝑘)

Proof of Theorem prodmolem3
Dummy variables 𝑖 𝑚 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 mulcl 11237 . . . 4 ((𝑚 ∈ ℂ ∧ 𝑗 ∈ ℂ) → (𝑚 · 𝑗) ∈ ℂ)
21adantl 481 . . 3 ((𝜑 ∧ (𝑚 ∈ ℂ ∧ 𝑗 ∈ ℂ)) → (𝑚 · 𝑗) ∈ ℂ)
3 mulcom 11239 . . . 4 ((𝑚 ∈ ℂ ∧ 𝑗 ∈ ℂ) → (𝑚 · 𝑗) = (𝑗 · 𝑚))
43adantl 481 . . 3 ((𝜑 ∧ (𝑚 ∈ ℂ ∧ 𝑗 ∈ ℂ)) → (𝑚 · 𝑗) = (𝑗 · 𝑚))
5 mulass 11241 . . . 4 ((𝑚 ∈ ℂ ∧ 𝑗 ∈ ℂ ∧ 𝑧 ∈ ℂ) → ((𝑚 · 𝑗) · 𝑧) = (𝑚 · (𝑗 · 𝑧)))
65adantl 481 . . 3 ((𝜑 ∧ (𝑚 ∈ ℂ ∧ 𝑗 ∈ ℂ ∧ 𝑧 ∈ ℂ)) → ((𝑚 · 𝑗) · 𝑧) = (𝑚 · (𝑗 · 𝑧)))
7 prodmolem3.5 . . . . 5 (𝜑 → (𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ))
87simpld 494 . . . 4 (𝜑𝑀 ∈ ℕ)
9 nnuz 12919 . . . 4 ℕ = (ℤ‘1)
108, 9eleqtrdi 2849 . . 3 (𝜑𝑀 ∈ (ℤ‘1))
11 ssidd 4019 . . 3 (𝜑 → ℂ ⊆ ℂ)
12 prodmolem3.6 . . . . . 6 (𝜑𝑓:(1...𝑀)–1-1-onto𝐴)
13 f1ocnv 6861 . . . . . 6 (𝑓:(1...𝑀)–1-1-onto𝐴𝑓:𝐴1-1-onto→(1...𝑀))
1412, 13syl 17 . . . . 5 (𝜑𝑓:𝐴1-1-onto→(1...𝑀))
15 prodmolem3.7 . . . . 5 (𝜑𝐾:(1...𝑁)–1-1-onto𝐴)
16 f1oco 6872 . . . . 5 ((𝑓:𝐴1-1-onto→(1...𝑀) ∧ 𝐾:(1...𝑁)–1-1-onto𝐴) → (𝑓𝐾):(1...𝑁)–1-1-onto→(1...𝑀))
1714, 15, 16syl2anc 584 . . . 4 (𝜑 → (𝑓𝐾):(1...𝑁)–1-1-onto→(1...𝑀))
18 ovex 7464 . . . . . . . . . 10 (1...𝑁) ∈ V
1918f1oen 9012 . . . . . . . . 9 ((𝑓𝐾):(1...𝑁)–1-1-onto→(1...𝑀) → (1...𝑁) ≈ (1...𝑀))
2017, 19syl 17 . . . . . . . 8 (𝜑 → (1...𝑁) ≈ (1...𝑀))
21 fzfi 14010 . . . . . . . . 9 (1...𝑁) ∈ Fin
22 fzfi 14010 . . . . . . . . 9 (1...𝑀) ∈ Fin
23 hashen 14383 . . . . . . . . 9 (((1...𝑁) ∈ Fin ∧ (1...𝑀) ∈ Fin) → ((♯‘(1...𝑁)) = (♯‘(1...𝑀)) ↔ (1...𝑁) ≈ (1...𝑀)))
2421, 22, 23mp2an 692 . . . . . . . 8 ((♯‘(1...𝑁)) = (♯‘(1...𝑀)) ↔ (1...𝑁) ≈ (1...𝑀))
2520, 24sylibr 234 . . . . . . 7 (𝜑 → (♯‘(1...𝑁)) = (♯‘(1...𝑀)))
267simprd 495 . . . . . . . . 9 (𝜑𝑁 ∈ ℕ)
2726nnnn0d 12585 . . . . . . . 8 (𝜑𝑁 ∈ ℕ0)
28 hashfz1 14382 . . . . . . . 8 (𝑁 ∈ ℕ0 → (♯‘(1...𝑁)) = 𝑁)
2927, 28syl 17 . . . . . . 7 (𝜑 → (♯‘(1...𝑁)) = 𝑁)
308nnnn0d 12585 . . . . . . . 8 (𝜑𝑀 ∈ ℕ0)
31 hashfz1 14382 . . . . . . . 8 (𝑀 ∈ ℕ0 → (♯‘(1...𝑀)) = 𝑀)
3230, 31syl 17 . . . . . . 7 (𝜑 → (♯‘(1...𝑀)) = 𝑀)
3325, 29, 323eqtr3rd 2784 . . . . . 6 (𝜑𝑀 = 𝑁)
3433oveq2d 7447 . . . . 5 (𝜑 → (1...𝑀) = (1...𝑁))
3534f1oeq2d 6845 . . . 4 (𝜑 → ((𝑓𝐾):(1...𝑀)–1-1-onto→(1...𝑀) ↔ (𝑓𝐾):(1...𝑁)–1-1-onto→(1...𝑀)))
3617, 35mpbird 257 . . 3 (𝜑 → (𝑓𝐾):(1...𝑀)–1-1-onto→(1...𝑀))
37 prodmo.3 . . . . 5 𝐺 = (𝑗 ∈ ℕ ↦ (𝑓𝑗) / 𝑘𝐵)
38 fveq2 6907 . . . . . 6 (𝑗 = 𝑚 → (𝑓𝑗) = (𝑓𝑚))
3938csbeq1d 3912 . . . . 5 (𝑗 = 𝑚(𝑓𝑗) / 𝑘𝐵 = (𝑓𝑚) / 𝑘𝐵)
40 elfznn 13590 . . . . . 6 (𝑚 ∈ (1...𝑀) → 𝑚 ∈ ℕ)
4140adantl 481 . . . . 5 ((𝜑𝑚 ∈ (1...𝑀)) → 𝑚 ∈ ℕ)
42 f1of 6849 . . . . . . . 8 (𝑓:(1...𝑀)–1-1-onto𝐴𝑓:(1...𝑀)⟶𝐴)
4312, 42syl 17 . . . . . . 7 (𝜑𝑓:(1...𝑀)⟶𝐴)
4443ffvelcdmda 7104 . . . . . 6 ((𝜑𝑚 ∈ (1...𝑀)) → (𝑓𝑚) ∈ 𝐴)
45 prodmo.2 . . . . . . . 8 ((𝜑𝑘𝐴) → 𝐵 ∈ ℂ)
4645ralrimiva 3144 . . . . . . 7 (𝜑 → ∀𝑘𝐴 𝐵 ∈ ℂ)
4746adantr 480 . . . . . 6 ((𝜑𝑚 ∈ (1...𝑀)) → ∀𝑘𝐴 𝐵 ∈ ℂ)
48 nfcsb1v 3933 . . . . . . . 8 𝑘(𝑓𝑚) / 𝑘𝐵
4948nfel1 2920 . . . . . . 7 𝑘(𝑓𝑚) / 𝑘𝐵 ∈ ℂ
50 csbeq1a 3922 . . . . . . . 8 (𝑘 = (𝑓𝑚) → 𝐵 = (𝑓𝑚) / 𝑘𝐵)
5150eleq1d 2824 . . . . . . 7 (𝑘 = (𝑓𝑚) → (𝐵 ∈ ℂ ↔ (𝑓𝑚) / 𝑘𝐵 ∈ ℂ))
5249, 51rspc 3610 . . . . . 6 ((𝑓𝑚) ∈ 𝐴 → (∀𝑘𝐴 𝐵 ∈ ℂ → (𝑓𝑚) / 𝑘𝐵 ∈ ℂ))
5344, 47, 52sylc 65 . . . . 5 ((𝜑𝑚 ∈ (1...𝑀)) → (𝑓𝑚) / 𝑘𝐵 ∈ ℂ)
5437, 39, 41, 53fvmptd3 7039 . . . 4 ((𝜑𝑚 ∈ (1...𝑀)) → (𝐺𝑚) = (𝑓𝑚) / 𝑘𝐵)
5554, 53eqeltrd 2839 . . 3 ((𝜑𝑚 ∈ (1...𝑀)) → (𝐺𝑚) ∈ ℂ)
5634f1oeq2d 6845 . . . . . . . . . . 11 (𝜑 → (𝐾:(1...𝑀)–1-1-onto𝐴𝐾:(1...𝑁)–1-1-onto𝐴))
5715, 56mpbird 257 . . . . . . . . . 10 (𝜑𝐾:(1...𝑀)–1-1-onto𝐴)
58 f1of 6849 . . . . . . . . . 10 (𝐾:(1...𝑀)–1-1-onto𝐴𝐾:(1...𝑀)⟶𝐴)
5957, 58syl 17 . . . . . . . . 9 (𝜑𝐾:(1...𝑀)⟶𝐴)
60 fvco3 7008 . . . . . . . . 9 ((𝐾:(1...𝑀)⟶𝐴𝑖 ∈ (1...𝑀)) → ((𝑓𝐾)‘𝑖) = (𝑓‘(𝐾𝑖)))
6159, 60sylan 580 . . . . . . . 8 ((𝜑𝑖 ∈ (1...𝑀)) → ((𝑓𝐾)‘𝑖) = (𝑓‘(𝐾𝑖)))
6261fveq2d 6911 . . . . . . 7 ((𝜑𝑖 ∈ (1...𝑀)) → (𝑓‘((𝑓𝐾)‘𝑖)) = (𝑓‘(𝑓‘(𝐾𝑖))))
6312adantr 480 . . . . . . . 8 ((𝜑𝑖 ∈ (1...𝑀)) → 𝑓:(1...𝑀)–1-1-onto𝐴)
6459ffvelcdmda 7104 . . . . . . . 8 ((𝜑𝑖 ∈ (1...𝑀)) → (𝐾𝑖) ∈ 𝐴)
65 f1ocnvfv2 7297 . . . . . . . 8 ((𝑓:(1...𝑀)–1-1-onto𝐴 ∧ (𝐾𝑖) ∈ 𝐴) → (𝑓‘(𝑓‘(𝐾𝑖))) = (𝐾𝑖))
6663, 64, 65syl2anc 584 . . . . . . 7 ((𝜑𝑖 ∈ (1...𝑀)) → (𝑓‘(𝑓‘(𝐾𝑖))) = (𝐾𝑖))
6762, 66eqtrd 2775 . . . . . 6 ((𝜑𝑖 ∈ (1...𝑀)) → (𝑓‘((𝑓𝐾)‘𝑖)) = (𝐾𝑖))
6867csbeq1d 3912 . . . . 5 ((𝜑𝑖 ∈ (1...𝑀)) → (𝑓‘((𝑓𝐾)‘𝑖)) / 𝑘𝐵 = (𝐾𝑖) / 𝑘𝐵)
6968fveq2d 6911 . . . 4 ((𝜑𝑖 ∈ (1...𝑀)) → ( I ‘(𝑓‘((𝑓𝐾)‘𝑖)) / 𝑘𝐵) = ( I ‘(𝐾𝑖) / 𝑘𝐵))
70 f1of 6849 . . . . . . 7 ((𝑓𝐾):(1...𝑀)–1-1-onto→(1...𝑀) → (𝑓𝐾):(1...𝑀)⟶(1...𝑀))
7136, 70syl 17 . . . . . 6 (𝜑 → (𝑓𝐾):(1...𝑀)⟶(1...𝑀))
7271ffvelcdmda 7104 . . . . 5 ((𝜑𝑖 ∈ (1...𝑀)) → ((𝑓𝐾)‘𝑖) ∈ (1...𝑀))
73 elfznn 13590 . . . . 5 (((𝑓𝐾)‘𝑖) ∈ (1...𝑀) → ((𝑓𝐾)‘𝑖) ∈ ℕ)
74 fveq2 6907 . . . . . . 7 (𝑗 = ((𝑓𝐾)‘𝑖) → (𝑓𝑗) = (𝑓‘((𝑓𝐾)‘𝑖)))
7574csbeq1d 3912 . . . . . 6 (𝑗 = ((𝑓𝐾)‘𝑖) → (𝑓𝑗) / 𝑘𝐵 = (𝑓‘((𝑓𝐾)‘𝑖)) / 𝑘𝐵)
7675, 37fvmpti 7015 . . . . 5 (((𝑓𝐾)‘𝑖) ∈ ℕ → (𝐺‘((𝑓𝐾)‘𝑖)) = ( I ‘(𝑓‘((𝑓𝐾)‘𝑖)) / 𝑘𝐵))
7772, 73, 763syl 18 . . . 4 ((𝜑𝑖 ∈ (1...𝑀)) → (𝐺‘((𝑓𝐾)‘𝑖)) = ( I ‘(𝑓‘((𝑓𝐾)‘𝑖)) / 𝑘𝐵))
78 elfznn 13590 . . . . . 6 (𝑖 ∈ (1...𝑀) → 𝑖 ∈ ℕ)
7978adantl 481 . . . . 5 ((𝜑𝑖 ∈ (1...𝑀)) → 𝑖 ∈ ℕ)
80 fveq2 6907 . . . . . . 7 (𝑗 = 𝑖 → (𝐾𝑗) = (𝐾𝑖))
8180csbeq1d 3912 . . . . . 6 (𝑗 = 𝑖(𝐾𝑗) / 𝑘𝐵 = (𝐾𝑖) / 𝑘𝐵)
82 prodmolem3.4 . . . . . 6 𝐻 = (𝑗 ∈ ℕ ↦ (𝐾𝑗) / 𝑘𝐵)
8381, 82fvmpti 7015 . . . . 5 (𝑖 ∈ ℕ → (𝐻𝑖) = ( I ‘(𝐾𝑖) / 𝑘𝐵))
8479, 83syl 17 . . . 4 ((𝜑𝑖 ∈ (1...𝑀)) → (𝐻𝑖) = ( I ‘(𝐾𝑖) / 𝑘𝐵))
8569, 77, 843eqtr4rd 2786 . . 3 ((𝜑𝑖 ∈ (1...𝑀)) → (𝐻𝑖) = (𝐺‘((𝑓𝐾)‘𝑖)))
862, 4, 6, 10, 11, 36, 55, 85seqf1o 14081 . 2 (𝜑 → (seq1( · , 𝐻)‘𝑀) = (seq1( · , 𝐺)‘𝑀))
8733fveq2d 6911 . 2 (𝜑 → (seq1( · , 𝐻)‘𝑀) = (seq1( · , 𝐻)‘𝑁))
8886, 87eqtr3d 2777 1 (𝜑 → (seq1( · , 𝐺)‘𝑀) = (seq1( · , 𝐻)‘𝑁))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086   = wceq 1537  wcel 2106  wral 3059  csb 3908  ifcif 4531   class class class wbr 5148  cmpt 5231   I cid 5582  ccnv 5688  ccom 5693  wf 6559  1-1-ontowf1o 6562  cfv 6563  (class class class)co 7431  cen 8981  Fincfn 8984  cc 11151  1c1 11154   · cmul 11158  cn 12264  0cn0 12524  cz 12611  cuz 12876  ...cfz 13544  seqcseq 14039  chash 14366
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754  ax-cnex 11209  ax-resscn 11210  ax-1cn 11211  ax-icn 11212  ax-addcl 11213  ax-addrcl 11214  ax-mulcl 11215  ax-mulrcl 11216  ax-mulcom 11217  ax-addass 11218  ax-mulass 11219  ax-distr 11220  ax-i2m1 11221  ax-1ne0 11222  ax-1rid 11223  ax-rnegex 11224  ax-rrecex 11225  ax-cnre 11226  ax-pre-lttri 11227  ax-pre-lttrn 11228  ax-pre-ltadd 11229  ax-pre-mulgt0 11230
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-nel 3045  df-ral 3060  df-rex 3069  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-pss 3983  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-int 4952  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5583  df-eprel 5589  df-po 5597  df-so 5598  df-fr 5641  df-we 5643  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-pred 6323  df-ord 6389  df-on 6390  df-lim 6391  df-suc 6392  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-riota 7388  df-ov 7434  df-oprab 7435  df-mpo 7436  df-om 7888  df-1st 8013  df-2nd 8014  df-frecs 8305  df-wrecs 8336  df-recs 8410  df-rdg 8449  df-1o 8505  df-er 8744  df-en 8985  df-dom 8986  df-sdom 8987  df-fin 8988  df-card 9977  df-pnf 11295  df-mnf 11296  df-xr 11297  df-ltxr 11298  df-le 11299  df-sub 11492  df-neg 11493  df-nn 12265  df-n0 12525  df-z 12612  df-uz 12877  df-fz 13545  df-fzo 13692  df-seq 14040  df-hash 14367
This theorem is referenced by:  prodmolem2a  15967  prodmo  15969
  Copyright terms: Public domain W3C validator