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

Theorem zrrnghm 20485
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 4123 . . . . 5 (𝑇 ∈ (Ring ∖ NzRing) → 𝑇 ∈ Ring)
2 ringrng 20233 . . . . 5 (𝑇 ∈ Ring → 𝑇 ∈ Rng)
31, 2syl 17 . . . 4 (𝑇 ∈ (Ring ∖ NzRing) → 𝑇 ∈ Rng)
43anim1i 613 . . 3 ((𝑇 ∈ (Ring ∖ NzRing) ∧ 𝑆 ∈ Rng) → (𝑇 ∈ Rng ∧ 𝑆 ∈ Rng))
54ancoms 457 . 2 ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → (𝑇 ∈ Rng ∧ 𝑆 ∈ Rng))
6 rngabl 20107 . . . . . 6 (𝑆 ∈ Rng → 𝑆 ∈ Abel)
7 ablgrp 19752 . . . . . 6 (𝑆 ∈ Abel → 𝑆 ∈ Grp)
86, 7syl 17 . . . . 5 (𝑆 ∈ Rng → 𝑆 ∈ Grp)
98adantr 479 . . . 4 ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → 𝑆 ∈ Grp)
10 ringgrp 20190 . . . . . 6 (𝑇 ∈ Ring → 𝑇 ∈ Grp)
111, 10syl 17 . . . . 5 (𝑇 ∈ (Ring ∖ NzRing) → 𝑇 ∈ Grp)
1211adantl 480 . . . 4 ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → 𝑇 ∈ Grp)
13 zrrnghm.b . . . . . 6 𝐵 = (Base‘𝑇)
14 eqid 2725 . . . . . 6 (0g𝑇) = (0g𝑇)
1513, 140ringbas 20477 . . . . 5 (𝑇 ∈ (Ring ∖ NzRing) → 𝐵 = {(0g𝑇)})
1615adantl 480 . . . 4 ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → 𝐵 = {(0g𝑇)})
17 zrrnghm.0 . . . . 5 0 = (0g𝑆)
18 zrrnghm.h . . . . 5 𝐻 = (𝑥𝐵0 )
1913, 17, 18, 14c0snghm 20415 . . . 4 ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp ∧ 𝐵 = {(0g𝑇)}) → 𝐻 ∈ (𝑇 GrpHom 𝑆))
209, 12, 16, 19syl3anc 1368 . . 3 ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → 𝐻 ∈ (𝑇 GrpHom 𝑆))
2118a1i 11 . . . . . . . 8 (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) → 𝐻 = (𝑥𝐵0 ))
22 eqidd 2726 . . . . . . . 8 ((((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) ∧ 𝑥 = (0g𝑇)) → 0 = 0 )
2313, 14ring0cl 20215 . . . . . . . . . 10 (𝑇 ∈ Ring → (0g𝑇) ∈ 𝐵)
241, 23syl 17 . . . . . . . . 9 (𝑇 ∈ (Ring ∖ NzRing) → (0g𝑇) ∈ 𝐵)
2524ad2antlr 725 . . . . . . . 8 (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) → (0g𝑇) ∈ 𝐵)
2617fvexi 6910 . . . . . . . . 9 0 ∈ V
2726a1i 11 . . . . . . . 8 (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) → 0 ∈ V)
2821, 22, 25, 27fvmptd 7011 . . . . . . 7 (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) → (𝐻‘(0g𝑇)) = 0 )
29 eqid 2725 . . . . . . . . . . . . . 14 (Base‘𝑆) = (Base‘𝑆)
3029, 17grpidcl 18930 . . . . . . . . . . . . 13 (𝑆 ∈ Grp → 0 ∈ (Base‘𝑆))
318, 30syl 17 . . . . . . . . . . . 12 (𝑆 ∈ Rng → 0 ∈ (Base‘𝑆))
32 eqid 2725 . . . . . . . . . . . . 13 (.r𝑆) = (.r𝑆)
3329, 32, 17rnglz 20117 . . . . . . . . . . . 12 ((𝑆 ∈ Rng ∧ 0 ∈ (Base‘𝑆)) → ( 0 (.r𝑆) 0 ) = 0 )
3431, 33mpdan 685 . . . . . . . . . . 11 (𝑆 ∈ Rng → ( 0 (.r𝑆) 0 ) = 0 )
3534adantr 479 . . . . . . . . . 10 ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → ( 0 (.r𝑆) 0 ) = 0 )
3635adantr 479 . . . . . . . . 9 (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) → ( 0 (.r𝑆) 0 ) = 0 )
3736adantr 479 . . . . . . . 8 ((((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) ∧ (𝐻‘(0g𝑇)) = 0 ) → ( 0 (.r𝑆) 0 ) = 0 )
38 simpr 483 . . . . . . . . 9 ((((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) ∧ (𝐻‘(0g𝑇)) = 0 ) → (𝐻‘(0g𝑇)) = 0 )
3938, 38oveq12d 7437 . . . . . . . 8 ((((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) ∧ (𝐻‘(0g𝑇)) = 0 ) → ((𝐻‘(0g𝑇))(.r𝑆)(𝐻‘(0g𝑇))) = ( 0 (.r𝑆) 0 ))
40 eqid 2725 . . . . . . . . . . . . . 14 (.r𝑇) = (.r𝑇)
4113, 40, 14ringlz 20241 . . . . . . . . . . . . 13 ((𝑇 ∈ Ring ∧ (0g𝑇) ∈ 𝐵) → ((0g𝑇)(.r𝑇)(0g𝑇)) = (0g𝑇))
421, 23, 41syl2anc2 583 . . . . . . . . . . . 12 (𝑇 ∈ (Ring ∖ NzRing) → ((0g𝑇)(.r𝑇)(0g𝑇)) = (0g𝑇))
4342ad2antlr 725 . . . . . . . . . . 11 (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) → ((0g𝑇)(.r𝑇)(0g𝑇)) = (0g𝑇))
4443adantr 479 . . . . . . . . . 10 ((((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) ∧ (𝐻‘(0g𝑇)) = 0 ) → ((0g𝑇)(.r𝑇)(0g𝑇)) = (0g𝑇))
4544fveq2d 6900 . . . . . . . . 9 ((((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) ∧ (𝐻‘(0g𝑇)) = 0 ) → (𝐻‘((0g𝑇)(.r𝑇)(0g𝑇))) = (𝐻‘(0g𝑇)))
4645, 38eqtrd 2765 . . . . . . . 8 ((((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) ∧ (𝐻‘(0g𝑇)) = 0 ) → (𝐻‘((0g𝑇)(.r𝑇)(0g𝑇))) = 0 )
4737, 39, 463eqtr4rd 2776 . . . . . . 7 ((((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) ∧ (𝐻‘(0g𝑇)) = 0 ) → (𝐻‘((0g𝑇)(.r𝑇)(0g𝑇))) = ((𝐻‘(0g𝑇))(.r𝑆)(𝐻‘(0g𝑇))))
4828, 47mpdan 685 . . . . . 6 (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) → (𝐻‘((0g𝑇)(.r𝑇)(0g𝑇))) = ((𝐻‘(0g𝑇))(.r𝑆)(𝐻‘(0g𝑇))))
4923, 23jca 510 . . . . . . . . 9 (𝑇 ∈ Ring → ((0g𝑇) ∈ 𝐵 ∧ (0g𝑇) ∈ 𝐵))
501, 49syl 17 . . . . . . . 8 (𝑇 ∈ (Ring ∖ NzRing) → ((0g𝑇) ∈ 𝐵 ∧ (0g𝑇) ∈ 𝐵))
5150ad2antlr 725 . . . . . . 7 (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) → ((0g𝑇) ∈ 𝐵 ∧ (0g𝑇) ∈ 𝐵))
52 fvoveq1 7442 . . . . . . . . 9 (𝑎 = (0g𝑇) → (𝐻‘(𝑎(.r𝑇)𝑐)) = (𝐻‘((0g𝑇)(.r𝑇)𝑐)))
53 fveq2 6896 . . . . . . . . . 10 (𝑎 = (0g𝑇) → (𝐻𝑎) = (𝐻‘(0g𝑇)))
5453oveq1d 7434 . . . . . . . . 9 (𝑎 = (0g𝑇) → ((𝐻𝑎)(.r𝑆)(𝐻𝑐)) = ((𝐻‘(0g𝑇))(.r𝑆)(𝐻𝑐)))
5552, 54eqeq12d 2741 . . . . . . . 8 (𝑎 = (0g𝑇) → ((𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐)) ↔ (𝐻‘((0g𝑇)(.r𝑇)𝑐)) = ((𝐻‘(0g𝑇))(.r𝑆)(𝐻𝑐))))
56 oveq2 7427 . . . . . . . . . 10 (𝑐 = (0g𝑇) → ((0g𝑇)(.r𝑇)𝑐) = ((0g𝑇)(.r𝑇)(0g𝑇)))
5756fveq2d 6900 . . . . . . . . 9 (𝑐 = (0g𝑇) → (𝐻‘((0g𝑇)(.r𝑇)𝑐)) = (𝐻‘((0g𝑇)(.r𝑇)(0g𝑇))))
58 fveq2 6896 . . . . . . . . . 10 (𝑐 = (0g𝑇) → (𝐻𝑐) = (𝐻‘(0g𝑇)))
5958oveq2d 7435 . . . . . . . . 9 (𝑐 = (0g𝑇) → ((𝐻‘(0g𝑇))(.r𝑆)(𝐻𝑐)) = ((𝐻‘(0g𝑇))(.r𝑆)(𝐻‘(0g𝑇))))
6057, 59eqeq12d 2741 . . . . . . . 8 (𝑐 = (0g𝑇) → ((𝐻‘((0g𝑇)(.r𝑇)𝑐)) = ((𝐻‘(0g𝑇))(.r𝑆)(𝐻𝑐)) ↔ (𝐻‘((0g𝑇)(.r𝑇)(0g𝑇))) = ((𝐻‘(0g𝑇))(.r𝑆)(𝐻‘(0g𝑇)))))
6155, 602ralsng 4682 . . . . . . 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 256 . . . . 5 (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) → ∀𝑎 ∈ {(0g𝑇)}∀𝑐 ∈ {(0g𝑇)} (𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐)))
64 raleq 3311 . . . . . . 7 (𝐵 = {(0g𝑇)} → (∀𝑐𝐵 (𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐)) ↔ ∀𝑐 ∈ {(0g𝑇)} (𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐))))
6564raleqbi1dv 3322 . . . . . 6 (𝐵 = {(0g𝑇)} → (∀𝑎𝐵𝑐𝐵 (𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐)) ↔ ∀𝑎 ∈ {(0g𝑇)}∀𝑐 ∈ {(0g𝑇)} (𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐))))
6665adantl 480 . . . . 5 (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) → (∀𝑎𝐵𝑐𝐵 (𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐)) ↔ ∀𝑎 ∈ {(0g𝑇)}∀𝑐 ∈ {(0g𝑇)} (𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐))))
6763, 66mpbird 256 . . . 4 (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) → ∀𝑎𝐵𝑐𝐵 (𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐)))
6816, 67mpdan 685 . . 3 ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → ∀𝑎𝐵𝑐𝐵 (𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐)))
6920, 68jca 510 . 2 ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → (𝐻 ∈ (𝑇 GrpHom 𝑆) ∧ ∀𝑎𝐵𝑐𝐵 (𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐))))
7013, 40, 32isrnghm 20392 . 2 (𝐻 ∈ (𝑇 RngHom 𝑆) ↔ ((𝑇 ∈ Rng ∧ 𝑆 ∈ Rng) ∧ (𝐻 ∈ (𝑇 GrpHom 𝑆) ∧ ∀𝑎𝐵𝑐𝐵 (𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐)))))
715, 69, 70sylanbrc 581 1 ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → 𝐻 ∈ (𝑇 RngHom 𝑆))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 394   = wceq 1533  wcel 2098  wral 3050  Vcvv 3461  cdif 3941  {csn 4630  cmpt 5232  cfv 6549  (class class class)co 7419  Basecbs 17183  .rcmulr 17237  0gc0g 17424  Grpcgrp 18898   GrpHom cghm 19175  Abelcabl 19748  Rngcrng 20104  Ringcrg 20185   RngHom crnghm 20385  NzRingcnzr 20463
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2696  ax-sep 5300  ax-nul 5307  ax-pow 5365  ax-pr 5429  ax-un 7741  ax-cnex 11196  ax-resscn 11197  ax-1cn 11198  ax-icn 11199  ax-addcl 11200  ax-addrcl 11201  ax-mulcl 11202  ax-mulrcl 11203  ax-mulcom 11204  ax-addass 11205  ax-mulass 11206  ax-distr 11207  ax-i2m1 11208  ax-1ne0 11209  ax-1rid 11210  ax-rnegex 11211  ax-rrecex 11212  ax-cnre 11213  ax-pre-lttri 11214  ax-pre-lttrn 11215  ax-pre-ltadd 11216  ax-pre-mulgt0 11217
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3or 1085  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2703  df-cleq 2717  df-clel 2802  df-nfc 2877  df-ne 2930  df-nel 3036  df-ral 3051  df-rex 3060  df-rmo 3363  df-reu 3364  df-rab 3419  df-v 3463  df-sbc 3774  df-csb 3890  df-dif 3947  df-un 3949  df-in 3951  df-ss 3961  df-pss 3964  df-nul 4323  df-if 4531  df-pw 4606  df-sn 4631  df-pr 4633  df-op 4637  df-uni 4910  df-int 4951  df-iun 4999  df-br 5150  df-opab 5212  df-mpt 5233  df-tr 5267  df-id 5576  df-eprel 5582  df-po 5590  df-so 5591  df-fr 5633  df-we 5635  df-xp 5684  df-rel 5685  df-cnv 5686  df-co 5687  df-dm 5688  df-rn 5689  df-res 5690  df-ima 5691  df-pred 6307  df-ord 6374  df-on 6375  df-lim 6376  df-suc 6377  df-iota 6501  df-fun 6551  df-fn 6552  df-f 6553  df-f1 6554  df-fo 6555  df-f1o 6556  df-fv 6557  df-riota 7375  df-ov 7422  df-oprab 7423  df-mpo 7424  df-om 7872  df-1st 7994  df-2nd 7995  df-frecs 8287  df-wrecs 8318  df-recs 8392  df-rdg 8431  df-1o 8487  df-oadd 8491  df-er 8725  df-map 8847  df-en 8965  df-dom 8966  df-sdom 8967  df-fin 8968  df-dju 9926  df-card 9964  df-pnf 11282  df-mnf 11283  df-xr 11284  df-ltxr 11285  df-le 11286  df-sub 11478  df-neg 11479  df-nn 12246  df-2 12308  df-n0 12506  df-xnn0 12578  df-z 12592  df-uz 12856  df-fz 13520  df-hash 14326  df-sets 17136  df-slot 17154  df-ndx 17166  df-base 17184  df-plusg 17249  df-0g 17426  df-mgm 18603  df-mgmhm 18655  df-sgrp 18682  df-mnd 18698  df-mhm 18743  df-grp 18901  df-minusg 18902  df-ghm 19176  df-cmn 19749  df-abl 19750  df-mgp 20087  df-rng 20105  df-ur 20134  df-ring 20187  df-rnghm 20387  df-nzr 20464
This theorem is referenced by:  zrinitorngc  20587
  Copyright terms: Public domain W3C validator