ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  ringinvnz1ne0 Unicode version

Theorem ringinvnz1ne0 14210
Description: In a unital ring, a left invertible element is different from zero iff  .1.  =/=  .0.. (Contributed by FL, 18-Apr-2010.) (Revised by AV, 24-Aug-2021.)
Hypotheses
Ref Expression
ringinvnzdiv.b  |-  B  =  ( Base `  R
)
ringinvnzdiv.t  |-  .x.  =  ( .r `  R )
ringinvnzdiv.u  |-  .1.  =  ( 1r `  R )
ringinvnzdiv.z  |-  .0.  =  ( 0g `  R )
ringinvnzdiv.r  |-  ( ph  ->  R  e.  Ring )
ringinvnzdiv.x  |-  ( ph  ->  X  e.  B )
ringinvnzdiv.a  |-  ( ph  ->  E. a  e.  B  ( a  .x.  X
)  =  .1.  )
Assertion
Ref Expression
ringinvnz1ne0  |-  ( ph  ->  ( X  =/=  .0.  <->  .1.  =/=  .0.  ) )
Distinct variable groups:    X, a    .0. , a    .1. , a    .x. , a    ph, a
Allowed substitution hints:    B( a)    R( a)

Proof of Theorem ringinvnz1ne0
StepHypRef Expression
1 oveq2 6060 . . . . 5  |-  ( X  =  .0.  ->  (
a  .x.  X )  =  ( a  .x.  .0.  ) )
2 ringinvnzdiv.r . . . . . . 7  |-  ( ph  ->  R  e.  Ring )
3 ringinvnzdiv.b . . . . . . . 8  |-  B  =  ( Base `  R
)
4 ringinvnzdiv.t . . . . . . . 8  |-  .x.  =  ( .r `  R )
5 ringinvnzdiv.z . . . . . . . 8  |-  .0.  =  ( 0g `  R )
63, 4, 5ringrz 14205 . . . . . . 7  |-  ( ( R  e.  Ring  /\  a  e.  B )  ->  (
a  .x.  .0.  )  =  .0.  )
72, 6sylan 283 . . . . . 6  |-  ( (
ph  /\  a  e.  B )  ->  (
a  .x.  .0.  )  =  .0.  )
8 eqeq12 2247 . . . . . . . 8  |-  ( ( ( a  .x.  X
)  =  .1.  /\  ( a  .x.  .0.  )  =  .0.  )  ->  ( ( a  .x.  X )  =  ( a  .x.  .0.  )  <->  .1.  =  .0.  ) )
98biimpd 144 . . . . . . 7  |-  ( ( ( a  .x.  X
)  =  .1.  /\  ( a  .x.  .0.  )  =  .0.  )  ->  ( ( a  .x.  X )  =  ( a  .x.  .0.  )  ->  .1.  =  .0.  )
)
109ex 115 . . . . . 6  |-  ( ( a  .x.  X )  =  .1.  ->  (
( a  .x.  .0.  )  =  .0.  ->  ( ( a  .x.  X
)  =  ( a 
.x.  .0.  )  ->  .1.  =  .0.  ) ) )
117, 10mpan9 281 . . . . 5  |-  ( ( ( ph  /\  a  e.  B )  /\  (
a  .x.  X )  =  .1.  )  ->  (
( a  .x.  X
)  =  ( a 
.x.  .0.  )  ->  .1.  =  .0.  ) )
121, 11syl5 32 . . . 4  |-  ( ( ( ph  /\  a  e.  B )  /\  (
a  .x.  X )  =  .1.  )  ->  ( X  =  .0.  ->  .1.  =  .0.  ) )
13 oveq2 6060 . . . . 5  |-  (  .1.  =  .0.  ->  ( X  .x.  .1.  )  =  ( X  .x.  .0.  ) )
14 ringinvnzdiv.x . . . . . . 7  |-  ( ph  ->  X  e.  B )
15 ringinvnzdiv.u . . . . . . . . . 10  |-  .1.  =  ( 1r `  R )
163, 4, 15ringridm 14185 . . . . . . . . 9  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  ( X  .x.  .1.  )  =  X )
173, 4, 5ringrz 14205 . . . . . . . . 9  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  ( X  .x.  .0.  )  =  .0.  )
1816, 17eqeq12d 2249 . . . . . . . 8  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  (
( X  .x.  .1.  )  =  ( X  .x.  .0.  )  <->  X  =  .0.  ) )
1918biimpd 144 . . . . . . 7  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  (
( X  .x.  .1.  )  =  ( X  .x.  .0.  )  ->  X  =  .0.  ) )
202, 14, 19syl2anc 411 . . . . . 6  |-  ( ph  ->  ( ( X  .x.  .1.  )  =  ( X  .x.  .0.  )  ->  X  =  .0.  )
)
2120ad2antrr 488 . . . . 5  |-  ( ( ( ph  /\  a  e.  B )  /\  (
a  .x.  X )  =  .1.  )  ->  (
( X  .x.  .1.  )  =  ( X  .x.  .0.  )  ->  X  =  .0.  ) )
2213, 21syl5 32 . . . 4  |-  ( ( ( ph  /\  a  e.  B )  /\  (
a  .x.  X )  =  .1.  )  ->  (  .1.  =  .0.  ->  X  =  .0.  ) )
2312, 22impbid 129 . . 3  |-  ( ( ( ph  /\  a  e.  B )  /\  (
a  .x.  X )  =  .1.  )  ->  ( X  =  .0.  <->  .1.  =  .0.  ) )
24 ringinvnzdiv.a . . 3  |-  ( ph  ->  E. a  e.  B  ( a  .x.  X
)  =  .1.  )
2523, 24r19.29a 2688 . 2  |-  ( ph  ->  ( X  =  .0.  <->  .1.  =  .0.  ) )
2625necon3bid 2455 1  |-  ( ph  ->  ( X  =/=  .0.  <->  .1.  =/=  .0.  ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398    e. wcel 2205    =/= wne 2414   E.wrex 2523   ` cfv 5354  (class class class)co 6052   Basecbs 13229   .rcmulr 13308   0gc0g 13486   1rcur 14120   Ringcrg 14157
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4230  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-setind 4661  ax-cnex 8220  ax-resscn 8221  ax-1cn 8222  ax-1re 8223  ax-icn 8224  ax-addcl 8225  ax-addrcl 8226  ax-mulcl 8227  ax-addcom 8229  ax-addass 8231  ax-i2m1 8234  ax-0lt1 8235  ax-0id 8237  ax-rnegex 8238  ax-pre-ltirr 8241  ax-pre-ltadd 8245
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3045  df-csb 3141  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-nul 3511  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-int 3952  df-br 4112  df-opab 4174  df-mpt 4175  df-id 4416  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-rn 4762  df-res 4763  df-ima 4764  df-iota 5314  df-fun 5356  df-fn 5357  df-fv 5362  df-riota 6005  df-ov 6055  df-oprab 6056  df-mpo 6057  df-pnf 8312  df-mnf 8313  df-ltxr 8315  df-inn 9240  df-2 9298  df-3 9299  df-ndx 13232  df-slot 13233  df-base 13235  df-sets 13236  df-plusg 13320  df-mulr 13321  df-0g 13488  df-mgm 13586  df-sgrp 13632  df-mnd 13647  df-grp 13733  df-mgp 14082  df-ur 14121  df-ring 14159
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator