Theorem dmxpss2 5195

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 4955	. 2 |- ( R C_ ( A X. B ) -> dom R C_ dom ( A X. B ) )
2		dmxpss 5193	. 2 |- dom ( A X. B ) C_ A
3	1, 2	sstrdi 3250	1 |- ( R C_ ( A X. B ) -> dom R C_ A )

Syntax hints:   -> wi 4   C_ wss 3211   X. cxp 4747   dom cdm 4749

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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-v 2815  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-br 4110  df-opab 4172  df-xp 4755  df-dm 4759

This theorem is referenced by:  cossxp2  5286