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

Theorem dprdfcntz 20258
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 2763 . . . . 5 (Base‘𝐺) = (Base‘𝐺)
61, 2, 3, 4, 5dprdff 20255 . . . 4 (𝜑 → 𝐹:𝐼⟶(Base‘𝐺))
76ffnd 6729 . . 3 (𝜑 → 𝐹 Fn 𝐼)
86ffvelcdmda 7105 . . . . 5 ((𝜑 ∧ 𝑦 ∈ 𝐼) → (𝐹‘𝑦) ∈ (Base‘𝐺))
9 simpr 490 . . . . . . . . . 10 ((((𝜑 ∧ 𝑦 ∈ 𝐼) ∧ 𝑧 ∈ 𝐼) ∧ 𝑦 = 𝑧) → 𝑦 = 𝑧)
109fveq2d 6909 . . . . . . . . 9 ((((𝜑 ∧ 𝑦 ∈ 𝐼) ∧ 𝑧 ∈ 𝐼) ∧ 𝑦 = 𝑧) → (𝐹‘𝑦) = (𝐹‘𝑧))
119equcomd 2054 . . . . . . . . . 10 ((((𝜑 ∧ 𝑦 ∈ 𝐼) ∧ 𝑧 ∈ 𝐼) ∧ 𝑦 = 𝑧) → 𝑧 = 𝑦)
1211fveq2d 6909 . . . . . . . . 9 ((((𝜑 ∧ 𝑦 ∈ 𝐼) ∧ 𝑧 ∈ 𝐼) ∧ 𝑦 = 𝑧) → (𝐹‘𝑧) = (𝐹‘𝑦))
1310, 12oveq12d 7458 . . . . . . . 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 20251 . . . . . . . . . 10 ((((𝜑 ∧ 𝑦 ∈ 𝐼) ∧ 𝑧 ∈ 𝐼) ∧ 𝑦 ≠ 𝑧) → (𝑆‘𝑦) ⊆ (𝑍‘(𝑆‘𝑧)))
211, 2, 3, 4dprdfcl 20256 . . . . . . . . . . 11 ((𝜑 ∧ 𝑦 ∈ 𝐼) → (𝐹‘𝑦) ∈ (𝑆‘𝑦))
2221ad2antrr 739 . . . . . . . . . 10 ((((𝜑 ∧ 𝑦 ∈ 𝐼) ∧ 𝑧 ∈ 𝐼) ∧ 𝑦 ≠ 𝑧) → (𝐹‘𝑦) ∈ (𝑆‘𝑦))
2320, 22sseldd 3914 . . . . . . . . 9 ((((𝜑 ∧ 𝑦 ∈ 𝐼) ∧ 𝑧 ∈ 𝐼) ∧ 𝑦 ≠ 𝑧) → (𝐹‘𝑦) ∈ (𝑍‘(𝑆‘𝑧)))
241, 2, 3, 4dprdfcl 20256 . . . . . . . . . 10 ((𝜑 ∧ 𝑧 ∈ 𝐼) → (𝐹‘𝑧) ∈ (𝑆‘𝑧))
2524ad4ant13 764 . . . . . . . . 9 ((((𝜑 ∧ 𝑦 ∈ 𝐼) ∧ 𝑧 ∈ 𝐼) ∧ 𝑦 ≠ 𝑧) → (𝐹‘𝑧) ∈ (𝑆‘𝑧))
26 eqid 2763 . . . . . . . . . 10 (+g‘𝐺) = (+g‘𝐺)
2726, 19cntzi 19570 . . . . . . . . 9 (((𝐹‘𝑦) ∈ (𝑍‘(𝑆‘𝑧)) ∧ (𝐹‘𝑧) ∈ (𝑆‘𝑧)) → ((𝐹‘𝑦)(+g‘𝐺)(𝐹‘𝑧)) = ((𝐹‘𝑧)(+g‘𝐺)(𝐹‘𝑦)))
2823, 25, 27syl2anc 596 . . . . . . . 8 ((((𝜑 ∧ 𝑦 ∈ 𝐼) ∧ 𝑧 ∈ 𝐼) ∧ 𝑦 ≠ 𝑧) → ((𝐹‘𝑦)(+g‘𝐺)(𝐹‘𝑧)) = ((𝐹‘𝑧)(+g‘𝐺)(𝐹‘𝑦)))
2913, 28pm2.61dane 3046 . . . . . . 7 (((𝜑 ∧ 𝑦 ∈ 𝐼) ∧ 𝑧 ∈ 𝐼) → ((𝐹‘𝑦)(+g‘𝐺)(𝐹‘𝑧)) = ((𝐹‘𝑧)(+g‘𝐺)(𝐹‘𝑦)))
3029ralrimiva 3158 . . . . . 6 ((𝜑 ∧ 𝑦 ∈ 𝐼) → ∀𝑧 ∈ 𝐼 ((𝐹‘𝑦)(+g‘𝐺)(𝐹‘𝑧)) = ((𝐹‘𝑧)(+g‘𝐺)(𝐹‘𝑦)))
317adantr 486 . . . . . . 7 ((𝜑 ∧ 𝑦 ∈ 𝐼) → 𝐹 Fn 𝐼)
32 oveq2 7448 . . . . . . . . 9 (𝑥 = (𝐹‘𝑧) → ((𝐹‘𝑦)(+g‘𝐺)𝑥) = ((𝐹‘𝑦)(+g‘𝐺)(𝐹‘𝑧)))
33 oveq1 7447 . . . . . . . . 9 (𝑥 = (𝐹‘𝑧) → (𝑥(+g‘𝐺)(𝐹‘𝑦)) = ((𝐹‘𝑧)(+g‘𝐺)(𝐹‘𝑦)))
3432, 33eqeq12d 2779 . . . . . . . 8 (𝑥 = (𝐹‘𝑧) → (((𝐹‘𝑦)(+g‘𝐺)𝑥) = (𝑥(+g‘𝐺)(𝐹‘𝑦)) ↔ ((𝐹‘𝑦)(+g‘𝐺)(𝐹‘𝑧)) = ((𝐹‘𝑧)(+g‘𝐺)(𝐹‘𝑦))))
3534ralrn 7109 . . . . . . 7 (𝐹 Fn 𝐼 → (∀𝑥 ∈ ran 𝐹((𝐹‘𝑦)(+g‘𝐺)𝑥) = (𝑥(+g‘𝐺)(𝐹‘𝑦)) ↔ ∀𝑧 ∈ 𝐼 ((𝐹‘𝑦)(+g‘𝐺)(𝐹‘𝑧)) = ((𝐹‘𝑧)(+g‘𝐺)(𝐹‘𝑦))))
3631, 35syl 18 . . . . . 6 ((𝜑 ∧ 𝑦 ∈ 𝐼) → (∀𝑥 ∈ ran 𝐹((𝐹‘𝑦)(+g‘𝐺)𝑥) = (𝑥(+g‘𝐺)(𝐹‘𝑦)) ↔ ∀𝑧 ∈ 𝐼 ((𝐹‘𝑦)(+g‘𝐺)(𝐹‘𝑧)) = ((𝐹‘𝑧)(+g‘𝐺)(𝐹‘𝑦))))
3730, 36mpbird 260 . . . . 5 ((𝜑 ∧ 𝑦 ∈ 𝐼) → ∀𝑥 ∈ ran 𝐹((𝐹‘𝑦)(+g‘𝐺)𝑥) = (𝑥(+g‘𝐺)(𝐹‘𝑦)))
386frnd 6737 . . . . . . 7 (𝜑 → ran 𝐹 ⊆ (Base‘𝐺))
3938adantr 486 . . . . . 6 ((𝜑 ∧ 𝑦 ∈ 𝐼) → ran 𝐹 ⊆ (Base‘𝐺))
405, 26, 19elcntz 19563 . . . . . 6 (ran 𝐹 ⊆ (Base‘𝐺) → ((𝐹‘𝑦) ∈ (𝑍‘ran 𝐹) ↔ ((𝐹‘𝑦) ∈ (Base‘𝐺) ∧ ∀𝑥 ∈ ran 𝐹((𝐹‘𝑦)(+g‘𝐺)𝑥) = (𝑥(+g‘𝐺)(𝐹‘𝑦)))))
4139, 40syl 18 . . . . 5 ((𝜑 ∧ 𝑦 ∈ 𝐼) → ((𝐹‘𝑦) ∈ (𝑍‘ran 𝐹) ↔ ((𝐹‘𝑦) ∈ (Base‘𝐺) ∧ ∀𝑥 ∈ ran 𝐹((𝐹‘𝑦)(+g‘𝐺)𝑥) = (𝑥(+g‘𝐺)(𝐹‘𝑦)))))
428, 37, 41mpbir2and 726 . . . 4 ((𝜑 ∧ 𝑦 ∈ 𝐼) → (𝐹‘𝑦) ∈ (𝑍‘ran 𝐹))
4342ralrimiva 3158 . . 3 (𝜑 → ∀𝑦 ∈ 𝐼 (𝐹‘𝑦) ∈ (𝑍‘ran 𝐹))
44 ffnfv 7140 . . 3 (𝐹:𝐼⟶(𝑍‘ran 𝐹) ↔ (𝐹 Fn 𝐼 ∧ ∀𝑦 ∈ 𝐼 (𝐹‘𝑦) ∈ (𝑍‘ran 𝐹)))
457, 43, 44sylanbrc 595 . 2 (𝜑 → 𝐹:𝐼⟶(𝑍‘ran 𝐹))
4645frnd 6737 1 (𝜑 → ran 𝐹 ⊆ (𝑍‘ran 𝐹))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  ∀wral 3080  {crab 3416   ⊆ wss 3900   class class class wbr 5106  dom cdm 5655  ran crn 5656   Fn wfn 6550  ⟶wf 6551  ‘cfv 6555  (class class class)co 7440  Xcixp 8950   finSupp cfsupp 9378  Basecbs 17413  +gcplusg 17454  Cntzccntz 19556   DProd cdprd 20236
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-ov 7443  df-oprab 7444  df-mpo 7445  df-1st 8022  df-2nd 8023  df-ixp 8951  df-subg 19359  df-cntz 19558  df-dprd 20238
This theorem is used by:  dprdssv  20259  dprdfinv  20262  dprdfadd  20263  dprdfeq0  20265  dprdlub  20269  dmdprdsplitlem  20280  dpjidcl  20301
  Copyright terms: Public domain W3C validator