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

Theorem dprdfcntz 18414
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 2622 . . . . 5 (Base‘𝐺) = (Base‘𝐺)
61, 2, 3, 4, 5dprdff 18411 . . . 4 (𝜑𝐹:𝐼⟶(Base‘𝐺))
7 ffn 6045 . . . 4 (𝐹:𝐼⟶(Base‘𝐺) → 𝐹 Fn 𝐼)
86, 7syl 17 . . 3 (𝜑𝐹 Fn 𝐼)
96ffvelrnda 6359 . . . . 5 ((𝜑𝑦𝐼) → (𝐹𝑦) ∈ (Base‘𝐺))
10 simpr 477 . . . . . . . . . 10 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦 = 𝑧) → 𝑦 = 𝑧)
1110fveq2d 6195 . . . . . . . . 9 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦 = 𝑧) → (𝐹𝑦) = (𝐹𝑧))
1210eqcomd 2628 . . . . . . . . . 10 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦 = 𝑧) → 𝑧 = 𝑦)
1312fveq2d 6195 . . . . . . . . 9 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦 = 𝑧) → (𝐹𝑧) = (𝐹𝑦))
1411, 13oveq12d 6668 . . . . . . . 8 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦 = 𝑧) → ((𝐹𝑦)(+g𝐺)(𝐹𝑧)) = ((𝐹𝑧)(+g𝐺)(𝐹𝑦)))
152ad3antrrr 766 . . . . . . . . . . 11 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦𝑧) → 𝐺dom DProd 𝑆)
163ad3antrrr 766 . . . . . . . . . . 11 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦𝑧) → dom 𝑆 = 𝐼)
17 simpllr 799 . . . . . . . . . . 11 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦𝑧) → 𝑦𝐼)
18 simplr 792 . . . . . . . . . . 11 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦𝑧) → 𝑧𝐼)
19 simpr 477 . . . . . . . . . . 11 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦𝑧) → 𝑦𝑧)
20 dprdfcntz.z . . . . . . . . . . 11 𝑍 = (Cntz‘𝐺)
2115, 16, 17, 18, 19, 20dprdcntz 18407 . . . . . . . . . 10 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦𝑧) → (𝑆𝑦) ⊆ (𝑍‘(𝑆𝑧)))
221, 2, 3, 4dprdfcl 18412 . . . . . . . . . . 11 ((𝜑𝑦𝐼) → (𝐹𝑦) ∈ (𝑆𝑦))
2322ad2antrr 762 . . . . . . . . . 10 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦𝑧) → (𝐹𝑦) ∈ (𝑆𝑦))
2421, 23sseldd 3604 . . . . . . . . 9 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦𝑧) → (𝐹𝑦) ∈ (𝑍‘(𝑆𝑧)))
251, 2, 3, 4dprdfcl 18412 . . . . . . . . . . 11 ((𝜑𝑧𝐼) → (𝐹𝑧) ∈ (𝑆𝑧))
2625adantlr 751 . . . . . . . . . 10 (((𝜑𝑦𝐼) ∧ 𝑧𝐼) → (𝐹𝑧) ∈ (𝑆𝑧))
2726adantr 481 . . . . . . . . 9 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦𝑧) → (𝐹𝑧) ∈ (𝑆𝑧))
28 eqid 2622 . . . . . . . . . 10 (+g𝐺) = (+g𝐺)
2928, 20cntzi 17762 . . . . . . . . 9 (((𝐹𝑦) ∈ (𝑍‘(𝑆𝑧)) ∧ (𝐹𝑧) ∈ (𝑆𝑧)) → ((𝐹𝑦)(+g𝐺)(𝐹𝑧)) = ((𝐹𝑧)(+g𝐺)(𝐹𝑦)))
3024, 27, 29syl2anc 693 . . . . . . . 8 ((((𝜑𝑦𝐼) ∧ 𝑧𝐼) ∧ 𝑦𝑧) → ((𝐹𝑦)(+g𝐺)(𝐹𝑧)) = ((𝐹𝑧)(+g𝐺)(𝐹𝑦)))
3114, 30pm2.61dane 2881 . . . . . . 7 (((𝜑𝑦𝐼) ∧ 𝑧𝐼) → ((𝐹𝑦)(+g𝐺)(𝐹𝑧)) = ((𝐹𝑧)(+g𝐺)(𝐹𝑦)))
3231ralrimiva 2966 . . . . . 6 ((𝜑𝑦𝐼) → ∀𝑧𝐼 ((𝐹𝑦)(+g𝐺)(𝐹𝑧)) = ((𝐹𝑧)(+g𝐺)(𝐹𝑦)))
338adantr 481 . . . . . . 7 ((𝜑𝑦𝐼) → 𝐹 Fn 𝐼)
34 oveq2 6658 . . . . . . . . 9 (𝑥 = (𝐹𝑧) → ((𝐹𝑦)(+g𝐺)𝑥) = ((𝐹𝑦)(+g𝐺)(𝐹𝑧)))
35 oveq1 6657 . . . . . . . . 9 (𝑥 = (𝐹𝑧) → (𝑥(+g𝐺)(𝐹𝑦)) = ((𝐹𝑧)(+g𝐺)(𝐹𝑦)))
3634, 35eqeq12d 2637 . . . . . . . 8 (𝑥 = (𝐹𝑧) → (((𝐹𝑦)(+g𝐺)𝑥) = (𝑥(+g𝐺)(𝐹𝑦)) ↔ ((𝐹𝑦)(+g𝐺)(𝐹𝑧)) = ((𝐹𝑧)(+g𝐺)(𝐹𝑦))))
3736ralrn 6362 . . . . . . 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 6053 . . . . . . . 8 (𝐹:𝐼⟶(Base‘𝐺) → ran 𝐹 ⊆ (Base‘𝐺))
416, 40syl 17 . . . . . . 7 (𝜑 → ran 𝐹 ⊆ (Base‘𝐺))
4241adantr 481 . . . . . 6 ((𝜑𝑦𝐼) → ran 𝐹 ⊆ (Base‘𝐺))
435, 28, 20elcntz 17755 . . . . . 6 (ran 𝐹 ⊆ (Base‘𝐺) → ((𝐹𝑦) ∈ (𝑍‘ran 𝐹) ↔ ((𝐹𝑦) ∈ (Base‘𝐺) ∧ ∀𝑥 ∈ ran 𝐹((𝐹𝑦)(+g𝐺)𝑥) = (𝑥(+g𝐺)(𝐹𝑦)))))
4442, 43syl 17 . . . . 5 ((𝜑𝑦𝐼) → ((𝐹𝑦) ∈ (𝑍‘ran 𝐹) ↔ ((𝐹𝑦) ∈ (Base‘𝐺) ∧ ∀𝑥 ∈ ran 𝐹((𝐹𝑦)(+g𝐺)𝑥) = (𝑥(+g𝐺)(𝐹𝑦)))))
459, 39, 44mpbir2and 957 . . . 4 ((𝜑𝑦𝐼) → (𝐹𝑦) ∈ (𝑍‘ran 𝐹))
4645ralrimiva 2966 . . 3 (𝜑 → ∀𝑦𝐼 (𝐹𝑦) ∈ (𝑍‘ran 𝐹))
47 ffnfv 6388 . . 3 (𝐹:𝐼⟶(𝑍‘ran 𝐹) ↔ (𝐹 Fn 𝐼 ∧ ∀𝑦𝐼 (𝐹𝑦) ∈ (𝑍‘ran 𝐹)))
488, 46, 47sylanbrc 698 . 2 (𝜑𝐹:𝐼⟶(𝑍‘ran 𝐹))
49 frn 6053 . 2 (𝐹:𝐼⟶(𝑍‘ran 𝐹) → ran 𝐹 ⊆ (𝑍‘ran 𝐹))
5048, 49syl 17 1 (𝜑 → ran 𝐹 ⊆ (𝑍‘ran 𝐹))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 384   = wceq 1483  wcel 1990  wne 2794  wral 2912  {crab 2916  wss 3574   class class class wbr 4653  dom cdm 5114  ran crn 5115   Fn wfn 5883  wf 5884  cfv 5888  (class class class)co 6650  Xcixp 7908   finSupp cfsupp 8275  Basecbs 15857  +gcplusg 15941  Cntzccntz 17748   DProd cdprd 18392
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-nel 2898  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-1st 7168  df-2nd 7169  df-ixp 7909  df-subg 17591  df-cntz 17750  df-dprd 18394
This theorem is referenced by:  dprdssv  18415  dprdfinv  18418  dprdfadd  18419  dprdfeq0  18421  dprdlub  18425  dmdprdsplitlem  18436  dpjidcl  18457
  Copyright terms: Public domain W3C validator