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

Theorem ringinvnz1ne0 14461
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 6096 . . . . 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 14456 . . . . . . 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 2251 . . . . . . . 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 6096 . . . . 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 14436 . . . . . . . . 9  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  ( X  .x.  .1.  )  =  X )
173, 4, 5ringrz 14456 . . . . . . . . 9  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  ( X  .x.  .0.  )  =  .0.  )
1816, 17eqeq12d 2253 . . . . . . . 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 415 . . . . . 6  |-  ( ph  ->  ( ( X  .x.  .1.  )  =  ( X  .x.  .0.  )  ->  X  =  .0.  )
)
2120ad2antrr 492 . . . . 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 2694 . 2  |-  ( ph  ->  ( X  =  .0.  <->  .1.  =  .0.  ) )
2625necon3bid 2461 1  |-  ( ph  ->  ( X  =/=  .0.  <->  .1.  =/=  .0.  ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209    =/= wne 2420   E.wrex 2529   ` cfv 5380  (class class class)co 6088   Basecbs 13410   .rcmulr 13491   0gc0g 13669   1rcur 14369   Ringcrg 14407
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-addcom 8285  ax-addass 8287  ax-i2m1 8290  ax-0lt1 8291  ax-0id 8293  ax-rnegex 8294  ax-pre-ltirr 8297  ax-pre-ltadd 8301
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-pnf 8368  df-mnf 8369  df-ltxr 8371  df-inn 9314  df-2 9372  df-3 9373  df-ndx 13413  df-slot 13414  df-base 13416  df-sets 13417  df-plusg 13503  df-mulr 13504  df-0g 13671  df-mgm 13735  df-sgrp 13776  df-mnd 13789  df-grp 13867  df-mgp 14325  df-ur 14370  df-ring 14409
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator