Theorem prdsmndd 13150

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 2197	. 2 ⊢ (𝜑 → (Base‘𝑌) = (Base‘𝑌))
2		eqidd 2197	. 2 ⊢ (𝜑 → (+g‘𝑌) = (+g‘𝑌))
3		prdsmndd.y	. . . 4 ⊢ 𝑌 = (𝑆Xs𝑅)
4		eqid 2196	. . . 4 ⊢ (Base‘𝑌) = (Base‘𝑌)
5		eqid 2196	. . . 4 ⊢ (+g‘𝑌) = (+g‘𝑌)
6		prdsmndd.s	. . . . . 6 ⊢ (𝜑 → 𝑆 ∈ 𝑉)
7	6	elexd 2776	. . . . 5 ⊢ (𝜑 → 𝑆 ∈ V)
8	7	adantr 276	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌))) → 𝑆 ∈ V)
9		prdsmndd.i	. . . . . 6 ⊢ (𝜑 → 𝐼 ∈ 𝑊)
10	9	elexd 2776	. . . . 5 ⊢ (𝜑 → 𝐼 ∈ V)
11	10	adantr 276	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌))) → 𝐼 ∈ V)
12		prdsmndd.r	. . . . 5 ⊢ (𝜑 → 𝑅:𝐼⟶Mnd)
13	12	adantr 276	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌))) → 𝑅:𝐼⟶Mnd)
14		simprl 529	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌))) → 𝑎 ∈ (Base‘𝑌))
15		simprr 531	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌))) → 𝑏 ∈ (Base‘𝑌))
16	3, 4, 5, 8, 11, 13, 14, 15	prdsplusgcl 13148	. . 3 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌))) → (𝑎(+g‘𝑌)𝑏) ∈ (Base‘𝑌))
17	16	3impb 1201	. 2 ⊢ ((𝜑 ∧ 𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌)) → (𝑎(+g‘𝑌)𝑏) ∈ (Base‘𝑌))
18	12	ffvelcdmda 5700	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (𝑅‘𝑦) ∈ Mnd)
19	18	adantlr 477	. . . . . 6 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → (𝑅‘𝑦) ∈ Mnd)
20	7	ad2antrr 488	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → 𝑆 ∈ V)
21	10	ad2antrr 488	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → 𝐼 ∈ V)
22	12	ffnd 5411	. . . . . . . 8 ⊢ (𝜑 → 𝑅 Fn 𝐼)
23	22	ad2antrr 488	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → 𝑅 Fn 𝐼)
24		simplr1 1041	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → 𝑎 ∈ (Base‘𝑌))
25		simpr 110	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → 𝑦 ∈ 𝐼)
26	3, 4, 20, 21, 23, 24, 25	prdsbasprj 12984	. . . . . 6 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → (𝑎‘𝑦) ∈ (Base‘(𝑅‘𝑦)))
27		simplr2 1042	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → 𝑏 ∈ (Base‘𝑌))
28	3, 4, 20, 21, 23, 27, 25	prdsbasprj 12984	. . . . . 6 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → (𝑏‘𝑦) ∈ (Base‘(𝑅‘𝑦)))
29		simplr3 1043	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → 𝑐 ∈ (Base‘𝑌))
30	3, 4, 20, 21, 23, 29, 25	prdsbasprj 12984	. . . . . 6 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → (𝑐‘𝑦) ∈ (Base‘(𝑅‘𝑦)))
31		eqid 2196	. . . . . . 7 ⊢ (Base‘(𝑅‘𝑦)) = (Base‘(𝑅‘𝑦))
32		eqid 2196	. . . . . . 7 ⊢ (+g‘(𝑅‘𝑦)) = (+g‘(𝑅‘𝑦))
33	31, 32	mndass 13126	. . . . . 6 ⊢ (((𝑅‘𝑦) ∈ Mnd ∧ ((𝑎‘𝑦) ∈ (Base‘(𝑅‘𝑦)) ∧ (𝑏‘𝑦) ∈ (Base‘(𝑅‘𝑦)) ∧ (𝑐‘𝑦) ∈ (Base‘(𝑅‘𝑦)))) → (((𝑎‘𝑦)(+g‘(𝑅‘𝑦))(𝑏‘𝑦))(+g‘(𝑅‘𝑦))(𝑐‘𝑦)) = ((𝑎‘𝑦)(+g‘(𝑅‘𝑦))((𝑏‘𝑦)(+g‘(𝑅‘𝑦))(𝑐‘𝑦))))
34	19, 26, 28, 30, 33	syl13anc 1251	. . . . 5 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → (((𝑎‘𝑦)(+g‘(𝑅‘𝑦))(𝑏‘𝑦))(+g‘(𝑅‘𝑦))(𝑐‘𝑦)) = ((𝑎‘𝑦)(+g‘(𝑅‘𝑦))((𝑏‘𝑦)(+g‘(𝑅‘𝑦))(𝑐‘𝑦))))
35	3, 4, 20, 21, 23, 24, 27, 5, 25	prdsplusgfval 12986	. . . . . 6 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → ((𝑎(+g‘𝑌)𝑏)‘𝑦) = ((𝑎‘𝑦)(+g‘(𝑅‘𝑦))(𝑏‘𝑦)))
36	35	oveq1d 5940	. . . . 5 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → (((𝑎(+g‘𝑌)𝑏)‘𝑦)(+g‘(𝑅‘𝑦))(𝑐‘𝑦)) = (((𝑎‘𝑦)(+g‘(𝑅‘𝑦))(𝑏‘𝑦))(+g‘(𝑅‘𝑦))(𝑐‘𝑦)))
37	3, 4, 20, 21, 23, 27, 29, 5, 25	prdsplusgfval 12986	. . . . . 6 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → ((𝑏(+g‘𝑌)𝑐)‘𝑦) = ((𝑏‘𝑦)(+g‘(𝑅‘𝑦))(𝑐‘𝑦)))
38	37	oveq2d 5941	. . . . 5 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → ((𝑎‘𝑦)(+g‘(𝑅‘𝑦))((𝑏(+g‘𝑌)𝑐)‘𝑦)) = ((𝑎‘𝑦)(+g‘(𝑅‘𝑦))((𝑏‘𝑦)(+g‘(𝑅‘𝑦))(𝑐‘𝑦))))
39	34, 36, 38	3eqtr4d 2239	. . . 4 ⊢ (((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) ∧ 𝑦 ∈ 𝐼) → (((𝑎(+g‘𝑌)𝑏)‘𝑦)(+g‘(𝑅‘𝑦))(𝑐‘𝑦)) = ((𝑎‘𝑦)(+g‘(𝑅‘𝑦))((𝑏(+g‘𝑌)𝑐)‘𝑦)))
40	39	mpteq2dva 4124	. . 3 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → (𝑦 ∈ 𝐼 ↦ (((𝑎(+g‘𝑌)𝑏)‘𝑦)(+g‘(𝑅‘𝑦))(𝑐‘𝑦))) = (𝑦 ∈ 𝐼 ↦ ((𝑎‘𝑦)(+g‘(𝑅‘𝑦))((𝑏(+g‘𝑌)𝑐)‘𝑦))))
41	7	adantr 276	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → 𝑆 ∈ V)
42	10	adantr 276	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → 𝐼 ∈ V)
43	22	adantr 276	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → 𝑅 Fn 𝐼)
44	16	3adantr3 1160	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → (𝑎(+g‘𝑌)𝑏) ∈ (Base‘𝑌))
45		simpr3 1007	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → 𝑐 ∈ (Base‘𝑌))
46	3, 4, 41, 42, 43, 44, 45, 5	prdsplusgval 12985	. . 3 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → ((𝑎(+g‘𝑌)𝑏)(+g‘𝑌)𝑐) = (𝑦 ∈ 𝐼 ↦ (((𝑎(+g‘𝑌)𝑏)‘𝑦)(+g‘(𝑅‘𝑦))(𝑐‘𝑦))))
47		simpr1 1005	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → 𝑎 ∈ (Base‘𝑌))
48	12	adantr 276	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → 𝑅:𝐼⟶Mnd)
49		simpr2 1006	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → 𝑏 ∈ (Base‘𝑌))
50	3, 4, 5, 41, 42, 48, 49, 45	prdsplusgcl 13148	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → (𝑏(+g‘𝑌)𝑐) ∈ (Base‘𝑌))
51	3, 4, 41, 42, 43, 47, 50, 5	prdsplusgval 12985	. . 3 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → (𝑎(+g‘𝑌)(𝑏(+g‘𝑌)𝑐)) = (𝑦 ∈ 𝐼 ↦ ((𝑎‘𝑦)(+g‘(𝑅‘𝑦))((𝑏(+g‘𝑌)𝑐)‘𝑦))))
52	40, 46, 51	3eqtr4d 2239	. 2 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝑌) ∧ 𝑏 ∈ (Base‘𝑌) ∧ 𝑐 ∈ (Base‘𝑌))) → ((𝑎(+g‘𝑌)𝑏)(+g‘𝑌)𝑐) = (𝑎(+g‘𝑌)(𝑏(+g‘𝑌)𝑐)))
53		eqid 2196	. . . 4 ⊢ (0g ∘ 𝑅) = (0g ∘ 𝑅)
54	3, 4, 5, 7, 10, 12, 53	prdsidlem 13149	. . 3 ⊢ (𝜑 → ((0g ∘ 𝑅) ∈ (Base‘𝑌) ∧ ∀𝑎 ∈ (Base‘𝑌)(((0g ∘ 𝑅)(+g‘𝑌)𝑎) = 𝑎 ∧ (𝑎(+g‘𝑌)(0g ∘ 𝑅)) = 𝑎)))
55	54	simpld 112	. 2 ⊢ (𝜑 → (0g ∘ 𝑅) ∈ (Base‘𝑌))
56	54	simprd 114	. . . 4 ⊢ (𝜑 → ∀𝑎 ∈ (Base‘𝑌)(((0g ∘ 𝑅)(+g‘𝑌)𝑎) = 𝑎 ∧ (𝑎(+g‘𝑌)(0g ∘ 𝑅)) = 𝑎))
57	56	r19.21bi 2585	. . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ (Base‘𝑌)) → (((0g ∘ 𝑅)(+g‘𝑌)𝑎) = 𝑎 ∧ (𝑎(+g‘𝑌)(0g ∘ 𝑅)) = 𝑎))
58	57	simpld 112	. 2 ⊢ ((𝜑 ∧ 𝑎 ∈ (Base‘𝑌)) → ((0g ∘ 𝑅)(+g‘𝑌)𝑎) = 𝑎)
59	57	simprd 114	. 2 ⊢ ((𝜑 ∧ 𝑎 ∈ (Base‘𝑌)) → (𝑎(+g‘𝑌)(0g ∘ 𝑅)) = 𝑎)
60	1, 2, 17, 52, 55, 58, 59	ismndd 13139	1 ⊢ (𝜑 → 𝑌 ∈ Mnd)

