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

Theorem elopabi 5821
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 4464 . . . 4  |-  Rel  { <. x ,  y >.  |  ph }
2 1st2nd 5807 . . . 4  |-  ( ( Rel  { <. x ,  y >.  |  ph }  /\  A  e.  { <. x ,  y >.  |  ph } )  ->  A  =  <. ( 1st `  A ) ,  ( 2nd `  A )
>. )
31, 2mpan 400 . . 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 2115 . 2  |-  ( A  e.  { <. x ,  y >.  |  ph }  ->  <. ( 1st `  A
) ,  ( 2nd `  A ) >.  e.  { <. x ,  y >.  |  ph } )
6 1stexg 5794 . . 3  |-  ( A  e.  { <. x ,  y >.  |  ph }  ->  ( 1st `  A
)  e.  _V )
7 2ndexg 5795 . . 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 4005 . . 3  |-  ( ( ( 1st `  A
)  e.  _V  /\  ( 2nd `  A )  e.  _V )  -> 
( <. ( 1st `  A
) ,  ( 2nd `  A ) >.  e.  { <. x ,  y >.  |  ph }  <->  ch )
)
116, 7, 10syl2anc 391 . 2  |-  ( A  e.  { <. x ,  y >.  |  ph }  ->  ( <. ( 1st `  A ) ,  ( 2nd `  A
) >.  e.  { <. x ,  y >.  |  ph } 
<->  ch ) )
125, 11mpbid 135 1  |-  ( A  e.  { <. x ,  y >.  |  ph }  ->  ch )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 98    = wceq 1243    e. wcel 1393   _Vcvv 2557   <.cop 3378   {copab 3817   Rel wrel 4350   ` cfv 4902   1stc1st 5765   2ndc2nd 5766
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-13 1404  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-sep 3875  ax-pow 3927  ax-pr 3944  ax-un 4170
This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-rex 2312  df-v 2559  df-sbc 2765  df-un 2922  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-br 3765  df-opab 3819  df-mpt 3820  df-id 4030  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-rn 4356  df-iota 4867  df-fun 4904  df-fn 4905  df-f 4906  df-fo 4908  df-fv 4910  df-1st 5767  df-2nd 5768
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator