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

Theorem zrrnghm 20588
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 4086 . . . . 5 (𝑇 ∈ (Ring ∖ NzRing) → 𝑇 ∈ Ring)
2 ringrng 20337 . . . . 5 (𝑇 ∈ Ring → 𝑇 ∈ Rng)
31, 2syl 17 . . . 4 (𝑇 ∈ (Ring ∖ NzRing) → 𝑇 ∈ Rng)
43anim1i 624 . . 3 ((𝑇 ∈ (Ring ∖ NzRing) ∧ 𝑆 ∈ Rng) → (𝑇 ∈ Rng ∧ 𝑆 ∈ Rng))
54ancoms 462 . 2 ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → (𝑇 ∈ Rng ∧ 𝑆 ∈ Rng))
6 rngabl 20203 . . . . . 6 (𝑆 ∈ Rng → 𝑆 ∈ Abel)
7 ablgrp 19827 . . . . . 6 (𝑆 ∈ Abel → 𝑆 ∈ Grp)
86, 7syl 17 . . . . 5 (𝑆 ∈ Rng → 𝑆 ∈ Grp)
98adantr 484 . . . 4 ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → 𝑆 ∈ Grp)
10 ringgrp 20290 . . . . . 6 (𝑇 ∈ Ring → 𝑇 ∈ Grp)
111, 10syl 17 . . . . 5 (𝑇 ∈ (Ring ∖ NzRing) → 𝑇 ∈ Grp)
1211adantl 485 . . . 4 ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → 𝑇 ∈ Grp)
13 zrrnghm.b . . . . . 6 𝐵 = (Base‘𝑇)
14 eqid 2764 . . . . . 6 (0g𝑇) = (0g𝑇)
1513, 140ringbas 20580 . . . . 5 (𝑇 ∈ (Ring ∖ NzRing) → 𝐵 = {(0g𝑇)})
1615adantl 485 . . . 4 ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → 𝐵 = {(0g𝑇)})
17 zrrnghm.0 . . . . 5 0 = (0g𝑆)
18 zrrnghm.h . . . . 5 𝐻 = (𝑥𝐵0 )
1913, 17, 18, 14c0snghm 20515 . . . 4 ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp ∧ 𝐵 = {(0g𝑇)}) → 𝐻 ∈ (𝑇 GrpHom 𝑆))
209, 12, 16, 19syl3anc 1392 . . 3 ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → 𝐻 ∈ (𝑇 GrpHom 𝑆))
2118a1i 11 . . . . . . . 8 (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) → 𝐻 = (𝑥𝐵0 ))
22 eqidd 2765 . . . . . . . 8 ((((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) ∧ 𝑥 = (0g𝑇)) → 0 = 0 )
2313, 14ring0cl 20319 . . . . . . . . . 10 (𝑇 ∈ Ring → (0g𝑇) ∈ 𝐵)
241, 23syl 17 . . . . . . . . 9 (𝑇 ∈ (Ring ∖ NzRing) → (0g𝑇) ∈ 𝐵)
2524ad2antlr 737 . . . . . . . 8 (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) → (0g𝑇) ∈ 𝐵)
2617fvexi 6883 . . . . . . . . 9 0 ∈ V
2726a1i 11 . . . . . . . 8 (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) → 0 ∈ V)
2821, 22, 25, 27fvmptd 6985 . . . . . . 7 (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) → (𝐻‘(0g𝑇)) = 0 )
29 eqid 2764 . . . . . . . . . . . . . 14 (Base‘𝑆) = (Base‘𝑆)
3029, 17grpidcl 19009 . . . . . . . . . . . . 13 (𝑆 ∈ Grp → 0 ∈ (Base‘𝑆))
318, 30syl 17 . . . . . . . . . . . 12 (𝑆 ∈ Rng → 0 ∈ (Base‘𝑆))
32 eqid 2764 . . . . . . . . . . . . 13 (.r𝑆) = (.r𝑆)
3329, 32, 17rnglz 20213 . . . . . . . . . . . 12 ((𝑆 ∈ Rng ∧ 0 ∈ (Base‘𝑆)) → ( 0 (.r𝑆) 0 ) = 0 )
3431, 33mpdan 697 . . . . . . . . . . 11 (𝑆 ∈ Rng → ( 0 (.r𝑆) 0 ) = 0 )
3534adantr 484 . . . . . . . . . 10 ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → ( 0 (.r𝑆) 0 ) = 0 )
3635adantr 484 . . . . . . . . 9 (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) → ( 0 (.r𝑆) 0 ) = 0 )
3736adantr 484 . . . . . . . 8 ((((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) ∧ (𝐻‘(0g𝑇)) = 0 ) → ( 0 (.r𝑆) 0 ) = 0 )
38 simpr 488 . . . . . . . . 9 ((((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) ∧ (𝐻‘(0g𝑇)) = 0 ) → (𝐻‘(0g𝑇)) = 0 )
3938, 38oveq12d 7416 . . . . . . . 8 ((((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) ∧ (𝐻‘(0g𝑇)) = 0 ) → ((𝐻‘(0g𝑇))(.r𝑆)(𝐻‘(0g𝑇))) = ( 0 (.r𝑆) 0 ))
40 eqid 2764 . . . . . . . . . . . . . 14 (.r𝑇) = (.r𝑇)
4113, 40, 14ringlz 20345 . . . . . . . . . . . . 13 ((𝑇 ∈ Ring ∧ (0g𝑇) ∈ 𝐵) → ((0g𝑇)(.r𝑇)(0g𝑇)) = (0g𝑇))
421, 23, 41syl2anc2 594 . . . . . . . . . . . 12 (𝑇 ∈ (Ring ∖ NzRing) → ((0g𝑇)(.r𝑇)(0g𝑇)) = (0g𝑇))
4342ad2antlr 737 . . . . . . . . . . 11 (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) → ((0g𝑇)(.r𝑇)(0g𝑇)) = (0g𝑇))
4443adantr 484 . . . . . . . . . 10 ((((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) ∧ (𝐻‘(0g𝑇)) = 0 ) → ((0g𝑇)(.r𝑇)(0g𝑇)) = (0g𝑇))
4544fveq2d 6873 . . . . . . . . 9 ((((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) ∧ (𝐻‘(0g𝑇)) = 0 ) → (𝐻‘((0g𝑇)(.r𝑇)(0g𝑇))) = (𝐻‘(0g𝑇)))
4645, 38eqtrd 2799 . . . . . . . 8 ((((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) ∧ (𝐻‘(0g𝑇)) = 0 ) → (𝐻‘((0g𝑇)(.r𝑇)(0g𝑇))) = 0 )
4737, 39, 463eqtr4rd 2810 . . . . . . 7 ((((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) ∧ (𝐻‘(0g𝑇)) = 0 ) → (𝐻‘((0g𝑇)(.r𝑇)(0g𝑇))) = ((𝐻‘(0g𝑇))(.r𝑆)(𝐻‘(0g𝑇))))
4828, 47mpdan 697 . . . . . 6 (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) → (𝐻‘((0g𝑇)(.r𝑇)(0g𝑇))) = ((𝐻‘(0g𝑇))(.r𝑆)(𝐻‘(0g𝑇))))
4923, 23jca 519 . . . . . . . . 9 (𝑇 ∈ Ring → ((0g𝑇) ∈ 𝐵 ∧ (0g𝑇) ∈ 𝐵))
501, 49syl 17 . . . . . . . 8 (𝑇 ∈ (Ring ∖ NzRing) → ((0g𝑇) ∈ 𝐵 ∧ (0g𝑇) ∈ 𝐵))
5150ad2antlr 737 . . . . . . 7 (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) → ((0g𝑇) ∈ 𝐵 ∧ (0g𝑇) ∈ 𝐵))
52 fvoveq1 7421 . . . . . . . . 9 (𝑎 = (0g𝑇) → (𝐻‘(𝑎(.r𝑇)𝑐)) = (𝐻‘((0g𝑇)(.r𝑇)𝑐)))
53 fveq2 6869 . . . . . . . . . 10 (𝑎 = (0g𝑇) → (𝐻𝑎) = (𝐻‘(0g𝑇)))
5453oveq1d 7413 . . . . . . . . 9 (𝑎 = (0g𝑇) → ((𝐻𝑎)(.r𝑆)(𝐻𝑐)) = ((𝐻‘(0g𝑇))(.r𝑆)(𝐻𝑐)))
5552, 54eqeq12d 2780 . . . . . . . 8 (𝑎 = (0g𝑇) → ((𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐)) ↔ (𝐻‘((0g𝑇)(.r𝑇)𝑐)) = ((𝐻‘(0g𝑇))(.r𝑆)(𝐻𝑐))))
56 oveq2 7406 . . . . . . . . . 10 (𝑐 = (0g𝑇) → ((0g𝑇)(.r𝑇)𝑐) = ((0g𝑇)(.r𝑇)(0g𝑇)))
5756fveq2d 6873 . . . . . . . . 9 (𝑐 = (0g𝑇) → (𝐻‘((0g𝑇)(.r𝑇)𝑐)) = (𝐻‘((0g𝑇)(.r𝑇)(0g𝑇))))
58 fveq2 6869 . . . . . . . . . 10 (𝑐 = (0g𝑇) → (𝐻𝑐) = (𝐻‘(0g𝑇)))
5958oveq2d 7414 . . . . . . . . 9 (𝑐 = (0g𝑇) → ((𝐻‘(0g𝑇))(.r𝑆)(𝐻𝑐)) = ((𝐻‘(0g𝑇))(.r𝑆)(𝐻‘(0g𝑇))))
6057, 59eqeq12d 2780 . . . . . . . 8 (𝑐 = (0g𝑇) → ((𝐻‘((0g𝑇)(.r𝑇)𝑐)) = ((𝐻‘(0g𝑇))(.r𝑆)(𝐻𝑐)) ↔ (𝐻‘((0g𝑇)(.r𝑇)(0g𝑇))) = ((𝐻‘(0g𝑇))(.r𝑆)(𝐻‘(0g𝑇)))))
6155, 602ralsng 4639 . . . . . . 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 259 . . . . 5 (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) → ∀𝑎 ∈ {(0g𝑇)}∀𝑐 ∈ {(0g𝑇)} (𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐)))
64 raleq 3319 . . . . . . 7 (𝐵 = {(0g𝑇)} → (∀𝑐𝐵 (𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐)) ↔ ∀𝑐 ∈ {(0g𝑇)} (𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐))))
6564raleqbi1dv 3332 . . . . . 6 (𝐵 = {(0g𝑇)} → (∀𝑎𝐵𝑐𝐵 (𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐)) ↔ ∀𝑎 ∈ {(0g𝑇)}∀𝑐 ∈ {(0g𝑇)} (𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐))))
6665adantl 485 . . . . 5 (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) → (∀𝑎𝐵𝑐𝐵 (𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐)) ↔ ∀𝑎 ∈ {(0g𝑇)}∀𝑐 ∈ {(0g𝑇)} (𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐))))
6763, 66mpbird 259 . . . 4 (((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) ∧ 𝐵 = {(0g𝑇)}) → ∀𝑎𝐵𝑐𝐵 (𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐)))
6816, 67mpdan 697 . . 3 ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → ∀𝑎𝐵𝑐𝐵 (𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐)))
6920, 68jca 519 . 2 ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → (𝐻 ∈ (𝑇 GrpHom 𝑆) ∧ ∀𝑎𝐵𝑐𝐵 (𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐))))
7013, 40, 32isrnghm 20492 . 2 (𝐻 ∈ (𝑇 RngHom 𝑆) ↔ ((𝑇 ∈ Rng ∧ 𝑆 ∈ Rng) ∧ (𝐻 ∈ (𝑇 GrpHom 𝑆) ∧ ∀𝑎𝐵𝑐𝐵 (𝐻‘(𝑎(.r𝑇)𝑐)) = ((𝐻𝑎)(.r𝑆)(𝐻𝑐)))))
715, 69, 70sylanbrc 592 1 ((𝑆 ∈ Rng ∧ 𝑇 ∈ (Ring ∖ NzRing)) → 𝐻 ∈ (𝑇 RngHom 𝑆))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 399   = wceq 1562  wcel 2144  wral 3078  Vcvv 3456  cdif 3903  {csn 4584  cmpt 5183  cfv 6523  (class class class)co 7398  Basecbs 17247  .rcmulr 17289  0gc0g 17470  Grpcgrp 18977   GrpHom cghm 19255  Abelcabl 19823  Rngcrng 20200  Ringcrg 20285   RngHom crnghm 20485  NzRingcnzr 20564
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2214  ax-ext 2736  ax-sep 5248  ax-nul 5258  ax-pow 5324  ax-pr 5392  ax-un 7720  ax-cnex 11131  ax-resscn 11132  ax-1cn 11133  ax-icn 11134  ax-addcl 11135  ax-addrcl 11136  ax-mulcl 11137  ax-mulrcl 11138  ax-mulcom 11139  ax-addass 11140  ax-mulass 11141  ax-distr 11142  ax-i2m1 11143  ax-1ne0 11144  ax-1rid 11145  ax-rnegex 11146  ax-rrecex 11147  ax-cnre 11148  ax-pre-lttri 11149  ax-pre-lttrn 11150  ax-pre-ltadd 11151  ax-pre-mulgt0 11152
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1100  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-nf 1806  df-sb 2093  df-mo 2568  df-eu 2598  df-clab 2743  df-cleq 2756  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3064  df-ral 3079  df-rex 3089  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3458  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4288  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-tr 5210  df-id 5544  df-eprel 5549  df-po 5557  df-so 5558  df-fr 5602  df-we 5604  df-xp 5655  df-rel 5656  df-cnv 5657  df-co 5658  df-dm 5659  df-rn 5660  df-res 5661  df-ima 5662  df-pred 6290  df-ord 6351  df-on 6352  df-lim 6353  df-suc 6354  df-iota 6479  df-fun 6525  df-fn 6526  df-f 6527  df-f1 6528  df-fo 6529  df-f1o 6530  df-fv 6531  df-riota 7355  df-ov 7401  df-oprab 7402  df-mpo 7403  df-om 7849  df-1st 7972  df-2nd 7973  df-frecs 8264  df-wrecs 8295  df-recs 8344  df-rdg 8383  df-1o 8439  df-oadd 8443  df-er 8680  df-map 8812  df-en 8930  df-dom 8931  df-sdom 8932  df-fin 8933  df-dju 9861  df-card 9899  df-pnf 11220  df-mnf 11221  df-xr 11222  df-ltxr 11223  df-le 11224  df-sub 11418  df-neg 11419  df-nn 12213  df-2 12282  df-n0 12484  df-xnn0 12557  df-z 12571  df-uz 12842  df-fz 13515  df-hash 14346  df-sets 17202  df-slot 17220  df-ndx 17232  df-base 17248  df-plusg 17301  df-0g 17472  df-mgm 18676  df-mgmhm 18728  df-sgrp 18755  df-mnd 18771  df-mhm 18819  df-grp 18980  df-minusg 18981  df-ghm 19256  df-cmn 19824  df-abl 19825  df-mgp 20189  df-rng 20201  df-ur 20234  df-ring 20287  df-rnghm 20487  df-nzr 20565
This theorem is referenced by:  zrinitorngc  20694
  Copyright terms: Public domain W3C validator