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

Theorem unitrrg 14274
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 2229 . . . . . 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 14053 . . . . . 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 14115 . . . 4  |-  ( ( R  e.  Ring  /\  x  e.  U )  ->  x  e.  ( Base `  R
) )
9 oveq2 6021 . . . . . 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 2229 . . . . . . . . . . 11  |-  ( invr `  R )  =  (
invr `  R )
11 eqid 2229 . . . . . . . . . . 11  |-  ( .r
`  R )  =  ( .r `  R
)
12 eqid 2229 . . . . . . . . . . 11  |-  ( 1r
`  R )  =  ( 1r `  R
)
133, 10, 11, 12unitlinv 14133 . . . . . . . . . 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 6028 . . . . . . . 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 14132 . . . . . . . . . 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 14022 . . . . . . . . 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 1273 . . . . . . . 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 14029 . . . . . . . . 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 2270 . . . . . . 7  |-  ( ( ( R  e.  Ring  /\  x  e.  U )  /\  y  e.  (
Base `  R )
)  ->  ( (
( invr `  R ) `  x ) ( .r
`  R ) ( x ( .r `  R ) y ) )  =  y )
26 eqid 2229 . . . . . . . . 9  |-  ( 0g
`  R )  =  ( 0g `  R
)
271, 11, 26ringrz 14050 . . . . . . . 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 2244 . . . . . 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 2603 . . . 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 14270 . . . 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 3231 1  |-  ( R  e.  Ring  ->  U  C_  E )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1395    e. wcel 2200   A.wral 2508    C_ wss 3198   ` cfv 5324  (class class class)co 6013   Basecbs 13075   .rcmulr 13154   0gc0g 13332   1rcur 13965  SRingcsrg 13969   Ringcrg 14002  Unitcui 14093   invrcinvr 14127  RLRegcrlreg 14262
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4202  ax-sep 4205  ax-nul 4213  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-cnex 8116  ax-resscn 8117  ax-1cn 8118  ax-1re 8119  ax-icn 8120  ax-addcl 8121  ax-addrcl 8122  ax-mulcl 8123  ax-addcom 8125  ax-addass 8127  ax-i2m1 8130  ax-0lt1 8131  ax-0id 8133  ax-rnegex 8134  ax-pre-ltirr 8137  ax-pre-lttrn 8139  ax-pre-ltadd 8141
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-riota 5966  df-ov 6016  df-oprab 6017  df-mpo 6018  df-tpos 6406  df-pnf 8209  df-mnf 8210  df-ltxr 8212  df-inn 9137  df-2 9195  df-3 9196  df-ndx 13078  df-slot 13079  df-base 13081  df-sets 13082  df-iress 13083  df-plusg 13166  df-mulr 13167  df-0g 13334  df-mgm 13432  df-sgrp 13478  df-mnd 13493  df-grp 13579  df-minusg 13580  df-cmn 13866  df-abl 13867  df-mgp 13927  df-ur 13966  df-srg 13970  df-ring 14004  df-oppr 14074  df-dvdsr 14095  df-unit 14096  df-invr 14128  df-rlreg 14265
This theorem is referenced by:  znrrg  14667
  Copyright terms: Public domain W3C validator