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 18754

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 18700	. 2 ⊢ (𝜑 → 𝑌 ∈ Mnd)
6		prdspjmhm.a	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝐼)
7	4, 6	ffvelcdmd 7081	. 2 ⊢ (𝜑 → (𝑅‘𝐴) ∈ Mnd)
8		prdspjmhm.b	. . . . 5 ⊢ 𝐵 = (Base‘𝑌)
9	3	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑆 ∈ 𝑋)
10	2	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝐼 ∈ 𝑉)
11	4	ffnd 6712	. . . . . 6 ⊢ (𝜑 → 𝑅 Fn 𝐼)
12	11	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑅 Fn 𝐼)
13		simpr 484	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐵)
14	6	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝐴 ∈ 𝐼)
15	1, 8, 9, 10, 12, 13, 14	prdsbasprj 17427	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑥‘𝐴) ∈ (Base‘(𝑅‘𝐴)))
16	15	fmpttd 7110	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴)):𝐵⟶(Base‘(𝑅‘𝐴)))
17	3	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝑆 ∈ 𝑋)
18	2	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝐼 ∈ 𝑉)
19	11	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝑅 Fn 𝐼)
20		simprl 768	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝑦 ∈ 𝐵)
21		simprr 770	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝑧 ∈ 𝐵)
22		eqid 2726	. . . . . 6 ⊢ (+_g‘𝑌) = (+_g‘𝑌)
23	6	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝐴 ∈ 𝐼)
24	1, 8, 17, 18, 19, 20, 21, 22, 23	prdsplusgfval 17429	. . . . 5 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑦(+_g‘𝑌)𝑧)‘𝐴) = ((𝑦‘𝐴)(+_g‘(𝑅‘𝐴))(𝑧‘𝐴)))
25	8, 22	mndcl 18675	. . . . . . . 8 ⊢ ((𝑌 ∈ Mnd ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) → (𝑦(+_g‘𝑌)𝑧) ∈ 𝐵)
26	25	3expb 1117	. . . . . . 7 ⊢ ((𝑌 ∈ Mnd ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → (𝑦(+_g‘𝑌)𝑧) ∈ 𝐵)
27	5, 26	sylan 579	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → (𝑦(+_g‘𝑌)𝑧) ∈ 𝐵)
28		fveq1 6884	. . . . . . 7 ⊢ (𝑥 = (𝑦(+_g‘𝑌)𝑧) → (𝑥‘𝐴) = ((𝑦(+_g‘𝑌)𝑧)‘𝐴))
29		eqid 2726	. . . . . . 7 ⊢ (𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴)) = (𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))
30		fvex 6898	. . . . . . 7 ⊢ ((𝑦(+_g‘𝑌)𝑧)‘𝐴) ∈ V
31	28, 29, 30	fvmpt 6992	. . . . . 6 ⊢ ((𝑦(+_g‘𝑌)𝑧) ∈ 𝐵 → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(𝑦(+_g‘𝑌)𝑧)) = ((𝑦(+_g‘𝑌)𝑧)‘𝐴))
32	27, 31	syl 17	. . . . 5 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(𝑦(+_g‘𝑌)𝑧)) = ((𝑦(+_g‘𝑌)𝑧)‘𝐴))
33		fveq1 6884	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → (𝑥‘𝐴) = (𝑦‘𝐴))
34		fvex 6898	. . . . . . . 8 ⊢ (𝑦‘𝐴) ∈ V
35	33, 29, 34	fvmpt 6992	. . . . . . 7 ⊢ (𝑦 ∈ 𝐵 → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑦) = (𝑦‘𝐴))
36		fveq1 6884	. . . . . . . 8 ⊢ (𝑥 = 𝑧 → (𝑥‘𝐴) = (𝑧‘𝐴))
37		fvex 6898	. . . . . . . 8 ⊢ (𝑧‘𝐴) ∈ V
38	36, 29, 37	fvmpt 6992	. . . . . . 7 ⊢ (𝑧 ∈ 𝐵 → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑧) = (𝑧‘𝐴))
39	35, 38	oveqan12d 7424	. . . . . 6 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) → (((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑦)(+_g‘(𝑅‘𝐴))((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑧)) = ((𝑦‘𝐴)(+_g‘(𝑅‘𝐴))(𝑧‘𝐴)))
40	39	adantl 481	. . . . 5 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → (((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑦)(+_g‘(𝑅‘𝐴))((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑧)) = ((𝑦‘𝐴)(+_g‘(𝑅‘𝐴))(𝑧‘𝐴)))
41	24, 32, 40	3eqtr4d 2776	. . . 4 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(𝑦(+_g‘𝑌)𝑧)) = (((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑦)(+_g‘(𝑅‘𝐴))((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑧)))
42	41	ralrimivva 3194	. . 3 ⊢ (𝜑 → ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(𝑦(+_g‘𝑌)𝑧)) = (((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑦)(+_g‘(𝑅‘𝐴))((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑧)))
43		eqid 2726	. . . . . 6 ⊢ (0_g‘𝑌) = (0_g‘𝑌)
44	8, 43	mndidcl 18682	. . . . 5 ⊢ (𝑌 ∈ Mnd → (0_g‘𝑌) ∈ 𝐵)
45		fveq1 6884	. . . . . 6 ⊢ (𝑥 = (0_g‘𝑌) → (𝑥‘𝐴) = ((0_g‘𝑌)‘𝐴))
46		fvex 6898	. . . . . 6 ⊢ ((0_g‘𝑌)‘𝐴) ∈ V
47	45, 29, 46	fvmpt 6992	. . . . 5 ⊢ ((0_g‘𝑌) ∈ 𝐵 → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(0_g‘𝑌)) = ((0_g‘𝑌)‘𝐴))
48	5, 44, 47	3syl 18	. . . 4 ⊢ (𝜑 → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(0_g‘𝑌)) = ((0_g‘𝑌)‘𝐴))
49	1, 2, 3, 4	prds0g 18701	. . . . 5 ⊢ (𝜑 → (0_g ∘ 𝑅) = (0_g‘𝑌))
50	49	fveq1d 6887	. . . 4 ⊢ (𝜑 → ((0_g ∘ 𝑅)‘𝐴) = ((0_g‘𝑌)‘𝐴))
51		fvco3 6984	. . . . 5 ⊢ ((𝑅:𝐼⟶Mnd ∧ 𝐴 ∈ 𝐼) → ((0_g ∘ 𝑅)‘𝐴) = (0_g‘(𝑅‘𝐴)))
52	4, 6, 51	syl2anc 583	. . . 4 ⊢ (𝜑 → ((0_g ∘ 𝑅)‘𝐴) = (0_g‘(𝑅‘𝐴)))
53	48, 50, 52	3eqtr2d 2772	. . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(0_g‘𝑌)) = (0_g‘(𝑅‘𝐴)))
54	16, 42, 53	3jca 1125	. 2 ⊢ (𝜑 → ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴)):𝐵⟶(Base‘(𝑅‘𝐴)) ∧ ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(𝑦(+_g‘𝑌)𝑧)) = (((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑦)(+_g‘(𝑅‘𝐴))((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘𝑧)) ∧ ((𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴))‘(0_g‘𝑌)) = (0_g‘(𝑅‘𝐴))))
55		eqid 2726	. . 3 ⊢ (Base‘(𝑅‘𝐴)) = (Base‘(𝑅‘𝐴))
56		eqid 2726	. . 3 ⊢ (+_g‘(𝑅‘𝐴)) = (+_g‘(𝑅‘𝐴))
57		eqid 2726	. . 3 ⊢ (0_g‘(𝑅‘𝐴)) = (0_g‘(𝑅‘𝐴))
58	8, 55, 22, 56, 43, 57	ismhm 18715	. 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 395 ∧ w3a 1084 = wceq 1533 ∈ wcel 2098 ∀wral 3055 ↦ cmpt 5224 ∘ ccom 5673 Fn wfn 6532 ⟶wf 6533 ‘cfv 6537 (class class class)co 7405 Basecbs 17153 +_gcplusg 17206 0_gc0g 17394 X_scprds 17400 Mndcmnd 18667 MndHom cmhm 18711

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 2163 ax-ext 2697 ax-rep 5278 ax-sep 5292 ax-nul 5299 ax-pow 5356 ax-pr 5420 ax-un 7722 ax-cnex 11168 ax-resscn 11169 ax-1cn 11170 ax-icn 11171 ax-addcl 11172 ax-addrcl 11173 ax-mulcl 11174 ax-mulrcl 11175 ax-mulcom 11176 ax-addass 11177 ax-mulass 11178 ax-distr 11179 ax-i2m1 11180 ax-1ne0 11181 ax-1rid 11182 ax-rnegex 11183 ax-rrecex 11184 ax-cnre 11185 ax-pre-lttri 11186 ax-pre-lttrn 11187 ax-pre-ltadd 11188 ax-pre-mulgt0 11189

