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

Theorem fvsng 5714
Description: The value of a singleton of an ordered pair is the second member. (Contributed by NM, 26-Oct-2012.)
Assertion
Ref Expression
fvsng  |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( { <. A ,  B >. } `  A
)  =  B )

Proof of Theorem fvsng
Dummy variables  a 
b are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 opeq1 3796 . . . . 5  |-  ( a  =  A  ->  <. a ,  b >.  =  <. A ,  b >. )
21sneqd 3653 . . . 4  |-  ( a  =  A  ->  { <. a ,  b >. }  =  { <. A ,  b
>. } )
3 id 19 . . . 4  |-  ( a  =  A  ->  a  =  A )
42, 3fveq12d 5531 . . 3  |-  ( a  =  A  ->  ( { <. a ,  b
>. } `  a )  =  ( { <. A ,  b >. } `  A ) )
54eqeq1d 2291 . 2  |-  ( a  =  A  ->  (
( { <. a ,  b >. } `  a )  =  b  <-> 
( { <. A , 
b >. } `  A
)  =  b ) )
6 opeq2 3797 . . . . 5  |-  ( b  =  B  ->  <. A , 
b >.  =  <. A ,  B >. )
76sneqd 3653 . . . 4  |-  ( b  =  B  ->  { <. A ,  b >. }  =  { <. A ,  B >. } )
87fveq1d 5527 . . 3  |-  ( b  =  B  ->  ( { <. A ,  b
>. } `  A )  =  ( { <. A ,  B >. } `  A ) )
9 id 19 . . 3  |-  ( b  =  B  ->  b  =  B )
108, 9eqeq12d 2297 . 2  |-  ( b  =  B  ->  (
( { <. A , 
b >. } `  A
)  =  b  <->  ( { <. A ,  B >. } `
 A )  =  B ) )
11 vex 2791 . . 3  |-  a  e. 
_V
12 vex 2791 . . 3  |-  b  e. 
_V
1311, 12fvsn 5713 . 2  |-  ( {
<. a ,  b >. } `  a )  =  b
145, 10, 13vtocl2g 2847 1  |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( { <. A ,  B >. } `  A
)  =  B )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 358    = wceq 1623    e. wcel 1684   {csn 3640   <.cop 3643   ` cfv 5255
This theorem is referenced by:  fsnunfv  5720  axdc3lem4  8079  fseq1p1m1  10857  s1fv  11446  sumsn  12213  seq1st  12741  vdwlem8  13035  setsid  13187  xpsc0  13462  xpsc1  13463  gsumws1  14462  dprdsn  15271  frgpcyg  16527  pt1hmeo  17497  cvmliftlem7  23822  cvmliftlem13  23827  vdgr1d  23894  vdgr1b  23895  vdgr1a  23897  eupap1  23900  cbicp  25166  enfixsn  27257  sumsnd  27697
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-sep 4141  ax-nul 4149  ax-pr 4214
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-eu 2147  df-mo 2148  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-ral 2548  df-rex 2549  df-rab 2552  df-v 2790  df-sbc 2992  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3456  df-if 3566  df-sn 3646  df-pr 3647  df-op 3649  df-uni 3828  df-br 4024  df-opab 4078  df-id 4309  df-xp 4695  df-rel 4696  df-cnv 4697  df-co 4698  df-dm 4699  df-iota 5219  df-fun 5257  df-fv 5263
  Copyright terms: Public domain W3C validator