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

Theorem fmptsn 5577
Description: Express a singleton function in maps-to notation. (Contributed by NM, 6-Jun-2006.) (Proof shortened by Andrew Salmon, 22-Oct-2011.) (Revised by Stefan O'Rear, 28-Feb-2015.)
Assertion
Ref Expression
fmptsn  |-  ( ( A  e.  V  /\  B  e.  W )  ->  { <. A ,  B >. }  =  ( x  e.  { A }  |->  B ) )
Distinct variable groups:    x, A    x, B
Allowed substitution hints:    V( x)    W( x)

Proof of Theorem fmptsn
StepHypRef Expression
1 fconstmpt 4556 . 2  |-  ( { A }  X.  { B } )  =  ( x  e.  { A }  |->  B )
2 xpsng 5563 . 2  |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( { A }  X.  { B } )  =  { <. A ,  B >. } )
31, 2syl5reqr 2165 1  |-  ( ( A  e.  V  /\  B  e.  W )  ->  { <. A ,  B >. }  =  ( x  e.  { A }  |->  B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    = wceq 1316    e. wcel 1465   {csn 3497   <.cop 3500    |-> cmpt 3959    X. cxp 4507
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 683  ax-5 1408  ax-7 1409  ax-gen 1410  ax-ie1 1454  ax-ie2 1455  ax-8 1467  ax-10 1468  ax-11 1469  ax-i12 1470  ax-bndl 1471  ax-4 1472  ax-14 1477  ax-17 1491  ax-i9 1495  ax-ial 1499  ax-i5r 1500  ax-ext 2099  ax-sep 4016  ax-pow 4068  ax-pr 4101
This theorem depends on definitions:  df-bi 116  df-3an 949  df-tru 1319  df-nf 1422  df-sb 1721  df-eu 1980  df-mo 1981  df-clab 2104  df-cleq 2110  df-clel 2113  df-nfc 2247  df-ral 2398  df-rex 2399  df-reu 2400  df-v 2662  df-un 3045  df-in 3047  df-ss 3054  df-pw 3482  df-sn 3503  df-pr 3504  df-op 3506  df-br 3900  df-opab 3960  df-mpt 3961  df-id 4185  df-xp 4515  df-rel 4516  df-cnv 4517  df-co 4518  df-dm 4519  df-rn 4520  df-fun 5095  df-fn 5096  df-f 5097  df-f1 5098  df-fo 5099  df-f1o 5100
This theorem is referenced by:  fmptap  5578  fmptapd  5579
  Copyright terms: Public domain W3C validator