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

Theorem unitrrg 14578
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 2238 . . . . . 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 14354 . . . . . 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 14417 . . . 4  |-  ( ( R  e.  Ring  /\  x  e.  U )  ->  x  e.  ( Base `  R
) )
9 oveq2 6093 . . . . . 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 2238 . . . . . . . . . . 11  |-  ( invr `  R )  =  (
invr `  R )
11 eqid 2238 . . . . . . . . . . 11  |-  ( .r
`  R )  =  ( .r `  R
)
12 eqid 2238 . . . . . . . . . . 11  |-  ( 1r
`  R )  =  ( 1r `  R
)
133, 10, 11, 12unitlinv 14435 . . . . . . . . . 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 6100 . . . . . . . 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 531 . . . . . . . . 9  |-  ( ( ( R  e.  Ring  /\  x  e.  U )  /\  y  e.  (
Base `  R )
)  ->  R  e.  Ring )
173, 10, 1ringinvcl 14434 . . . . . . . . . 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 14322 . . . . . . . . 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 1280 . . . . . . . 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 14330 . . . . . . . . 9  |-  ( ( R  e.  Ring  /\  y  e.  ( Base `  R
) )  ->  (
( 1r `  R
) ( .r `  R ) y )  =  y )
2423adantlr 481 . . . . . . . 8  |-  ( ( ( R  e.  Ring  /\  x  e.  U )  /\  y  e.  (
Base `  R )
)  ->  ( ( 1r `  R ) ( .r `  R ) y )  =  y )
2515, 22, 243eqtr3d 2279 . . . . . . 7  |-  ( ( ( R  e.  Ring  /\  x  e.  U )  /\  y  e.  (
Base `  R )
)  ->  ( (
( invr `  R ) `  x ) ( .r
`  R ) ( x ( .r `  R ) y ) )  =  y )
26 eqid 2238 . . . . . . . . 9  |-  ( 0g
`  R )  =  ( 0g `  R
)
271, 11, 26ringrz 14351 . . . . . . . 8  |-  ( ( R  e.  Ring  /\  (
( invr `  R ) `  x )  e.  (
Base `  R )
)  ->  ( (
( invr `  R ) `  x ) ( .r
`  R ) ( 0g `  R ) )  =  ( 0g
`  R ) )
2816, 18, 27syl2anc 415 . . . . . . 7  |-  ( ( ( R  e.  Ring  /\  x  e.  U )  /\  y  e.  (
Base `  R )
)  ->  ( (
( invr `  R ) `  x ) ( .r
`  R ) ( 0g `  R ) )  =  ( 0g
`  R ) )
2925, 28eqeq12d 2253 . . . . . 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 2623 . . . 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 14573 . . . 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 421 . . 3  |-  ( ( R  e.  Ring  /\  x  e.  U )  ->  x  e.  E )
3534ex 115 . 2  |-  ( R  e.  Ring  ->  ( x  e.  U  ->  x  e.  E ) )
3635ssrdv 3254 1  |-  ( R  e.  Ring  ->  U  C_  E )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   A.wral 2528    C_ wss 3220   ` cfv 5377  (class class class)co 6085   Basecbs 13354   .rcmulr 13434   0gc0g 13612   1rcur 14264  SRingcsrg 14269   Ringcrg 14302  Unitcui 14395   invrcinvr 14429  RLRegcrlreg 14565
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-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-pre-ltirr 8291  ax-pre-lttrn 8293  ax-pre-ltadd 8295
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-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-tpos 6516  df-pnf 8362  df-mnf 8363  df-ltxr 8365  df-inn 9306  df-2 9364  df-3 9365  df-ndx 13357  df-slot 13358  df-base 13360  df-sets 13361  df-iress 13362  df-plusg 13446  df-mulr 13447  df-0g 13614  df-mgm 13678  df-sgrp 13719  df-mnd 13732  df-grp 13810  df-minusg 13811  df-cmn 14091  df-abl 14092  df-mgp 14220  df-ur 14265  df-srg 14270  df-ring 14304  df-oppr 14375  df-dvdsr 14397  df-unit 14398  df-invr 14430  df-rlreg 14568
This theorem is used by:  znrrg  14997
  Copyright terms: Public domain W3C validator