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

Theorem opprdomnbg 14506
Description: A class is a domain if and only if its opposite is a domain, biconditional form of opprdomn 14507. (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 14415 . . 3  |-  ( R  e.  V  ->  ( R  e. NzRing  <->  O  e. NzRing ) )
3 eqid 2234 . . . . . 6  |-  ( Base `  R )  =  (
Base `  R )
41, 3opprbasg 14303 . . . . 5  |-  ( R  e.  V  ->  ( Base `  R )  =  ( Base `  O
) )
5 vex 2818 . . . . . . . . . 10  |-  y  e. 
_V
6 vex 2818 . . . . . . . . . 10  |-  x  e. 
_V
7 eqid 2234 . . . . . . . . . . 11  |-  ( .r
`  R )  =  ( .r `  R
)
8 eqid 2234 . . . . . . . . . . 11  |-  ( .r
`  O )  =  ( .r `  O
)
93, 7, 1, 8opprmulg 14299 . . . . . . . . . 10  |-  ( ( R  e.  V  /\  y  e.  _V  /\  x  e.  _V )  ->  (
y ( .r `  O ) x )  =  ( x ( .r `  R ) y ) )
105, 6, 9mp3an23 1366 . . . . . . . . 9  |-  ( R  e.  V  ->  (
y ( .r `  O ) x )  =  ( x ( .r `  R ) y ) )
1110eqcomd 2240 . . . . . . . 8  |-  ( R  e.  V  ->  (
x ( .r `  R ) y )  =  ( y ( .r `  O ) x ) )
12 eqid 2234 . . . . . . . . 9  |-  ( 0g
`  R )  =  ( 0g `  R
)
131, 12oppr0g 14310 . . . . . . . 8  |-  ( R  e.  V  ->  ( 0g `  R )  =  ( 0g `  O
) )
1411, 13eqeq12d 2249 . . . . . . 7  |-  ( R  e.  V  ->  (
( x ( .r
`  R ) y )  =  ( 0g
`  R )  <->  ( y
( .r `  O
) x )  =  ( 0g `  O
) ) )
1513eqeq2d 2246 . . . . . . . . 9  |-  ( R  e.  V  ->  (
x  =  ( 0g
`  R )  <->  x  =  ( 0g `  O ) ) )
1613eqeq2d 2246 . . . . . . . . 9  |-  ( R  e.  V  ->  (
y  =  ( 0g
`  R )  <->  y  =  ( 0g `  O ) ) )
1715, 16orbi12d 801 . . . . . . . 8  |-  ( R  e.  V  ->  (
( x  =  ( 0g `  R )  \/  y  =  ( 0g `  R ) )  <->  ( x  =  ( 0g `  O
)  \/  y  =  ( 0g `  O
) ) ) )
18 orcom 736 . . . . . . . 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 2759 . . . . 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 2759 . . . 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 2708 . . . 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 14501 . 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 2234 . . 3  |-  ( Base `  O )  =  (
Base `  O )
28 eqid 2234 . . 3  |-  ( 0g
`  O )  =  ( 0g `  O
)
2927, 8, 28isdomn 14501 . 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 716    = wceq 1398    e. wcel 2205   A.wral 2522   _Vcvv 2815   ` cfv 5357  (class class class)co 6058   Basecbs 13296   .rcmulr 13375   0gc0g 13553  opprcoppr 14295  NzRingcnzr 14409  Domncdomn 14487
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-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-addcom 8243  ax-addass 8245  ax-i2m1 8248  ax-0lt1 8249  ax-0id 8251  ax-rnegex 8252  ax-pre-ltirr 8255  ax-pre-lttrn 8257  ax-pre-ltadd 8259
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-reu 2529  df-rmo 2530  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 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-tpos 6489  df-pnf 8326  df-mnf 8327  df-ltxr 8329  df-inn 9255  df-2 9313  df-3 9314  df-ndx 13299  df-slot 13300  df-base 13302  df-sets 13303  df-plusg 13387  df-mulr 13388  df-0g 13555  df-mgm 13653  df-sgrp 13699  df-mnd 13714  df-grp 13800  df-mgp 14149  df-ur 14188  df-ring 14226  df-oppr 14296  df-nzr 14410  df-domn 14490
This theorem is referenced by:  opprdomn  14507
  Copyright terms: Public domain W3C validator