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

Theorem dprdfcntz 18460
Description: A function on the elements of an internal direct product has pairwise commuting values. (Contributed by Mario Carneiro, 25-Apr-2016.) (Revised by AV, 11-Jul-2019.)
Hypotheses
Ref Expression
dprdff.w 𝑊 = {X𝑖𝐼 (𝑆𝑖) ∣ finSupp 0 }
dprdff.1 (𝜑𝐺dom DProd 𝑆)
dprdff.2 (𝜑 → dom 𝑆 = 𝐼)
dprdff.3 (𝜑𝐹𝑊)
dprdfcntz.z 𝑍 = (Cntz‘𝐺)
Assertion
Ref Expression
dprdfcntz (𝜑 → ran 𝐹 ⊆ (𝑍‘ran 𝐹))
Distinct variable groups:   ,𝐹   ,𝑖,𝐼   0 ,   𝑆,,𝑖
Allowed substitution hints:   𝜑(,𝑖)   𝐹(𝑖)   𝐺(,𝑖)   𝑊(,𝑖)   0 (𝑖)   𝑍(,𝑖)

Proof of Theorem dprdfcntz
Dummy variables 𝑦 𝑧 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dprdff.w . . . . 5 𝑊 = {X𝑖𝐼 (𝑆𝑖) ∣ finSupp 0 }
2 dprdff.1 . . . . 5 (𝜑𝐺dom DProd 𝑆)
3 dprdff.2 . . . . 5 (𝜑 → dom 𝑆 = 𝐼)
4 dprdff.3 . . . . 5 (𝜑𝐹𝑊)
5 eqid 2651 . . . . 5 (Base‘𝐺) = (Base‘𝐺)
61, 2, 3, 4, 5dprdff 18457 . . . 4 (𝜑𝐹:𝐼⟶(Base‘𝐺))
7 ffn 6083 . . . 4 (𝐹:𝐼⟶(Base‘𝐺) → 𝐹 Fn 𝐼)
86, 7syl 17 . . 3 (𝜑𝐹 Fn 𝐼)
96ffvelrnda 6399 . . . . 5 ((𝜑𝑦𝐼) → (𝐹𝑦) ∈ (Base‘𝐺))
10 simpr 476 . . . . . . . . . 10 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦 = 𝑧) → 𝑦 = 𝑧)
1110fveq2d 6233 . . . . . . . . 9 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦 = 𝑧) → (𝐹𝑦) = (𝐹𝑧))
1210eqcomd 2657 . . . . . . . . . 10 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦 = 𝑧) → 𝑧 = 𝑦)
1312fveq2d 6233 . . . . . . . . 9 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦 = 𝑧) → (𝐹𝑧) = (𝐹𝑦))
1411, 13oveq12d 6708 . . . . . . . 8 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦 = 𝑧) → ((𝐹𝑦)(+g𝐺)(𝐹𝑧)) = ((𝐹𝑧)(+g𝐺)(𝐹𝑦)))
152ad3antrrr 766 . . . . . . . . . . 11 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦𝑧) → 𝐺dom DProd 𝑆)
163ad3antrrr 766 . . . . . . . . . . 11 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦𝑧) → dom 𝑆 = 𝐼)
17 simpllr 815 . . . . . . . . . . 11 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦𝑧) → 𝑦𝐼)
18 simplr 807 . . . . . . . . . . 11 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦𝑧) → 𝑧𝐼)
19 simpr 476 . . . . . . . . . . 11 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦𝑧) → 𝑦𝑧)
20 dprdfcntz.z . . . . . . . . . . 11 𝑍 = (Cntz‘𝐺)
2115, 16, 17, 18, 19, 20dprdcntz 18453 . . . . . . . . . 10 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦𝑧) → (𝑆𝑦) ⊆ (𝑍‘(𝑆𝑧)))
221, 2, 3, 4dprdfcl 18458 . . . . . . . . . . 11 ((𝜑𝑦𝐼) → (𝐹𝑦) ∈ (𝑆𝑦))
2322ad2antrr 762 . . . . . . . . . 10 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦𝑧) → (𝐹𝑦) ∈ (𝑆𝑦))
2421, 23sseldd 3637 . . . . . . . . 9 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦𝑧) → (𝐹𝑦) ∈ (𝑍‘(𝑆𝑧)))
251, 2, 3, 4dprdfcl 18458 . . . . . . . . . . 11 ((𝜑𝑧𝐼) → (𝐹𝑧) ∈ (𝑆𝑧))
2625adantlr 751 . . . . . . . . . 10 (((𝜑𝑦𝐼) ∧ 𝑧𝐼) → (𝐹𝑧) ∈ (𝑆𝑧))
2726adantr 480 . . . . . . . . 9 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦𝑧) → (𝐹𝑧) ∈ (𝑆𝑧))
28 eqid 2651 . . . . . . . . . 10 (+g𝐺) = (+g𝐺)
2928, 20cntzi 17808 . . . . . . . . 9 (((𝐹𝑦) ∈ (𝑍‘(𝑆𝑧)) ∧ (𝐹𝑧) ∈ (𝑆𝑧)) → ((𝐹𝑦)(+g𝐺)(𝐹𝑧)) = ((𝐹𝑧)(+g𝐺)(𝐹𝑦)))
3024, 27, 29syl2anc 694 . . . . . . . 8 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦𝑧) → ((𝐹𝑦)(+g𝐺)(𝐹𝑧)) = ((𝐹𝑧)(+g𝐺)(𝐹𝑦)))
3114, 30pm2.61dane 2910 . . . . . . 7 (((𝜑𝑦𝐼) ∧ 𝑧𝐼) → ((𝐹𝑦)(+g𝐺)(𝐹𝑧)) = ((𝐹𝑧)(+g𝐺)(𝐹𝑦)))
3231ralrimiva 2995 . . . . . 6 ((𝜑𝑦𝐼) → ∀𝑧𝐼 ((𝐹𝑦)(+g𝐺)(𝐹𝑧)) = ((𝐹𝑧)(+g𝐺)(𝐹𝑦)))
338adantr 480 . . . . . . 7 ((𝜑𝑦𝐼) → 𝐹 Fn 𝐼)
34 oveq2 6698 . . . . . . . . 9 (𝑥 = (𝐹𝑧) → ((𝐹𝑦)(+g𝐺)𝑥) = ((𝐹𝑦)(+g𝐺)(𝐹𝑧)))
35 oveq1 6697 . . . . . . . . 9 (𝑥 = (𝐹𝑧) → (𝑥(+g𝐺)(𝐹𝑦)) = ((𝐹𝑧)(+g𝐺)(𝐹𝑦)))
3634, 35eqeq12d 2666 . . . . . . . 8 (𝑥 = (𝐹𝑧) → (((𝐹𝑦)(+g𝐺)𝑥) = (𝑥(+g𝐺)(𝐹𝑦)) ↔ ((𝐹𝑦)(+g𝐺)(𝐹𝑧)) = ((𝐹𝑧)(+g𝐺)(𝐹𝑦))))
3736ralrn 6402 . . . . . . 7 (𝐹 Fn 𝐼 → (∀𝑥 ∈ ran 𝐹((𝐹𝑦)(+g𝐺)𝑥) = (𝑥(+g𝐺)(𝐹𝑦)) ↔ ∀𝑧𝐼 ((𝐹𝑦)(+g𝐺)(𝐹𝑧)) = ((𝐹𝑧)(+g𝐺)(𝐹𝑦))))
3833, 37syl 17 . . . . . 6 ((𝜑𝑦𝐼) → (∀𝑥 ∈ ran 𝐹((𝐹𝑦)(+g𝐺)𝑥) = (𝑥(+g𝐺)(𝐹𝑦)) ↔ ∀𝑧𝐼 ((𝐹𝑦)(+g𝐺)(𝐹𝑧)) = ((𝐹𝑧)(+g𝐺)(𝐹𝑦))))
3932, 38mpbird 247 . . . . 5 ((𝜑𝑦𝐼) → ∀𝑥 ∈ ran 𝐹((𝐹𝑦)(+g𝐺)𝑥) = (𝑥(+g𝐺)(𝐹𝑦)))
40 frn 6091 . . . . . . . 8 (𝐹:𝐼⟶(Base‘𝐺) → ran 𝐹 ⊆ (Base‘𝐺))
416, 40syl 17 . . . . . . 7 (𝜑 → ran 𝐹 ⊆ (Base‘𝐺))
4241adantr 480 . . . . . 6 ((𝜑𝑦𝐼) → ran 𝐹 ⊆ (Base‘𝐺))
435, 28, 20elcntz 17801 . . . . . 6 (ran 𝐹 ⊆ (Base‘𝐺) → ((𝐹𝑦) ∈ (𝑍‘ran 𝐹) ↔ ((𝐹𝑦) ∈ (Base‘𝐺) ∧ ∀𝑥 ∈ ran 𝐹((𝐹𝑦)(+g𝐺)𝑥) = (𝑥(+g𝐺)(𝐹𝑦)))))
4442, 43syl 17 . . . . 5 ((𝜑𝑦𝐼) → ((𝐹𝑦) ∈ (𝑍‘ran 𝐹) ↔ ((𝐹𝑦) ∈ (Base‘𝐺) ∧ ∀𝑥 ∈ ran 𝐹((𝐹𝑦)(+g𝐺)𝑥) = (𝑥(+g𝐺)(𝐹𝑦)))))
459, 39, 44mpbir2and 977 . . . 4 ((𝜑𝑦𝐼) → (𝐹𝑦) ∈ (𝑍‘ran 𝐹))
4645ralrimiva 2995 . . 3 (𝜑 → ∀𝑦𝐼 (𝐹𝑦) ∈ (𝑍‘ran 𝐹))
47 ffnfv 6428 . . 3 (𝐹:𝐼⟶(𝑍‘ran 𝐹) ↔ (𝐹 Fn 𝐼 ∧ ∀𝑦𝐼 (𝐹𝑦) ∈ (𝑍‘ran 𝐹)))
488, 46, 47sylanbrc 699 . 2 (𝜑𝐹:𝐼⟶(𝑍‘ran 𝐹))
49 frn 6091 . 2 (𝐹:𝐼⟶(𝑍‘ran 𝐹) → ran 𝐹 ⊆ (𝑍‘ran 𝐹))
5048, 49syl 17 1 (𝜑 → ran 𝐹 ⊆ (𝑍‘ran 𝐹))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 383   = wceq 1523  wcel 2030  wne 2823  wral 2941  {crab 2945  wss 3607   class class class wbr 4685  dom cdm 5143  ran crn 5144   Fn wfn 5921  wf 5922  cfv 5926  (class class class)co 6690  Xcixp 7950   finSupp cfsupp 8316  Basecbs 15904  +gcplusg 15988  Cntzccntz 17794   DProd cdprd 18438
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-8 2032  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-rep 4804  ax-sep 4814  ax-nul 4822  ax-pow 4873  ax-pr 4936  ax-un 6991
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ne 2824  df-nel 2927  df-ral 2946  df-rex 2947  df-reu 2948  df-rab 2950  df-v 3233  df-sbc 3469  df-csb 3567  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-nul 3949  df-if 4120  df-pw 4193  df-sn 4211  df-pr 4213  df-op 4217  df-uni 4469  df-iun 4554  df-br 4686  df-opab 4746  df-mpt 4763  df-id 5053  df-xp 5149  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-rn 5154  df-res 5155  df-ima 5156  df-iota 5889  df-fun 5928  df-fn 5929  df-f 5930  df-f1 5931  df-fo 5932  df-f1o 5933  df-fv 5934  df-ov 6693  df-oprab 6694  df-mpt2 6695  df-1st 7210  df-2nd 7211  df-ixp 7951  df-subg 17638  df-cntz 17796  df-dprd 18440
This theorem is referenced by:  dprdssv  18461  dprdfinv  18464  dprdfadd  18465  dprdfeq0  18467  dprdlub  18471  dmdprdsplitlem  18482  dpjidcl  18503
  Copyright terms: Public domain W3C validator