MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  c0mhm Structured version   Visualization version   GIF version

Theorem c0mhm 20369
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 2729 . . . . . . . 8 (Base‘𝑇) = (Base‘𝑇)
2 c0mhm.0 . . . . . . . 8 0 = (0g𝑇)
31, 2mndidcl 18676 . . . . . . 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 7086 . . . 4 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → 𝐻:𝐵⟶(Base‘𝑇))
83ancli 548 . . . . . . . . 9 (𝑇 ∈ Mnd → (𝑇 ∈ Mnd ∧ 0 ∈ (Base‘𝑇)))
98adantl 481 . . . . . . . 8 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → (𝑇 ∈ Mnd ∧ 0 ∈ (Base‘𝑇)))
10 eqid 2729 . . . . . . . . 9 (+g𝑇) = (+g𝑇)
111, 10, 2mndlid 18681 . . . . . . . 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 2730 . . . . . . . 8 ((((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎𝐵𝑏𝐵)) ∧ 𝑥 = 𝑎) → 0 = 0 )
16 simprl 770 . . . . . . . 8 (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎𝐵𝑏𝐵)) → 𝑎𝐵)
174adantr 480 . . . . . . . 8 (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎𝐵𝑏𝐵)) → 0 ∈ (Base‘𝑇))
1814, 15, 16, 17fvmptd 6975 . . . . . . 7 (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎𝐵𝑏𝐵)) → (𝐻𝑎) = 0 )
19 eqidd 2730 . . . . . . . 8 ((((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎𝐵𝑏𝐵)) ∧ 𝑥 = 𝑏) → 0 = 0 )
20 simprr 772 . . . . . . . 8 (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎𝐵𝑏𝐵)) → 𝑏𝐵)
2114, 19, 20, 17fvmptd 6975 . . . . . . 7 (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎𝐵𝑏𝐵)) → (𝐻𝑏) = 0 )
2218, 21oveq12d 7405 . . . . . 6 (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎𝐵𝑏𝐵)) → ((𝐻𝑎)(+g𝑇)(𝐻𝑏)) = ( 0 (+g𝑇) 0 ))
23 eqidd 2730 . . . . . . 7 ((((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎𝐵𝑏𝐵)) ∧ 𝑥 = (𝑎(+g𝑆)𝑏)) → 0 = 0 )
24 c0mhm.b . . . . . . . . . 10 𝐵 = (Base‘𝑆)
25 eqid 2729 . . . . . . . . . 10 (+g𝑆) = (+g𝑆)
2624, 25mndcl 18669 . . . . . . . . 9 ((𝑆 ∈ Mnd ∧ 𝑎𝐵𝑏𝐵) → (𝑎(+g𝑆)𝑏) ∈ 𝐵)
27263expb 1120 . . . . . . . 8 ((𝑆 ∈ Mnd ∧ (𝑎𝐵𝑏𝐵)) → (𝑎(+g𝑆)𝑏) ∈ 𝐵)
2827adantlr 715 . . . . . . 7 (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎𝐵𝑏𝐵)) → (𝑎(+g𝑆)𝑏) ∈ 𝐵)
2914, 23, 28, 17fvmptd 6975 . . . . . 6 (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎𝐵𝑏𝐵)) → (𝐻‘(𝑎(+g𝑆)𝑏)) = 0 )
3013, 22, 293eqtr4rd 2775 . . . . 5 (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝑎𝐵𝑏𝐵)) → (𝐻‘(𝑎(+g𝑆)𝑏)) = ((𝐻𝑎)(+g𝑇)(𝐻𝑏)))
3130ralrimivva 3180 . . . 4 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → ∀𝑎𝐵𝑏𝐵 (𝐻‘(𝑎(+g𝑆)𝑏)) = ((𝐻𝑎)(+g𝑇)(𝐻𝑏)))
326a1i 11 . . . . 5 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → 𝐻 = (𝑥𝐵0 ))
33 eqidd 2730 . . . . 5 (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ 𝑥 = (0g𝑆)) → 0 = 0 )
34 eqid 2729 . . . . . . 7 (0g𝑆) = (0g𝑆)
3524, 34mndidcl 18676 . . . . . 6 (𝑆 ∈ Mnd → (0g𝑆) ∈ 𝐵)
3635adantr 480 . . . . 5 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → (0g𝑆) ∈ 𝐵)
3732, 33, 36, 4fvmptd 6975 . . . 4 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → (𝐻‘(0g𝑆)) = 0 )
387, 31, 373jca 1128 . . 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 18712 . 2 (𝐻 ∈ (𝑆 MndHom 𝑇) ↔ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝐻:𝐵⟶(Base‘𝑇) ∧ ∀𝑎𝐵𝑏𝐵 (𝐻‘(𝑎(+g𝑆)𝑏)) = ((𝐻𝑎)(+g𝑇)(𝐻𝑏)) ∧ (𝐻‘(0g𝑆)) = 0 )))
4139, 40sylibr 234 1 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → 𝐻 ∈ (𝑆 MndHom 𝑇))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1086   = wceq 1540  wcel 2109  wral 3044  cmpt 5188  wf 6507  cfv 6511  (class class class)co 7387  Basecbs 17179  +gcplusg 17220  0gc0g 17402  Mndcmnd 18661   MndHom cmhm 18708
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rmo 3354  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-opab 5170  df-mpt 5189  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-fv 6519  df-riota 7344  df-ov 7390  df-oprab 7391  df-mpo 7392  df-map 8801  df-0g 17404  df-mgm 18567  df-sgrp 18646  df-mnd 18662  df-mhm 18710
This theorem is referenced by:  c0ghm  20370  c0rhm  20443
  Copyright terms: Public domain W3C validator