Theorem fnsn 6556

Description: Functionality and domain of the singleton of an ordered pair. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.)

Hypotheses

Ref	Expression
fnsn.1	⊢ 𝐴 ∈ V
fnsn.2	⊢ 𝐵 ∈ V

Assertion

Ref	Expression
fnsn	⊢ {⟨𝐴, 𝐵⟩} Fn {𝐴}

Proof of Theorem fnsn

Step	Hyp	Ref	Expression
1		fnsn.1	. 2 ⊢ 𝐴 ∈ V
2		fnsn.2	. 2 ⊢ 𝐵 ∈ V
3		fnsng 6550	. 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → {⟨𝐴, 𝐵⟩} Fn {𝐴})
4	1, 2, 3	mp2an 693	1 ⊢ {⟨𝐴, 𝐵⟩} Fn {𝐴}

Syntax hints:   ∈ wcel 2114  Vcvv 3429  {csn 4567  ⟨cop 4573   Fn wfn 6493

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2708  ax-sep 5231  ax-pr 5375

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-mo 2539  df-clab 2715  df-cleq 2728  df-clel 2811  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-br 5086  df-opab 5148  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-fun 6500  df-fn 6501

This theorem is referenced by:  f1osn  6821  fnsnbOLD  7121  frrlem11  8246  frrlem12  8247  elixpsn  8885  axdc3lem4  10375  hashf1lem1  14417  axlowdimlem8  29018  axlowdimlem9  29019  axlowdimlem11  29021  axlowdimlem12  29022  bnj927  34912  cvmliftlem4  35470  cvmliftlem5  35471  finixpnum  37926  poimirlem3  37944