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

Theorem ringinvnz1ne0 13018
Description: In a unitary 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 5873 . . . . 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 13015 . . . . . . 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 2188 . . . . . . . 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 5873 . . . . 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 13000 . . . . . . . . 9  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  ( X  .x.  .1.  )  =  X )
173, 4, 5ringrz 13015 . . . . . . . . 9  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  ( X  .x.  .0.  )  =  .0.  )
1816, 17eqeq12d 2190 . . . . . . . 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 2618 . 2  |-  ( ph  ->  ( X  =  .0.  <->  .1.  =  .0.  ) )
2625necon3bid 2386 1  |-  ( ph  ->  ( X  =/=  .0.  <->  .1.  =/=  .0.  ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1353    e. wcel 2146    =/= wne 2345   E.wrex 2454   ` cfv 5208  (class class class)co 5865   Basecbs 12427   .rcmulr 12492   0gc0g 12625   1rcur 12935   Ringcrg 12972
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 614  ax-in2 615  ax-io 709  ax-5 1445  ax-7 1446  ax-gen 1447  ax-ie1 1491  ax-ie2 1492  ax-8 1502  ax-10 1503  ax-11 1504  ax-i12 1505  ax-bndl 1507  ax-4 1508  ax-17 1524  ax-i9 1528  ax-ial 1532  ax-i5r 1533  ax-13 2148  ax-14 2149  ax-ext 2157  ax-sep 4116  ax-pow 4169  ax-pr 4203  ax-un 4427  ax-setind 4530  ax-cnex 7877  ax-resscn 7878  ax-1cn 7879  ax-1re 7880  ax-icn 7881  ax-addcl 7882  ax-addrcl 7883  ax-mulcl 7884  ax-addcom 7886  ax-addass 7888  ax-i2m1 7891  ax-0lt1 7892  ax-0id 7894  ax-rnegex 7895  ax-pre-ltirr 7898  ax-pre-ltadd 7902
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1459  df-sb 1761  df-eu 2027  df-mo 2028  df-clab 2162  df-cleq 2168  df-clel 2171  df-nfc 2306  df-ne 2346  df-nel 2441  df-ral 2458  df-rex 2459  df-reu 2460  df-rmo 2461  df-rab 2462  df-v 2737  df-sbc 2961  df-csb 3056  df-dif 3129  df-un 3131  df-in 3133  df-ss 3140  df-nul 3421  df-pw 3574  df-sn 3595  df-pr 3596  df-op 3598  df-uni 3806  df-int 3841  df-br 3999  df-opab 4060  df-mpt 4061  df-id 4287  df-xp 4626  df-rel 4627  df-cnv 4628  df-co 4629  df-dm 4630  df-rn 4631  df-res 4632  df-ima 4633  df-iota 5170  df-fun 5210  df-fn 5211  df-fv 5216  df-riota 5821  df-ov 5868  df-oprab 5869  df-mpo 5870  df-pnf 7968  df-mnf 7969  df-ltxr 7971  df-inn 8891  df-2 8949  df-3 8950  df-ndx 12430  df-slot 12431  df-base 12433  df-sets 12434  df-plusg 12504  df-mulr 12505  df-0g 12627  df-mgm 12639  df-sgrp 12672  df-mnd 12682  df-grp 12740  df-mgp 12926  df-ur 12936  df-ring 12974
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator