prdspjmhm - Metamath Proof Explorer

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

Theorem prdspjmhm 18710

Description: A projection from a product of monoids to one of the factors is a monoid homomorphism. (Contributed by Mario Carneiro, 6-May-2015.)

**Hypotheses**
Ref	Expression
prdspjmhm.y	⊢ 𝑌 = (𝑆X_s𝑅)
prdspjmhm.b	⊢ 𝐵 = (Base‘𝑌)
prdspjmhm.i	⊢ (𝜑 → 𝐼 ∈ 𝑉)
prdspjmhm.s	⊢ (𝜑 → 𝑆 ∈ 𝑋)
prdspjmhm.r	⊢ (𝜑 → 𝑅:𝐼⟶Mnd)
prdspjmhm.a	⊢ (𝜑 → 𝐴 ∈ 𝐼)

**Assertion**
Ref	Expression
prdspjmhm	⊢ (𝜑 → (𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴)) ∈ (𝑌 MndHom (𝑅‘𝐴)))

Distinct variable groups: 𝑥,𝐴 𝑥,𝐵 𝜑,𝑥 𝑥,𝑅 𝑥,𝑌 Allowed substitution hints: 𝑆(𝑥) 𝐼(𝑥) 𝑉(𝑥) 𝑋(𝑥)

