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

Theorem 2ndval2 6328
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 4794 . 2  |-  ( A  e.  ( _V  X.  _V )  <->  E. x E. y  A  =  <. x ,  y >. )
2 vex 2806 . . . . . 6  |-  x  e. 
_V
3 vex 2806 . . . . . 6  |-  y  e. 
_V
42, 3op2nd 6319 . . . . 5  |-  ( 2nd `  <. x ,  y
>. )  =  y
52, 3op2ndb 5227 . . . . 5  |-  |^| |^| |^| `' { <. x ,  y
>. }  =  y
64, 5eqtr4i 2255 . . . 4  |-  ( 2nd `  <. x ,  y
>. )  =  |^| |^|
|^| `' { <. x ,  y
>. }
7 fveq2 5648 . . . 4  |-  ( A  =  <. x ,  y
>.  ->  ( 2nd `  A
)  =  ( 2nd `  <. x ,  y
>. ) )
8 sneq 3684 . . . . . . . 8  |-  ( A  =  <. x ,  y
>.  ->  { A }  =  { <. x ,  y
>. } )
98cnveqd 4912 . . . . . . 7  |-  ( A  =  <. x ,  y
>.  ->  `' { A }  =  `' { <. x ,  y >. } )
109inteqd 3938 . . . . . 6  |-  ( A  =  <. x ,  y
>.  ->  |^| `' { A }  =  |^| `' { <. x ,  y >. } )
1110inteqd 3938 . . . . 5  |-  ( A  =  <. x ,  y
>.  ->  |^| |^| `' { A }  =  |^| |^| `' { <. x ,  y
>. } )
1211inteqd 3938 . . . 4  |-  ( A  =  <. x ,  y
>.  ->  |^| |^| |^| `' { A }  =  |^| |^| |^| `' { <. x ,  y
>. } )
136, 7, 123eqtr4a 2290 . . 3  |-  ( A  =  <. x ,  y
>.  ->  ( 2nd `  A
)  =  |^| |^| |^| `' { A } )
1413exlimivv 1945 . 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
Syntax hints:    -> wi 4    = wceq 1398   E.wex 1541    e. wcel 2202   _Vcvv 2803   {csn 3673   <.cop 3676   |^|cint 3933    X. cxp 4729   `'ccnv 4730   ` cfv 5333   2ndc2nd 6311
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-sbc 3033  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-iota 5293  df-fun 5335  df-fv 5341  df-2nd 6313
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator