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

Theorem oppr0g 14360
Description: Additive identity of an opposite ring. (Contributed by Mario Carneiro, 1-Dec-2014.)
Hypotheses
Ref Expression
opprbas.1  |-  O  =  (oppr
`  R )
oppr0.2  |-  .0.  =  ( 0g `  R )
Assertion
Ref Expression
oppr0g  |-  ( R  e.  V  ->  .0.  =  ( 0g `  O ) )

Proof of Theorem oppr0g
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 opprbas.1 . . . . . 6  |-  O  =  (oppr
`  R )
2 eqid 2238 . . . . . 6  |-  ( Base `  R )  =  (
Base `  R )
31, 2opprbasg 14353 . . . . 5  |-  ( R  e.  V  ->  ( Base `  R )  =  ( Base `  O
) )
43eleq2d 2308 . . . 4  |-  ( R  e.  V  ->  (
y  e.  ( Base `  R )  <->  y  e.  ( Base `  O )
) )
5 eqid 2238 . . . . . . . . 9  |-  ( +g  `  R )  =  ( +g  `  R )
61, 5oppraddg 14354 . . . . . . . 8  |-  ( R  e.  V  ->  ( +g  `  R )  =  ( +g  `  O
) )
76oveqd 6092 . . . . . . 7  |-  ( R  e.  V  ->  (
y ( +g  `  R
) x )  =  ( y ( +g  `  O ) x ) )
87eqeq1d 2247 . . . . . 6  |-  ( R  e.  V  ->  (
( y ( +g  `  R ) x )  =  x  <->  ( y
( +g  `  O ) x )  =  x ) )
96oveqd 6092 . . . . . . 7  |-  ( R  e.  V  ->  (
x ( +g  `  R
) y )  =  ( x ( +g  `  O ) y ) )
109eqeq1d 2247 . . . . . 6  |-  ( R  e.  V  ->  (
( x ( +g  `  R ) y )  =  x  <->  ( x
( +g  `  O ) y )  =  x ) )
118, 10anbi12d 477 . . . . 5  |-  ( R  e.  V  ->  (
( ( y ( +g  `  R ) x )  =  x  /\  ( x ( +g  `  R ) y )  =  x )  <->  ( ( y ( +g  `  O
) x )  =  x  /\  ( x ( +g  `  O
) y )  =  x ) ) )
123, 11raleqbidv 2765 . . . 4  |-  ( R  e.  V  ->  ( A. x  e.  ( Base `  R ) ( ( y ( +g  `  R ) x )  =  x  /\  (
x ( +g  `  R
) y )  =  x )  <->  A. x  e.  ( Base `  O
) ( ( y ( +g  `  O
) x )  =  x  /\  ( x ( +g  `  O
) y )  =  x ) ) )
134, 12anbi12d 477 . . 3  |-  ( R  e.  V  ->  (
( y  e.  (
Base `  R )  /\  A. x  e.  (
Base `  R )
( ( y ( +g  `  R ) x )  =  x  /\  ( x ( +g  `  R ) y )  =  x ) )  <->  ( y  e.  ( Base `  O
)  /\  A. x  e.  ( Base `  O
) ( ( y ( +g  `  O
) x )  =  x  /\  ( x ( +g  `  O
) y )  =  x ) ) ) )
1413iotabidv 5355 . 2  |-  ( R  e.  V  ->  ( iota y ( y  e.  ( Base `  R
)  /\  A. x  e.  ( Base `  R
) ( ( y ( +g  `  R
) x )  =  x  /\  ( x ( +g  `  R
) y )  =  x ) ) )  =  ( iota y
( y  e.  (
Base `  O )  /\  A. x  e.  (
Base `  O )
( ( y ( +g  `  O ) x )  =  x  /\  ( x ( +g  `  O ) y )  =  x ) ) ) )
15 oppr0.2 . . 3  |-  .0.  =  ( 0g `  R )
162, 5, 15grpidvalg 13670 . 2  |-  ( R  e.  V  ->  .0.  =  ( iota y
( y  e.  (
Base `  R )  /\  A. x  e.  (
Base `  R )
( ( y ( +g  `  R ) x )  =  x  /\  ( x ( +g  `  R ) y )  =  x ) ) ) )
171opprex 14351 . . 3  |-  ( R  e.  V  ->  O  e.  _V )
18 eqid 2238 . . . 4  |-  ( Base `  O )  =  (
Base `  O )
19 eqid 2238 . . . 4  |-  ( +g  `  O )  =  ( +g  `  O )
20 eqid 2238 . . . 4  |-  ( 0g
`  O )  =  ( 0g `  O
)
2118, 19, 20grpidvalg 13670 . . 3  |-  ( O  e.  _V  ->  ( 0g `  O )  =  ( iota y ( y  e.  ( Base `  O )  /\  A. x  e.  ( Base `  O ) ( ( y ( +g  `  O
) x )  =  x  /\  ( x ( +g  `  O
) y )  =  x ) ) ) )
2217, 21syl 14 . 2  |-  ( R  e.  V  ->  ( 0g `  O )  =  ( iota y ( y  e.  ( Base `  O )  /\  A. x  e.  ( Base `  O ) ( ( y ( +g  `  O
) x )  =  x  /\  ( x ( +g  `  O
) y )  =  x ) ) ) )
2314, 16, 223eqtr4d 2281 1  |-  ( R  e.  V  ->  .0.  =  ( 0g `  O ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   A.wral 2528   _Vcvv 2821   iotacio 5330   ` cfv 5372  (class class class)co 6075   Basecbs 13330   +g cplusg 13408   0gc0g 13587  opprcoppr 14345
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-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-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-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-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-ndx 13333  df-slot 13334  df-base 13336  df-sets 13337  df-plusg 13421  df-mulr 13422  df-0g 13589  df-oppr 14346
This theorem is referenced by:  opprnegg  14362  opprnzrbg  14465  opprdomnbg  14556  ridl0  14819  2idlcpblrng  14832
  Copyright terms: Public domain W3C validator