Theorem dmxpss2 5169

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

Step	Hyp	Ref	Expression
1		dmss 4930	. 2 |- ( R C_ ( A X. B ) -> dom R C_ dom ( A X. B ) )
2		dmxpss 5167	. 2 |- dom ( A X. B ) C_ A
3	1, 2	sstrdi 3239	1 |- ( R C_ ( A X. B ) -> dom R C_ A )

Syntax hints:   -> wi 4   C_ wss 3200   X. cxp 4723   dom cdm 4725

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 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-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-br 4089  df-opab 4151  df-xp 4731  df-dm 4735

This theorem is referenced by:  cossxp2  5260