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

Theorem opprdomnbg 14634
Description: A class is a domain if and only if its opposite is a domain, biconditional form of opprdomn 14635. (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 14543 . . 3  |-  ( R  e.  V  ->  ( R  e. NzRing  <->  O  e. NzRing ) )
3 eqid 2238 . . . . . 6  |-  ( Base `  R )  =  (
Base `  R )
41, 3opprbasg 14431 . . . . 5  |-  ( R  e.  V  ->  ( Base `  R )  =  ( Base `  O
) )
5 vex 2824 . . . . . . . . . 10  |-  y  e. 
_V
6 vex 2824 . . . . . . . . . 10  |-  x  e. 
_V
7 eqid 2238 . . . . . . . . . . 11  |-  ( .r
`  R )  =  ( .r `  R
)
8 eqid 2238 . . . . . . . . . . 11  |-  ( .r
`  O )  =  ( .r `  O
)
93, 7, 1, 8opprmulg 14427 . . . . . . . . . 10  |-  ( ( R  e.  V  /\  y  e.  _V  /\  x  e.  _V )  ->  (
y ( .r `  O ) x )  =  ( x ( .r `  R ) y ) )
105, 6, 9mp3an23 1370 . . . . . . . . 9  |-  ( R  e.  V  ->  (
y ( .r `  O ) x )  =  ( x ( .r `  R ) y ) )
1110eqcomd 2244 . . . . . . . 8  |-  ( R  e.  V  ->  (
x ( .r `  R ) y )  =  ( y ( .r `  O ) x ) )
12 eqid 2238 . . . . . . . . 9  |-  ( 0g
`  R )  =  ( 0g `  R
)
131, 12oppr0g 14438 . . . . . . . 8  |-  ( R  e.  V  ->  ( 0g `  R )  =  ( 0g `  O
) )
1411, 13eqeq12d 2253 . . . . . . 7  |-  ( R  e.  V  ->  (
( x ( .r
`  R ) y )  =  ( 0g
`  R )  <->  ( y
( .r `  O
) x )  =  ( 0g `  O
) ) )
1513eqeq2d 2250 . . . . . . . . 9  |-  ( R  e.  V  ->  (
x  =  ( 0g
`  R )  <->  x  =  ( 0g `  O ) ) )
1613eqeq2d 2250 . . . . . . . . 9  |-  ( R  e.  V  ->  (
y  =  ( 0g
`  R )  <->  y  =  ( 0g `  O ) ) )
1715, 16orbi12d 805 . . . . . . . 8  |-  ( R  e.  V  ->  (
( x  =  ( 0g `  R )  \/  y  =  ( 0g `  R ) )  <->  ( x  =  ( 0g `  O
)  \/  y  =  ( 0g `  O
) ) ) )
18 orcom 740 . . . . . . . 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 2765 . . . . 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 2765 . . . 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 2714 . . . 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 477 . 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 14629 . 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 2238 . . 3  |-  ( Base `  O )  =  (
Base `  O )
28 eqid 2238 . . 3  |-  ( 0g
`  O )  =  ( 0g `  O
)
2927, 8, 28isdomn 14629 . 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
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 720    = wceq 1402    e. wcel 2209   A.wral 2528   _Vcvv 2821   ` cfv 5377  (class class class)co 6085   Basecbs 13403   .rcmulr 13483   0gc0g 13661  opprcoppr 14423  NzRingcnzr 14537  Domncdomn 14615
This proof depends on 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 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8271  ax-resscn 8272  ax-1cn 8273  ax-1re 8274  ax-icn 8275  ax-addcl 8276  ax-addrcl 8277  ax-mulcl 8278  ax-addcom 8280  ax-addass 8282  ax-i2m1 8285  ax-0lt1 8286  ax-0id 8288  ax-rnegex 8289  ax-pre-ltirr 8292  ax-pre-lttrn 8294  ax-pre-ltadd 8296
This proof 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 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-tpos 6516  df-pnf 8363  df-mnf 8364  df-ltxr 8366  df-inn 9308  df-2 9366  df-3 9367  df-ndx 13406  df-slot 13407  df-base 13409  df-sets 13410  df-plusg 13495  df-mulr 13496  df-0g 13663  df-mgm 13727  df-sgrp 13768  df-mnd 13781  df-grp 13859  df-mgp 14269  df-ur 14314  df-ring 14353  df-oppr 14424  df-nzr 14538  df-domn 14618
This theorem is used by:  opprdomn  14635
  Copyright terms: Public domain W3C validator