Theorem fnsn 6587

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 6581	. 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → {⟨𝐴, 𝐵⟩} Fn {𝐴})
4	1, 2, 3	mp2an 705	1 ⊢ {⟨𝐴, 𝐵⟩} Fn {𝐴}

This proof depends on syntax axioms:   ∈ wcel 2145  Vcvv 3450  {csn 4584  ⟨cop 4590   Fn wfn 6523

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 2147  ax-9 2155  ax-ext 2732  ax-sep 5249  ax-pr 5391

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-mo 2564  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-id 5543  df-xp 5654  df-rel 5655  df-cnv 5656  df-co 5657  df-dm 5658  df-fun 6530  df-fn 6531

This theorem is used by:  f1osn  6855  fnsnbOLD  7160  frrlem11  8293  frrlem12  8294  elixpsn  8944  axdc3lem4  10488  hashf1lem1  14553  axlowdimlem8  29446  axlowdimlem9  29447  axlowdimlem11  29449  axlowdimlem12  29450  bnj927  35320  cvmliftlem4  35968  cvmliftlem5  35969  finixpnum  38442  poimirlem3  38455