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

Theorem zrrnghm 20536
Description: The constant mapping to zero is a non-unital ring homomorphism from the zero ring to any non-unital ring. (Contributed by AV, 17-Apr-2020.)
Hypotheses
Ref Expression
zrrnghm.b 𝐵 = (Base‘𝑇)
zrrnghm.0 0 = (0g𝑆)
zrrnghm.h 𝐻 = (𝑥𝐵0 )
Assertion
Ref Expression
zrrnghm ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → 𝐻 ∈ (𝑇 RngHom 𝑆))
Distinct variable groups:   𝑥,𝐵   𝑥,𝑆   𝑥,𝑇   𝑥, 0
Allowed substitution hint:   𝐻(𝑥)

Proof of Theorem zrrnghm
Dummy variables 𝑎 𝑐 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eldifi 4131 . . . . 5 (𝑇 ∈ (Ring ∖ NzRing) → 𝑇 ∈ Ring)
2 ringrng 20282 . . . . 5 (𝑇 ∈ Ring → 𝑇 ∈ Rng)
31, 2syl 17 . . . 4 (𝑇 ∈ (Ring ∖ NzRing) → 𝑇 ∈ Rng)
43anim1i 615 . . 3 ((𝑇 ∈ (Ring ∖ NzRing) ∧ 𝑆 ∈ Rng) → (𝑇 ∈ Rng ∧ 𝑆 ∈ Rng))
54ancoms 458 . 2 ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → (𝑇 ∈ Rng ∧ 𝑆 ∈ Rng))
6 rngabl 20152 . . . . . 6 (𝑆 ∈ Rng → 𝑆 ∈ Abel)
7 ablgrp 19803 . . . . . 6 (𝑆 ∈ Abel → 𝑆 ∈ Grp)
86, 7syl 17 . . . . 5 (𝑆 ∈ Rng → 𝑆 ∈ Grp)
98adantr 480 . . . 4 ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → 𝑆 ∈ Grp)
10 ringgrp 20235 . . . . . 6 (𝑇 ∈ Ring → 𝑇 ∈ Grp)
111, 10syl 17 . . . . 5 (𝑇 ∈ (Ring ∖ NzRing) → 𝑇 ∈ Grp)
1211adantl 481 . . . 4 ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → 𝑇 ∈ Grp)
13 zrrnghm.b . . . . . 6 𝐵 = (Base‘𝑇)
14 eqid 2737 . . . . . 6 (0g𝑇) = (0g𝑇)
1513, 140ringbas 20528 . . . . 5 (𝑇 ∈ (Ring ∖ NzRing) → 𝐵 = {(0g𝑇)})
1615adantl 481 . . . 4 ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → 𝐵 = {(0g𝑇)})
17 zrrnghm.0 . . . . 5 0 = (0g𝑆)
18 zrrnghm.h . . . . 5 𝐻 = (𝑥𝐵0 )
1913, 17, 18, 14c0snghm 20464 . . . 4 ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp ∧ 𝐵 = {(0g𝑇)}) → 𝐻 ∈ (𝑇 GrpHom 𝑆))
209, 12, 16, 19syl3anc 1373 . . 3 ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → 𝐻 ∈ (𝑇 GrpHom 𝑆))
2118a1i 11 . . . . . . . 8 (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) → 𝐻 = (𝑥𝐵0 ))
22 eqidd 2738 . . . . . . . 8 ((((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) ∧ 𝑥 = (0g𝑇)) → 0 = 0 )
2313, 14ring0cl 20264 . . . . . . . . . 10 (𝑇 ∈ Ring → (0g𝑇) ∈ 𝐵)
241, 23syl 17 . . . . . . . . 9 (𝑇 ∈ (Ring ∖ NzRing) → (0g𝑇) ∈ 𝐵)
2524ad2antlr 727 . . . . . . . 8 (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) → (0g𝑇) ∈ 𝐵)
2617fvexi 6920 . . . . . . . . 9 0 ∈ V
2726a1i 11 . . . . . . . 8 (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) → 0 ∈ V)
2821, 22, 25, 27fvmptd 7023 . . . . . . 7 (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) → (𝐻‘(0g𝑇)) = 0 )
29 eqid 2737 . . . . . . . . . . . . . 14 (Base‘𝑆) = (Base‘𝑆)
3029, 17grpidcl 18983 . . . . . . . . . . . . 13 (𝑆 ∈ Grp → 0 ∈ (Base‘𝑆))
318, 30syl 17 . . . . . . . . . . . 12 (𝑆 ∈ Rng → 0 ∈ (Base‘𝑆))
32 eqid 2737 . . . . . . . . . . . . 13 (.r𝑆) = (.r𝑆)
3329, 32, 17rnglz 20162 . . . . . . . . . . . 12 ((𝑆 ∈ Rng ∧ 0 ∈ (Base‘𝑆)) → ( 0 (.r𝑆) 0 ) = 0 )
3431, 33mpdan 687 . . . . . . . . . . 11 (𝑆 ∈ Rng → ( 0 (.r𝑆) 0 ) = 0 )
3534adantr 480 . . . . . . . . . 10 ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → ( 0 (.r𝑆) 0 ) = 0 )
3635adantr 480 . . . . . . . . 9 (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) → ( 0 (.r𝑆) 0 ) = 0 )
3736adantr 480 . . . . . . . 8 ((((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) ∧ (𝐻‘(0g𝑇)) = 0 ) → ( 0 (.r𝑆) 0 ) = 0 )
38 simpr 484 . . . . . . . . 9 ((((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) ∧ (𝐻‘(0g𝑇)) = 0 ) → (𝐻‘(0g𝑇)) = 0 )
3938, 38oveq12d 7449 . . . . . . . 8 ((((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) ∧ (𝐻‘(0g𝑇)) = 0 ) → ((𝐻‘(0g𝑇))(.r𝑆)(𝐻‘(0g𝑇))) = ( 0 (.r𝑆) 0 ))
40 eqid 2737 . . . . . . . . . . . . . 14 (.r𝑇) = (.r𝑇)
4113, 40, 14ringlz 20290 . . . . . . . . . . . . 13 ((𝑇 ∈ Ring ∧ (0g𝑇) ∈ 𝐵) → ((0g𝑇)(.r𝑇)(0g𝑇)) = (0g𝑇))
421, 23, 41syl2anc2 585 . . . . . . . . . . . 12 (𝑇 ∈ (Ring ∖ NzRing) → ((0g𝑇)(.r𝑇)(0g𝑇)) = (0g𝑇))
4342ad2antlr 727 . . . . . . . . . . 11 (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) → ((0g𝑇)(.r𝑇)(0g𝑇)) = (0g𝑇))
4443adantr 480 . . . . . . . . . 10 ((((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) ∧ (𝐻‘(0g𝑇)) = 0 ) → ((0g𝑇)(.r𝑇)(0g𝑇)) = (0g𝑇))
4544fveq2d 6910 . . . . . . . . 9 ((((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) ∧ (𝐻‘(0g𝑇)) = 0 ) → (𝐻‘((0g𝑇)(.r𝑇)(0g𝑇))) = (𝐻‘(0g𝑇)))
4645, 38eqtrd 2777 . . . . . . . 8 ((((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) ∧ (𝐻‘(0g𝑇)) = 0 ) → (𝐻‘((0g𝑇)(.r𝑇)(0g𝑇))) = 0 )
4737, 39, 463eqtr4rd 2788 . . . . . . 7 ((((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) ∧ (𝐻‘(0g𝑇)) = 0 ) → (𝐻‘((0g𝑇)(.r𝑇)(0g𝑇))) = ((𝐻‘(0g𝑇))(.r𝑆)(𝐻‘(0g𝑇))))
4828, 47mpdan 687 . . . . . 6 (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) → (𝐻‘((0g𝑇)(.r𝑇)(0g𝑇))) = ((𝐻‘(0g𝑇))(.r𝑆)(𝐻‘(0g𝑇))))
4923, 23jca 511 . . . . . . . . 9 (𝑇 ∈ Ring → ((0g𝑇) ∈ 𝐵 ∧ (0g𝑇) ∈ 𝐵))
501, 49syl 17 . . . . . . . 8 (𝑇 ∈ (Ring ∖ NzRing) → ((0g𝑇) ∈ 𝐵 ∧ (0g𝑇) ∈ 𝐵))
5150ad2antlr 727 . . . . . . 7 (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) → ((0g𝑇) ∈ 𝐵 ∧ (0g𝑇) ∈ 𝐵))
52 fvoveq1 7454 . . . . . . . . 9 (𝑎 = (0g𝑇) → (𝐻‘(𝑎(.r𝑇)𝑐)) = (𝐻‘((0g𝑇)(.r𝑇)𝑐)))
53 fveq2 6906 . . . . . . . . . 10 (𝑎 = (0g𝑇) → (𝐻𝑎) = (𝐻‘(0g𝑇)))
5453oveq1d 7446 . . . . . . . . 9 (𝑎 = (0g𝑇) → ((𝐻𝑎)(.r𝑆)(𝐻𝑐)) = ((𝐻‘(0g𝑇))(.r𝑆)(𝐻𝑐)))
5552, 54eqeq12d 2753 . . . . . . . 8 (𝑎 = (0g𝑇) → ((𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐)) ↔ (𝐻‘((0g𝑇)(.r𝑇)𝑐)) = ((𝐻‘(0g𝑇))(.r𝑆)(𝐻𝑐))))
56 oveq2 7439 . . . . . . . . . 10 (𝑐 = (0g𝑇) → ((0g𝑇)(.r𝑇)𝑐) = ((0g𝑇)(.r𝑇)(0g𝑇)))
5756fveq2d 6910 . . . . . . . . 9 (𝑐 = (0g𝑇) → (𝐻‘((0g𝑇)(.r𝑇)𝑐)) = (𝐻‘((0g𝑇)(.r𝑇)(0g𝑇))))
58 fveq2 6906 . . . . . . . . . 10 (𝑐 = (0g𝑇) → (𝐻𝑐) = (𝐻‘(0g𝑇)))
5958oveq2d 7447 . . . . . . . . 9 (𝑐 = (0g𝑇) → ((𝐻‘(0g𝑇))(.r𝑆)(𝐻𝑐)) = ((𝐻‘(0g𝑇))(.r𝑆)(𝐻‘(0g𝑇))))
6057, 59eqeq12d 2753 . . . . . . . 8 (𝑐 = (0g𝑇) → ((𝐻‘((0g𝑇)(.r𝑇)𝑐)) = ((𝐻‘(0g𝑇))(.r𝑆)(𝐻𝑐)) ↔ (𝐻‘((0g𝑇)(.r𝑇)(0g𝑇))) = ((𝐻‘(0g𝑇))(.r𝑆)(𝐻‘(0g𝑇)))))
6155, 602ralsng 4678 . . . . . . 7 (((0g𝑇) ∈ 𝐵 ∧ (0g𝑇) ∈ 𝐵) → (∀𝑎 ∈ {(0g𝑇)}∀𝑐 ∈ {(0g𝑇)} (𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐)) ↔ (𝐻‘((0g𝑇)(.r𝑇)(0g𝑇))) = ((𝐻‘(0g𝑇))(.r𝑆)(𝐻‘(0g𝑇)))))
6251, 61syl 17 . . . . . 6 (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) → (∀𝑎 ∈ {(0g𝑇)}∀𝑐 ∈ {(0g𝑇)} (𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐)) ↔ (𝐻‘((0g𝑇)(.r𝑇)(0g𝑇))) = ((𝐻‘(0g𝑇))(.r𝑆)(𝐻‘(0g𝑇)))))
6348, 62mpbird 257 . . . . 5 (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) → ∀𝑎 ∈ {(0g𝑇)}∀𝑐 ∈ {(0g𝑇)} (𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐)))
64 raleq 3323 . . . . . . 7 (𝐵 = {(0g𝑇)} → (∀𝑐𝐵 (𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐)) ↔ ∀𝑐 ∈ {(0g𝑇)} (𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐))))
6564raleqbi1dv 3338 . . . . . 6 (𝐵 = {(0g𝑇)} → (∀𝑎𝐵𝑐𝐵 (𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐)) ↔ ∀𝑎 ∈ {(0g𝑇)}∀𝑐 ∈ {(0g𝑇)} (𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐))))
6665adantl 481 . . . . 5 (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) → (∀𝑎𝐵𝑐𝐵 (𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐)) ↔ ∀𝑎 ∈ {(0g𝑇)}∀𝑐 ∈ {(0g𝑇)} (𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐))))
6763, 66mpbird 257 . . . 4 (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) → ∀𝑎𝐵𝑐𝐵 (𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐)))
6816, 67mpdan 687 . . 3 ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → ∀𝑎𝐵𝑐𝐵 (𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐)))
6920, 68jca 511 . 2 ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → (𝐻 ∈ (𝑇 GrpHom 𝑆) ∧ ∀𝑎𝐵𝑐𝐵 (𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐))))
7013, 40, 32isrnghm 20441 . 2 (𝐻 ∈ (𝑇 RngHom 𝑆) ↔ ((𝑇 ∈ Rng ∧ 𝑆 ∈ Rng) ∧ (𝐻 ∈ (𝑇 GrpHom 𝑆) ∧ ∀𝑎𝐵𝑐𝐵 (𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐)))))
715, 69, 70sylanbrc 583 1 ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → 𝐻 ∈ (𝑇 RngHom 𝑆))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1540  wcel 2108  wral 3061  Vcvv 3480  cdif 3948  {csn 4626  cmpt 5225  cfv 6561  (class class class)co 7431  Basecbs 17247  .rcmulr 17298  0gc0g 17484  Grpcgrp 18951   GrpHom cghm 19230  Abelcabl 19799  Rngcrng 20149  Ringcrg 20230   RngHom crnghm 20434  NzRingcnzr 20512
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 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755  ax-cnex 11211  ax-resscn 11212  ax-1cn 11213  ax-icn 11214  ax-addcl 11215  ax-addrcl 11216  ax-mulcl 11217  ax-mulrcl 11218  ax-mulcom 11219  ax-addass 11220  ax-mulass 11221  ax-distr 11222  ax-i2m1 11223  ax-1ne0 11224  ax-1rid 11225  ax-rnegex 11226  ax-rrecex 11227  ax-cnre 11228  ax-pre-lttri 11229  ax-pre-lttrn 11230  ax-pre-ltadd 11231  ax-pre-mulgt0 11232
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-nel 3047  df-ral 3062  df-rex 3071  df-rmo 3380  df-reu 3381  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-pss 3971  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-int 4947  df-iun 4993  df-br 5144  df-opab 5206  df-mpt 5226  df-tr 5260  df-id 5578  df-eprel 5584  df-po 5592  df-so 5593  df-fr 5637  df-we 5639  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-pred 6321  df-ord 6387  df-on 6388  df-lim 6389  df-suc 6390  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-riota 7388  df-ov 7434  df-oprab 7435  df-mpo 7436  df-om 7888  df-1st 8014  df-2nd 8015  df-frecs 8306  df-wrecs 8337  df-recs 8411  df-rdg 8450  df-1o 8506  df-oadd 8510  df-er 8745  df-map 8868  df-en 8986  df-dom 8987  df-sdom 8988  df-fin 8989  df-dju 9941  df-card 9979  df-pnf 11297  df-mnf 11298  df-xr 11299  df-ltxr 11300  df-le 11301  df-sub 11494  df-neg 11495  df-nn 12267  df-2 12329  df-n0 12527  df-xnn0 12600  df-z 12614  df-uz 12879  df-fz 13548  df-hash 14370  df-sets 17201  df-slot 17219  df-ndx 17231  df-base 17248  df-plusg 17310  df-0g 17486  df-mgm 18653  df-mgmhm 18705  df-sgrp 18732  df-mnd 18748  df-mhm 18796  df-grp 18954  df-minusg 18955  df-ghm 19231  df-cmn 19800  df-abl 19801  df-mgp 20138  df-rng 20150  df-ur 20179  df-ring 20232  df-rnghm 20436  df-nzr 20513
This theorem is referenced by:  zrinitorngc  20642
  Copyright terms: Public domain W3C validator