Theorem c0mhm 46198

Description: The constant mapping to zero is a monoid homomorphism. (Contributed by AV, 16-Apr-2020.)

Hypotheses

Ref	Expression
c0mhm.b	⊢ 𝐵 = (Base‘𝑆)
c0mhm.0	⊢ 0 = (0g‘𝑇)
c0mhm.h	⊢ 𝐻 = (𝑥 ∈ 𝐵 ↦ 0 )

Assertion

Ref	Expression
c0mhm	⊢ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → 𝐻 ∈ (𝑆 MndHom 𝑇))

Distinct variable groups:   𝑥,𝐵   𝑥,𝑆   𝑥,𝑇   𝑥, 0

Allowed substitution hint:   𝐻(𝑥)

Proof of Theorem c0mhm

Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2736	. . . . . . . 8 ⊢ (Base‘𝑇) = (Base‘𝑇)
2		c0mhm.0	. . . . . . . 8 ⊢ 0 = (0g‘𝑇)
3	1, 2	mndidcl 18571	. . . . . . 7 ⊢ (𝑇 ∈ Mnd → 0 ∈ (Base‘𝑇))
4	3	adantl 482	. . . . . 6 ⊢ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → 0 ∈ (Base‘𝑇))
5	4	adantr 481	. . . . 5 ⊢ (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ 𝑥 ∈ 𝐵) → 0 ∈ (Base‘𝑇))
6		c0mhm.h	. . . . 5 ⊢ 𝐻 = (𝑥 ∈ 𝐵 ↦ 0 )
7	5, 6	fmptd 7062	. . . 4 ⊢ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → 𝐻:𝐵⟶(Base‘𝑇))
8	3	ancli 549	. . . . . . . . 9 ⊢ (𝑇 ∈ Mnd → (𝑇 ∈ Mnd ∧ 0 ∈ (Base‘𝑇)))
9	8	adantl 482	. . . . . . . 8 ⊢ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → (𝑇 ∈ Mnd ∧ 0 ∈ (Base‘𝑇)))
10		eqid 2736	. . . . . . . . 9 ⊢ (+g‘𝑇) = (+g‘𝑇)
11	1, 10, 2	mndlid 18576	. . . . . . . 8 ⊢ ((𝑇 ∈ Mnd ∧ 0 ∈ (Base‘𝑇)) → ( 0 (+g‘𝑇) 0 ) = 0 )
12	9, 11	syl 17	. . . . . . 7 ⊢ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → ( 0 (+g‘𝑇) 0 ) = 0 )
13	12	adantr 481	. . . . . 6 ⊢ (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → ( 0 (+g‘𝑇) 0 ) = 0 )
14	6	a1i 11	. . . . . . . 8 ⊢ (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → 𝐻 = (𝑥 ∈ 𝐵 ↦ 0 ))
15		eqidd 2737	. . . . . . . 8 ⊢ ((((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) ∧ 𝑥 = 𝑎) → 0 = 0 )
16		simprl 769	. . . . . . . 8 ⊢ (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → 𝑎 ∈ 𝐵)
17	4	adantr 481	. . . . . . . 8 ⊢ (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → 0 ∈ (Base‘𝑇))
18	14, 15, 16, 17	fvmptd 6955	. . . . . . 7 ⊢ (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝐻‘𝑎) = 0 )
19		eqidd 2737	. . . . . . . 8 ⊢ ((((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) ∧ 𝑥 = 𝑏) → 0 = 0 )
20		simprr 771	. . . . . . . 8 ⊢ (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → 𝑏 ∈ 𝐵)
21	14, 19, 20, 17	fvmptd 6955	. . . . . . 7 ⊢ (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝐻‘𝑏) = 0 )
22	18, 21	oveq12d 7375	. . . . . 6 ⊢ (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → ((𝐻‘𝑎)(+g‘𝑇)(𝐻‘𝑏)) = ( 0 (+g‘𝑇) 0 ))
23		eqidd 2737	. . . . . . 7 ⊢ ((((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) ∧ 𝑥 = (𝑎(+g‘𝑆)𝑏)) → 0 = 0 )
24		c0mhm.b	. . . . . . . . . 10 ⊢ 𝐵 = (Base‘𝑆)
25		eqid 2736	. . . . . . . . . 10 ⊢ (+g‘𝑆) = (+g‘𝑆)
26	24, 25	mndcl 18564	. . . . . . . . 9 ⊢ ((𝑆 ∈ Mnd ∧ 𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵) → (𝑎(+g‘𝑆)𝑏) ∈ 𝐵)
27	26	3expb 1120	. . . . . . . 8 ⊢ ((𝑆 ∈ Mnd ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝑎(+g‘𝑆)𝑏) ∈ 𝐵)
28	27	adantlr 713	. . . . . . 7 ⊢ (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝑎(+g‘𝑆)𝑏) ∈ 𝐵)
29	14, 23, 28, 17	fvmptd 6955	. . . . . 6 ⊢ (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝐻‘(𝑎(+g‘𝑆)𝑏)) = 0 )
30	13, 22, 29	3eqtr4rd 2787	. . . . 5 ⊢ (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝐻‘(𝑎(+g‘𝑆)𝑏)) = ((𝐻‘𝑎)(+g‘𝑇)(𝐻‘𝑏)))
31	30	ralrimivva 3197	. . . 4 ⊢ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝐻‘(𝑎(+g‘𝑆)𝑏)) = ((𝐻‘𝑎)(+g‘𝑇)(𝐻‘𝑏)))
32	6	a1i 11	. . . . 5 ⊢ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → 𝐻 = (𝑥 ∈ 𝐵 ↦ 0 ))
33		eqidd 2737	. . . . 5 ⊢ (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ 𝑥 = (0g‘𝑆)) → 0 = 0 )
34		eqid 2736	. . . . . . 7 ⊢ (0g‘𝑆) = (0g‘𝑆)
35	24, 34	mndidcl 18571	. . . . . 6 ⊢ (𝑆 ∈ Mnd → (0g‘𝑆) ∈ 𝐵)
36	35	adantr 481	. . . . 5 ⊢ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → (0g‘𝑆) ∈ 𝐵)
37	32, 33, 36, 4	fvmptd 6955	. . . 4 ⊢ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → (𝐻‘(0g‘𝑆)) = 0 )
38	7, 31, 37	3jca 1128	. . 3 ⊢ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → (𝐻:𝐵⟶(Base‘𝑇) ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝐻‘(𝑎(+g‘𝑆)𝑏)) = ((𝐻‘𝑎)(+g‘𝑇)(𝐻‘𝑏)) ∧ (𝐻‘(0g‘𝑆)) = 0 ))
39	38	ancli 549	. 2 ⊢ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝐻:𝐵⟶(Base‘𝑇) ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝐻‘(𝑎(+g‘𝑆)𝑏)) = ((𝐻‘𝑎)(+g‘𝑇)(𝐻‘𝑏)) ∧ (𝐻‘(0g‘𝑆)) = 0 )))
40	24, 1, 25, 10, 34, 2	ismhm 18603	. 2 ⊢ (𝐻 ∈ (𝑆 MndHom 𝑇) ↔ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝐻:𝐵⟶(Base‘𝑇) ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝐻‘(𝑎(+g‘𝑆)𝑏)) = ((𝐻‘𝑎)(+g‘𝑇)(𝐻‘𝑏)) ∧ (𝐻‘(0g‘𝑆)) = 0 )))
41	39, 40	sylibr 233	1 ⊢ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → 𝐻 ∈ (𝑆 MndHom 𝑇))

Syntax hints:   → wi 4   ∧ wa 396   ∧ w3a 1087   = wceq 1541   ∈ wcel 2106  ∀wral 3064   ↦ cmpt 5188  ⟶wf 6492  ‘cfv 6496  (class class class)co 7357  Basecbs 17083  +_gcplusg 17133  0_gc0g 17321  Mndcmnd 18556   MndHom cmhm 18599

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-ral 3065  df-rex 3074  df-rmo 3353  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-br 5106  df-opab 5168  df-mpt 5189  df-id 5531  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-fv 6504  df-riota 7313  df-ov 7360  df-oprab 7361  df-mpo 7362  df-map 8767  df-0g 17323  df-mgm 18497  df-sgrp 18546  df-mnd 18557  df-mhm 18601

This theorem is referenced by:  c0ghm  46199  c0rhm  46200