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

Theorem zrrnghm 20473
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 4084 . . . . 5 (𝑇 ∈ (Ring ∖ NzRing) → 𝑇 ∈ Ring)
2 ringrng 20224 . . . . 5 (𝑇 ∈ Ring → 𝑇 ∈ Rng)
31, 2syl 17 . . . 4 (𝑇 ∈ (Ring ∖ NzRing) → 𝑇 ∈ Rng)
43anim1i 616 . . 3 ((𝑇 ∈ (Ring ∖ NzRing) ∧ 𝑆 ∈ Rng) → (𝑇 ∈ Rng ∧ 𝑆 ∈ Rng))
54ancoms 458 . 2 ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → (𝑇 ∈ Rng ∧ 𝑆 ∈ Rng))
6 rngabl 20094 . . . . . 6 (𝑆 ∈ Rng → 𝑆 ∈ Abel)
7 ablgrp 19718 . . . . . 6 (𝑆 ∈ Abel → 𝑆 ∈ Grp)
86, 7syl 17 . . . . 5 (𝑆 ∈ Rng → 𝑆 ∈ Grp)
98adantr 480 . . . 4 ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → 𝑆 ∈ Grp)
10 ringgrp 20177 . . . . . 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 20465 . . . . 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 20404 . . . 4 ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp ∧ 𝐵 = {(0g𝑇)}) → 𝐻 ∈ (𝑇 GrpHom 𝑆))
209, 12, 16, 19syl3anc 1374 . . 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 20206 . . . . . . . . . 10 (𝑇 ∈ Ring → (0g𝑇) ∈ 𝐵)
241, 23syl 17 . . . . . . . . 9 (𝑇 ∈ (Ring ∖ NzRing) → (0g𝑇) ∈ 𝐵)
2524ad2antlr 728 . . . . . . . 8 (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) → (0g𝑇) ∈ 𝐵)
2617fvexi 6849 . . . . . . . . 9 0 ∈ V
2726a1i 11 . . . . . . . 8 (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) → 0 ∈ V)
2821, 22, 25, 27fvmptd 6950 . . . . . . 7 (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) → (𝐻‘(0g𝑇)) = 0 )
29 eqid 2737 . . . . . . . . . . . . . 14 (Base‘𝑆) = (Base‘𝑆)
3029, 17grpidcl 18899 . . . . . . . . . . . . 13 (𝑆 ∈ Grp → 0 ∈ (Base‘𝑆))
318, 30syl 17 . . . . . . . . . . . 12 (𝑆 ∈ Rng → 0 ∈ (Base‘𝑆))
32 eqid 2737 . . . . . . . . . . . . 13 (.r𝑆) = (.r𝑆)
3329, 32, 17rnglz 20104 . . . . . . . . . . . 12 ((𝑆 ∈ Rng ∧ 0 ∈ (Base‘𝑆)) → ( 0 (.r𝑆) 0 ) = 0 )
3431, 33mpdan 688 . . . . . . . . . . 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 7378 . . . . . . . 8 ((((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) ∧ (𝐻‘(0g𝑇)) = 0 ) → ((𝐻‘(0g𝑇))(.r𝑆)(𝐻‘(0g𝑇))) = ( 0 (.r𝑆) 0 ))
40 eqid 2737 . . . . . . . . . . . . . 14 (.r𝑇) = (.r𝑇)
4113, 40, 14ringlz 20232 . . . . . . . . . . . . 13 ((𝑇 ∈ Ring ∧ (0g𝑇) ∈ 𝐵) → ((0g𝑇)(.r𝑇)(0g𝑇)) = (0g𝑇))
421, 23, 41syl2anc2 586 . . . . . . . . . . . 12 (𝑇 ∈ (Ring ∖ NzRing) → ((0g𝑇)(.r𝑇)(0g𝑇)) = (0g𝑇))
4342ad2antlr 728 . . . . . . . . . . 11 (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) → ((0g𝑇)(.r𝑇)(0g𝑇)) = (0g𝑇))
4443adantr 480 . . . . . . . . . 10 ((((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) ∧ (𝐻‘(0g𝑇)) = 0 ) → ((0g𝑇)(.r𝑇)(0g𝑇)) = (0g𝑇))
4544fveq2d 6839 . . . . . . . . 9 ((((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) ∧ (𝐻‘(0g𝑇)) = 0 ) → (𝐻‘((0g𝑇)(.r𝑇)(0g𝑇))) = (𝐻‘(0g𝑇)))
4645, 38eqtrd 2772 . . . . . . . 8 ((((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) ∧ (𝐻‘(0g𝑇)) = 0 ) → (𝐻‘((0g𝑇)(.r𝑇)(0g𝑇))) = 0 )
4737, 39, 463eqtr4rd 2783 . . . . . . 7 ((((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) ∧ (𝐻‘(0g𝑇)) = 0 ) → (𝐻‘((0g𝑇)(.r𝑇)(0g𝑇))) = ((𝐻‘(0g𝑇))(.r𝑆)(𝐻‘(0g𝑇))))
4828, 47mpdan 688 . . . . . 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 728 . . . . . . 7 (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) → ((0g𝑇) ∈ 𝐵 ∧ (0g𝑇) ∈ 𝐵))
52 fvoveq1 7383 . . . . . . . . 9 (𝑎 = (0g𝑇) → (𝐻‘(𝑎(.r𝑇)𝑐)) = (𝐻‘((0g𝑇)(.r𝑇)𝑐)))
53 fveq2 6835 . . . . . . . . . 10 (𝑎 = (0g𝑇) → (𝐻𝑎) = (𝐻‘(0g𝑇)))
5453oveq1d 7375 . . . . . . . . 9 (𝑎 = (0g𝑇) → ((𝐻𝑎)(.r𝑆)(𝐻𝑐)) = ((𝐻‘(0g𝑇))(.r𝑆)(𝐻𝑐)))
5552, 54eqeq12d 2753 . . . . . . . 8 (𝑎 = (0g𝑇) → ((𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐)) ↔ (𝐻‘((0g𝑇)(.r𝑇)𝑐)) = ((𝐻‘(0g𝑇))(.r𝑆)(𝐻𝑐))))
56 oveq2 7368 . . . . . . . . . 10 (𝑐 = (0g𝑇) → ((0g𝑇)(.r𝑇)𝑐) = ((0g𝑇)(.r𝑇)(0g𝑇)))
5756fveq2d 6839 . . . . . . . . 9 (𝑐 = (0g𝑇) → (𝐻‘((0g𝑇)(.r𝑇)𝑐)) = (𝐻‘((0g𝑇)(.r𝑇)(0g𝑇))))
58 fveq2 6835 . . . . . . . . . 10 (𝑐 = (0g𝑇) → (𝐻𝑐) = (𝐻‘(0g𝑇)))
5958oveq2d 7376 . . . . . . . . 9 (𝑐 = (0g𝑇) → ((𝐻‘(0g𝑇))(.r𝑆)(𝐻𝑐)) = ((𝐻‘(0g𝑇))(.r𝑆)(𝐻‘(0g𝑇))))
6057, 59eqeq12d 2753 . . . . . . . 8 (𝑐 = (0g𝑇) → ((𝐻‘((0g𝑇)(.r𝑇)𝑐)) = ((𝐻‘(0g𝑇))(.r𝑆)(𝐻𝑐)) ↔ (𝐻‘((0g𝑇)(.r𝑇)(0g𝑇))) = ((𝐻‘(0g𝑇))(.r𝑆)(𝐻‘(0g𝑇)))))
6155, 602ralsng 4636 . . . . . . 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 3294 . . . . . . 7 (𝐵 = {(0g𝑇)} → (∀𝑐𝐵 (𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐)) ↔ ∀𝑐 ∈ {(0g𝑇)} (𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐))))
6564raleqbi1dv 3309 . . . . . 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 688 . . 3 ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → ∀𝑎𝐵𝑐𝐵 (𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐)))
6920, 68jca 511 . 2 ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → (𝐻 ∈ (𝑇 GrpHom 𝑆) ∧ ∀𝑎𝐵𝑐𝐵 (𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐))))
7013, 40, 32isrnghm 20381 . 2 (𝐻 ∈ (𝑇 RngHom 𝑆) ↔ ((𝑇 ∈ Rng ∧ 𝑆 ∈ Rng) ∧ (𝐻 ∈ (𝑇 GrpHom 𝑆) ∧ ∀𝑎𝐵𝑐𝐵 (𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐)))))
715, 69, 70sylanbrc 584 1 ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → 𝐻 ∈ (𝑇 RngHom 𝑆))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1542  wcel 2114  wral 3052  Vcvv 3441  cdif 3899  {csn 4581  cmpt 5180  cfv 6493  (class class class)co 7360  Basecbs 17140  .rcmulr 17182  0gc0g 17363  Grpcgrp 18867   GrpHom cghm 19145  Abelcabl 19714  Rngcrng 20091  Ringcrg 20172   RngHom crnghm 20374  NzRingcnzr 20449
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5242  ax-nul 5252  ax-pow 5311  ax-pr 5378  ax-un 7682  ax-cnex 11086  ax-resscn 11087  ax-1cn 11088  ax-icn 11089  ax-addcl 11090  ax-addrcl 11091  ax-mulcl 11092  ax-mulrcl 11093  ax-mulcom 11094  ax-addass 11095  ax-mulass 11096  ax-distr 11097  ax-i2m1 11098  ax-1ne0 11099  ax-1rid 11100  ax-rnegex 11101  ax-rrecex 11102  ax-cnre 11103  ax-pre-lttri 11104  ax-pre-lttrn 11105  ax-pre-ltadd 11106  ax-pre-mulgt0 11107
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3062  df-rmo 3351  df-reu 3352  df-rab 3401  df-v 3443  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4287  df-if 4481  df-pw 4557  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-int 4904  df-iun 4949  df-br 5100  df-opab 5162  df-mpt 5181  df-tr 5207  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-pred 6260  df-ord 6321  df-on 6322  df-lim 6323  df-suc 6324  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-riota 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-om 7811  df-1st 7935  df-2nd 7936  df-frecs 8225  df-wrecs 8256  df-recs 8305  df-rdg 8343  df-1o 8399  df-oadd 8403  df-er 8637  df-map 8769  df-en 8888  df-dom 8889  df-sdom 8890  df-fin 8891  df-dju 9817  df-card 9855  df-pnf 11172  df-mnf 11173  df-xr 11174  df-ltxr 11175  df-le 11176  df-sub 11370  df-neg 11371  df-nn 12150  df-2 12212  df-n0 12406  df-xnn0 12479  df-z 12493  df-uz 12756  df-fz 13428  df-hash 14258  df-sets 17095  df-slot 17113  df-ndx 17125  df-base 17141  df-plusg 17194  df-0g 17365  df-mgm 18569  df-mgmhm 18621  df-sgrp 18648  df-mnd 18664  df-mhm 18712  df-grp 18870  df-minusg 18871  df-ghm 19146  df-cmn 19715  df-abl 19716  df-mgp 20080  df-rng 20092  df-ur 20121  df-ring 20174  df-rnghm 20376  df-nzr 20450
This theorem is referenced by:  zrinitorngc  20579
  Copyright terms: Public domain W3C validator