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 18785

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 18726	. 2 ⊢ (𝜑 → 𝑌 ∈ Mnd)
6		prdspjmhm.a	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝐼)
7	4, 6	ffvelcdmd 7090	. 2 ⊢ (𝜑 → (𝑅‘𝐴) ∈ Mnd)
8		prdspjmhm.b	. . . . 5 ⊢ 𝐵 = (Base‘𝑌)
9	3	adantr 479	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑆 ∈ 𝑋)
10	2	adantr 479	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝐼 ∈ 𝑉)
11	4	ffnd 6718	. . . . . 6 ⊢ (𝜑 → 𝑅 Fn 𝐼)
12	11	adantr 479	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑅 Fn 𝐼)
13		simpr 483	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐵)
14	6	adantr 479	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝐴 ∈ 𝐼)
15	1, 8, 9, 10, 12, 13, 14	prdsbasprj 17453	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑥‘𝐴) ∈ (Base‘(𝑅‘𝐴)))
16	15	fmpttd 7120	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴)):𝐵⟶(Base‘(𝑅‘𝐴)))
17	3	adantr 479	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝑆 ∈ 𝑋)
18	2	adantr 479	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝐼 ∈ 𝑉)
19	11	adantr 479	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝑅 Fn 𝐼)
20		simprl 769	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝑦 ∈ 𝐵)
21		simprr 771	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝑧 ∈ 𝐵)
22		eqid 2725	. . . . . 6 ⊢ (+_g‘𝑌) = (+_g‘𝑌)
23	6	adantr 479	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝐴 ∈ 𝐼)
24	1, 8, 17, 18, 19, 20, 21, 22, 23	prdsplusgfval 17455	. . . . 5 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑦(+_g‘𝑌)𝑧)‘𝐴) = ((𝑦‘𝐴)(+_g‘(𝑅‘𝐴))(𝑧‘𝐴)))
25	8, 22	mndcl 18701	. . . . . . . 8 ⊢ ((𝑌 ∈ Mnd ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) → (𝑦(+_g‘𝑌)𝑧) ∈ 𝐵)
26	25	3expb 1117	. . . . . . 7 ⊢ ((𝑌 ∈ Mnd ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → (𝑦(+_g‘𝑌)𝑧) ∈ 𝐵)
27	5, 26	sylan 578	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → (𝑦(+_g‘𝑌)𝑧) ∈ 𝐵)
28		fveq1 6891	. . . . . . 7 ⊢ (𝑥 = (𝑦(+_g‘𝑌)𝑧) → (𝑥‘𝐴) = ((𝑦(+_g‘𝑌)𝑧)‘𝐴))
29		eqid 2725	. . . . . . 7 ⊢ (𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴)) = (𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))
30		fvex 6905	. . . . . . 7 ⊢ ((𝑦(+_g‘𝑌)𝑧)‘𝐴) ∈ V
31	28, 29, 30	fvmpt 7000	. . . . . 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 7000	. . . . . . 7 ⊢ (𝑦 ∈ 𝐵 → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑦) = (𝑦‘𝐴))
36		fveq1 6891	. . . . . . . 8 ⊢ (𝑥 = 𝑧 → (𝑥‘𝐴) = (𝑧‘𝐴))
37		fvex 6905	. . . . . . . 8 ⊢ (𝑧‘𝐴) ∈ V
38	36, 29, 37	fvmpt 7000	. . . . . . 7 ⊢ (𝑧 ∈ 𝐵 → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑧) = (𝑧‘𝐴))
39	35, 38	oveqan12d 7435	. . . . . 6 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) → (((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑦)(+_g‘(𝑅‘𝐴))((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑧)) = ((𝑦‘𝐴)(+_g‘(𝑅‘𝐴))(𝑧‘𝐴)))
40	39	adantl 480	. . . . 5 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → (((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑦)(+_g‘(𝑅‘𝐴))((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑧)) = ((𝑦‘𝐴)(+_g‘(𝑅‘𝐴))(𝑧‘𝐴)))
41	24, 32, 40	3eqtr4d 2775	. . . 4 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(𝑦(+_g‘𝑌)𝑧)) = (((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑦)(+_g‘(𝑅‘𝐴))((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑧)))
42	41	ralrimivva 3191	. . 3 ⊢ (𝜑 → ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(𝑦(+_g‘𝑌)𝑧)) = (((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑦)(+_g‘(𝑅‘𝐴))((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑧)))
43		eqid 2725	. . . . . 6 ⊢ (0_g‘𝑌) = (0_g‘𝑌)
44	8, 43	mndidcl 18708	. . . . 5 ⊢ (𝑌 ∈ Mnd → (0_g‘𝑌) ∈ 𝐵)
45		fveq1 6891	. . . . . 6 ⊢ (𝑥 = (0_g‘𝑌) → (𝑥‘𝐴) = ((0_g‘𝑌)‘𝐴))
46		fvex 6905	. . . . . 6 ⊢ ((0_g‘𝑌)‘𝐴) ∈ V
47	45, 29, 46	fvmpt 7000	. . . . 5 ⊢ ((0_g‘𝑌) ∈ 𝐵 → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(0_g‘𝑌)) = ((0_g‘𝑌)‘𝐴))
48	5, 44, 47	3syl 18	. . . 4 ⊢ (𝜑 → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(0_g‘𝑌)) = ((0_g‘𝑌)‘𝐴))
49	1, 2, 3, 4	prds0g 18727	. . . . 5 ⊢ (𝜑 → (0_g ∘ 𝑅) = (0_g‘𝑌))
50	49	fveq1d 6894	. . . 4 ⊢ (𝜑 → ((0_g ∘ 𝑅)‘𝐴) = ((0_g‘𝑌)‘𝐴))
51		fvco3 6992	. . . . 5 ⊢ ((𝑅:𝐼⟶Mnd ∧ 𝐴 ∈ 𝐼) → ((0_g ∘ 𝑅)‘𝐴) = (0_g‘(𝑅‘𝐴)))
52	4, 6, 51	syl2anc 582	. . . 4 ⊢ (𝜑 → ((0_g ∘ 𝑅)‘𝐴) = (0_g‘(𝑅‘𝐴)))
53	48, 50, 52	3eqtr2d 2771	. . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(0_g‘𝑌)) = (0_g‘(𝑅‘𝐴)))
54	16, 42, 53	3jca 1125	. 2 ⊢ (𝜑 → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴)):𝐵⟶(Base‘(𝑅‘𝐴)) ∧ ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(𝑦(+_g‘𝑌)𝑧)) = (((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑦)(+_g‘(𝑅‘𝐴))((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑧)) ∧ ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(0_g‘𝑌)) = (0_g‘(𝑅‘𝐴))))
55		eqid 2725	. . 3 ⊢ (Base‘(𝑅‘𝐴)) = (Base‘(𝑅‘𝐴))
56		eqid 2725	. . 3 ⊢ (+_g‘(𝑅‘𝐴)) = (+_g‘(𝑅‘𝐴))
57		eqid 2725	. . 3 ⊢ (0_g‘(𝑅‘𝐴)) = (0_g‘(𝑅‘𝐴))
58	8, 55, 22, 56, 43, 57	ismhm 18741	. 2 ⊢ ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴)) ∈ (𝑌 MndHom (𝑅‘𝐴)) ↔ ((𝑌 ∈ Mnd ∧ (𝑅‘𝐴) ∈ Mnd) ∧ ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴)):𝐵⟶(Base‘(𝑅‘𝐴)) ∧ ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(𝑦(+_g‘𝑌)𝑧)) = (((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑦)(+_g‘(𝑅‘𝐴))((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑧)) ∧ ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(0_g‘𝑌)) = (0_g‘(𝑅‘𝐴)))))
59	5, 7, 54, 58	syl21anbrc 1341	1 ⊢ (𝜑 → (𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴)) ∈ (𝑌 MndHom (𝑅‘𝐴)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 394 ∧ w3a 1084 = wceq 1533 ∈ wcel 2098 ∀wral 3051 ↦ cmpt 5226 ∘ ccom 5676 Fn wfn 6538 ⟶wf 6539 ‘cfv 6543 (class class class)co 7416 Basecbs 17179 +_gcplusg 17232 0_gc0g 17420 X_scprds 17426 Mndcmnd 18693 MndHom cmhm 18737

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-rep 5280 ax-sep 5294 ax-nul 5301 ax-pow 5359 ax-pr 5423 ax-un 7738 ax-cnex 11194 ax-resscn 11195 ax-1cn 11196 ax-icn 11197 ax-addcl 11198 ax-addrcl 11199 ax-mulcl 11200 ax-mulrcl 11201 ax-mulcom 11202 ax-addass 11203 ax-mulass 11204 ax-distr 11205 ax-i2m1 11206 ax-1ne0 11207 ax-1rid 11208 ax-rnegex 11209 ax-rrecex 11210 ax-cnre 11211 ax-pre-lttri 11212 ax-pre-lttrn 11213 ax-pre-ltadd 11214 ax-pre-mulgt0 11215

This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2931 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3364 df-reu 3365 df-rab 3420 df-v 3465 df-sbc 3769 df-csb 3885 df-dif 3942 df-un 3944 df-in 3946 df-ss 3956 df-pss 3959 df-nul 4319 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-tp 4629 df-op 4631 df-uni 4904 df-iun 4993 df-br 5144 df-opab 5206 df-mpt 5227 df-tr 5261 df-id 5570 df-eprel 5576 df-po 5584 df-so 5585 df-fr 5627 df-we 5629 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-rn 5683 df-res 5684 df-ima 5685 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7372 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7869 df-1st 7991 df-2nd 7992 df-frecs 8285 df-wrecs 8316 df-recs 8390 df-rdg 8429 df-1o 8485 df-er 8723 df-map 8845 df-ixp 8915 df-en 8963 df-dom 8964 df-sdom 8965 df-fin 8966 df-sup 9465 df-pnf 11280 df-mnf 11281 df-xr 11282 df-ltxr 11283 df-le 11284 df-sub 11476 df-neg 11477 df-nn 12243 df-2 12305 df-3 12306 df-4 12307 df-5 12308 df-6 12309 df-7 12310 df-8 12311 df-9 12312 df-n0 12503 df-z 12589 df-dec 12708 df-uz 12853 df-fz 13517 df-struct 17115 df-slot 17150 df-ndx 17162 df-base 17180 df-plusg 17245 df-mulr 17246 df-sca 17248 df-vsca 17249 df-ip 17250 df-tset 17251 df-ple 17252 df-ds 17254 df-hom 17256 df-cco 17257 df-0g 17422 df-prds 17428 df-mgm 18599 df-sgrp 18678 df-mnd 18694 df-mhm 18739

This theorem is referenced by: pwspjmhm 18786 prdsgsum 19940

W3C validator