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

Theorem df2nd2 6287
Description: An alternate possible definition of the  2nd function. (Contributed by NM, 10-Aug-2006.) (Revised by Mario Carneiro, 31-Aug-2015.)
Assertion
Ref Expression
df2nd2  |-  { <. <.
x ,  y >. ,  z >.  |  z  =  y }  =  ( 2nd  |`  ( _V  X.  _V ) )
Distinct variable group:    x, y, z

Proof of Theorem df2nd2
Dummy variable  w is distinct from all other variables.
StepHypRef Expression
1 fo2nd 6225 . . . . 5  |-  2nd : _V -onto-> _V
2 fofn 5485 . . . . 5  |-  ( 2nd
: _V -onto-> _V  ->  2nd 
Fn  _V )
3 dffn5im 5609 . . . . 5  |-  ( 2nd 
Fn  _V  ->  2nd  =  ( w  e.  _V  |->  ( 2nd `  w ) ) )
41, 2, 3mp2b 8 . . . 4  |-  2nd  =  ( w  e.  _V  |->  ( 2nd `  w ) )
5 mptv 4131 . . . 4  |-  ( w  e.  _V  |->  ( 2nd `  w ) )  =  { <. w ,  z
>.  |  z  =  ( 2nd `  w ) }
64, 5eqtri 2217 . . 3  |-  2nd  =  { <. w ,  z
>.  |  z  =  ( 2nd `  w ) }
76reseq1i 4943 . 2  |-  ( 2nd  |`  ( _V  X.  _V ) )  =  ( { <. w ,  z
>.  |  z  =  ( 2nd `  w ) }  |`  ( _V  X.  _V ) )
8 resopab 4991 . 2  |-  ( {
<. w ,  z >.  |  z  =  ( 2nd `  w ) }  |`  ( _V  X.  _V ) )  =  { <. w ,  z >.  |  ( w  e.  ( _V  X.  _V )  /\  z  =  ( 2nd `  w ) ) }
9 vex 2766 . . . . 5  |-  x  e. 
_V
10 vex 2766 . . . . 5  |-  y  e. 
_V
119, 10op2ndd 6216 . . . 4  |-  ( w  =  <. x ,  y
>.  ->  ( 2nd `  w
)  =  y )
1211eqeq2d 2208 . . 3  |-  ( w  =  <. x ,  y
>.  ->  ( z  =  ( 2nd `  w
)  <->  z  =  y ) )
1312dfoprab3 6258 . 2  |-  { <. w ,  z >.  |  ( w  e.  ( _V 
X.  _V )  /\  z  =  ( 2nd `  w
) ) }  =  { <. <. x ,  y
>. ,  z >.  |  z  =  y }
147, 8, 133eqtrri 2222 1  |-  { <. <.
x ,  y >. ,  z >.  |  z  =  y }  =  ( 2nd  |`  ( _V  X.  _V ) )
Colors of variables: wff set class
Syntax hints:    /\ wa 104    = wceq 1364    e. wcel 2167   _Vcvv 2763   <.cop 3626   {copab 4094    |-> cmpt 4095    X. cxp 4662    |` cres 4666    Fn wfn 5254   -onto->wfo 5257   ` cfv 5259   {coprab 5926   2ndc2nd 6206
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-v 2765  df-sbc 2990  df-un 3161  df-in 3163  df-ss 3170  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-fo 5265  df-fv 5267  df-oprab 5929  df-1st 6207  df-2nd 6208
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator