MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  funsn Unicode version

Theorem funsn 5265
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 5263 . 2  |-  ( ( A  e.  _V  /\  B  e.  _V )  ->  Fun  { <. A ,  B >. } )
41, 2, 3mp2an 655 1  |-  Fun  { <. A ,  B >. }
Colors of variables: wff set class
Syntax hints:    e. wcel 1685   _Vcvv 2789   {csn 3641   <.cop 3644   Fun wfun 5215
This theorem is referenced by:  funtp  5268  fun0  5272  fvsn  5674  dcomex  8068  axdc3lem4  8074  xpsc0  13456  xpsc1  13457  wfrlem13  23669  repfuntw  24559  1alg  25121  bnj1421  28339
This theorem was proved from axioms:  ax-1 7  ax-2 8  ax-3 9  ax-mp 10  ax-gen 1534  ax-5 1545  ax-17 1604  ax-9 1637  ax-8 1645  ax-14 1689  ax-6 1704  ax-7 1709  ax-11 1716  ax-12 1867  ax-ext 2265  ax-sep 4142  ax-nul 4150  ax-pr 4213
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3an 938  df-tru 1312  df-ex 1530  df-nf 1533  df-sb 1632  df-eu 2148  df-mo 2149  df-clab 2271  df-cleq 2277  df-clel 2280  df-nfc 2409  df-ne 2449  df-ral 2549  df-rex 2550  df-rab 2553  df-v 2791  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-nul 3457  df-if 3567  df-sn 3647  df-pr 3648  df-op 3650  df-br 4025  df-opab 4079  df-id 4308  df-xp 4694  df-rel 4695  df-cnv 4696  df-co 4697  df-fun 5223
  Copyright terms: Public domain W3C validator