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

Theorem eloprabi 6263
Description: A consequence of membership in an operation class abstraction, using ordered pair extractors. (Contributed by NM, 6-Nov-2006.) (Revised by David Abernethy, 19-Jun-2012.)
Hypotheses
Ref Expression
eloprabi.1  |-  ( x  =  ( 1st `  ( 1st `  A ) )  ->  ( ph  <->  ps )
)
eloprabi.2  |-  ( y  =  ( 2nd `  ( 1st `  A ) )  ->  ( ps  <->  ch )
)
eloprabi.3  |-  ( z  =  ( 2nd `  A
)  ->  ( ch  <->  th ) )
Assertion
Ref Expression
eloprabi  |-  ( A  e.  { <. <. x ,  y >. ,  z
>.  |  ph }  ->  th )
Distinct variable groups:    x, y, z, A    th, x, y, z
Allowed substitution hints:    ph( x, y, z)    ps( x, y, z)    ch( x, y, z)

Proof of Theorem eloprabi
Dummy variable  w is distinct from all other variables.
StepHypRef Expression
1 eqeq1 2203 . . . . . 6  |-  ( w  =  A  ->  (
w  =  <. <. x ,  y >. ,  z
>. 
<->  A  =  <. <. x ,  y >. ,  z
>. ) )
21anbi1d 465 . . . . 5  |-  ( w  =  A  ->  (
( w  =  <. <.
x ,  y >. ,  z >.  /\  ph ) 
<->  ( A  =  <. <.
x ,  y >. ,  z >.  /\  ph ) ) )
323exbidv 1883 . . . 4  |-  ( w  =  A  ->  ( E. x E. y E. z ( w  = 
<. <. x ,  y
>. ,  z >.  /\ 
ph )  <->  E. x E. y E. z ( A  =  <. <. x ,  y >. ,  z
>.  /\  ph ) ) )
4 df-oprab 5929 . . . 4  |-  { <. <.
x ,  y >. ,  z >.  |  ph }  =  { w  |  E. x E. y E. z ( w  = 
<. <. x ,  y
>. ,  z >.  /\ 
ph ) }
53, 4elab2g 2911 . . 3  |-  ( A  e.  { <. <. x ,  y >. ,  z
>.  |  ph }  ->  ( A  e.  { <. <.
x ,  y >. ,  z >.  |  ph } 
<->  E. x E. y E. z ( A  = 
<. <. x ,  y
>. ,  z >.  /\ 
ph ) ) )
65ibi 176 . 2  |-  ( A  e.  { <. <. x ,  y >. ,  z
>.  |  ph }  ->  E. x E. y E. z ( A  = 
<. <. x ,  y
>. ,  z >.  /\ 
ph ) )
7 vex 2766 . . . . . . . . . . . 12  |-  x  e. 
_V
8 vex 2766 . . . . . . . . . . . 12  |-  y  e. 
_V
97, 8opex 4263 . . . . . . . . . . 11  |-  <. x ,  y >.  e.  _V
10 vex 2766 . . . . . . . . . . 11  |-  z  e. 
_V
119, 10op1std 6215 . . . . . . . . . 10  |-  ( A  =  <. <. x ,  y
>. ,  z >.  -> 
( 1st `  A
)  =  <. x ,  y >. )
1211fveq2d 5565 . . . . . . . . 9  |-  ( A  =  <. <. x ,  y
>. ,  z >.  -> 
( 1st `  ( 1st `  A ) )  =  ( 1st `  <. x ,  y >. )
)
137, 8op1st 6213 . . . . . . . . 9  |-  ( 1st `  <. x ,  y
>. )  =  x
1412, 13eqtr2di 2246 . . . . . . . 8  |-  ( A  =  <. <. x ,  y
>. ,  z >.  ->  x  =  ( 1st `  ( 1st `  A
) ) )
15 eloprabi.1 . . . . . . . 8  |-  ( x  =  ( 1st `  ( 1st `  A ) )  ->  ( ph  <->  ps )
)
1614, 15syl 14 . . . . . . 7  |-  ( A  =  <. <. x ,  y
>. ,  z >.  -> 
( ph  <->  ps ) )
1711fveq2d 5565 . . . . . . . . 9  |-  ( A  =  <. <. x ,  y
>. ,  z >.  -> 
( 2nd `  ( 1st `  A ) )  =  ( 2nd `  <. x ,  y >. )
)
187, 8op2nd 6214 . . . . . . . . 9  |-  ( 2nd `  <. x ,  y
>. )  =  y
1917, 18eqtr2di 2246 . . . . . . . 8  |-  ( A  =  <. <. x ,  y
>. ,  z >.  -> 
y  =  ( 2nd `  ( 1st `  A
) ) )
20 eloprabi.2 . . . . . . . 8  |-  ( y  =  ( 2nd `  ( 1st `  A ) )  ->  ( ps  <->  ch )
)
2119, 20syl 14 . . . . . . 7  |-  ( A  =  <. <. x ,  y
>. ,  z >.  -> 
( ps  <->  ch )
)
229, 10op2ndd 6216 . . . . . . . . 9  |-  ( A  =  <. <. x ,  y
>. ,  z >.  -> 
( 2nd `  A
)  =  z )
2322eqcomd 2202 . . . . . . . 8  |-  ( A  =  <. <. x ,  y
>. ,  z >.  -> 
z  =  ( 2nd `  A ) )
24 eloprabi.3 . . . . . . . 8  |-  ( z  =  ( 2nd `  A
)  ->  ( ch  <->  th ) )
2523, 24syl 14 . . . . . . 7  |-  ( A  =  <. <. x ,  y
>. ,  z >.  -> 
( ch  <->  th )
)
2616, 21, 253bitrd 214 . . . . . 6  |-  ( A  =  <. <. x ,  y
>. ,  z >.  -> 
( ph  <->  th ) )
2726biimpa 296 . . . . 5  |-  ( ( A  =  <. <. x ,  y >. ,  z
>.  /\  ph )  ->  th )
2827exlimiv 1612 . . . 4  |-  ( E. z ( A  = 
<. <. x ,  y
>. ,  z >.  /\ 
ph )  ->  th )
2928exlimiv 1612 . . 3  |-  ( E. y E. z ( A  =  <. <. x ,  y >. ,  z
>.  /\  ph )  ->  th )
3029exlimiv 1612 . 2  |-  ( E. x E. y E. z ( A  = 
<. <. x ,  y
>. ,  z >.  /\ 
ph )  ->  th )
316, 30syl 14 1  |-  ( A  e.  { <. <. x ,  y >. ,  z
>.  |  ph }  ->  th )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1364   E.wex 1506    e. wcel 2167   <.cop 3626   ` cfv 5259   {coprab 5926   1stc1st 6205   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-iota 5220  df-fun 5261  df-fv 5267  df-oprab 5929  df-1st 6207  df-2nd 6208
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator