Theorem fssxp 5504

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 5489	. . 3 ⊢ (𝐹:𝐴⟶𝐵 → Rel 𝐹)
2		relssdmrn 5259	. . 3 ⊢ (Rel 𝐹 → 𝐹 ⊆ (dom 𝐹 × ran 𝐹))
3	1, 2	syl 14	. 2 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 ⊆ (dom 𝐹 × ran 𝐹))
4		fdm 5490	. . . 4 ⊢ (𝐹:𝐴⟶𝐵 → dom 𝐹 = 𝐴)
5		eqimss 3280	. . . 4 ⊢ (dom 𝐹 = 𝐴 → dom 𝐹 ⊆ 𝐴)
6	4, 5	syl 14	. . 3 ⊢ (𝐹:𝐴⟶𝐵 → dom 𝐹 ⊆ 𝐴)
7		frn 5493	. . 3 ⊢ (𝐹:𝐴⟶𝐵 → ran 𝐹 ⊆ 𝐵)
8		xpss12 4835	. . 3 ⊢ ((dom 𝐹 ⊆ 𝐴 ∧ ran 𝐹 ⊆ 𝐵) → (dom 𝐹 × ran 𝐹) ⊆ (𝐴 × 𝐵))
9	6, 7, 8	syl2anc 411	. 2 ⊢ (𝐹:𝐴⟶𝐵 → (dom 𝐹 × ran 𝐹) ⊆ (𝐴 × 𝐵))
10	3, 9	sstrd 3236	1 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 ⊆ (𝐴 × 𝐵))

Syntax hints:   → wi 4   = wceq 1397   ⊆ wss 3199   × cxp 4725  dom cdm 4727  ran crn 4728  Rel wrel 4732  ⟶wf 5324

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 2204  ax-ext 2212  ax-sep 4208  ax-pow 4266  ax-pr 4301

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1810  df-eu 2081  df-mo 2082  df-clab 2217  df-cleq 2223  df-clel 2226  df-nfc 2362  df-ral 2514  df-rex 2515  df-v 2803  df-un 3203  df-in 3205  df-ss 3212  df-pw 3655  df-sn 3676  df-pr 3677  df-op 3679  df-br 4090  df-opab 4152  df-xp 4733  df-rel 4734  df-cnv 4735  df-dm 4737  df-rn 4738  df-fun 5330  df-fn 5331  df-f 5332

This theorem is referenced by:  fex2  5505  funssxp  5506  opelf  5509  fabexg  5526  dff2  5794  dff3im  5795  f2ndf  6396  f1o2ndf1  6398  tfrlemibfn  6499  tfr1onlembfn  6515  tfrcllembfn  6528  mapex  6828  uniixp  6895  ixxex  10139  pw1nct  16664