This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 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 2704 df-cleq 2718 df-clel 2804 df-nfc 2879 df-ne 2935 df-nel 3041 df-ral 3056 df-rex 3065 df-rmo 3370 df-reu 3371 df-rab 3427 df-v 3470 df-sbc 3773 df-csb 3889 df-dif 3946 df-un 3948 df-in 3950 df-ss 3960 df-pss 3962 df-nul 4318 df-if 4524 df-pw 4599 df-sn 4624 df-pr 4626 df-tp 4628 df-op 4630 df-uni 4903 df-iun 4992 df-br 5142 df-opab 5204 df-mpt 5225 df-tr 5259 df-id 5567 df-eprel 5573 df-po 5581 df-so 5582 df-fr 5624 df-we 5626 df-xp 5675 df-rel 5676 df-cnv 5677 df-co 5678 df-dm 5679 df-rn 5680 df-res 5681 df-ima 5682 df-pred 6294 df-ord 6361 df-on 6362 df-lim 6363 df-suc 6364 df-iota 6489 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7853 df-1st 7974 df-2nd 7975 df-frecs 8267 df-wrecs 8298 df-recs 8372 df-rdg 8411 df-1o 8467 df-er 8705 df-map 8824 df-ixp 8894 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-sup 9439 df-pnf 11254 df-mnf 11255 df-xr 11256 df-ltxr 11257 df-le 11258 df-sub 11450 df-neg 11451 df-nn 12217 df-2 12279 df-3 12280 df-4 12281 df-5 12282 df-6 12283 df-7 12284 df-8 12285 df-9 12286 df-n0 12477 df-z 12563 df-dec 12682 df-uz 12827 df-fz 13491 df-struct 17089 df-slot 17124 df-ndx 17136 df-base 17154 df-plusg 17219 df-mulr 17220 df-sca 17222 df-vsca 17223 df-ip 17224 df-tset 17225 df-ple 17226 df-ds 17228 df-hom 17230 df-cco 17231 df-0g 17396 df-prds 17402 df-mgm 18573 df-sgrp 18652 df-mnd 18668 df-mhm 18713

This theorem is referenced by: pwspjmhm 18755 prdsgsum 19901

W3C validator