Theorem fssxp 6740

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	⊢ (𝐹:𝐴⟶𝐵 → 𝐹 ⊆ (𝐴 × 𝐵))

Proof of Theorem fssxp

Step	Hyp	Ref	Expression
1		frel 6718	. . 3 ⊢ (𝐹:𝐴⟶𝐵 → Rel 𝐹)
2		relssdmrn 6276	. . 3 ⊢ (Rel 𝐹 → 𝐹 ⊆ (dom 𝐹 × ran 𝐹))
3	1, 2	syl 18	. 2 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 ⊆ (dom 𝐹 × ran 𝐹))
4		fdm 6722	. . . 4 ⊢ (𝐹:𝐴⟶𝐵 → dom 𝐹 = 𝐴)
5		eqimss 3998	. . . 4 ⊢ (dom 𝐹 = 𝐴 → dom 𝐹 ⊆ 𝐴)
6	4, 5	syl 18	. . 3 ⊢ (𝐹:𝐴⟶𝐵 → dom 𝐹 ⊆ 𝐴)
7		frn 6720	. . 3 ⊢ (𝐹:𝐴⟶𝐵 → ran 𝐹 ⊆ 𝐵)
8		xpss12 5681	. . 3 ⊢ ((dom 𝐹 ⊆ 𝐴 ∧ ran 𝐹 ⊆ 𝐵) → (dom 𝐹 × ran 𝐹) ⊆ (𝐴 × 𝐵))
9	6, 7, 8	syl2anc 596	. 2 ⊢ (𝐹:𝐴⟶𝐵 → (dom 𝐹 × ran 𝐹) ⊆ (𝐴 × 𝐵))
10	3, 9	sstrd 3950	1 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 ⊆ (𝐴 × 𝐵))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ⊆ wss 3908   × cxp 5664  dom cdm 5666  ran crn 5667  Rel wrel 5671  ⟶wf 6539

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2738  ax-sep 5262  ax-pr 5409

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-br 5115  df-opab 5179  df-xp 5672  df-rel 5673  df-cnv 5674  df-dm 5676  df-rn 5677  df-fun 6545  df-fn 6546  df-f 6547

This theorem is used by:  funssxp  6741  opelf  6746  dff2  7101  dff3  7102  fndifnfp  7181  fex2  7942  fabexd  7943  f2ndf  8124  f1o2ndf1  8126  fsetsspwxp  8859  uniixp  8928  wdom2d  9552  rankfu  9859  dfac12lem2  10147  infmap2  10219  axdc3lem  10452  fnct  10539  tskcard  10784  ixxex  13401  imasvscafn  17616  imasvscaf  17618  fnmrc  17688  mrcfval  17689  isacs1i  17738  mreacs  17739  pjfval  21893  pjpm  21895  isngp2  24791  volf  25725  fgraphopab  43970  dfno2  44194  issmflem  47481