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

Theorem unitrrg 14287
Description: Units are regular elements. (Contributed by Stefan O'Rear, 22-Mar-2015.)
Hypotheses
Ref Expression
unitrrg.e  |-  E  =  (RLReg `  R )
unitrrg.u  |-  U  =  (Unit `  R )
Assertion
Ref Expression
unitrrg  |-  ( R  e.  Ring  ->  U  C_  E )

Proof of Theorem unitrrg
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2231 . . . . . 6  |-  ( Base `  R )  =  (
Base `  R )
21a1i 9 . . . . 5  |-  ( ( R  e.  Ring  /\  x  e.  U )  ->  ( Base `  R )  =  ( Base `  R
) )
3 unitrrg.u . . . . . 6  |-  U  =  (Unit `  R )
43a1i 9 . . . . 5  |-  ( ( R  e.  Ring  /\  x  e.  U )  ->  U  =  (Unit `  R )
)
5 ringsrg 14066 . . . . . 6  |-  ( R  e.  Ring  ->  R  e. SRing
)
65adantr 276 . . . . 5  |-  ( ( R  e.  Ring  /\  x  e.  U )  ->  R  e. SRing )
7 simpr 110 . . . . 5  |-  ( ( R  e.  Ring  /\  x  e.  U )  ->  x  e.  U )
82, 4, 6, 7unitcld 14128 . . . 4  |-  ( ( R  e.  Ring  /\  x  e.  U )  ->  x  e.  ( Base `  R
) )
9 oveq2 6026 . . . . . 6  |-  ( ( x ( .r `  R ) y )  =  ( 0g `  R )  ->  (
( ( invr `  R
) `  x )
( .r `  R
) ( x ( .r `  R ) y ) )  =  ( ( ( invr `  R ) `  x
) ( .r `  R ) ( 0g
`  R ) ) )
10 eqid 2231 . . . . . . . . . . 11  |-  ( invr `  R )  =  (
invr `  R )
11 eqid 2231 . . . . . . . . . . 11  |-  ( .r
`  R )  =  ( .r `  R
)
12 eqid 2231 . . . . . . . . . . 11  |-  ( 1r
`  R )  =  ( 1r `  R
)
133, 10, 11, 12unitlinv 14146 . . . . . . . . . 10  |-  ( ( R  e.  Ring  /\  x  e.  U )  ->  (
( ( invr `  R
) `  x )
( .r `  R
) x )  =  ( 1r `  R
) )
1413adantr 276 . . . . . . . . 9  |-  ( ( ( R  e.  Ring  /\  x  e.  U )  /\  y  e.  (
Base `  R )
)  ->  ( (
( invr `  R ) `  x ) ( .r
`  R ) x )  =  ( 1r
`  R ) )
1514oveq1d 6033 . . . . . . . 8  |-  ( ( ( R  e.  Ring  /\  x  e.  U )  /\  y  e.  (
Base `  R )
)  ->  ( (
( ( invr `  R
) `  x )
( .r `  R
) x ) ( .r `  R ) y )  =  ( ( 1r `  R
) ( .r `  R ) y ) )
16 simpll 527 . . . . . . . . 9  |-  ( ( ( R  e.  Ring  /\  x  e.  U )  /\  y  e.  (
Base `  R )
)  ->  R  e.  Ring )
173, 10, 1ringinvcl 14145 . . . . . . . . . 10  |-  ( ( R  e.  Ring  /\  x  e.  U )  ->  (
( invr `  R ) `  x )  e.  (
Base `  R )
)
1817adantr 276 . . . . . . . . 9  |-  ( ( ( R  e.  Ring  /\  x  e.  U )  /\  y  e.  (
Base `  R )
)  ->  ( ( invr `  R ) `  x )  e.  (
Base `  R )
)
198adantr 276 . . . . . . . . 9  |-  ( ( ( R  e.  Ring  /\  x  e.  U )  /\  y  e.  (
Base `  R )
)  ->  x  e.  ( Base `  R )
)
20 simpr 110 . . . . . . . . 9  |-  ( ( ( R  e.  Ring  /\  x  e.  U )  /\  y  e.  (
Base `  R )
)  ->  y  e.  ( Base `  R )
)
211, 11ringass 14035 . . . . . . . . 9  |-  ( ( R  e.  Ring  /\  (
( ( invr `  R
) `  x )  e.  ( Base `  R
)  /\  x  e.  ( Base `  R )  /\  y  e.  ( Base `  R ) ) )  ->  ( (
( ( invr `  R
) `  x )
( .r `  R
) x ) ( .r `  R ) y )  =  ( ( ( invr `  R
) `  x )
( .r `  R
) ( x ( .r `  R ) y ) ) )
2216, 18, 19, 20, 21syl13anc 1275 . . . . . . . 8  |-  ( ( ( R  e.  Ring  /\  x  e.  U )  /\  y  e.  (
Base `  R )
)  ->  ( (
( ( invr `  R
) `  x )
( .r `  R
) x ) ( .r `  R ) y )  =  ( ( ( invr `  R
) `  x )
( .r `  R
) ( x ( .r `  R ) y ) ) )
231, 11, 12ringlidm 14042 . . . . . . . . 9  |-  ( ( R  e.  Ring  /\  y  e.  ( Base `  R
) )  ->  (
( 1r `  R
) ( .r `  R ) y )  =  y )
2423adantlr 477 . . . . . . . 8  |-  ( ( ( R  e.  Ring  /\  x  e.  U )  /\  y  e.  (
Base `  R )
)  ->  ( ( 1r `  R ) ( .r `  R ) y )  =  y )
2515, 22, 243eqtr3d 2272 . . . . . . 7  |-  ( ( ( R  e.  Ring  /\  x  e.  U )  /\  y  e.  (
Base `  R )
)  ->  ( (
( invr `  R ) `  x ) ( .r
`  R ) ( x ( .r `  R ) y ) )  =  y )
26 eqid 2231 . . . . . . . . 9  |-  ( 0g
`  R )  =  ( 0g `  R
)
271, 11, 26ringrz 14063 . . . . . . . 8  |-  ( ( R  e.  Ring  /\  (
( invr `  R ) `  x )  e.  (
Base `  R )
)  ->  ( (
( invr `  R ) `  x ) ( .r
`  R ) ( 0g `  R ) )  =  ( 0g
`  R ) )
2816, 18, 27syl2anc 411 . . . . . . 7  |-  ( ( ( R  e.  Ring  /\  x  e.  U )  /\  y  e.  (
Base `  R )
)  ->  ( (
( invr `  R ) `  x ) ( .r
`  R ) ( 0g `  R ) )  =  ( 0g
`  R ) )
2925, 28eqeq12d 2246 . . . . . 6  |-  ( ( ( R  e.  Ring  /\  x  e.  U )  /\  y  e.  (
Base `  R )
)  ->  ( (
( ( invr `  R
) `  x )
( .r `  R
) ( x ( .r `  R ) y ) )  =  ( ( ( invr `  R ) `  x
) ( .r `  R ) ( 0g
`  R ) )  <-> 
y  =  ( 0g
`  R ) ) )
309, 29imbitrid 154 . . . . 5  |-  ( ( ( R  e.  Ring  /\  x  e.  U )  /\  y  e.  (
Base `  R )
)  ->  ( (
x ( .r `  R ) y )  =  ( 0g `  R )  ->  y  =  ( 0g `  R ) ) )
3130ralrimiva 2605 . . . 4  |-  ( ( R  e.  Ring  /\  x  e.  U )  ->  A. y  e.  ( Base `  R
) ( ( x ( .r `  R
) y )  =  ( 0g `  R
)  ->  y  =  ( 0g `  R ) ) )
32 unitrrg.e . . . . 5  |-  E  =  (RLReg `  R )
3332, 1, 11, 26isrrg 14283 . . . 4  |-  ( x  e.  E  <->  ( x  e.  ( Base `  R
)  /\  A. y  e.  ( Base `  R
) ( ( x ( .r `  R
) y )  =  ( 0g `  R
)  ->  y  =  ( 0g `  R ) ) ) )
348, 31, 33sylanbrc 417 . . 3  |-  ( ( R  e.  Ring  /\  x  e.  U )  ->  x  e.  E )
3534ex 115 . 2  |-  ( R  e.  Ring  ->  ( x  e.  U  ->  x  e.  E ) )
3635ssrdv 3233 1  |-  ( R  e.  Ring  ->  U  C_  E )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1397    e. wcel 2202   A.wral 2510    C_ wss 3200   ` cfv 5326  (class class class)co 6018   Basecbs 13087   .rcmulr 13166   0gc0g 13344   1rcur 13978  SRingcsrg 13982   Ringcrg 14015  Unitcui 14106   invrcinvr 14140  RLRegcrlreg 14275
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8123  ax-resscn 8124  ax-1cn 8125  ax-1re 8126  ax-icn 8127  ax-addcl 8128  ax-addrcl 8129  ax-mulcl 8130  ax-addcom 8132  ax-addass 8134  ax-i2m1 8137  ax-0lt1 8138  ax-0id 8140  ax-rnegex 8141  ax-pre-ltirr 8144  ax-pre-lttrn 8146  ax-pre-ltadd 8148
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5971  df-ov 6021  df-oprab 6022  df-mpo 6023  df-tpos 6411  df-pnf 8216  df-mnf 8217  df-ltxr 8219  df-inn 9144  df-2 9202  df-3 9203  df-ndx 13090  df-slot 13091  df-base 13093  df-sets 13094  df-iress 13095  df-plusg 13178  df-mulr 13179  df-0g 13346  df-mgm 13444  df-sgrp 13490  df-mnd 13505  df-grp 13591  df-minusg 13592  df-cmn 13878  df-abl 13879  df-mgp 13940  df-ur 13979  df-srg 13983  df-ring 14017  df-oppr 14087  df-dvdsr 14108  df-unit 14109  df-invr 14141  df-rlreg 14278
This theorem is referenced by:  znrrg  14680
  Copyright terms: Public domain W3C validator