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

Theorem opprdomnbg 14294
Description: A class is a domain if and only if its opposite is a domain, biconditional form of opprdomn 14295. (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 14205 . . 3  |-  ( R  e.  V  ->  ( R  e. NzRing  <->  O  e. NzRing ) )
3 eqid 2231 . . . . . 6  |-  ( Base `  R )  =  (
Base `  R )
41, 3opprbasg 14094 . . . . 5  |-  ( R  e.  V  ->  ( Base `  R )  =  ( Base `  O
) )
5 vex 2805 . . . . . . . . . 10  |-  y  e. 
_V
6 vex 2805 . . . . . . . . . 10  |-  x  e. 
_V
7 eqid 2231 . . . . . . . . . . 11  |-  ( .r
`  R )  =  ( .r `  R
)
8 eqid 2231 . . . . . . . . . . 11  |-  ( .r
`  O )  =  ( .r `  O
)
93, 7, 1, 8opprmulg 14090 . . . . . . . . . 10  |-  ( ( R  e.  V  /\  y  e.  _V  /\  x  e.  _V )  ->  (
y ( .r `  O ) x )  =  ( x ( .r `  R ) y ) )
105, 6, 9mp3an23 1365 . . . . . . . . 9  |-  ( R  e.  V  ->  (
y ( .r `  O ) x )  =  ( x ( .r `  R ) y ) )
1110eqcomd 2237 . . . . . . . 8  |-  ( R  e.  V  ->  (
x ( .r `  R ) y )  =  ( y ( .r `  O ) x ) )
12 eqid 2231 . . . . . . . . 9  |-  ( 0g
`  R )  =  ( 0g `  R
)
131, 12oppr0g 14100 . . . . . . . 8  |-  ( R  e.  V  ->  ( 0g `  R )  =  ( 0g `  O
) )
1411, 13eqeq12d 2246 . . . . . . 7  |-  ( R  e.  V  ->  (
( x ( .r
`  R ) y )  =  ( 0g
`  R )  <->  ( y
( .r `  O
) x )  =  ( 0g `  O
) ) )
1513eqeq2d 2243 . . . . . . . . 9  |-  ( R  e.  V  ->  (
x  =  ( 0g
`  R )  <->  x  =  ( 0g `  O ) ) )
1613eqeq2d 2243 . . . . . . . . 9  |-  ( R  e.  V  ->  (
y  =  ( 0g
`  R )  <->  y  =  ( 0g `  O ) ) )
1715, 16orbi12d 800 . . . . . . . 8  |-  ( R  e.  V  ->  (
( x  =  ( 0g `  R )  \/  y  =  ( 0g `  R ) )  <->  ( x  =  ( 0g `  O
)  \/  y  =  ( 0g `  O
) ) ) )
18 orcom 735 . . . . . . . 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 2746 . . . . 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 2746 . . . 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 2696 . . . 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 14289 . 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 2231 . . 3  |-  ( Base `  O )  =  (
Base `  O )
28 eqid 2231 . . 3  |-  ( 0g
`  O )  =  ( 0g `  O
)
2927, 8, 28isdomn 14289 . 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 715    = wceq 1397    e. wcel 2202   A.wral 2510   _Vcvv 2802   ` cfv 5326  (class class class)co 6018   Basecbs 13087   .rcmulr 13166   0gc0g 13344  opprcoppr 14086  NzRingcnzr 14199  Domncdomn 14276
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8123  ax-resscn 8124  ax-1cn 8125  ax-1re 8126  ax-icn 8127  ax-addcl 8128  ax-addrcl 8129  ax-mulcl 8130  ax-addcom 8132  ax-addass 8134  ax-i2m1 8137  ax-0lt1 8138  ax-0id 8140  ax-rnegex 8141  ax-pre-ltirr 8144  ax-pre-lttrn 8146  ax-pre-ltadd 8148
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-fv 5334  df-riota 5971  df-ov 6021  df-oprab 6022  df-mpo 6023  df-tpos 6411  df-pnf 8216  df-mnf 8217  df-ltxr 8219  df-inn 9144  df-2 9202  df-3 9203  df-ndx 13090  df-slot 13091  df-base 13093  df-sets 13094  df-plusg 13178  df-mulr 13179  df-0g 13346  df-mgm 13444  df-sgrp 13490  df-mnd 13505  df-grp 13591  df-mgp 13940  df-ur 13979  df-ring 14017  df-oppr 14087  df-nzr 14200  df-domn 14279
This theorem is referenced by:  opprdomn  14295
  Copyright terms: Public domain W3C validator