ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  fnsn Unicode version

Theorem fnsn 5384
Description: Functionality and domain of the singleton of an ordered pair. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.)
Hypotheses
Ref Expression
fnsn.1  |-  A  e. 
_V
fnsn.2  |-  B  e. 
_V
Assertion
Ref Expression
fnsn  |-  { <. A ,  B >. }  Fn  { A }

Proof of Theorem fnsn
StepHypRef Expression
1 fnsn.1 . 2  |-  A  e. 
_V
2 fnsn.2 . 2  |-  B  e. 
_V
3 fnsng 5377 . 2  |-  ( ( A  e.  _V  /\  B  e.  _V )  ->  { <. A ,  B >. }  Fn  { A } )
41, 2, 3mp2an 426 1  |-  { <. A ,  B >. }  Fn  { A }
Colors of variables: wff set class
Syntax hints:    e. wcel 2202   _Vcvv 2802   {csn 3669   <.cop 3672    Fn wfn 5321
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 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-br 4089  df-opab 4151  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-fun 5328  df-fn 5329
This theorem is referenced by:  f1osn  5625  fvsnun2  5852  elixpsn  6904  xnn0nnen  10700
  Copyright terms: Public domain W3C validator