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

Theorem 2ndval2 6390
Description: Alternate value of the function that extracts the second member of an ordered pair. Definition 5.13 (ii) of [Monk1] p. 52. (Contributed by NM, 18-Aug-2006.)
Assertion
Ref Expression
2ndval2  |-  ( A  e.  ( _V  X.  _V )  ->  ( 2nd `  A )  =  |^| |^|
|^| `' { A } )

Proof of Theorem 2ndval2
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elvv 4837 . 2  |-  ( A  e.  ( _V  X.  _V )  <->  E. x E. y  A  =  <. x ,  y >. )
2 vex 2824 . . . . . 6  |-  x  e. 
_V
3 vex 2824 . . . . . 6  |-  y  e. 
_V
42, 3op2nd 6381 . . . . 5  |-  ( 2nd `  <. x ,  y
>. )  =  y
52, 3op2ndb 5271 . . . . 5  |-  |^| |^| |^| `' { <. x ,  y
>. }  =  y
64, 5eqtr4i 2262 . . . 4  |-  ( 2nd `  <. x ,  y
>. )  =  |^| |^|
|^| `' { <. x ,  y
>. }
7 fveq2 5695 . . . 4  |-  ( A  =  <. x ,  y
>.  ->  ( 2nd `  A
)  =  ( 2nd `  <. x ,  y
>. ) )
8 sneq 3720 . . . . . . . 8  |-  ( A  =  <. x ,  y
>.  ->  { A }  =  { <. x ,  y
>. } )
98cnveqd 4956 . . . . . . 7  |-  ( A  =  <. x ,  y
>.  ->  `' { A }  =  `' { <. x ,  y >. } )
109inteqd 3975 . . . . . 6  |-  ( A  =  <. x ,  y
>.  ->  |^| `' { A }  =  |^| `' { <. x ,  y >. } )
1110inteqd 3975 . . . . 5  |-  ( A  =  <. x ,  y
>.  ->  |^| |^| `' { A }  =  |^| |^| `' { <. x ,  y
>. } )
1211inteqd 3975 . . . 4  |-  ( A  =  <. x ,  y
>.  ->  |^| |^| |^| `' { A }  =  |^| |^| |^| `' { <. x ,  y
>. } )
136, 7, 123eqtr4a 2297 . . 3  |-  ( A  =  <. x ,  y
>.  ->  ( 2nd `  A
)  =  |^| |^| |^| `' { A } )
1413exlimivv 1952 . 2  |-  ( E. x E. y  A  =  <. x ,  y
>.  ->  ( 2nd `  A
)  =  |^| |^| |^| `' { A } )
151, 14sylbi 121 1  |-  ( A  e.  ( _V  X.  _V )  ->  ( 2nd `  A )  =  |^| |^|
|^| `' { A } )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    = wceq 1402   E.wex 1545    e. wcel 2209   _Vcvv 2821   {csn 3709   <.cop 3712   |^|cint 3970    X. cxp 4772   `'ccnv 4773   ` cfv 5377   2ndc2nd 6373
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-iota 5337  df-fun 5379  df-fv 5385  df-2nd 6375
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator