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

Theorem dmxpss2 5043
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 4810 . 2  |-  ( R 
C_  ( A  X.  B )  ->  dom  R 
C_  dom  ( A  X.  B ) )
2 dmxpss 5041 . 2  |-  dom  ( A  X.  B )  C_  A
31, 2sstrdi 3159 1  |-  ( R 
C_  ( A  X.  B )  ->  dom  R 
C_  A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    C_ wss 3121    X. cxp 4609   dom cdm 4611
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-pow 4160  ax-pr 4194
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-v 2732  df-un 3125  df-in 3127  df-ss 3134  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-br 3990  df-opab 4051  df-xp 4617  df-dm 4621
This theorem is referenced by:  cossxp2  5134
  Copyright terms: Public domain W3C validator