Syntax hints:   → wi 4   ∧ wa 104   ∧ w3a 980   = wceq 1364   ∈ wcel 2167  ∀wral 2475  Vcvv 2763   ↦ cmpt 4095   ∘ ccom 4668   Fn wfn 5254  ⟶wf 5255  ‘cfv 5259  (class class class)co 5925  Basecbs 12703  +_gcplusg 12780  0_gc0g 12958  X_scprds 12967  Mndcmnd 13118

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4149  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-cnex 7987  ax-resscn 7988  ax-1cn 7989  ax-1re 7990  ax-icn 7991  ax-addcl 7992  ax-addrcl 7993  ax-mulcl 7994  ax-addcom 7996  ax-mulcom 7997  ax-addass 7998  ax-mulass 7999  ax-distr 8000  ax-i2m1 8001  ax-0lt1 8002  ax-1rid 8003  ax-0id 8004  ax-rnegex 8005  ax-cnre 8007  ax-pre-ltirr 8008  ax-pre-ltwlin 8009  ax-pre-lttrn 8010  ax-pre-apti 8011  ax-pre-ltadd 8012

This theorem depends on definitions:  df-bi 117  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3452  df-pw 3608  df-sn 3629  df-pr 3630  df-tp 3631  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-riota 5880  df-ov 5928  df-oprab 5929  df-mpo 5930  df-1st 6207  df-2nd 6208  df-map 6718  df-ixp 6767  df-sup 7059  df-pnf 8080  df-mnf 8081  df-xr 8082  df-ltxr 8083  df-le 8084  df-sub 8216  df-neg 8217  df-inn 9008  df-2 9066  df-3 9067  df-4 9068  df-5 9069  df-6 9070  df-7 9071  df-8 9072  df-9 9073  df-n0 9267  df-z 9344  df-dec 9475  df-uz 9619  df-fz 10101  df-struct 12705  df-ndx 12706  df-slot 12707  df-base 12709  df-plusg 12793  df-mulr 12794  df-sca 12796  df-vsca 12797  df-ip 12798  df-tset 12799  df-ple 12800  df-ds 12802  df-hom 12804  df-cco 12805  df-rest 12943  df-topn 12944  df-0g 12960  df-topgen 12962  df-pt 12963  df-prds 12969  df-mgm 13058  df-sgrp 13104  df-mnd 13119

This theorem is referenced by:  prds0g  13151  pwsmnd  13152  prdsgrpd  13311