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.

Step	Hyp	Ref	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‘𝐺)
6	1, 2, 3, 4, 5	dprdff 18457	. . . 4 ⊢ (𝜑 → 𝐹:𝐼⟶(Base‘𝐺))
7		ffn 6083	. . . 4 ⊢ (𝐹:𝐼⟶(Base‘𝐺) → 𝐹 Fn 𝐼)
8	6, 7	syl 17	. . 3 ⊢ (𝜑 → 𝐹 Fn 𝐼)
9	6	ffvelrnda 6399	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (𝐹‘𝑦) ∈ (Base‘𝐺))
10		simpr 476	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝐼) ∧ 𝑧 ∈ 𝐼) ∧ 𝑦 = 𝑧) → 𝑦 = 𝑧)
11	10	fveq2d 6233	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝐼) ∧ 𝑧 ∈ 𝐼) ∧ 𝑦 = 𝑧) → (𝐹‘𝑦) = (𝐹‘𝑧))
12	10	eqcomd 2657	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝐼) ∧ 𝑧 ∈ 𝐼) ∧ 𝑦 = 𝑧) → 𝑧 = 𝑦)
13	12	fveq2d 6233	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝐼) ∧ 𝑧 ∈ 𝐼) ∧ 𝑦 = 𝑧) → (𝐹‘𝑧) = (𝐹‘𝑦))
14	11, 13	oveq12d 6708	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝐼) ∧ 𝑧 ∈ 𝐼) ∧ 𝑦 = 𝑧) → ((𝐹‘𝑦)(+g‘𝐺)(𝐹‘𝑧)) = ((𝐹‘𝑧)(+g‘𝐺)(𝐹‘𝑦)))
15	2	ad3antrrr 766	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝐼) ∧ 𝑧 ∈ 𝐼) ∧ 𝑦 ≠ 𝑧) → 𝐺dom DProd 𝑆)
16	3	ad3antrrr 766	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝐼) ∧ 𝑧 ∈ 𝐼) ∧ 𝑦 ≠ 𝑧) → dom 𝑆 = 𝐼)
17		simpllr 815	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝐼) ∧ 𝑧 ∈ 𝐼) ∧ 𝑦 ≠ 𝑧) → 𝑦 ∈ 𝐼)
18		simplr 807	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝐼) ∧ 𝑧 ∈ 𝐼) ∧ 𝑦 ≠ 𝑧) → 𝑧 ∈ 𝐼)
19		simpr 476	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝐼) ∧ 𝑧 ∈ 𝐼) ∧ 𝑦 ≠ 𝑧) → 𝑦 ≠ 𝑧)
20		dprdfcntz.z	. . . . . . . . . . 11 ⊢ 𝑍 = (Cntz‘𝐺)
21	15, 16, 17, 18, 19, 20	dprdcntz 18453	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝐼) ∧ 𝑧 ∈ 𝐼) ∧ 𝑦 ≠ 𝑧) → (𝑆‘𝑦) ⊆ (𝑍‘(𝑆‘𝑧)))
22	1, 2, 3, 4	dprdfcl 18458	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (𝐹‘𝑦) ∈ (𝑆‘𝑦))
23	22	ad2antrr 762	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝐼) ∧ 𝑧 ∈ 𝐼) ∧ 𝑦 ≠ 𝑧) → (𝐹‘𝑦) ∈ (𝑆‘𝑦))
24	21, 23	sseldd 3637	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝐼) ∧ 𝑧 ∈ 𝐼) ∧ 𝑦 ≠ 𝑧) → (𝐹‘𝑦) ∈ (𝑍‘(𝑆‘𝑧)))
25	1, 2, 3, 4	dprdfcl 18458	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐼) → (𝐹‘𝑧) ∈ (𝑆‘𝑧))
26	25	adantlr 751	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐼) ∧ 𝑧 ∈ 𝐼) → (𝐹‘𝑧) ∈ (𝑆‘𝑧))
27	26	adantr 480	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝐼) ∧ 𝑧 ∈ 𝐼) ∧ 𝑦 ≠ 𝑧) → (𝐹‘𝑧) ∈ (𝑆‘𝑧))
28		eqid 2651	. . . . . . . . . 10 ⊢ (+g‘𝐺) = (+g‘𝐺)
29	28, 20	cntzi 17808	. . . . . . . . 9 ⊢ (((𝐹‘𝑦) ∈ (𝑍‘(𝑆‘𝑧)) ∧ (𝐹‘𝑧) ∈ (𝑆‘𝑧)) → ((𝐹‘𝑦)(+g‘𝐺)(𝐹‘𝑧)) = ((𝐹‘𝑧)(+g‘𝐺)(𝐹‘𝑦)))
30	24, 27, 29	syl2anc 694	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝐼) ∧ 𝑧 ∈ 𝐼) ∧ 𝑦 ≠ 𝑧) → ((𝐹‘𝑦)(+g‘𝐺)(𝐹‘𝑧)) = ((𝐹‘𝑧)(+g‘𝐺)(𝐹‘𝑦)))
31	14, 30	pm2.61dane 2910	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐼) ∧ 𝑧 ∈ 𝐼) → ((𝐹‘𝑦)(+g‘𝐺)(𝐹‘𝑧)) = ((𝐹‘𝑧)(+g‘𝐺)(𝐹‘𝑦)))
32	31	ralrimiva 2995	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → ∀𝑧 ∈ 𝐼 ((𝐹‘𝑦)(+g‘𝐺)(𝐹‘𝑧)) = ((𝐹‘𝑧)(+g‘𝐺)(𝐹‘𝑦)))
33	8	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → 𝐹 Fn 𝐼)
34		oveq2 6698	. . . . . . . . 9 ⊢ (𝑥 = (𝐹‘𝑧) → ((𝐹‘𝑦)(+g‘𝐺)𝑥) = ((𝐹‘𝑦)(+g‘𝐺)(𝐹‘𝑧)))
35		oveq1 6697	. . . . . . . . 9 ⊢ (𝑥 = (𝐹‘𝑧) → (𝑥(+g‘𝐺)(𝐹‘𝑦)) = ((𝐹‘𝑧)(+g‘𝐺)(𝐹‘𝑦)))
36	34, 35	eqeq12d 2666	. . . . . . . 8 ⊢ (𝑥 = (𝐹‘𝑧) → (((𝐹‘𝑦)(+g‘𝐺)𝑥) = (𝑥(+g‘𝐺)(𝐹‘𝑦)) ↔ ((𝐹‘𝑦)(+g‘𝐺)(𝐹‘𝑧)) = ((𝐹‘𝑧)(+g‘𝐺)(𝐹‘𝑦))))
37	36	ralrn 6402	. . . . . . 7 ⊢ (𝐹 Fn 𝐼 → (∀𝑥 ∈ ran 𝐹((𝐹‘𝑦)(+g‘𝐺)𝑥) = (𝑥(+g‘𝐺)(𝐹‘𝑦)) ↔ ∀𝑧 ∈ 𝐼 ((𝐹‘𝑦)(+g‘𝐺)(𝐹‘𝑧)) = ((𝐹‘𝑧)(+g‘𝐺)(𝐹‘𝑦))))
38	33, 37	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (∀𝑥 ∈ ran 𝐹((𝐹‘𝑦)(+g‘𝐺)𝑥) = (𝑥(+g‘𝐺)(𝐹‘𝑦)) ↔ ∀𝑧 ∈ 𝐼 ((𝐹‘𝑦)(+g‘𝐺)(𝐹‘𝑧)) = ((𝐹‘𝑧)(+g‘𝐺)(𝐹‘𝑦))))
39	32, 38	mpbird 247	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → ∀𝑥 ∈ ran 𝐹((𝐹‘𝑦)(+g‘𝐺)𝑥) = (𝑥(+g‘𝐺)(𝐹‘𝑦)))
40		frn 6091	. . . . . . . 8 ⊢ (𝐹:𝐼⟶(Base‘𝐺) → ran 𝐹 ⊆ (Base‘𝐺))
41	6, 40	syl 17	. . . . . . 7 ⊢ (𝜑 → ran 𝐹 ⊆ (Base‘𝐺))
42	41	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → ran 𝐹 ⊆ (Base‘𝐺))
43	5, 28, 20	elcntz 17801	. . . . . 6 ⊢ (ran 𝐹 ⊆ (Base‘𝐺) → ((𝐹‘𝑦) ∈ (𝑍‘ran 𝐹) ↔ ((𝐹‘𝑦) ∈ (Base‘𝐺) ∧ ∀𝑥 ∈ ran 𝐹((𝐹‘𝑦)(+g‘𝐺)𝑥) = (𝑥(+g‘𝐺)(𝐹‘𝑦)))))
44	42, 43	syl 17	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → ((𝐹‘𝑦) ∈ (𝑍‘ran 𝐹) ↔ ((𝐹‘𝑦) ∈ (Base‘𝐺) ∧ ∀𝑥 ∈ ran 𝐹((𝐹‘𝑦)(+g‘𝐺)𝑥) = (𝑥(+g‘𝐺)(𝐹‘𝑦)))))
45	9, 39, 44	mpbir2and 977	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (𝐹‘𝑦) ∈ (𝑍‘ran 𝐹))
46	45	ralrimiva 2995	. . 3 ⊢ (𝜑 → ∀𝑦 ∈ 𝐼 (𝐹‘𝑦) ∈ (𝑍‘ran 𝐹))
47		ffnfv 6428	. . 3 ⊢ (𝐹:𝐼⟶(𝑍‘ran 𝐹) ↔ (𝐹 Fn 𝐼 ∧ ∀𝑦 ∈ 𝐼 (𝐹‘𝑦) ∈ (𝑍‘ran 𝐹)))
48	8, 46, 47	sylanbrc 699	. 2 ⊢ (𝜑 → 𝐹:𝐼⟶(𝑍‘ran 𝐹))
49		frn 6091	. 2 ⊢ (𝐹:𝐼⟶(𝑍‘ran 𝐹) → ran 𝐹 ⊆ (𝑍‘ran 𝐹))
50	48, 49	syl 17	1 ⊢ (𝜑 → ran 𝐹 ⊆ (𝑍‘ran 𝐹))

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