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

Theorem dprdfcntz 20143
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 2762 . . . . 5 (Base‘𝐺) = (Base‘𝐺)
61, 2, 3, 4, 5dprdff 20140 . . . 4 (𝜑𝐹:𝐼⟶(Base‘𝐺))
76ffnd 6707 . . 3 (𝜑𝐹 Fn 𝐼)
86ffvelcdmda 7080 . . . . 5 ((𝜑𝑦𝐼) → (𝐹𝑦) ∈ (Base‘𝐺))
9 simpr 490 . . . . . . . . . 10 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦 = 𝑧) → 𝑦 = 𝑧)
109fveq2d 6886 . . . . . . . . 9 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦 = 𝑧) → (𝐹𝑦) = (𝐹𝑧))
119equcomd 2052 . . . . . . . . . 10 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦 = 𝑧) → 𝑧 = 𝑦)
1211fveq2d 6886 . . . . . . . . 9 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦 = 𝑧) → (𝐹𝑧) = (𝐹𝑦))
1310, 12oveq12d 7434 . . . . . . . 8 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦 = 𝑧) → ((𝐹𝑦)(+g𝐺)(𝐹𝑧)) = ((𝐹𝑧)(+g𝐺)(𝐹𝑦)))
142ad3antrrr 743 . . . . . . . . . . 11 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦𝑧) → 𝐺dom DProd 𝑆)
153ad3antrrr 743 . . . . . . . . . . 11 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦𝑧) → dom 𝑆 = 𝐼)
16 simpllr 788 . . . . . . . . . . 11 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦𝑧) → 𝑦𝐼)
17 simplr 781 . . . . . . . . . . 11 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦𝑧) → 𝑧𝐼)
18 simpr 490 . . . . . . . . . . 11 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦𝑧) → 𝑦𝑧)
19 dprdfcntz.z . . . . . . . . . . 11 𝑍 = (Cntz‘𝐺)
2014, 15, 16, 17, 18, 19dprdcntz 20136 . . . . . . . . . 10 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦𝑧) → (𝑆𝑦) ⊆ (𝑍‘(𝑆𝑧)))
211, 2, 3, 4dprdfcl 20141 . . . . . . . . . . 11 ((𝜑𝑦𝐼) → (𝐹𝑦) ∈ (𝑆𝑦))
2221ad2antrr 739 . . . . . . . . . 10 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦𝑧) → (𝐹𝑦) ∈ (𝑆𝑦))
2320, 22sseldd 3935 . . . . . . . . 9 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦𝑧) → (𝐹𝑦) ∈ (𝑍‘(𝑆𝑧)))
241, 2, 3, 4dprdfcl 20141 . . . . . . . . . 10 ((𝜑𝑧𝐼) → (𝐹𝑧) ∈ (𝑆𝑧))
2524ad4ant13 764 . . . . . . . . 9 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦𝑧) → (𝐹𝑧) ∈ (𝑆𝑧))
26 eqid 2762 . . . . . . . . . 10 (+g𝐺) = (+g𝐺)
2726, 19cntzi 19455 . . . . . . . . 9 (((𝐹𝑦) ∈ (𝑍‘(𝑆𝑧)) ∧ (𝐹𝑧) ∈ (𝑆𝑧)) → ((𝐹𝑦)(+g𝐺)(𝐹𝑧)) = ((𝐹𝑧)(+g𝐺)(𝐹𝑦)))
2823, 25, 27syl2anc 596 . . . . . . . 8 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦𝑧) → ((𝐹𝑦)(+g𝐺)(𝐹𝑧)) = ((𝐹𝑧)(+g𝐺)(𝐹𝑦)))
2913, 28pm2.61dane 3044 . . . . . . 7 (((𝜑𝑦𝐼) ∧ 𝑧𝐼) → ((𝐹𝑦)(+g𝐺)(𝐹𝑧)) = ((𝐹𝑧)(+g𝐺)(𝐹𝑦)))
3029ralrimiva 3156 . . . . . 6 ((𝜑𝑦𝐼) → ∀𝑧𝐼 ((𝐹𝑦)(+g𝐺)(𝐹𝑧)) = ((𝐹𝑧)(+g𝐺)(𝐹𝑦)))
317adantr 486 . . . . . . 7 ((𝜑𝑦𝐼) → 𝐹 Fn 𝐼)
32 oveq2 7424 . . . . . . . . 9 (𝑥 = (𝐹𝑧) → ((𝐹𝑦)(+g𝐺)𝑥) = ((𝐹𝑦)(+g𝐺)(𝐹𝑧)))
33 oveq1 7423 . . . . . . . . 9 (𝑥 = (𝐹𝑧) → (𝑥(+g𝐺)(𝐹𝑦)) = ((𝐹𝑧)(+g𝐺)(𝐹𝑦)))
3432, 33eqeq12d 2778 . . . . . . . 8 (𝑥 = (𝐹𝑧) → (((𝐹𝑦)(+g𝐺)𝑥) = (𝑥(+g𝐺)(𝐹𝑦)) ↔ ((𝐹𝑦)(+g𝐺)(𝐹𝑧)) = ((𝐹𝑧)(+g𝐺)(𝐹𝑦))))
3534ralrn 7084 . . . . . . 7 (𝐹 Fn 𝐼 → (∀𝑥 ∈ ran 𝐹((𝐹𝑦)(+g𝐺)𝑥) = (𝑥(+g𝐺)(𝐹𝑦)) ↔ ∀𝑧𝐼 ((𝐹𝑦)(+g𝐺)(𝐹𝑧)) = ((𝐹𝑧)(+g𝐺)(𝐹𝑦))))
3631, 35syl 18 . . . . . 6 ((𝜑𝑦𝐼) → (∀𝑥 ∈ ran 𝐹((𝐹𝑦)(+g𝐺)𝑥) = (𝑥(+g𝐺)(𝐹𝑦)) ↔ ∀𝑧𝐼 ((𝐹𝑦)(+g𝐺)(𝐹𝑧)) = ((𝐹𝑧)(+g𝐺)(𝐹𝑦))))
3730, 36mpbird 260 . . . . 5 ((𝜑𝑦𝐼) → ∀𝑥 ∈ ran 𝐹((𝐹𝑦)(+g𝐺)𝑥) = (𝑥(+g𝐺)(𝐹𝑦)))
386frnd 6715 . . . . . . 7 (𝜑 → ran 𝐹 ⊆ (Base‘𝐺))
3938adantr 486 . . . . . 6 ((𝜑𝑦𝐼) → ran 𝐹 ⊆ (Base‘𝐺))
405, 26, 19elcntz 19448 . . . . . 6 (ran 𝐹 ⊆ (Base‘𝐺) → ((𝐹𝑦) ∈ (𝑍‘ran 𝐹) ↔ ((𝐹𝑦) ∈ (Base‘𝐺) ∧ ∀𝑥 ∈ ran 𝐹((𝐹𝑦)(+g𝐺)𝑥) = (𝑥(+g𝐺)(𝐹𝑦)))))
4139, 40syl 18 . . . . 5 ((𝜑𝑦𝐼) → ((𝐹𝑦) ∈ (𝑍‘ran 𝐹) ↔ ((𝐹𝑦) ∈ (Base‘𝐺) ∧ ∀𝑥 ∈ ran 𝐹((𝐹𝑦)(+g𝐺)𝑥) = (𝑥(+g𝐺)(𝐹𝑦)))))
428, 37, 41mpbir2and 726 . . . 4 ((𝜑𝑦𝐼) → (𝐹𝑦) ∈ (𝑍‘ran 𝐹))
4342ralrimiva 3156 . . 3 (𝜑 → ∀𝑦𝐼 (𝐹𝑦) ∈ (𝑍‘ran 𝐹))
44 ffnfv 7115 . . 3 (𝐹:𝐼⟶(𝑍‘ran 𝐹) ↔ (𝐹 Fn 𝐼 ∧ ∀𝑦𝐼 (𝐹𝑦) ∈ (𝑍‘ran 𝐹)))
457, 43, 44sylanbrc 595 . 2 (𝜑𝐹:𝐼⟶(𝑍‘ran 𝐹))
4645frnd 6715 1 (𝜑 → ran 𝐹 ⊆ (𝑍‘ran 𝐹))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401   = wceq 1570  wcel 2145  wne 2957  wral 3078  {crab 3414  wss 3902   class class class wbr 5107  dom cdm 5659  ran crn 5660   Fn wfn 6532  wf 6533  cfv 6537  (class class class)co 7416  Xcixp 8907   finSupp cfsupp 9334  Basecbs 17303  +gcplusg 17344  Cntzccntz 19441   DProd cdprd 20121
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3064  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7419  df-oprab 7420  df-mpo 7421  df-1st 7989  df-2nd 7990  df-ixp 8908  df-subg 19245  df-cntz 19443  df-dprd 20123
This theorem is used by:  dprdssv  20144  dprdfinv  20147  dprdfadd  20148  dprdfeq0  20150  dprdlub  20154  dmdprdsplitlem  20165  dpjidcl  20186
  Copyright terms: Public domain W3C validator