Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  c0mhm Structured version   Visualization version   GIF version

Theorem c0mhm 45356
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.
StepHypRef Expression
1 eqid 2738 . . . . . . . 8 (Base‘𝑇) = (Base‘𝑇)
2 c0mhm.0 . . . . . . . 8 0 = (0g𝑇)
31, 2mndidcl 18315 . . . . . . 7 (𝑇 ∈ Mnd → 0 ∈ (Base‘𝑇))
43adantl 481 . . . . . 6 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → 0 ∈ (Base‘𝑇))
54adantr 480 . . . . 5 (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ 𝑥𝐵) → 0 ∈ (Base‘𝑇))
6 c0mhm.h . . . . 5 𝐻 = (𝑥𝐵0 )
75, 6fmptd 6970 . . . 4 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → 𝐻:𝐵⟶(Base‘𝑇))
83ancli 548 . . . . . . . . 9 (𝑇 ∈ Mnd → (𝑇 ∈ Mnd ∧ 0 ∈ (Base‘𝑇)))
98adantl 481 . . . . . . . 8 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → (𝑇 ∈ Mnd ∧ 0 ∈ (Base‘𝑇)))
10 eqid 2738 . . . . . . . . 9 (+g𝑇) = (+g𝑇)
111, 10, 2mndlid 18320 . . . . . . . 8 ((𝑇 ∈ Mnd ∧ 0 ∈ (Base‘𝑇)) → ( 0 (+g𝑇) 0 ) = 0 )
129, 11syl 17 . . . . . . 7 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → ( 0 (+g𝑇) 0 ) = 0 )
1312adantr 480 . . . . . 6 (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎𝐵𝑏𝐵)) → ( 0 (+g𝑇) 0 ) = 0 )
146a1i 11 . . . . . . . 8 (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎𝐵𝑏𝐵)) → 𝐻 = (𝑥𝐵0 ))
15 eqidd 2739 . . . . . . . 8 ((((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎𝐵𝑏𝐵)) ∧ 𝑥 = 𝑎) → 0 = 0 )
16 simprl 767 . . . . . . . 8 (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎𝐵𝑏𝐵)) → 𝑎𝐵)
174adantr 480 . . . . . . . 8 (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎𝐵𝑏𝐵)) → 0 ∈ (Base‘𝑇))
1814, 15, 16, 17fvmptd 6864 . . . . . . 7 (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎𝐵𝑏𝐵)) → (𝐻𝑎) = 0 )
19 eqidd 2739 . . . . . . . 8 ((((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎𝐵𝑏𝐵)) ∧ 𝑥 = 𝑏) → 0 = 0 )
20 simprr 769 . . . . . . . 8 (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎𝐵𝑏𝐵)) → 𝑏𝐵)
2114, 19, 20, 17fvmptd 6864 . . . . . . 7 (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎𝐵𝑏𝐵)) → (𝐻𝑏) = 0 )
2218, 21oveq12d 7273 . . . . . 6 (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎𝐵𝑏𝐵)) → ((𝐻𝑎)(+g𝑇)(𝐻𝑏)) = ( 0 (+g𝑇) 0 ))
23 eqidd 2739 . . . . . . 7 ((((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎𝐵𝑏𝐵)) ∧ 𝑥 = (𝑎(+g𝑆)𝑏)) → 0 = 0 )
24 c0mhm.b . . . . . . . . . 10 𝐵 = (Base‘𝑆)
25 eqid 2738 . . . . . . . . . 10 (+g𝑆) = (+g𝑆)
2624, 25mndcl 18308 . . . . . . . . 9 ((𝑆 ∈ Mnd ∧ 𝑎𝐵𝑏𝐵) → (𝑎(+g𝑆)𝑏) ∈ 𝐵)
27263expb 1118 . . . . . . . 8 ((𝑆 ∈ Mnd ∧ (𝑎𝐵𝑏𝐵)) → (𝑎(+g𝑆)𝑏) ∈ 𝐵)
2827adantlr 711 . . . . . . 7 (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎𝐵𝑏𝐵)) → (𝑎(+g𝑆)𝑏) ∈ 𝐵)
2914, 23, 28, 17fvmptd 6864 . . . . . 6 (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎𝐵𝑏𝐵)) → (𝐻‘(𝑎(+g𝑆)𝑏)) = 0 )
3013, 22, 293eqtr4rd 2789 . . . . 5 (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎𝐵𝑏𝐵)) → (𝐻‘(𝑎(+g𝑆)𝑏)) = ((𝐻𝑎)(+g𝑇)(𝐻𝑏)))
3130ralrimivva 3114 . . . 4 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → ∀𝑎𝐵𝑏𝐵 (𝐻‘(𝑎(+g𝑆)𝑏)) = ((𝐻𝑎)(+g𝑇)(𝐻𝑏)))
326a1i 11 . . . . 5 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → 𝐻 = (𝑥𝐵0 ))
33 eqidd 2739 . . . . 5 (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ 𝑥 = (0g𝑆)) → 0 = 0 )
34 eqid 2738 . . . . . . 7 (0g𝑆) = (0g𝑆)
3524, 34mndidcl 18315 . . . . . 6 (𝑆 ∈ Mnd → (0g𝑆) ∈ 𝐵)
3635adantr 480 . . . . 5 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → (0g𝑆) ∈ 𝐵)
3732, 33, 36, 4fvmptd 6864 . . . 4 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → (𝐻‘(0g𝑆)) = 0 )
387, 31, 373jca 1126 . . 3 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → (𝐻:𝐵⟶(Base‘𝑇) ∧ ∀𝑎𝐵𝑏𝐵 (𝐻‘(𝑎(+g𝑆)𝑏)) = ((𝐻𝑎)(+g𝑇)(𝐻𝑏)) ∧ (𝐻‘(0g𝑆)) = 0 ))
3938ancli 548 . 2 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝐻:𝐵⟶(Base‘𝑇) ∧ ∀𝑎𝐵𝑏𝐵 (𝐻‘(𝑎(+g𝑆)𝑏)) = ((𝐻𝑎)(+g𝑇)(𝐻𝑏)) ∧ (𝐻‘(0g𝑆)) = 0 )))
4024, 1, 25, 10, 34, 2ismhm 18347 . 2 (𝐻 ∈ (𝑆 MndHom 𝑇) ↔ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝐻:𝐵⟶(Base‘𝑇) ∧ ∀𝑎𝐵𝑏𝐵 (𝐻‘(𝑎(+g𝑆)𝑏)) = ((𝐻𝑎)(+g𝑇)(𝐻𝑏)) ∧ (𝐻‘(0g𝑆)) = 0 )))
4139, 40sylibr 233 1 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → 𝐻 ∈ (𝑆 MndHom 𝑇))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1085   = wceq 1539  wcel 2108  wral 3063  cmpt 5153  wf 6414  cfv 6418  (class class class)co 7255  Basecbs 16840  +gcplusg 16888  0gc0g 17067  Mndcmnd 18300   MndHom cmhm 18343
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rmo 3071  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-fv 6426  df-riota 7212  df-ov 7258  df-oprab 7259  df-mpo 7260  df-map 8575  df-0g 17069  df-mgm 18241  df-sgrp 18290  df-mnd 18301  df-mhm 18345
This theorem is referenced by:  c0ghm  45357  c0rhm  45358
  Copyright terms: Public domain W3C validator