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

Theorem opprdomnbg 14259
Description: A class is a domain if and only if its opposite is a domain, biconditional form of opprdomn 14260. (Contributed by SN, 15-Jun-2015.)
Hypothesis
Ref Expression
opprdomn.1  |-  O  =  (oppr
`  R )
Assertion
Ref Expression
opprdomnbg  |-  ( R  e.  V  ->  ( R  e. Domn  <->  O  e. Domn ) )

Proof of Theorem opprdomnbg
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 opprdomn.1 . . . 4  |-  O  =  (oppr
`  R )
21opprnzrbg 14170 . . 3  |-  ( R  e.  V  ->  ( R  e. NzRing  <->  O  e. NzRing ) )
3 eqid 2229 . . . . . 6  |-  ( Base `  R )  =  (
Base `  R )
41, 3opprbasg 14059 . . . . 5  |-  ( R  e.  V  ->  ( Base `  R )  =  ( Base `  O
) )
5 vex 2802 . . . . . . . . . 10  |-  y  e. 
_V
6 vex 2802 . . . . . . . . . 10  |-  x  e. 
_V
7 eqid 2229 . . . . . . . . . . 11  |-  ( .r
`  R )  =  ( .r `  R
)
8 eqid 2229 . . . . . . . . . . 11  |-  ( .r
`  O )  =  ( .r `  O
)
93, 7, 1, 8opprmulg 14055 . . . . . . . . . 10  |-  ( ( R  e.  V  /\  y  e.  _V  /\  x  e.  _V )  ->  (
y ( .r `  O ) x )  =  ( x ( .r `  R ) y ) )
105, 6, 9mp3an23 1363 . . . . . . . . 9  |-  ( R  e.  V  ->  (
y ( .r `  O ) x )  =  ( x ( .r `  R ) y ) )
1110eqcomd 2235 . . . . . . . 8  |-  ( R  e.  V  ->  (
x ( .r `  R ) y )  =  ( y ( .r `  O ) x ) )
12 eqid 2229 . . . . . . . . 9  |-  ( 0g
`  R )  =  ( 0g `  R
)
131, 12oppr0g 14065 . . . . . . . 8  |-  ( R  e.  V  ->  ( 0g `  R )  =  ( 0g `  O
) )
1411, 13eqeq12d 2244 . . . . . . 7  |-  ( R  e.  V  ->  (
( x ( .r
`  R ) y )  =  ( 0g
`  R )  <->  ( y
( .r `  O
) x )  =  ( 0g `  O
) ) )
1513eqeq2d 2241 . . . . . . . . 9  |-  ( R  e.  V  ->  (
x  =  ( 0g
`  R )  <->  x  =  ( 0g `  O ) ) )
1613eqeq2d 2241 . . . . . . . . 9  |-  ( R  e.  V  ->  (
y  =  ( 0g
`  R )  <->  y  =  ( 0g `  O ) ) )
1715, 16orbi12d 798 . . . . . . . 8  |-  ( R  e.  V  ->  (
( x  =  ( 0g `  R )  \/  y  =  ( 0g `  R ) )  <->  ( x  =  ( 0g `  O
)  \/  y  =  ( 0g `  O
) ) ) )
18 orcom 733 . . . . . . . 8  |-  ( ( x  =  ( 0g
`  O )  \/  y  =  ( 0g
`  O ) )  <-> 
( y  =  ( 0g `  O )  \/  x  =  ( 0g `  O ) ) )
1917, 18bitrdi 196 . . . . . . 7  |-  ( R  e.  V  ->  (
( x  =  ( 0g `  R )  \/  y  =  ( 0g `  R ) )  <->  ( y  =  ( 0g `  O
)  \/  x  =  ( 0g `  O
) ) ) )
2014, 19imbi12d 234 . . . . . 6  |-  ( R  e.  V  ->  (
( ( x ( .r `  R ) y )  =  ( 0g `  R )  ->  ( x  =  ( 0g `  R
)  \/  y  =  ( 0g `  R
) ) )  <->  ( (
y ( .r `  O ) x )  =  ( 0g `  O )  ->  (
y  =  ( 0g
`  O )  \/  x  =  ( 0g
`  O ) ) ) ) )
214, 20raleqbidv 2744 . . . . 5  |-  ( R  e.  V  ->  ( A. y  e.  ( Base `  R ) ( ( x ( .r
`  R ) y )  =  ( 0g
`  R )  -> 
( x  =  ( 0g `  R )  \/  y  =  ( 0g `  R ) ) )  <->  A. y  e.  ( Base `  O
) ( ( y ( .r `  O
) x )  =  ( 0g `  O
)  ->  ( y  =  ( 0g `  O )  \/  x  =  ( 0g `  O ) ) ) ) )
224, 21raleqbidv 2744 . . . 4  |-  ( R  e.  V  ->  ( A. x  e.  ( Base `  R ) A. y  e.  ( Base `  R ) ( ( x ( .r `  R ) y )  =  ( 0g `  R )  ->  (
x  =  ( 0g
`  R )  \/  y  =  ( 0g
`  R ) ) )  <->  A. x  e.  (
Base `  O ) A. y  e.  ( Base `  O ) ( ( y ( .r
`  O ) x )  =  ( 0g
`  O )  -> 
( y  =  ( 0g `  O )  \/  x  =  ( 0g `  O ) ) ) ) )
23 ralcom 2694 . . . 4  |-  ( A. x  e.  ( Base `  O ) A. y  e.  ( Base `  O
) ( ( y ( .r `  O
) x )  =  ( 0g `  O
)  ->  ( y  =  ( 0g `  O )  \/  x  =  ( 0g `  O ) ) )  <->  A. y  e.  ( Base `  O ) A. x  e.  ( Base `  O ) ( ( y ( .r `  O ) x )  =  ( 0g `  O )  ->  (
y  =  ( 0g
`  O )  \/  x  =  ( 0g
`  O ) ) ) )
2422, 23bitrdi 196 . . 3  |-  ( R  e.  V  ->  ( A. x  e.  ( Base `  R ) A. y  e.  ( Base `  R ) ( ( x ( .r `  R ) y )  =  ( 0g `  R )  ->  (
x  =  ( 0g
`  R )  \/  y  =  ( 0g
`  R ) ) )  <->  A. y  e.  (
Base `  O ) A. x  e.  ( Base `  O ) ( ( y ( .r
`  O ) x )  =  ( 0g
`  O )  -> 
( y  =  ( 0g `  O )  \/  x  =  ( 0g `  O ) ) ) ) )
252, 24anbi12d 473 . 2  |-  ( R  e.  V  ->  (
( R  e. NzRing  /\  A. x  e.  ( Base `  R ) A. y  e.  ( Base `  R
) ( ( x ( .r `  R
) y )  =  ( 0g `  R
)  ->  ( x  =  ( 0g `  R )  \/  y  =  ( 0g `  R ) ) ) )  <->  ( O  e. NzRing  /\  A. y  e.  (
Base `  O ) A. x  e.  ( Base `  O ) ( ( y ( .r
`  O ) x )  =  ( 0g
`  O )  -> 
( y  =  ( 0g `  O )  \/  x  =  ( 0g `  O ) ) ) ) ) )
263, 7, 12isdomn 14254 . 2  |-  ( R  e. Domn 
<->  ( R  e. NzRing  /\  A. x  e.  ( Base `  R ) A. y  e.  ( Base `  R
) ( ( x ( .r `  R
) y )  =  ( 0g `  R
)  ->  ( x  =  ( 0g `  R )  \/  y  =  ( 0g `  R ) ) ) ) )
27 eqid 2229 . . 3  |-  ( Base `  O )  =  (
Base `  O )
28 eqid 2229 . . 3  |-  ( 0g
`  O )  =  ( 0g `  O
)
2927, 8, 28isdomn 14254 . 2  |-  ( O  e. Domn 
<->  ( O  e. NzRing  /\  A. y  e.  ( Base `  O ) A. x  e.  ( Base `  O
) ( ( y ( .r `  O
) x )  =  ( 0g `  O
)  ->  ( y  =  ( 0g `  O )  \/  x  =  ( 0g `  O ) ) ) ) )
3025, 26, 293bitr4g 223 1  |-  ( R  e.  V  ->  ( R  e. Domn  <->  O  e. Domn ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 713    = wceq 1395    e. wcel 2200   A.wral 2508   _Vcvv 2799   ` cfv 5321  (class class class)co 6010   Basecbs 13053   .rcmulr 13132   0gc0g 13310  opprcoppr 14051  NzRingcnzr 14164  Domncdomn 14241
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 4259  ax-pr 4294  ax-un 4525  ax-setind 4630  ax-cnex 8106  ax-resscn 8107  ax-1cn 8108  ax-1re 8109  ax-icn 8110  ax-addcl 8111  ax-addrcl 8112  ax-mulcl 8113  ax-addcom 8115  ax-addass 8117  ax-i2m1 8120  ax-0lt1 8121  ax-0id 8123  ax-rnegex 8124  ax-pre-ltirr 8127  ax-pre-lttrn 8129  ax-pre-ltadd 8131
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-reu 2515  df-rmo 2516  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 4385  df-xp 4726  df-rel 4727  df-cnv 4728  df-co 4729  df-dm 4730  df-rn 4731  df-res 4732  df-ima 4733  df-iota 5281  df-fun 5323  df-fn 5324  df-fv 5329  df-riota 5963  df-ov 6013  df-oprab 6014  df-mpo 6015  df-tpos 6402  df-pnf 8199  df-mnf 8200  df-ltxr 8202  df-inn 9127  df-2 9185  df-3 9186  df-ndx 13056  df-slot 13057  df-base 13059  df-sets 13060  df-plusg 13144  df-mulr 13145  df-0g 13312  df-mgm 13410  df-sgrp 13456  df-mnd 13471  df-grp 13557  df-mgp 13905  df-ur 13944  df-ring 13982  df-oppr 14052  df-nzr 14165  df-domn 14244
This theorem is referenced by:  opprdomn  14260
  Copyright terms: Public domain W3C validator