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

Theorem df1st2 6124
Description: An alternate possible definition of the  1st function. (Contributed by NM, 14-Oct-2004.) (Revised by Mario Carneiro, 31-Aug-2015.)
Assertion
Ref Expression
df1st2  |-  { <. <.
x ,  y >. ,  z >.  |  z  =  x }  =  ( 1st  |`  ( _V  X.  _V ) )
Distinct variable group:    x, y, z

Proof of Theorem df1st2
Dummy variable  w is distinct from all other variables.
StepHypRef Expression
1 fo1st 6063 . . . . 5  |-  1st : _V -onto-> _V
2 fofn 5355 . . . . 5  |-  ( 1st
: _V -onto-> _V  ->  1st 
Fn  _V )
3 dffn5im 5475 . . . . 5  |-  ( 1st 
Fn  _V  ->  1st  =  ( w  e.  _V  |->  ( 1st `  w ) ) )
41, 2, 3mp2b 8 . . . 4  |-  1st  =  ( w  e.  _V  |->  ( 1st `  w ) )
5 mptv 4033 . . . 4  |-  ( w  e.  _V  |->  ( 1st `  w ) )  =  { <. w ,  z
>.  |  z  =  ( 1st `  w ) }
64, 5eqtri 2161 . . 3  |-  1st  =  { <. w ,  z
>.  |  z  =  ( 1st `  w ) }
76reseq1i 4823 . 2  |-  ( 1st  |`  ( _V  X.  _V ) )  =  ( { <. w ,  z
>.  |  z  =  ( 1st `  w ) }  |`  ( _V  X.  _V ) )
8 resopab 4871 . 2  |-  ( {
<. w ,  z >.  |  z  =  ( 1st `  w ) }  |`  ( _V  X.  _V ) )  =  { <. w ,  z >.  |  ( w  e.  ( _V  X.  _V )  /\  z  =  ( 1st `  w ) ) }
9 vex 2692 . . . . 5  |-  x  e. 
_V
10 vex 2692 . . . . 5  |-  y  e. 
_V
119, 10op1std 6054 . . . 4  |-  ( w  =  <. x ,  y
>.  ->  ( 1st `  w
)  =  x )
1211eqeq2d 2152 . . 3  |-  ( w  =  <. x ,  y
>.  ->  ( z  =  ( 1st `  w
)  <->  z  =  x ) )
1312dfoprab3 6097 . 2  |-  { <. w ,  z >.  |  ( w  e.  ( _V 
X.  _V )  /\  z  =  ( 1st `  w
) ) }  =  { <. <. x ,  y
>. ,  z >.  |  z  =  x }
147, 8, 133eqtrri 2166 1  |-  { <. <.
x ,  y >. ,  z >.  |  z  =  x }  =  ( 1st  |`  ( _V  X.  _V ) )
Colors of variables: wff set class
Syntax hints:    /\ wa 103    = wceq 1332    e. wcel 1481   _Vcvv 2689   <.cop 3535   {copab 3996    |-> cmpt 3997    X. cxp 4545    |` cres 4549    Fn wfn 5126   -onto->wfo 5129   ` cfv 5131   {coprab 5783   1stc1st 6044
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 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-13 1492  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-sep 4054  ax-pow 4106  ax-pr 4139  ax-un 4363
This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ral 2422  df-rex 2423  df-v 2691  df-sbc 2914  df-un 3080  df-in 3082  df-ss 3089  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-uni 3745  df-br 3938  df-opab 3998  df-mpt 3999  df-id 4223  df-xp 4553  df-rel 4554  df-cnv 4555  df-co 4556  df-dm 4557  df-rn 4558  df-res 4559  df-iota 5096  df-fun 5133  df-fn 5134  df-f 5135  df-fo 5137  df-fv 5139  df-oprab 5786  df-1st 6046  df-2nd 6047
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator