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

Theorem elopabi 6369
Description: A consequence of membership in an ordered-pair class abstraction, using ordered pair extractors. (Contributed by NM, 29-Aug-2006.)
Hypotheses
Ref Expression
elopabi.1  |-  ( x  =  ( 1st `  A
)  ->  ( ph  <->  ps ) )
elopabi.2  |-  ( y  =  ( 2nd `  A
)  ->  ( ps  <->  ch ) )
Assertion
Ref Expression
elopabi  |-  ( A  e.  { <. x ,  y >.  |  ph }  ->  ch )
Distinct variable groups:    x, y, A    ch, x, y
Allowed substitution hints:    ph( x, y)    ps( x, y)

Proof of Theorem elopabi
StepHypRef Expression
1 relopab 4862 . . . 4  |-  Rel  { <. x ,  y >.  |  ph }
2 1st2nd 6353 . . . 4  |-  ( ( Rel  { <. x ,  y >.  |  ph }  /\  A  e.  { <. x ,  y >.  |  ph } )  ->  A  =  <. ( 1st `  A ) ,  ( 2nd `  A )
>. )
31, 2mpan 424 . . 3  |-  ( A  e.  { <. x ,  y >.  |  ph }  ->  A  =  <. ( 1st `  A ) ,  ( 2nd `  A
) >. )
4 id 19 . . 3  |-  ( A  e.  { <. x ,  y >.  |  ph }  ->  A  e.  { <. x ,  y >.  |  ph } )
53, 4eqeltrrd 2309 . 2  |-  ( A  e.  { <. x ,  y >.  |  ph }  ->  <. ( 1st `  A
) ,  ( 2nd `  A ) >.  e.  { <. x ,  y >.  |  ph } )
6 1stexg 6339 . . 3  |-  ( A  e.  { <. x ,  y >.  |  ph }  ->  ( 1st `  A
)  e.  _V )
7 2ndexg 6340 . . 3  |-  ( A  e.  { <. x ,  y >.  |  ph }  ->  ( 2nd `  A
)  e.  _V )
8 elopabi.1 . . . 4  |-  ( x  =  ( 1st `  A
)  ->  ( ph  <->  ps ) )
9 elopabi.2 . . . 4  |-  ( y  =  ( 2nd `  A
)  ->  ( ps  <->  ch ) )
108, 9opelopabg 4368 . . 3  |-  ( ( ( 1st `  A
)  e.  _V  /\  ( 2nd `  A )  e.  _V )  -> 
( <. ( 1st `  A
) ,  ( 2nd `  A ) >.  e.  { <. x ,  y >.  |  ph }  <->  ch )
)
116, 7, 10syl2anc 411 . 2  |-  ( A  e.  { <. x ,  y >.  |  ph }  ->  ( <. ( 1st `  A ) ,  ( 2nd `  A
) >.  e.  { <. x ,  y >.  |  ph } 
<->  ch ) )
125, 11mpbid 147 1  |-  ( A  e.  { <. x ,  y >.  |  ph }  ->  ch )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    = wceq 1398    e. wcel 2202   _Vcvv 2803   <.cop 3676   {copab 4154   Rel wrel 4736   ` cfv 5333   1stc1st 6310   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-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-fn 5336  df-f 5337  df-fo 5339  df-fv 5341  df-1st 6312  df-2nd 6313
This theorem is referenced by:  exmidapne  7539  aprcl  8885  aptap  8889
  Copyright terms: Public domain W3C validator