Theorem prdsmndd 18673

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 2730	. 2 ⊢ (𝜑 → (Base‘𝑌) = (Base‘𝑌))
2		eqidd 2730	. 2 ⊢ (𝜑 → (+g‘𝑌) = (+g‘𝑌))
3		prdsmndd.y	. . . 4 ⊢ 𝑌 = (𝑆Xs𝑅)
4		eqid 2729	. . . 4 ⊢ (Base‘𝑌) = (Base‘𝑌)
5		eqid 2729	. . . 4 ⊢ (+g‘𝑌) = (+g‘𝑌)
6		prdsmndd.s	. . . . . 6 ⊢ (𝜑 → 𝑆 ∈ 𝑉)
7	6	elexd 3468	. . . . 5 ⊢ (𝜑 → 𝑆 ∈ V)
8	7	adantr 480	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌))) → 𝑆 ∈ V)
9		prdsmndd.i	. . . . . 6 ⊢ (𝜑 → 𝐼 ∈ 𝑊)
10	9	elexd 3468	. . . . 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 18671	. . 3 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌))) → (𝑎(+g‘𝑌)𝑏) ∈ (Base‘𝑌))
17	16	3impb 1114	. 2 ⊢ ((𝜑 ∧ 𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌)) → (𝑎(+g‘𝑌)𝑏) ∈ (Base‘𝑌))
18	12	ffvelcdmda 7038	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (𝑅‘𝑦) ∈ Mnd)
19	18	adantlr 715	. . . . . 6 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → (𝑅‘𝑦) ∈ Mnd)
20	7	ad2antrr 726	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → 𝑆 ∈ V)
21	10	ad2antrr 726	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → 𝐼 ∈ V)
22	12	ffnd 6671	. . . . . . . 8 ⊢ (𝜑 → 𝑅 Fn 𝐼)
23	22	ad2antrr 726	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → 𝑅 Fn 𝐼)
24		simplr1 1216	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → 𝑎 ∈ (Base‘𝑌))
25		simpr 484	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → 𝑦 ∈ 𝐼)
26	3, 4, 20, 21, 23, 24, 25	prdsbasprj 17411	. . . . . 6 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → (𝑎‘𝑦) ∈ (Base‘(𝑅‘𝑦)))
27		simplr2 1217	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → 𝑏 ∈ (Base‘𝑌))
28	3, 4, 20, 21, 23, 27, 25	prdsbasprj 17411	. . . . . 6 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → (𝑏‘𝑦) ∈ (Base‘(𝑅‘𝑦)))
29		simplr3 1218	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → 𝑐 ∈ (Base‘𝑌))
30	3, 4, 20, 21, 23, 29, 25	prdsbasprj 17411	. . . . . 6 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → (𝑐‘𝑦) ∈ (Base‘(𝑅‘𝑦)))
31		eqid 2729	. . . . . . 7 ⊢ (Base‘(𝑅‘𝑦)) = (Base‘(𝑅‘𝑦))
32		eqid 2729	. . . . . . 7 ⊢ (+g‘(𝑅‘𝑦)) = (+g‘(𝑅‘𝑦))
33	31, 32	mndass 18646	. . . . . 6 ⊢ (((𝑅‘𝑦) ∈ Mnd ∧ ((𝑎‘𝑦) ∈ (Base‘(𝑅‘𝑦)) ∧ (𝑏‘𝑦) ∈ (Base‘(𝑅‘𝑦)) ∧ (𝑐‘𝑦) ∈ (Base‘(𝑅‘𝑦)))) → (((𝑎‘𝑦)(+g‘(𝑅‘𝑦))(𝑏‘𝑦))(+g‘(𝑅‘𝑦))(𝑐‘𝑦)) = ((𝑎‘𝑦)(+g‘(𝑅‘𝑦))((𝑏‘𝑦)(+g‘(𝑅‘𝑦))(𝑐‘𝑦))))
34	19, 26, 28, 30, 33	syl13anc 1374	. . . . 5 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → (((𝑎‘𝑦)(+g‘(𝑅‘𝑦))(𝑏‘𝑦))(+g‘(𝑅‘𝑦))(𝑐‘𝑦)) = ((𝑎‘𝑦)(+g‘(𝑅‘𝑦))((𝑏‘𝑦)(+g‘(𝑅‘𝑦))(𝑐‘𝑦))))
35	3, 4, 20, 21, 23, 24, 27, 5, 25	prdsplusgfval 17413	. . . . . 6 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → ((𝑎(+g‘𝑌)𝑏)‘𝑦) = ((𝑎‘𝑦)(+g‘(𝑅‘𝑦))(𝑏‘𝑦)))
36	35	oveq1d 7384	. . . . 5 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → (((𝑎(+g‘𝑌)𝑏)‘𝑦)(+g‘(𝑅‘𝑦))(𝑐‘𝑦)) = (((𝑎‘𝑦)(+g‘(𝑅‘𝑦))(𝑏‘𝑦))(+g‘(𝑅‘𝑦))(𝑐‘𝑦)))
37	3, 4, 20, 21, 23, 27, 29, 5, 25	prdsplusgfval 17413	. . . . . 6 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → ((𝑏(+g‘𝑌)𝑐)‘𝑦) = ((𝑏‘𝑦)(+g‘(𝑅‘𝑦))(𝑐‘𝑦)))
38	37	oveq2d 7385	. . . . 5 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → ((𝑎‘𝑦)(+g‘(𝑅‘𝑦))((𝑏(+g‘𝑌)𝑐)‘𝑦)) = ((𝑎‘𝑦)(+g‘(𝑅‘𝑦))((𝑏‘𝑦)(+g‘(𝑅‘𝑦))(𝑐‘𝑦))))
39	34, 36, 38	3eqtr4d 2774	. . . 4 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → (((𝑎(+g‘𝑌)𝑏)‘𝑦)(+g‘(𝑅‘𝑦))(𝑐‘𝑦)) = ((𝑎‘𝑦)(+g‘(𝑅‘𝑦))((𝑏(+g‘𝑌)𝑐)‘𝑦)))
40	39	mpteq2dva 5195	. . 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 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 17412	. . 3 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → ((𝑎(+g‘𝑌)𝑏)(+g‘𝑌)𝑐) = (𝑦 ∈ 𝐼 ↦ (((𝑎(+g‘𝑌)𝑏)‘𝑦)(+g‘(𝑅‘𝑦))(𝑐‘𝑦))))
47		simpr1 1195	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → 𝑎 ∈ (Base‘𝑌))
48	12	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → 𝑅:𝐼⟶Mnd)
49		simpr2 1196	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → 𝑏 ∈ (Base‘𝑌))
50	3, 4, 5, 41, 42, 48, 49, 45	prdsplusgcl 18671	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → (𝑏(+g‘𝑌)𝑐) ∈ (Base‘𝑌))
51	3, 4, 41, 42, 43, 47, 50, 5	prdsplusgval 17412	. . 3 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → (𝑎(+g‘𝑌)(𝑏(+g‘𝑌)𝑐)) = (𝑦 ∈ 𝐼 ↦ ((𝑎‘𝑦)(+g‘(𝑅‘𝑦))((𝑏(+g‘𝑌)𝑐)‘𝑦))))
52	40, 46, 51	3eqtr4d 2774	. 2 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → ((𝑎(+g‘𝑌)𝑏)(+g‘𝑌)𝑐) = (𝑎(+g‘𝑌)(𝑏(+g‘𝑌)𝑐)))
53		eqid 2729	. . . 4 ⊢ (0g ∘ 𝑅) = (0g ∘ 𝑅)
54	3, 4, 5, 7, 10, 12, 53	prdsidlem 18672	. . 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 3227	. . 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 18659	1 ⊢ (𝜑 → 𝑌 ∈ Mnd)

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109  ∀wral 3044  Vcvv 3444   ↦ cmpt 5183   ∘ ccom 5635   Fn wfn 6494  ⟶wf 6495  ‘cfv 6499  (class class class)co 7369  Basecbs 17155  +_gcplusg 17196  0_gc0g 17378  X_scprds 17384  Mndcmnd 18637

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5229  ax-sep 5246  ax-nul 5256  ax-pow 5315  ax-pr 5382  ax-un 7691  ax-cnex 11100  ax-resscn 11101  ax-1cn 11102  ax-icn 11103  ax-addcl 11104  ax-addrcl 11105  ax-mulcl 11106  ax-mulrcl 11107  ax-mulcom 11108  ax-addass 11109  ax-mulass 11110  ax-distr 11111  ax-i2m1 11112  ax-1ne0 11113  ax-1rid 11114  ax-rnegex 11115  ax-rrecex 11116  ax-cnre 11117  ax-pre-lttri 11118  ax-pre-lttrn 11119  ax-pre-ltadd 11120  ax-pre-mulgt0 11121

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-nel 3030  df-ral 3045  df-rex 3054  df-rmo 3351  df-reu 3352  df-rab 3403  df-v 3446  df-sbc 3751  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-pss 3931  df-nul 4293  df-if 4485  df-pw 4561  df-sn 4586  df-pr 4588  df-tp 4590  df-op 4592  df-uni 4868  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-tr 5210  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6262  df-ord 6323  df-on 6324  df-lim 6325  df-suc 6326  df-iota 6452  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-riota 7326  df-ov 7372  df-oprab 7373  df-mpo 7374  df-om 7823  df-1st 7947  df-2nd 7948  df-frecs 8237  df-wrecs 8268  df-recs 8317  df-rdg 8355  df-1o 8411  df-er 8648  df-map 8778  df-ixp 8848  df-en 8896  df-dom 8897  df-sdom 8898  df-fin 8899  df-sup 9369  df-pnf 11186  df-mnf 11187  df-xr 11188  df-ltxr 11189  df-le 11190  df-sub 11383  df-neg 11384  df-nn 12163  df-2 12225  df-3 12226  df-4 12227  df-5 12228  df-6 12229  df-7 12230  df-8 12231  df-9 12232  df-n0 12419  df-z 12506  df-dec 12626  df-uz 12770  df-fz 13445  df-struct 17093  df-slot 17128  df-ndx 17140  df-base 17156  df-plusg 17209  df-mulr 17210  df-sca 17212  df-vsca 17213  df-ip 17214  df-tset 17215  df-ple 17216  df-ds 17218  df-hom 17220  df-cco 17221  df-0g 17380  df-prds 17386  df-mgm 18543  df-sgrp 18622  df-mnd 18638

This theorem is referenced by:  prds0g  18674  pwsmnd  18675  xpsmnd  18680  prdspjmhm  18732  prdsgrpd  18958  prdscmnd  19767  prdsringd  20206  dsmm0cl  21625  prdstmdd  23987