Theorem fssxp 5078

Description: A mapping is a class of ordered pairs. (Contributed by NM, 3-Aug-1994.) (Proof shortened by Andrew Salmon, 17-Sep-2011.)

Assertion

Ref	Expression
fssxp	|- ( F : A --> B -> F C_ ( A X. B ) )

Proof of Theorem fssxp

Step	Hyp	Ref	Expression
1		frel 5069	. . 3 |- ( F : A --> B -> Rel F )
2		relssdmrn 4861	. . 3 |- ( Rel F -> F C_ ( dom F X. ran F ) )
3	1, 2	syl 14	. 2 |- ( F : A --> B -> F C_ ( dom F X. ran F ) )
4		fdm 5070	. . . 4 |- ( F : A --> B -> dom F = A )
5		eqimss 3051	. . . 4 |- ( dom F = A -> dom F C_ A )
6	4, 5	syl 14	. . 3 |- ( F : A --> B -> dom F C_ A )
7		frn 5072	. . 3 |- ( F : A --> B -> ran F C_ B )
8		xpss12 4463	. . 3 |- ( ( dom F C_ A /\ ran F C_ B ) -> ( dom F X. ran F ) C_ ( A X. B ) )
9	6, 7, 8	syl2anc 403	. 2 |- ( F : A --> B -> ( dom F X. ran F ) C_ ( A X. B ) )
10	3, 9	sstrd 3009	1 |- ( F : A --> B -> F C_ ( A X. B ) )

Syntax hints:   -> wi 4   = wceq 1284   C_ wss 2973   X. cxp 4361   dom cdm 4363   ran crn 4364   Rel wrel 4368   -->wf 4918

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964

This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-v 2603  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-br 3786  df-opab 3840  df-xp 4369  df-rel 4370  df-cnv 4371  df-dm 4373  df-rn 4374  df-fun 4924  df-fn 4925  df-f 4926

This theorem is referenced by:  fex2  5079  funssxp  5080  opelf  5082  fabexg  5097  dff2  5332  dff3im  5333  f2ndf  5867  f1o2ndf1  5869  tfrlemibfn  5965  ixxex  8922