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

Theorem oppr0g 14332
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 2234 . . . . . 6  |-  ( Base `  R )  =  (
Base `  R )
31, 2opprbasg 14325 . . . . 5  |-  ( R  e.  V  ->  ( Base `  R )  =  ( Base `  O
) )
43eleq2d 2304 . . . 4  |-  ( R  e.  V  ->  (
y  e.  ( Base `  R )  <->  y  e.  ( Base `  O )
) )
5 eqid 2234 . . . . . . . . 9  |-  ( +g  `  R )  =  ( +g  `  R )
61, 5oppraddg 14326 . . . . . . . 8  |-  ( R  e.  V  ->  ( +g  `  R )  =  ( +g  `  O
) )
76oveqd 6077 . . . . . . 7  |-  ( R  e.  V  ->  (
y ( +g  `  R
) x )  =  ( y ( +g  `  O ) x ) )
87eqeq1d 2243 . . . . . 6  |-  ( R  e.  V  ->  (
( y ( +g  `  R ) x )  =  x  <->  ( y
( +g  `  O ) x )  =  x ) )
96oveqd 6077 . . . . . . 7  |-  ( R  e.  V  ->  (
x ( +g  `  R
) y )  =  ( x ( +g  `  O ) y ) )
109eqeq1d 2243 . . . . . 6  |-  ( R  e.  V  ->  (
( x ( +g  `  R ) y )  =  x  <->  ( x
( +g  `  O ) y )  =  x ) )
118, 10anbi12d 473 . . . . 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 2759 . . . 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 473 . . 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 5342 . 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 13642 . 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 14323 . . 3  |-  ( R  e.  V  ->  O  e.  _V )
18 eqid 2234 . . . 4  |-  ( Base `  O )  =  (
Base `  O )
19 eqid 2234 . . . 4  |-  ( +g  `  O )  =  ( +g  `  O )
20 eqid 2234 . . . 4  |-  ( 0g
`  O )  =  ( 0g `  O
)
2118, 19, 20grpidvalg 13642 . . 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 2277 1  |-  ( R  e.  V  ->  .0.  =  ( 0g `  O ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1398    e. wcel 2205   A.wral 2522   _Vcvv 2815   iotacio 5317   ` cfv 5359  (class class class)co 6060   Basecbs 13302   +g cplusg 13380   0gc0g 13559  opprcoppr 14317
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2208  ax-ext 2216  ax-sep 4234  ax-nul 4242  ax-pow 4293  ax-pr 4328  ax-un 4560  ax-setind 4666  ax-cnex 8236  ax-resscn 8237  ax-1cn 8238  ax-1re 8239  ax-icn 8240  ax-addcl 8241  ax-addrcl 8242  ax-mulcl 8243  ax-addcom 8245  ax-addass 8247  ax-i2m1 8250  ax-0lt1 8251  ax-0id 8253  ax-rnegex 8254  ax-pre-ltirr 8257  ax-pre-lttrn 8259  ax-pre-ltadd 8261
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3677  df-sn 3701  df-pr 3702  df-op 3704  df-uni 3921  df-int 3956  df-br 4116  df-opab 4178  df-mpt 4179  df-id 4420  df-xp 4762  df-rel 4763  df-cnv 4764  df-co 4765  df-dm 4766  df-rn 4767  df-res 4768  df-ima 4769  df-iota 5319  df-fun 5361  df-fn 5362  df-fv 5367  df-riota 6013  df-ov 6063  df-oprab 6064  df-mpo 6065  df-tpos 6491  df-pnf 8328  df-mnf 8329  df-ltxr 8331  df-inn 9260  df-2 9318  df-3 9319  df-ndx 13305  df-slot 13306  df-base 13308  df-sets 13309  df-plusg 13393  df-mulr 13394  df-0g 13561  df-oppr 14318
This theorem is referenced by:  opprnegg  14334  opprnzrbg  14437  opprdomnbg  14528  ridl0  14791  2idlcpblrng  14804
  Copyright terms: Public domain W3C validator