Theorem prdsmndd 18805

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

Hypotheses

Ref	Expression
prdsmndd.y	⊢ 𝑌 = (𝑆Xs𝑅)
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 2741	. 2 ⊢ (𝜑 → (Base‘𝑌) = (Base‘𝑌))
2		eqidd 2741	. 2 ⊢ (𝜑 → (+g‘𝑌) = (+g‘𝑌))
3		prdsmndd.y	. . . 4 ⊢ 𝑌 = (𝑆Xs𝑅)
4		eqid 2740	. . . 4 ⊢ (Base‘𝑌) = (Base‘𝑌)
5		eqid 2740	. . . 4 ⊢ (+g‘𝑌) = (+g‘𝑌)
6		prdsmndd.s	. . . . . 6 ⊢ (𝜑 → 𝑆 ∈ 𝑉)
7	6	elexd 3512	. . . . 5 ⊢ (𝜑 → 𝑆 ∈ V)
8	7	adantr 480	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌))) → 𝑆 ∈ V)
9		prdsmndd.i	. . . . . 6 ⊢ (𝜑 → 𝐼 ∈ 𝑊)
10	9	elexd 3512	. . . . 5 ⊢ (𝜑 → 𝐼 ∈ V)
11	10	adantr 480	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌))) → 𝐼 ∈ V)
12		prdsmndd.r	. . . . 5 ⊢ (𝜑 → 𝑅:𝐼⟶Mnd)
13	12	adantr 480	. . . 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 18803	. . 3 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌))) → (𝑎(+g‘𝑌)𝑏) ∈ (Base‘𝑌))
17	16	3impb 1115	. 2 ⊢ ((𝜑 ∧ 𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌)) → (𝑎(+g‘𝑌)𝑏) ∈ (Base‘𝑌))
18	12	ffvelcdmda 7118	. . . . . . 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 6748	. . . . . . . 8 ⊢ (𝜑 → 𝑅 Fn 𝐼)
23	22	ad2antrr 725	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → 𝑅 Fn 𝐼)
24		simplr1 1215	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → 𝑎 ∈ (Base‘𝑌))
25		simpr 484	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → 𝑦 ∈ 𝐼)
26	3, 4, 20, 21, 23, 24, 25	prdsbasprj 17532	. . . . . 6 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → (𝑎‘𝑦) ∈ (Base‘(𝑅‘𝑦)))
27		simplr2 1216	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → 𝑏 ∈ (Base‘𝑌))
28	3, 4, 20, 21, 23, 27, 25	prdsbasprj 17532	. . . . . 6 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → (𝑏‘𝑦) ∈ (Base‘(𝑅‘𝑦)))
29		simplr3 1217	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → 𝑐 ∈ (Base‘𝑌))
30	3, 4, 20, 21, 23, 29, 25	prdsbasprj 17532	. . . . . 6 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → (𝑐‘𝑦) ∈ (Base‘(𝑅‘𝑦)))
31		eqid 2740	. . . . . . 7 ⊢ (Base‘(𝑅‘𝑦)) = (Base‘(𝑅‘𝑦))
32		eqid 2740	. . . . . . 7 ⊢ (+g‘(𝑅‘𝑦)) = (+g‘(𝑅‘𝑦))
33	31, 32	mndass 18781	. . . . . 6 ⊢ (((𝑅‘𝑦) ∈ Mnd ∧ ((𝑎‘𝑦) ∈ (Base‘(𝑅‘𝑦)) ∧ (𝑏‘𝑦) ∈ (Base‘(𝑅‘𝑦)) ∧ (𝑐‘𝑦) ∈ (Base‘(𝑅‘𝑦)))) → (((𝑎‘𝑦)(+g‘(𝑅‘𝑦))(𝑏‘𝑦))(+g‘(𝑅‘𝑦))(𝑐‘𝑦)) = ((𝑎‘𝑦)(+g‘(𝑅‘𝑦))((𝑏‘𝑦)(+g‘(𝑅‘𝑦))(𝑐‘𝑦))))
34	19, 26, 28, 30, 33	syl13anc 1372	. . . . 5 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → (((𝑎‘𝑦)(+g‘(𝑅‘𝑦))(𝑏‘𝑦))(+g‘(𝑅‘𝑦))(𝑐‘𝑦)) = ((𝑎‘𝑦)(+g‘(𝑅‘𝑦))((𝑏‘𝑦)(+g‘(𝑅‘𝑦))(𝑐‘𝑦))))
35	3, 4, 20, 21, 23, 24, 27, 5, 25	prdsplusgfval 17534	. . . . . 6 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → ((𝑎(+g‘𝑌)𝑏)‘𝑦) = ((𝑎‘𝑦)(+g‘(𝑅‘𝑦))(𝑏‘𝑦)))
36	35	oveq1d 7463	. . . . 5 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → (((𝑎(+g‘𝑌)𝑏)‘𝑦)(+g‘(𝑅‘𝑦))(𝑐‘𝑦)) = (((𝑎‘𝑦)(+g‘(𝑅‘𝑦))(𝑏‘𝑦))(+g‘(𝑅‘𝑦))(𝑐‘𝑦)))
37	3, 4, 20, 21, 23, 27, 29, 5, 25	prdsplusgfval 17534	. . . . . 6 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → ((𝑏(+g‘𝑌)𝑐)‘𝑦) = ((𝑏‘𝑦)(+g‘(𝑅‘𝑦))(𝑐‘𝑦)))
38	37	oveq2d 7464	. . . . 5 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → ((𝑎‘𝑦)(+g‘(𝑅‘𝑦))((𝑏(+g‘𝑌)𝑐)‘𝑦)) = ((𝑎‘𝑦)(+g‘(𝑅‘𝑦))((𝑏‘𝑦)(+g‘(𝑅‘𝑦))(𝑐‘𝑦))))
39	34, 36, 38	3eqtr4d 2790	. . . 4 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → (((𝑎(+g‘𝑌)𝑏)‘𝑦)(+g‘(𝑅‘𝑦))(𝑐‘𝑦)) = ((𝑎‘𝑦)(+g‘(𝑅‘𝑦))((𝑏(+g‘𝑌)𝑐)‘𝑦)))
40	39	mpteq2dva 5266	. . 3 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → (𝑦 ∈ 𝐼 ↦ (((𝑎(+g‘𝑌)𝑏)‘𝑦)(+g‘(𝑅‘𝑦))(𝑐‘𝑦))) = (𝑦 ∈ 𝐼 ↦ ((𝑎‘𝑦)(+g‘(𝑅‘𝑦))((𝑏(+g‘𝑌)𝑐)‘𝑦))))
41	7	adantr 480	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → 𝑆 ∈ V)
42	10	adantr 480	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → 𝐼 ∈ V)
43	22	adantr 480	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → 𝑅 Fn 𝐼)
44	16	3adantr3 1171	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → (𝑎(+g‘𝑌)𝑏) ∈ (Base‘𝑌))
45		simpr3 1196	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → 𝑐 ∈ (Base‘𝑌))
46	3, 4, 41, 42, 43, 44, 45, 5	prdsplusgval 17533	. . 3 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → ((𝑎(+g‘𝑌)𝑏)(+g‘𝑌)𝑐) = (𝑦 ∈ 𝐼 ↦ (((𝑎(+g‘𝑌)𝑏)‘𝑦)(+g‘(𝑅‘𝑦))(𝑐‘𝑦))))
47		simpr1 1194	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → 𝑎 ∈ (Base‘𝑌))
48	12	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → 𝑅:𝐼⟶Mnd)
49		simpr2 1195	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → 𝑏 ∈ (Base‘𝑌))
50	3, 4, 5, 41, 42, 48, 49, 45	prdsplusgcl 18803	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → (𝑏(+g‘𝑌)𝑐) ∈ (Base‘𝑌))
51	3, 4, 41, 42, 43, 47, 50, 5	prdsplusgval 17533	. . 3 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → (𝑎(+g‘𝑌)(𝑏(+g‘𝑌)𝑐)) = (𝑦 ∈ 𝐼 ↦ ((𝑎‘𝑦)(+g‘(𝑅‘𝑦))((𝑏(+g‘𝑌)𝑐)‘𝑦))))
52	40, 46, 51	3eqtr4d 2790	. 2 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → ((𝑎(+g‘𝑌)𝑏)(+g‘𝑌)𝑐) = (𝑎(+g‘𝑌)(𝑏(+g‘𝑌)𝑐)))
53		eqid 2740	. . . 4 ⊢ (0g ∘ 𝑅) = (0g ∘ 𝑅)
54	3, 4, 5, 7, 10, 12, 53	prdsidlem 18804	. . 3 ⊢ (𝜑 → ((0g ∘ 𝑅) ∈ (Base‘𝑌) ∧ ∀𝑎 ∈ (Base‘𝑌)(((0g ∘ 𝑅)(+g‘𝑌)𝑎) = 𝑎 ∧ (𝑎(+g‘𝑌)(0g ∘ 𝑅)) = 𝑎)))
55	54	simpld 494	. 2 ⊢ (𝜑 → (0g ∘ 𝑅) ∈ (Base‘𝑌))
56	54	simprd 495	. . . 4 ⊢ (𝜑 → ∀𝑎 ∈ (Base‘𝑌)(((0g ∘ 𝑅)(+g‘𝑌)𝑎) = 𝑎 ∧ (𝑎(+g‘𝑌)(0g ∘ 𝑅)) = 𝑎))
57	56	r19.21bi 3257	. . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ (Base‘𝑌)) → (((0g ∘ 𝑅)(+g‘𝑌)𝑎) = 𝑎 ∧ (𝑎(+g‘𝑌)(0g ∘ 𝑅)) = 𝑎))
58	57	simpld 494	. 2 ⊢ ((𝜑 ∧ 𝑎 ∈ (Base‘𝑌)) → ((0g ∘ 𝑅)(+g‘𝑌)𝑎) = 𝑎)
59	57	simprd 495	. 2 ⊢ ((𝜑 ∧ 𝑎 ∈ (Base‘𝑌)) → (𝑎(+g‘𝑌)(0g ∘ 𝑅)) = 𝑎)
60	1, 2, 17, 52, 55, 58, 59	ismndd 18794	1 ⊢ (𝜑 → 𝑌 ∈ Mnd)

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1087   = wceq 1537   ∈ wcel 2108  ∀wral 3067  Vcvv 3488   ↦ cmpt 5249   ∘ ccom 5704   Fn wfn 6568  ⟶wf 6569  ‘cfv 6573  (class class class)co 7448  Basecbs 17258  +_gcplusg 17311  0_gc0g 17499  X_scprds 17505  Mndcmnd 18772

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770  ax-cnex 11240  ax-resscn 11241  ax-1cn 11242  ax-icn 11243  ax-addcl 11244  ax-addrcl 11245  ax-mulcl 11246  ax-mulrcl 11247  ax-mulcom 11248  ax-addass 11249  ax-mulass 11250  ax-distr 11251  ax-i2m1 11252  ax-1ne0 11253  ax-1rid 11254  ax-rnegex 11255  ax-rrecex 11256  ax-cnre 11257  ax-pre-lttri 11258  ax-pre-lttrn 11259  ax-pre-ltadd 11260  ax-pre-mulgt0 11261

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-nel 3053  df-ral 3068  df-rex 3077  df-rmo 3388  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-tp 4653  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-tr 5284  df-id 5593  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-we 5654  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-pred 6332  df-ord 6398  df-on 6399  df-lim 6400  df-suc 6401  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-riota 7404  df-ov 7451  df-oprab 7452  df-mpo 7453  df-om 7904  df-1st 8030  df-2nd 8031  df-frecs 8322  df-wrecs 8353  df-recs 8427  df-rdg 8466  df-1o 8522  df-er 8763  df-map 8886  df-ixp 8956  df-en 9004  df-dom 9005  df-sdom 9006  df-fin 9007  df-sup 9511  df-pnf 11326  df-mnf 11327  df-xr 11328  df-ltxr 11329  df-le 11330  df-sub 11522  df-neg 11523  df-nn 12294  df-2 12356  df-3 12357  df-4 12358  df-5 12359  df-6 12360  df-7 12361  df-8 12362  df-9 12363  df-n0 12554  df-z 12640  df-dec 12759  df-uz 12904  df-fz 13568  df-struct 17194  df-slot 17229  df-ndx 17241  df-base 17259  df-plusg 17324  df-mulr 17325  df-sca 17327  df-vsca 17328  df-ip 17329  df-tset 17330  df-ple 17331  df-ds 17333  df-hom 17335  df-cco 17336  df-0g 17501  df-prds 17507  df-mgm 18678  df-sgrp 18757  df-mnd 18773

This theorem is referenced by:  prds0g  18806  pwsmnd  18807  xpsmnd  18812  prdspjmhm  18864  prdsgrpd  19090  prdscmnd  19903  prdsringd  20344  dsmm0cl  21783  prdstmdd  24153