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

Theorem funsn 5127
Description: A singleton of an ordered pair is a function. Theorem 10.5 of [Quine] p. 65. (Contributed by NM, 12-Aug-1994.)
Hypotheses
Ref Expression
funsn.1  |-  A  e. 
_V
funsn.2  |-  B  e. 
_V
Assertion
Ref Expression
funsn  |-  Fun  { <. A ,  B >. }

Proof of Theorem funsn
StepHypRef Expression
1 funsn.1 . 2  |-  A  e. 
_V
2 funsn.2 . 2  |-  B  e. 
_V
3 funsng 5125 . 2  |-  ( ( A  e.  _V  /\  B  e.  _V )  ->  Fun  { <. A ,  B >. } )
41, 2, 3mp2an 420 1  |-  Fun  { <. A ,  B >. }
Colors of variables: wff set class
Syntax hints:    e. wcel 1461   _Vcvv 2655   {csn 3491   <.cop 3494   Fun wfun 5073
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 681  ax-5 1404  ax-7 1405  ax-gen 1406  ax-ie1 1450  ax-ie2 1451  ax-8 1463  ax-10 1464  ax-11 1465  ax-i12 1466  ax-bndl 1467  ax-4 1468  ax-14 1473  ax-17 1487  ax-i9 1491  ax-ial 1495  ax-i5r 1496  ax-ext 2095  ax-sep 4004  ax-pow 4056  ax-pr 4089
This theorem depends on definitions:  df-bi 116  df-3an 945  df-tru 1315  df-nf 1418  df-sb 1717  df-eu 1976  df-mo 1977  df-clab 2100  df-cleq 2106  df-clel 2109  df-nfc 2242  df-ral 2393  df-rex 2394  df-v 2657  df-un 3039  df-in 3041  df-ss 3048  df-pw 3476  df-sn 3497  df-pr 3498  df-op 3500  df-br 3894  df-opab 3948  df-id 4173  df-xp 4503  df-rel 4504  df-cnv 4505  df-co 4506  df-fun 5081
This theorem is referenced by:  funtp  5132  fun0  5137  fvsn  5567
  Copyright terms: Public domain W3C validator