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

Theorem relrelss 5309
Description: Two ways to describe the structure of a two-place operation. (Contributed by NM, 17-Dec-2008.)
Assertion
Ref Expression
relrelss  |-  ( ( Rel  A  /\  Rel  dom 
A )  <->  A  C_  (
( _V  X.  _V )  X.  _V ) )

Proof of Theorem relrelss
StepHypRef Expression
1 df-rel 4776 . . 3  |-  ( Rel 
dom  A  <->  dom  A  C_  ( _V  X.  _V ) )
21anbi2i 461 . 2  |-  ( ( Rel  A  /\  Rel  dom 
A )  <->  ( Rel  A  /\  dom  A  C_  ( _V  X.  _V )
) )
3 relssdmrn 5303 . . . 4  |-  ( Rel 
A  ->  A  C_  ( dom  A  X.  ran  A
) )
4 ssv 3270 . . . . 5  |-  ran  A  C_ 
_V
5 xpss12 4877 . . . . 5  |-  ( ( dom  A  C_  ( _V  X.  _V )  /\  ran  A  C_  _V )  ->  ( dom  A  X.  ran  A )  C_  (
( _V  X.  _V )  X.  _V ) )
64, 5mpan2 429 . . . 4  |-  ( dom 
A  C_  ( _V  X.  _V )  ->  ( dom  A  X.  ran  A
)  C_  ( ( _V  X.  _V )  X. 
_V ) )
73, 6sylan9ss 3261 . . 3  |-  ( ( Rel  A  /\  dom  A 
C_  ( _V  X.  _V ) )  ->  A  C_  ( ( _V  X.  _V )  X.  _V )
)
8 xpss 4878 . . . . . 6  |-  ( ( _V  X.  _V )  X.  _V )  C_  ( _V  X.  _V )
9 sstr 3256 . . . . . 6  |-  ( ( A  C_  ( ( _V  X.  _V )  X. 
_V )  /\  (
( _V  X.  _V )  X.  _V )  C_  ( _V  X.  _V )
)  ->  A  C_  ( _V  X.  _V ) )
108, 9mpan2 429 . . . . 5  |-  ( A 
C_  ( ( _V 
X.  _V )  X.  _V )  ->  A  C_  ( _V  X.  _V ) )
11 df-rel 4776 . . . . 5  |-  ( Rel 
A  <->  A  C_  ( _V 
X.  _V ) )
1210, 11sylibr 134 . . . 4  |-  ( A 
C_  ( ( _V 
X.  _V )  X.  _V )  ->  Rel  A )
13 dmss 4975 . . . . 5  |-  ( A 
C_  ( ( _V 
X.  _V )  X.  _V )  ->  dom  A  C_  dom  ( ( _V  X.  _V )  X.  _V )
)
14 vn0m 3533 . . . . . 6  |-  E. x  x  e.  _V
15 dmxpm 4997 . . . . . 6  |-  ( E. x  x  e.  _V  ->  dom  ( ( _V 
X.  _V )  X.  _V )  =  ( _V  X.  _V ) )
1614, 15ax-mp 5 . . . . 5  |-  dom  (
( _V  X.  _V )  X.  _V )  =  ( _V  X.  _V )
1713, 16sseqtrdi 3296 . . . 4  |-  ( A 
C_  ( ( _V 
X.  _V )  X.  _V )  ->  dom  A  C_  ( _V  X.  _V ) )
1812, 17jca 306 . . 3  |-  ( A 
C_  ( ( _V 
X.  _V )  X.  _V )  ->  ( Rel  A  /\  dom  A  C_  ( _V  X.  _V ) ) )
197, 18impbii 126 . 2  |-  ( ( Rel  A  /\  dom  A 
C_  ( _V  X.  _V ) )  <->  A  C_  (
( _V  X.  _V )  X.  _V ) )
202, 19bitri 184 1  |-  ( ( Rel  A  /\  Rel  dom 
A )  <->  A  C_  (
( _V  X.  _V )  X.  _V ) )
Colors of variables: wff set class
Syntax hints:    /\ wa 104    <-> wb 105    = wceq 1402   E.wex 1545    e. wcel 2209   _Vcvv 2821    C_ wss 3220    X. cxp 4767   dom cdm 4769   ran crn 4770   Rel wrel 4774
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-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 4244  ax-pow 4306  ax-pr 4341
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  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-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-br 4126  df-opab 4188  df-xp 4775  df-rel 4776  df-cnv 4777  df-dm 4779  df-rn 4780
This theorem is referenced by:  dftpos3  6523  tpostpos2  6526
  Copyright terms: Public domain W3C validator