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

Theorem isridlrng 14791
Description: A right ideal is a left ideal of the opposite non-unital ring. This theorem shows that this definition corresponds to the usual textbook definition of a right ideal of a ring to be a subgroup of the additive group of the ring which is closed under right-multiplication by elements of the full ring. (Contributed by AV, 21-Mar-2025.)
Hypotheses
Ref Expression
isridlrng.u  |-  U  =  (LIdeal `  (oppr
`  R ) )
isridlrng.b  |-  B  =  ( Base `  R
)
isridlrng.t  |-  .x.  =  ( .r `  R )
Assertion
Ref Expression
isridlrng  |-  ( ( R  e. Rng  /\  I  e.  (SubGrp `  R )
)  ->  ( I  e.  U  <->  A. x  e.  B  A. y  e.  I 
( y  .x.  x
)  e.  I ) )
Distinct variable groups:    x, B, y   
x, I, y    x, R, y    x, U, y
Allowed substitution hints:    .x. ( x, y)

Proof of Theorem isridlrng
StepHypRef Expression
1 eqid 2238 . . . 4  |-  (oppr `  R
)  =  (oppr `  R
)
21opprrng 14355 . . 3  |-  ( R  e. Rng  ->  (oppr
`  R )  e. Rng )
31opprsubgg 14363 . . . . 5  |-  ( R  e. Rng  ->  (SubGrp `  R )  =  (SubGrp `  (oppr
`  R ) ) )
43eleq2d 2308 . . . 4  |-  ( R  e. Rng  ->  ( I  e.  (SubGrp `  R )  <->  I  e.  (SubGrp `  (oppr `  R
) ) ) )
54biimpa 296 . . 3  |-  ( ( R  e. Rng  /\  I  e.  (SubGrp `  R )
)  ->  I  e.  (SubGrp `  (oppr
`  R ) ) )
6 isridlrng.u . . . 4  |-  U  =  (LIdeal `  (oppr
`  R ) )
7 eqid 2238 . . . 4  |-  ( Base `  (oppr
`  R ) )  =  ( Base `  (oppr `  R
) )
8 eqid 2238 . . . 4  |-  ( .r
`  (oppr
`  R ) )  =  ( .r `  (oppr `  R ) )
96, 7, 8dflidl2rng 14790 . . 3  |-  ( ( (oppr
`  R )  e. Rng  /\  I  e.  (SubGrp `  (oppr
`  R ) ) )  ->  ( I  e.  U  <->  A. x  e.  (
Base `  (oppr
`  R ) ) A. y  e.  I 
( x ( .r
`  (oppr
`  R ) ) y )  e.  I
) )
102, 5, 9syl2an2r 603 . 2  |-  ( ( R  e. Rng  /\  I  e.  (SubGrp `  R )
)  ->  ( I  e.  U  <->  A. x  e.  (
Base `  (oppr
`  R ) ) A. y  e.  I 
( x ( .r
`  (oppr
`  R ) ) y )  e.  I
) )
11 isridlrng.b . . . . 5  |-  B  =  ( Base `  R
)
121, 11opprbasg 14353 . . . 4  |-  ( R  e. Rng  ->  B  =  (
Base `  (oppr
`  R ) ) )
1312adantr 276 . . 3  |-  ( ( R  e. Rng  /\  I  e.  (SubGrp `  R )
)  ->  B  =  ( Base `  (oppr
`  R ) ) )
1413raleqdv 2755 . 2  |-  ( ( R  e. Rng  /\  I  e.  (SubGrp `  R )
)  ->  ( A. x  e.  B  A. y  e.  I  (
x ( .r `  (oppr `  R ) ) y )  e.  I  <->  A. x  e.  ( Base `  (oppr `  R
) ) A. y  e.  I  ( x
( .r `  (oppr `  R
) ) y )  e.  I ) )
15 isridlrng.t . . . . . . 7  |-  .x.  =  ( .r `  R )
1611, 15, 1, 8opprmulg 14349 . . . . . 6  |-  ( ( R  e. Rng  /\  x  e.  B  /\  y  e.  I )  ->  (
x ( .r `  (oppr `  R ) ) y )  =  ( y 
.x.  x ) )
1716ad4ant134 1248 . . . . 5  |-  ( ( ( ( R  e. Rng  /\  I  e.  (SubGrp `  R ) )  /\  x  e.  B )  /\  y  e.  I
)  ->  ( x
( .r `  (oppr `  R
) ) y )  =  ( y  .x.  x ) )
1817eleq1d 2307 . . . 4  |-  ( ( ( ( R  e. Rng  /\  I  e.  (SubGrp `  R ) )  /\  x  e.  B )  /\  y  e.  I
)  ->  ( (
x ( .r `  (oppr `  R ) ) y )  e.  I  <->  ( y  .x.  x )  e.  I
) )
1918ralbidva 2546 . . 3  |-  ( ( ( R  e. Rng  /\  I  e.  (SubGrp `  R
) )  /\  x  e.  B )  ->  ( A. y  e.  I 
( x ( .r
`  (oppr
`  R ) ) y )  e.  I  <->  A. y  e.  I  ( y  .x.  x )  e.  I ) )
2019ralbidva 2546 . 2  |-  ( ( R  e. Rng  /\  I  e.  (SubGrp `  R )
)  ->  ( A. x  e.  B  A. y  e.  I  (
x ( .r `  (oppr `  R ) ) y )  e.  I  <->  A. x  e.  B  A. y  e.  I  ( y  .x.  x )  e.  I
) )
2110, 14, 203bitr2d 216 1  |-  ( ( R  e. Rng  /\  I  e.  (SubGrp `  R )
)  ->  ( I  e.  U  <->  A. x  e.  B  A. y  e.  I 
( y  .x.  x
)  e.  I ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209   A.wral 2528   ` cfv 5372  (class class class)co 6075   Basecbs 13330   .rcmulr 13409  SubGrpcsubg 13947  Rngcrng 14206  opprcoppr 14345  LIdealclidl 14776
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 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 4241  ax-sep 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-addcom 8269  ax-addass 8271  ax-i2m1 8274  ax-0lt1 8275  ax-0id 8277  ax-rnegex 8278  ax-pre-ltirr 8281  ax-pre-lttrn 8283  ax-pre-ltadd 8285
This theorem 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 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-tpos 6506  df-pnf 8352  df-mnf 8353  df-ltxr 8355  df-inn 9284  df-2 9342  df-3 9343  df-4 9344  df-5 9345  df-6 9346  df-7 9347  df-8 9348  df-ndx 13333  df-slot 13334  df-base 13336  df-sets 13337  df-iress 13338  df-plusg 13421  df-mulr 13422  df-sca 13424  df-vsca 13425  df-ip 13426  df-0g 13589  df-mgm 13653  df-sgrp 13694  df-mnd 13707  df-grp 13785  df-subg 13950  df-cmn 14066  df-abl 14067  df-mgp 14195  df-rng 14207  df-oppr 14346  df-lssm 14662  df-sra 14744  df-rgmod 14745  df-lidl 14778
This theorem is referenced by:  df2idl2rng  14817
  Copyright terms: Public domain W3C validator