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

Theorem funsng 5437
Description: A singleton of an ordered pair is a function. Theorem 10.5 of [Quine] p. 65. (Contributed by NM, 28-Jun-2011.)
Assertion
Ref Expression
funsng  |-  ( ( A  e.  V  /\  B  e.  W )  ->  Fun  { <. A ,  B >. } )

Proof of Theorem funsng
StepHypRef Expression
1 funcnvsn 5436 . 2  |-  Fun  `' { <. B ,  A >. }
2 cnvsng 5295 . . . 4  |-  ( ( B  e.  W  /\  A  e.  V )  ->  `' { <. B ,  A >. }  =  { <. A ,  B >. } )
32ancoms 440 . . 3  |-  ( ( A  e.  V  /\  B  e.  W )  ->  `' { <. B ,  A >. }  =  { <. A ,  B >. } )
43funeqd 5415 . 2  |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( Fun  `' { <. B ,  A >. }  <->  Fun  { <. A ,  B >. } ) )
51, 4mpbii 203 1  |-  ( ( A  e.  V  /\  B  e.  W )  ->  Fun  { <. A ,  B >. } )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 359    = wceq 1649    e. wcel 1717   {csn 3757   <.cop 3760   `'ccnv 4817   Fun wfun 5388
This theorem is referenced by:  fnsng  5438  funsn  5439  funprg  5440  funtpg  5441  tfrlem10  6584  strle1  13487  constr3pthlem1  21490  bnj519  28441  bnj150  28585
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1661  ax-8 1682  ax-14 1721  ax-6 1736  ax-7 1741  ax-11 1753  ax-12 1939  ax-ext 2368  ax-sep 4271  ax-nul 4279  ax-pr 4344
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-eu 2242  df-mo 2243  df-clab 2374  df-cleq 2380  df-clel 2383  df-nfc 2512  df-ne 2552  df-ral 2654  df-rex 2655  df-rab 2658  df-v 2901  df-dif 3266  df-un 3268  df-in 3270  df-ss 3277  df-nul 3572  df-if 3683  df-sn 3763  df-pr 3764  df-op 3766  df-br 4154  df-opab 4208  df-id 4439  df-xp 4824  df-rel 4825  df-cnv 4826  df-co 4827  df-fun 5396
  Copyright terms: Public domain W3C validator