Theorem c0mhm 44534

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 2798	. . . . . . . 8 ⊢ (Base‘𝑇) = (Base‘𝑇)
2		c0mhm.0	. . . . . . . 8 ⊢ 0 = (0g‘𝑇)
3	1, 2	mndidcl 17918	. . . . . . 7 ⊢ (𝑇 ∈ Mnd → 0 ∈ (Base‘𝑇))
4	3	adantl 485	. . . . . 6 ⊢ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → 0 ∈ (Base‘𝑇))
5	4	adantr 484	. . . . 5 ⊢ (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ 𝑥 ∈ 𝐵) → 0 ∈ (Base‘𝑇))
6		c0mhm.h	. . . . 5 ⊢ 𝐻 = (𝑥 ∈ 𝐵 ↦ 0 )
7	5, 6	fmptd 6855	. . . 4 ⊢ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → 𝐻:𝐵⟶(Base‘𝑇))
8	3	ancli 552	. . . . . . . . 9 ⊢ (𝑇 ∈ Mnd → (𝑇 ∈ Mnd ∧ 0 ∈ (Base‘𝑇)))
9	8	adantl 485	. . . . . . . 8 ⊢ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → (𝑇 ∈ Mnd ∧ 0 ∈ (Base‘𝑇)))
10		eqid 2798	. . . . . . . . 9 ⊢ (+g‘𝑇) = (+g‘𝑇)
11	1, 10, 2	mndlid 17923	. . . . . . . 8 ⊢ ((𝑇 ∈ Mnd ∧ 0 ∈ (Base‘𝑇)) → ( 0 (+g‘𝑇) 0 ) = 0 )
12	9, 11	syl 17	. . . . . . 7 ⊢ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → ( 0 (+g‘𝑇) 0 ) = 0 )
13	12	adantr 484	. . . . . 6 ⊢ (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → ( 0 (+g‘𝑇) 0 ) = 0 )
14	6	a1i 11	. . . . . . . 8 ⊢ (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → 𝐻 = (𝑥 ∈ 𝐵 ↦ 0 ))
15		eqidd 2799	. . . . . . . 8 ⊢ ((((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) ∧ 𝑥 = 𝑎) → 0 = 0 )
16		simprl 770	. . . . . . . 8 ⊢ (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → 𝑎 ∈ 𝐵)
17	4	adantr 484	. . . . . . . 8 ⊢ (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → 0 ∈ (Base‘𝑇))
18	14, 15, 16, 17	fvmptd 6752	. . . . . . 7 ⊢ (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝐻‘𝑎) = 0 )
19		eqidd 2799	. . . . . . . 8 ⊢ ((((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) ∧ 𝑥 = 𝑏) → 0 = 0 )
20		simprr 772	. . . . . . . 8 ⊢ (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → 𝑏 ∈ 𝐵)
21	14, 19, 20, 17	fvmptd 6752	. . . . . . 7 ⊢ (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝐻‘𝑏) = 0 )
22	18, 21	oveq12d 7153	. . . . . 6 ⊢ (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → ((𝐻‘𝑎)(+g‘𝑇)(𝐻‘𝑏)) = ( 0 (+g‘𝑇) 0 ))
23		eqidd 2799	. . . . . . 7 ⊢ ((((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) ∧ 𝑥 = (𝑎(+g‘𝑆)𝑏)) → 0 = 0 )
24		c0mhm.b	. . . . . . . . . 10 ⊢ 𝐵 = (Base‘𝑆)
25		eqid 2798	. . . . . . . . . 10 ⊢ (+g‘𝑆) = (+g‘𝑆)
26	24, 25	mndcl 17911	. . . . . . . . 9 ⊢ ((𝑆 ∈ Mnd ∧ 𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵) → (𝑎(+g‘𝑆)𝑏) ∈ 𝐵)
27	26	3expb 1117	. . . . . . . 8 ⊢ ((𝑆 ∈ Mnd ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝑎(+g‘𝑆)𝑏) ∈ 𝐵)
28	27	adantlr 714	. . . . . . 7 ⊢ (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝑎(+g‘𝑆)𝑏) ∈ 𝐵)
29	14, 23, 28, 17	fvmptd 6752	. . . . . 6 ⊢ (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝐻‘(𝑎(+g‘𝑆)𝑏)) = 0 )
30	13, 22, 29	3eqtr4rd 2844	. . . . 5 ⊢ (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝐻‘(𝑎(+g‘𝑆)𝑏)) = ((𝐻‘𝑎)(+g‘𝑇)(𝐻‘𝑏)))
31	30	ralrimivva 3156	. . . 4 ⊢ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝐻‘(𝑎(+g‘𝑆)𝑏)) = ((𝐻‘𝑎)(+g‘𝑇)(𝐻‘𝑏)))
32	6	a1i 11	. . . . 5 ⊢ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → 𝐻 = (𝑥 ∈ 𝐵 ↦ 0 ))
33		eqidd 2799	. . . . 5 ⊢ (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ 𝑥 = (0g‘𝑆)) → 0 = 0 )
34		eqid 2798	. . . . . . 7 ⊢ (0g‘𝑆) = (0g‘𝑆)
35	24, 34	mndidcl 17918	. . . . . 6 ⊢ (𝑆 ∈ Mnd → (0g‘𝑆) ∈ 𝐵)
36	35	adantr 484	. . . . 5 ⊢ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → (0g‘𝑆) ∈ 𝐵)
37	32, 33, 36, 4	fvmptd 6752	. . . 4 ⊢ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → (𝐻‘(0g‘𝑆)) = 0 )
38	7, 31, 37	3jca 1125	. . 3 ⊢ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → (𝐻:𝐵⟶(Base‘𝑇) ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝐻‘(𝑎(+g‘𝑆)𝑏)) = ((𝐻‘𝑎)(+g‘𝑇)(𝐻‘𝑏)) ∧ (𝐻‘(0g‘𝑆)) = 0 ))
39	38	ancli 552	. 2 ⊢ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝐻:𝐵⟶(Base‘𝑇) ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝐻‘(𝑎(+g‘𝑆)𝑏)) = ((𝐻‘𝑎)(+g‘𝑇)(𝐻‘𝑏)) ∧ (𝐻‘(0g‘𝑆)) = 0 )))
40	24, 1, 25, 10, 34, 2	ismhm 17950	. 2 ⊢ (𝐻 ∈ (𝑆 MndHom 𝑇) ↔ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝐻:𝐵⟶(Base‘𝑇) ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝐻‘(𝑎(+g‘𝑆)𝑏)) = ((𝐻‘𝑎)(+g‘𝑇)(𝐻‘𝑏)) ∧ (𝐻‘(0g‘𝑆)) = 0 )))
41	39, 40	sylibr 237	1 ⊢ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → 𝐻 ∈ (𝑆 MndHom 𝑇))

Syntax hints:   → wi 4   ∧ wa 399   ∧ w3a 1084   = wceq 1538   ∈ wcel 2111  ∀wral 3106   ↦ cmpt 5110  ⟶wf 6320  ‘cfv 6324  (class class class)co 7135  Basecbs 16475  +_gcplusg 16557  0_gc0g 16705  Mndcmnd 17903   MndHom cmhm 17946

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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-rmo 3114  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-fv 6332  df-riota 7093  df-ov 7138  df-oprab 7139  df-mpo 7140  df-map 8391  df-0g 16707  df-mgm 17844  df-sgrp 17893  df-mnd 17904  df-mhm 17948

This theorem is referenced by:  c0ghm  44535  c0rhm  44536