Theorem c0mgm 20603

Description: The constant mapping to zero is a magma homomorphism into a monoid. Remark: Instead of the assumption that T is a monoid, it would be sufficient that T is a magma with a right or left identity. (Contributed by AV, 17-Apr-2020.)

Hypotheses

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

Assertion

Ref	Expression
c0mgm	⊢ ((𝑆 ∈ Mgm ∧ 𝑇 ∈ Mnd) → 𝐻 ∈ (𝑆 MgmHom 𝑇))

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

Allowed substitution hint:   𝐻(𝑥)

Proof of Theorem c0mgm

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

Step	Hyp	Ref	Expression
1		mndmgm 18846	. . 3 ⊢ (𝑇 ∈ Mnd → 𝑇 ∈ Mgm)
2	1	anim2i 629	. 2 ⊢ ((𝑆 ∈ Mgm ∧ 𝑇 ∈ Mnd) → (𝑆 ∈ Mgm ∧ 𝑇 ∈ Mgm))
3		eqid 2760	. . . . . . 7 ⊢ (Base‘𝑇) = (Base‘𝑇)
4		c0mhm.0	. . . . . . 7 ⊢ 0 = (0g‘𝑇)
5	3, 4	mndidcl 18855	. . . . . 6 ⊢ (𝑇 ∈ Mnd → 0 ∈ (Base‘𝑇))
6	5	adantl 487	. . . . 5 ⊢ ((𝑆 ∈ Mgm ∧ 𝑇 ∈ Mnd) → 0 ∈ (Base‘𝑇))
7	6	adantr 486	. . . 4 ⊢ (((𝑆 ∈ Mgm ∧ 𝑇 ∈ Mnd) ∧ 𝑥 ∈ 𝐵) → 0 ∈ (Base‘𝑇))
8		c0mhm.h	. . . 4 ⊢ 𝐻 = (𝑥 ∈ 𝐵 ↦ 0 )
9	7, 8	fmptd 7108	. . 3 ⊢ ((𝑆 ∈ Mgm ∧ 𝑇 ∈ Mnd) → 𝐻:𝐵⟶(Base‘𝑇))
10	5	ancli 558	. . . . . . . 8 ⊢ (𝑇 ∈ Mnd → (𝑇 ∈ Mnd ∧ 0 ∈ (Base‘𝑇)))
11	10	adantl 487	. . . . . . 7 ⊢ ((𝑆 ∈ Mgm ∧ 𝑇 ∈ Mnd) → (𝑇 ∈ Mnd ∧ 0 ∈ (Base‘𝑇)))
12		eqid 2760	. . . . . . . 8 ⊢ (+g‘𝑇) = (+g‘𝑇)
13	3, 12, 4	mndlid 18860	. . . . . . 7 ⊢ ((𝑇 ∈ Mnd ∧ 0 ∈ (Base‘𝑇)) → ( 0 (+g‘𝑇) 0 ) = 0 )
14	11, 13	syl 18	. . . . . 6 ⊢ ((𝑆 ∈ Mgm ∧ 𝑇 ∈ Mnd) → ( 0 (+g‘𝑇) 0 ) = 0 )
15	14	adantr 486	. . . . 5 ⊢ (((𝑆 ∈ Mgm ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → ( 0 (+g‘𝑇) 0 ) = 0 )
16	8	a1i 11	. . . . . . 7 ⊢ (((𝑆 ∈ Mgm ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → 𝐻 = (𝑥 ∈ 𝐵 ↦ 0 ))
17		eqidd 2761	. . . . . . 7 ⊢ ((((𝑆 ∈ Mgm ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) ∧ 𝑥 = 𝑎) → 0 = 0 )
18		simprl 783	. . . . . . 7 ⊢ (((𝑆 ∈ Mgm ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → 𝑎 ∈ 𝐵)
19	6	adantr 486	. . . . . . 7 ⊢ (((𝑆 ∈ Mgm ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → 0 ∈ (Base‘𝑇))
20	16, 17, 18, 19	fvmptd 6995	. . . . . 6 ⊢ (((𝑆 ∈ Mgm ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝐻‘𝑎) = 0 )
21		eqidd 2761	. . . . . . 7 ⊢ ((((𝑆 ∈ Mgm ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) ∧ 𝑥 = 𝑏) → 0 = 0 )
22		simprr 785	. . . . . . 7 ⊢ (((𝑆 ∈ Mgm ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → 𝑏 ∈ 𝐵)
23	16, 21, 22, 19	fvmptd 6995	. . . . . 6 ⊢ (((𝑆 ∈ Mgm ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝐻‘𝑏) = 0 )
24	20, 23	oveq12d 7432	. . . . 5 ⊢ (((𝑆 ∈ Mgm ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → ((𝐻‘𝑎)(+g‘𝑇)(𝐻‘𝑏)) = ( 0 (+g‘𝑇) 0 ))
25		eqidd 2761	. . . . . 6 ⊢ ((((𝑆 ∈ Mgm ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) ∧ 𝑥 = (𝑎(+g‘𝑆)𝑏)) → 0 = 0 )
26		c0mhm.b	. . . . . . . . 9 ⊢ 𝐵 = (Base‘𝑆)
27		eqid 2760	. . . . . . . . 9 ⊢ (+g‘𝑆) = (+g‘𝑆)
28	26, 27	mgmcl 18736	. . . . . . . 8 ⊢ ((𝑆 ∈ Mgm ∧ 𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵) → (𝑎(+g‘𝑆)𝑏) ∈ 𝐵)
29	28	3expb 1138	. . . . . . 7 ⊢ ((𝑆 ∈ Mgm ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝑎(+g‘𝑆)𝑏) ∈ 𝐵)
30	29	adantlr 728	. . . . . 6 ⊢ (((𝑆 ∈ Mgm ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝑎(+g‘𝑆)𝑏) ∈ 𝐵)
31	16, 25, 30, 19	fvmptd 6995	. . . . 5 ⊢ (((𝑆 ∈ Mgm ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝐻‘(𝑎(+g‘𝑆)𝑏)) = 0 )
32	15, 24, 31	3eqtr4rd 2806	. . . 4 ⊢ (((𝑆 ∈ Mgm ∧ 𝑇 ∈ Mnd) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝐻‘(𝑎(+g‘𝑆)𝑏)) = ((𝐻‘𝑎)(+g‘𝑇)(𝐻‘𝑏)))
33	32	ralrimivva 3205	. . 3 ⊢ ((𝑆 ∈ Mgm ∧ 𝑇 ∈ Mnd) → ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝐻‘(𝑎(+g‘𝑆)𝑏)) = ((𝐻‘𝑎)(+g‘𝑇)(𝐻‘𝑏)))
34	9, 33	jca 521	. 2 ⊢ ((𝑆 ∈ Mgm ∧ 𝑇 ∈ Mnd) → (𝐻:𝐵⟶(Base‘𝑇) ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝐻‘(𝑎(+g‘𝑆)𝑏)) = ((𝐻‘𝑎)(+g‘𝑇)(𝐻‘𝑏))))
35	26, 3, 27, 12	ismgmhm 18801	. 2 ⊢ (𝐻 ∈ (𝑆 MgmHom 𝑇) ↔ ((𝑆 ∈ Mgm ∧ 𝑇 ∈ Mgm) ∧ (𝐻:𝐵⟶(Base‘𝑇) ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝐻‘(𝑎(+g‘𝑆)𝑏)) = ((𝐻‘𝑎)(+g‘𝑇)(𝐻‘𝑏)))))
36	2, 34, 35	sylanbrc 595	1 ⊢ ((𝑆 ∈ Mgm ∧ 𝑇 ∈ Mnd) → 𝐻 ∈ (𝑆 MgmHom 𝑇))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3076   ↦ cmpt 5186  ⟶wf 6529  ‘cfv 6533  (class class class)co 7414  Basecbs 17304  +_gcplusg 17345  0_gc0g 17527  Mgmcmgm 18731   MgmHom cmgmhm 18795  Mndcmnd 18839

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-fv 6541  df-riota 7371  df-ov 7417  df-oprab 7418  df-mpo 7419  df-map 8831  df-0g 17529  df-mgm 18733  df-mgmhm 18797  df-sgrp 18824  df-mnd 18840

This theorem is used by:  c0rnghm  20700