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

Theorem dmxpss2 5167
Description: Upper bound for the domain of a binary relation. (Contributed by BJ, 10-Jul-2022.)
Assertion
Ref Expression
dmxpss2  |-  ( R 
C_  ( A  X.  B )  ->  dom  R 
C_  A )

Proof of Theorem dmxpss2
StepHypRef Expression
1 dmss 4928 . 2  |-  ( R 
C_  ( A  X.  B )  ->  dom  R 
C_  dom  ( A  X.  B ) )
2 dmxpss 5165 . 2  |-  dom  ( A  X.  B )  C_  A
31, 2sstrdi 3237 1  |-  ( R 
C_  ( A  X.  B )  ->  dom  R 
C_  A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    C_ wss 3198    X. cxp 4721   dom cdm 4723
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-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-dm 4733
This theorem is referenced by:  cossxp2  5258
  Copyright terms: Public domain W3C validator