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

Theorem crngoppr 14035
Description: In a commutative ring, the opposite ring is equivalent to the original ring. (Contributed by Mario Carneiro, 14-Jun-2015.)
Hypotheses
Ref Expression
opprval.1  |-  B  =  ( Base `  R
)
opprval.2  |-  .x.  =  ( .r `  R )
opprval.3  |-  O  =  (oppr
`  R )
opprmulfval.4  |-  .xb  =  ( .r `  O )
Assertion
Ref Expression
crngoppr  |-  ( ( R  e.  CRing  /\  X  e.  B  /\  Y  e.  B )  ->  ( X  .x.  Y )  =  ( X  .xb  Y
) )

Proof of Theorem crngoppr
StepHypRef Expression
1 opprval.1 . . 3  |-  B  =  ( Base `  R
)
2 opprval.2 . . 3  |-  .x.  =  ( .r `  R )
31, 2crngcom 13977 . 2  |-  ( ( R  e.  CRing  /\  X  e.  B  /\  Y  e.  B )  ->  ( X  .x.  Y )  =  ( Y  .x.  X
) )
4 opprval.3 . . 3  |-  O  =  (oppr
`  R )
5 opprmulfval.4 . . 3  |-  .xb  =  ( .r `  O )
61, 2, 4, 5opprmulg 14034 . 2  |-  ( ( R  e.  CRing  /\  X  e.  B  /\  Y  e.  B )  ->  ( X  .xb  Y )  =  ( Y  .x.  X
) )
73, 6eqtr4d 2265 1  |-  ( ( R  e.  CRing  /\  X  e.  B  /\  Y  e.  B )  ->  ( X  .x.  Y )  =  ( X  .xb  Y
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ w3a 1002    = wceq 1395    e. wcel 2200   ` cfv 5318  (class class class)co 6001   Basecbs 13032   .rcmulr 13111   CRingccrg 13960  opprcoppr 14030
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-sep 4202  ax-nul 4210  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-cnex 8090  ax-resscn 8091  ax-1cn 8092  ax-1re 8093  ax-icn 8094  ax-addcl 8095  ax-addrcl 8096  ax-mulcl 8097  ax-addcom 8099  ax-addass 8101  ax-i2m1 8104  ax-0lt1 8105  ax-0id 8107  ax-rnegex 8108  ax-pre-ltirr 8111  ax-pre-ltadd 8115
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-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4384  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-fv 5326  df-ov 6004  df-oprab 6005  df-mpo 6006  df-tpos 6391  df-pnf 8183  df-mnf 8184  df-ltxr 8186  df-inn 9111  df-2 9169  df-3 9170  df-ndx 13035  df-slot 13036  df-base 13038  df-sets 13039  df-plusg 13123  df-mulr 13124  df-cmn 13823  df-mgp 13884  df-cring 13962  df-oppr 14031
This theorem is referenced by:  crngunit  14075  crngridl  14494
  Copyright terms: Public domain W3C validator