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

Theorem cocnvss 5260
Description: Upper bound for the composed of a relation and an inverse relation. (Contributed by BJ, 10-Jul-2022.)
Assertion
Ref Expression
cocnvss  |-  ( S  o.  `' R ) 
C_  ( ran  ( R  |`  dom  S )  X.  ran  ( S  |`  dom  R ) )

Proof of Theorem cocnvss
StepHypRef Expression
1 cocnvres 5259 . 2  |-  ( S  o.  `' R )  =  ( ( S  |`  dom  R )  o.  `' ( R  |`  dom  S ) )
2 cossxp 5257 . . 3  |-  ( ( S  |`  dom  R )  o.  `' ( R  |`  dom  S ) ) 
C_  ( dom  `' ( R  |`  dom  S
)  X.  ran  ( S  |`  dom  R ) )
3 df-rn 4734 . . . . 5  |-  ran  ( R  |`  dom  S )  =  dom  `' ( R  |`  dom  S )
43eqimss2i 3282 . . . 4  |-  dom  `' ( R  |`  dom  S
)  C_  ran  ( R  |`  dom  S )
5 ssid 3245 . . . 4  |-  ran  ( S  |`  dom  R ) 
C_  ran  ( S  |` 
dom  R )
6 xpss12 4831 . . . 4  |-  ( ( dom  `' ( R  |`  dom  S )  C_  ran  ( R  |`  dom  S
)  /\  ran  ( S  |`  dom  R )  C_  ran  ( S  |`  dom  R
) )  ->  ( dom  `' ( R  |`  dom  S )  X.  ran  ( S  |`  dom  R
) )  C_  ( ran  ( R  |`  dom  S
)  X.  ran  ( S  |`  dom  R ) ) )
74, 5, 6mp2an 426 . . 3  |-  ( dom  `' ( R  |`  dom  S )  X.  ran  ( S  |`  dom  R
) )  C_  ( ran  ( R  |`  dom  S
)  X.  ran  ( S  |`  dom  R ) )
82, 7sstri 3234 . 2  |-  ( ( S  |`  dom  R )  o.  `' ( R  |`  dom  S ) ) 
C_  ( ran  ( R  |`  dom  S )  X.  ran  ( S  |`  dom  R ) )
91, 8eqsstri 3257 1  |-  ( S  o.  `' R ) 
C_  ( ran  ( R  |`  dom  S )  X.  ran  ( S  |`  dom  R ) )
Colors of variables: wff set class
Syntax hints:    C_ wss 3198    X. cxp 4721   `'ccnv 4722   dom cdm 4723   ran crn 4724    |` cres 4725    o. ccom 4727
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 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-14 2203  ax-ext 2211  ax-sep 4205  ax-pow 4262  ax-pr 4297
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  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-ral 2513  df-rex 2514  df-v 2802  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-br 4087  df-opab 4149  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735
This theorem is referenced by:  caserel  7277
  Copyright terms: Public domain W3C validator