Proof of Theorem prdspjmhm Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		prdspjmhm.y	. . 3 ⊢ 𝑌 = (𝑆X_s𝑅)
2		prdspjmhm.i	. . 3 ⊢ (𝜑 → 𝐼 ∈ 𝑉)
3		prdspjmhm.s	. . 3 ⊢ (𝜑 → 𝑆 ∈ 𝑋)
4		prdspjmhm.r	. . 3 ⊢ (𝜑 → 𝑅:𝐼⟶Mnd)
5	1, 2, 3, 4	prdsmndd 18658	. 2 ⊢ (𝜑 → 𝑌 ∈ Mnd)
6		prdspjmhm.a	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝐼)
7	4, 6	ffvelcdmd 7088	. 2 ⊢ (𝜑 → (𝑅‘𝐴) ∈ Mnd)
8		prdspjmhm.b	. . . . 5 ⊢ 𝐵 = (Base‘𝑌)
9	3	adantr 482	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑆 ∈ 𝑋)
10	2	adantr 482	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝐼 ∈ 𝑉)
11	4	ffnd 6719	. . . . . 6 ⊢ (𝜑 → 𝑅 Fn 𝐼)
12	11	adantr 482	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑅 Fn 𝐼)
13		simpr 486	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐵)
14	6	adantr 482	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝐴 ∈ 𝐼)
15	1, 8, 9, 10, 12, 13, 14	prdsbasprj 17418	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑥‘𝐴) ∈ (Base‘(𝑅‘𝐴)))
16	15	fmpttd 7115	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴)):𝐵⟶(Base‘(𝑅‘𝐴)))
17	3	adantr 482	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝑆 ∈ 𝑋)
18	2	adantr 482	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝐼 ∈ 𝑉)
19	11	adantr 482	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝑅 Fn 𝐼)
20		simprl 770	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝑦 ∈ 𝐵)
21		simprr 772	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝑧 ∈ 𝐵)
22		eqid 2733	. . . . . 6 ⊢ (+_g‘𝑌) = (+_g‘𝑌)
23	6	adantr 482	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝐴 ∈ 𝐼)
24	1, 8, 17, 18, 19, 20, 21, 22, 23	prdsplusgfval 17420	. . . . 5 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑦(+_g‘𝑌)𝑧)‘𝐴) = ((𝑦‘𝐴)(+_g‘(𝑅‘𝐴))(𝑧‘𝐴)))
25	8, 22	mndcl 18633	. . . . . . . 8 ⊢ ((𝑌 ∈ Mnd ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) → (𝑦(+_g‘𝑌)𝑧) ∈ 𝐵)
26	25	3expb 1121	. . . . . . 7 ⊢ ((𝑌 ∈ Mnd ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → (𝑦(+_g‘𝑌)𝑧) ∈ 𝐵)
27	5, 26	sylan 581	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → (𝑦(+_g‘𝑌)𝑧) ∈ 𝐵)
28		fveq1 6891	. . . . . . 7 ⊢ (𝑥 = (𝑦(+_g‘𝑌)𝑧) → (𝑥‘𝐴) = ((𝑦(+_g‘𝑌)𝑧)‘𝐴))
29		eqid 2733	. . . . . . 7 ⊢ (𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴)) = (𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))
30		fvex 6905	. . . . . . 7 ⊢ ((𝑦(+_g‘𝑌)𝑧)‘𝐴) ∈ V
31	28, 29, 30	fvmpt 6999	. . . . . 6 ⊢ ((𝑦(+_g‘𝑌)𝑧) ∈ 𝐵 → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(𝑦(+_g‘𝑌)𝑧)) = ((𝑦(+_g‘𝑌)𝑧)‘𝐴))
32	27, 31	syl 17	. . . . 5 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(𝑦(+_g‘𝑌)𝑧)) = ((𝑦(+_g‘𝑌)𝑧)‘𝐴))
33		fveq1 6891	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → (𝑥‘𝐴) = (𝑦‘𝐴))
34		fvex 6905	. . . . . . . 8 ⊢ (𝑦‘𝐴) ∈ V
35	33, 29, 34	fvmpt 6999	. . . . . . 7 ⊢ (𝑦 ∈ 𝐵 → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑦) = (𝑦‘𝐴))
36		fveq1 6891	. . . . . . . 8 ⊢ (𝑥 = 𝑧 → (𝑥‘𝐴) = (𝑧‘𝐴))
37		fvex 6905	. . . . . . . 8 ⊢ (𝑧‘𝐴) ∈ V
38	36, 29, 37	fvmpt 6999	. . . . . . 7 ⊢ (𝑧 ∈ 𝐵 → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑧) = (𝑧‘𝐴))
39	35, 38	oveqan12d 7428	. . . . . 6 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) → (((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑦)(+_g‘(𝑅‘𝐴))((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑧)) = ((𝑦‘𝐴)(+_g‘(𝑅‘𝐴))(𝑧‘𝐴)))
40	39	adantl 483	. . . . 5 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → (((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑦)(+_g‘(𝑅‘𝐴))((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑧)) = ((𝑦‘𝐴)(+_g‘(𝑅‘𝐴))(𝑧‘𝐴)))
41	24, 32, 40	3eqtr4d 2783	. . . 4 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(𝑦(+_g‘𝑌)𝑧)) = (((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑦)(+_g‘(𝑅‘𝐴))((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑧)))
42	41	ralrimivva 3201	. . 3 ⊢ (𝜑 → ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(𝑦(+_g‘𝑌)𝑧)) = (((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑦)(+_g‘(𝑅‘𝐴))((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑧)))
43		eqid 2733	. . . . . 6 ⊢ (0_g‘𝑌) = (0_g‘𝑌)
44	8, 43	mndidcl 18640	. . . . 5 ⊢ (𝑌 ∈ Mnd → (0_g‘𝑌) ∈ 𝐵)
45		fveq1 6891	. . . . . 6 ⊢ (𝑥 = (0_g‘𝑌) → (𝑥‘𝐴) = ((0_g‘𝑌)‘𝐴))
46		fvex 6905	. . . . . 6 ⊢ ((0_g‘𝑌)‘𝐴) ∈ V
47	45, 29, 46	fvmpt 6999	. . . . 5 ⊢ ((0_g‘𝑌) ∈ 𝐵 → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(0_g‘𝑌)) = ((0_g‘𝑌)‘𝐴))
48	5, 44, 47	3syl 18	. . . 4 ⊢ (𝜑 → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(0_g‘𝑌)) = ((0_g‘𝑌)‘𝐴))
49	1, 2, 3, 4	prds0g 18659	. . . . 5 ⊢ (𝜑 → (0_g ∘ 𝑅) = (0_g‘𝑌))
50	49	fveq1d 6894	. . . 4 ⊢ (𝜑 → ((0_g ∘ 𝑅)‘𝐴) = ((0_g‘𝑌)‘𝐴))
51		fvco3 6991	. . . . 5 ⊢ ((𝑅:𝐼⟶Mnd ∧ 𝐴 ∈ 𝐼) → ((0_g ∘ 𝑅)‘𝐴) = (0_g‘(𝑅‘𝐴)))
52	4, 6, 51	syl2anc 585	. . . 4 ⊢ (𝜑 → ((0_g ∘ 𝑅)‘𝐴) = (0_g‘(𝑅‘𝐴)))
53	48, 50, 52	3eqtr2d 2779	. . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(0_g‘𝑌)) = (0_g‘(𝑅‘𝐴)))
54	16, 42, 53	3jca 1129	. 2 ⊢ (𝜑 → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴)):𝐵⟶(Base‘(𝑅‘𝐴)) ∧ ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(𝑦(+_g‘𝑌)𝑧)) = (((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑦)(+_g‘(𝑅‘𝐴))((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑧)) ∧ ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(0_g‘𝑌)) = (0_g‘(𝑅‘𝐴))))
55		eqid 2733	. . 3 ⊢ (Base‘(𝑅‘𝐴)) = (Base‘(𝑅‘𝐴))
56		eqid 2733	. . 3 ⊢ (+_g‘(𝑅‘𝐴)) = (+_g‘(𝑅‘𝐴))
57		eqid 2733	. . 3 ⊢ (0_g‘(𝑅‘𝐴)) = (0_g‘(𝑅‘𝐴))
58	8, 55, 22, 56, 43, 57	ismhm 18673	. 2 ⊢ ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴)) ∈ (𝑌 MndHom (𝑅‘𝐴)) ↔ ((𝑌 ∈ Mnd ∧ (𝑅‘𝐴) ∈ Mnd) ∧ ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴)):𝐵⟶(Base‘(𝑅‘𝐴)) ∧ ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(𝑦(+_g‘𝑌)𝑧)) = (((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑦)(+_g‘(𝑅‘𝐴))((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑧)) ∧ ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(0_g‘𝑌)) = (0_g‘(𝑅‘𝐴)))))
59	5, 7, 54, 58	syl21anbrc 1345	1 ⊢ (𝜑 → (𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴)) ∈ (𝑌 MndHom (𝑅‘𝐴)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 397 ∧ w3a 1088 = wceq 1542 ∈ wcel 2107 ∀wral 3062 ↦ 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 MndHom cmhm 18669

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 df-mhm 18671

This theorem is referenced by: pwspjmhm 18711 prdsgsum 19849

W3C validator