prdsmndd - Metamath Proof Explorer

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

Theorem prdsmndd 18658

Description: The product of a family of monoids is a monoid. (Contributed by Stefan O'Rear, 10-Jan-2015.)

**Hypotheses**
Ref	Expression
prdsmndd.y	⊢ 𝑌 = (𝑆X_s𝑅)
prdsmndd.i	⊢ (𝜑 → 𝐼 ∈ 𝑊)
prdsmndd.s	⊢ (𝜑 → 𝑆 ∈ 𝑉)
prdsmndd.r	⊢ (𝜑 → 𝑅:𝐼⟶Mnd)

**Assertion**
Ref	Expression
prdsmndd	⊢ (𝜑 → 𝑌 ∈ Mnd)

Proof of Theorem prdsmndd Dummy variables 𝑎 𝑏 𝑦 𝑐 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqidd 2734	. 2 ⊢ (𝜑 → (Base‘𝑌) = (Base‘𝑌))
2		eqidd 2734	. 2 ⊢ (𝜑 → (+_g‘𝑌) = (+_g‘𝑌))
3		prdsmndd.y	. . . 4 ⊢ 𝑌 = (𝑆X_s𝑅)
4		eqid 2733	. . . 4 ⊢ (Base‘𝑌) = (Base‘𝑌)
5		eqid 2733	. . . 4 ⊢ (+_g‘𝑌) = (+_g‘𝑌)
6		prdsmndd.s	. . . . . 6 ⊢ (𝜑 → 𝑆 ∈ 𝑉)
7	6	elexd 3495	. . . . 5 ⊢ (𝜑 → 𝑆 ∈ V)
8	7	adantr 482	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌))) → 𝑆 ∈ V)
9		prdsmndd.i	. . . . . 6 ⊢ (𝜑 → 𝐼 ∈ 𝑊)
10	9	elexd 3495	. . . . 5 ⊢ (𝜑 → 𝐼 ∈ V)
11	10	adantr 482	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌))) → 𝐼 ∈ V)
12		prdsmndd.r	. . . . 5 ⊢ (𝜑 → 𝑅:𝐼⟶Mnd)
13	12	adantr 482	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌))) → 𝑅:𝐼⟶Mnd)
14		simprl 770	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌))) → 𝑎 ∈ (Base‘𝑌))
15		simprr 772	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌))) → 𝑏 ∈ (Base‘𝑌))
16	3, 4, 5, 8, 11, 13, 14, 15	prdsplusgcl 18656	. . 3 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌))) → (𝑎(+_g‘𝑌)𝑏) ∈ (Base‘𝑌))
17	16	3impb 1116	. 2 ⊢ ((𝜑 ∧ 𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌)) → (𝑎(+_g‘𝑌)𝑏) ∈ (Base‘𝑌))
18	12	ffvelcdmda 7087	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (𝑅‘𝑦) ∈ Mnd)
19	18	adantlr 714	. . . . . 6 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → (𝑅‘𝑦) ∈ Mnd)
20	7	ad2antrr 725	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → 𝑆 ∈ V)
21	10	ad2antrr 725	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → 𝐼 ∈ V)
22	12	ffnd 6719	. . . . . . . 8 ⊢ (𝜑 → 𝑅 Fn 𝐼)
23	22	ad2antrr 725	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → 𝑅 Fn 𝐼)
24		simplr1 1216	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → 𝑎 ∈ (Base‘𝑌))
25		simpr 486	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → 𝑦 ∈ 𝐼)
26	3, 4, 20, 21, 23, 24, 25	prdsbasprj 17418	. . . . . 6 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → (𝑎‘𝑦) ∈ (Base‘(𝑅‘𝑦)))
27		simplr2 1217	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → 𝑏 ∈ (Base‘𝑌))
28	3, 4, 20, 21, 23, 27, 25	prdsbasprj 17418	. . . . . 6 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → (𝑏‘𝑦) ∈ (Base‘(𝑅‘𝑦)))
29		simplr3 1218	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → 𝑐 ∈ (Base‘𝑌))
30	3, 4, 20, 21, 23, 29, 25	prdsbasprj 17418	. . . . . 6 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → (𝑐‘𝑦) ∈ (Base‘(𝑅‘𝑦)))
31		eqid 2733	. . . . . . 7 ⊢ (Base‘(𝑅‘𝑦)) = (Base‘(𝑅‘𝑦))
32		eqid 2733	. . . . . . 7 ⊢ (+_g‘(𝑅‘𝑦)) = (+_g‘(𝑅‘𝑦))
33	31, 32	mndass 18634	. . . . . 6 ⊢ (((𝑅‘𝑦) ∈ Mnd ∧ ((𝑎‘𝑦) ∈ (Base‘(𝑅‘𝑦)) ∧ (𝑏‘𝑦) ∈ (Base‘(𝑅‘𝑦)) ∧ (𝑐‘𝑦) ∈ (Base‘(𝑅‘𝑦)))) → (((𝑎‘𝑦)(+_g‘(𝑅‘𝑦))(𝑏‘𝑦))(+_g‘(𝑅‘𝑦))(𝑐‘𝑦)) = ((𝑎‘𝑦)(+_g‘(𝑅‘𝑦))((𝑏‘𝑦)(+_g‘(𝑅‘𝑦))(𝑐‘𝑦))))
34	19, 26, 28, 30, 33	syl13anc 1373	. . . . 5 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → (((𝑎‘𝑦)(+_g‘(𝑅‘𝑦))(𝑏‘𝑦))(+_g‘(𝑅‘𝑦))(𝑐‘𝑦)) = ((𝑎‘𝑦)(+_g‘(𝑅‘𝑦))((𝑏‘𝑦)(+_g‘(𝑅‘𝑦))(𝑐‘𝑦))))
35	3, 4, 20, 21, 23, 24, 27, 5, 25	prdsplusgfval 17420	. . . . . 6 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → ((𝑎(+_g‘𝑌)𝑏)‘𝑦) = ((𝑎‘𝑦)(+_g‘(𝑅‘𝑦))(𝑏‘𝑦)))
36	35	oveq1d 7424	. . . . 5 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → (((𝑎(+_g‘𝑌)𝑏)‘𝑦)(+_g‘(𝑅‘𝑦))(𝑐‘𝑦)) = (((𝑎‘𝑦)(+_g‘(𝑅‘𝑦))(𝑏‘𝑦))(+_g‘(𝑅‘𝑦))(𝑐‘𝑦)))
37	3, 4, 20, 21, 23, 27, 29, 5, 25	prdsplusgfval 17420	. . . . . 6 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → ((𝑏(+_g‘𝑌)𝑐)‘𝑦) = ((𝑏‘𝑦)(+_g‘(𝑅‘𝑦))(𝑐‘𝑦)))
38	37	oveq2d 7425	. . . . 5 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → ((𝑎‘𝑦)(+_g‘(𝑅‘𝑦))((𝑏(+_g‘𝑌)𝑐)‘𝑦)) = ((𝑎‘𝑦)(+_g‘(𝑅‘𝑦))((𝑏‘𝑦)(+_g‘(𝑅‘𝑦))(𝑐‘𝑦))))
39	34, 36, 38	3eqtr4d 2783	. . . 4 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → (((𝑎(+_g‘𝑌)𝑏)‘𝑦)(+_g‘(𝑅‘𝑦))(𝑐‘𝑦)) = ((𝑎‘𝑦)(+_g‘(𝑅‘𝑦))((𝑏(+_g‘𝑌)𝑐)‘𝑦)))
40	39	mpteq2dva 5249	. . 3 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → (𝑦 ∈ 𝐼 ↦ (((𝑎(+_g‘𝑌)𝑏)‘𝑦)(+_g‘(𝑅‘𝑦))(𝑐‘𝑦))) = (𝑦 ∈ 𝐼 ↦ ((𝑎‘𝑦)(+_g‘(𝑅‘𝑦))((𝑏(+_g‘𝑌)𝑐)‘𝑦))))
41	7	adantr 482	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → 𝑆 ∈ V)
42	10	adantr 482	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → 𝐼 ∈ V)
43	22	adantr 482	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → 𝑅 Fn 𝐼)
44	16	3adantr3 1172	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → (𝑎(+_g‘𝑌)𝑏) ∈ (Base‘𝑌))
45		simpr3 1197	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → 𝑐 ∈ (Base‘𝑌))
46	3, 4, 41, 42, 43, 44, 45, 5	prdsplusgval 17419	. . 3 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → ((𝑎(+_g‘𝑌)𝑏)(+_g‘𝑌)𝑐) = (𝑦 ∈ 𝐼 ↦ (((𝑎(+_g‘𝑌)𝑏)‘𝑦)(+_g‘(𝑅‘𝑦))(𝑐‘𝑦))))
47		simpr1 1195	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → 𝑎 ∈ (Base‘𝑌))
48	12	adantr 482	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → 𝑅:𝐼⟶Mnd)
49		simpr2 1196	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → 𝑏 ∈ (Base‘𝑌))
50	3, 4, 5, 41, 42, 48, 49, 45	prdsplusgcl 18656	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → (𝑏(+_g‘𝑌)𝑐) ∈ (Base‘𝑌))
51	3, 4, 41, 42, 43, 47, 50, 5	prdsplusgval 17419	. . 3 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → (𝑎(+_g‘𝑌)(𝑏(+_g‘𝑌)𝑐)) = (𝑦 ∈ 𝐼 ↦ ((𝑎‘𝑦)(+_g‘(𝑅‘𝑦))((𝑏(+_g‘𝑌)𝑐)‘𝑦))))
52	40, 46, 51	3eqtr4d 2783	. 2 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → ((𝑎(+_g‘𝑌)𝑏)(+_g‘𝑌)𝑐) = (𝑎(+_g‘𝑌)(𝑏(+_g‘𝑌)𝑐)))
53		eqid 2733	. . . 4 ⊢ (0_g ∘ 𝑅) = (0_g ∘ 𝑅)
54	3, 4, 5, 7, 10, 12, 53	prdsidlem 18657	. . 3 ⊢ (𝜑 → ((0_g ∘ 𝑅) ∈ (Base‘𝑌) ∧ ∀𝑎 ∈ (Base‘𝑌)(((0_g ∘ 𝑅)(+_g‘𝑌)𝑎) = 𝑎 ∧ (𝑎(+_g‘𝑌)(0_g ∘ 𝑅)) = 𝑎)))
55	54	simpld 496	. 2 ⊢ (𝜑 → (0_g ∘ 𝑅) ∈ (Base‘𝑌))
56	54	simprd 497	. . . 4 ⊢ (𝜑 → ∀𝑎 ∈ (Base‘𝑌)(((0_g ∘ 𝑅)(+_g‘𝑌)𝑎) = 𝑎 ∧ (𝑎(+_g‘𝑌)(0_g ∘ 𝑅)) = 𝑎))
57	56	r19.21bi 3249	. . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ (Base‘𝑌)) → (((0_g ∘ 𝑅)(+_g‘𝑌)𝑎) = 𝑎 ∧ (𝑎(+_g‘𝑌)(0_g ∘ 𝑅)) = 𝑎))
58	57	simpld 496	. 2 ⊢ ((𝜑 ∧ 𝑎 ∈ (Base‘𝑌)) → ((0_g ∘ 𝑅)(+_g‘𝑌)𝑎) = 𝑎)
59	57	simprd 497	. 2 ⊢ ((𝜑 ∧ 𝑎 ∈ (Base‘𝑌)) → (𝑎(+_g‘𝑌)(0_g ∘ 𝑅)) = 𝑎)
60	1, 2, 17, 52, 55, 58, 59	ismndd 18647	1 ⊢ (𝜑 → 𝑌 ∈ Mnd)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 397 ∧ w3a 1088 = wceq 1542 ∈ wcel 2107 ∀wral 3062 Vcvv 3475 ↦ cmpt 5232 ∘ ccom 5681 Fn wfn 6539 ⟶wf 6540 ‘cfv 6544 (class class class)co 7409 Basecbs 17144 +_gcplusg 17197 0_gc0g 17385 X_scprds 17391 Mndcmnd 18625

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-cnex 11166 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-mulcom 11174 ax-addass 11175 ax-mulass 11176 ax-distr 11177 ax-i2m1 11178 ax-1ne0 11179 ax-1rid 11180 ax-rnegex 11181 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 ax-pre-ltadd 11186 ax-pre-mulgt0 11187

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-tp 4634 df-op 4636 df-uni 4910 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-riota 7365 df-ov 7412 df-oprab 7413 df-mpo 7414 df-om 7856 df-1st 7975 df-2nd 7976 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-rdg 8410 df-1o 8466 df-er 8703 df-map 8822 df-ixp 8892 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-sup 9437 df-pnf 11250 df-mnf 11251 df-xr 11252 df-ltxr 11253 df-le 11254 df-sub 11446 df-neg 11447 df-nn 12213 df-2 12275 df-3 12276 df-4 12277 df-5 12278 df-6 12279 df-7 12280 df-8 12281 df-9 12282 df-n0 12473 df-z 12559 df-dec 12678 df-uz 12823 df-fz 13485 df-struct 17080 df-slot 17115 df-ndx 17127 df-base 17145 df-plusg 17210 df-mulr 17211 df-sca 17213 df-vsca 17214 df-ip 17215 df-tset 17216 df-ple 17217 df-ds 17219 df-hom 17221 df-cco 17222 df-0g 17387 df-prds 17393 df-mgm 18561 df-sgrp 18610 df-mnd 18626

This theorem is referenced by: prds0g 18659 pwsmnd 18660 xpsmnd 18665 prdspjmhm 18710 prdsgrpd 18933 prdscmnd 19729 prdsringd 20134 dsmm0cl 21295 prdstmdd 23628

W3C validator