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

Theorem dfoprab4 6426
Description: Operation class abstraction expressed without existential quantifiers. (Contributed by NM, 3-Sep-2007.) (Revised by Mario Carneiro, 31-Aug-2015.)
Hypothesis
Ref Expression
dfoprab4.1  |-  ( w  =  <. x ,  y
>.  ->  ( ph  <->  ps )
)
Assertion
Ref Expression
dfoprab4  |-  { <. w ,  z >.  |  ( w  e.  ( A  X.  B )  /\  ph ) }  =  { <. <. x ,  y
>. ,  z >.  |  ( ( x  e.  A  /\  y  e.  B )  /\  ps ) }
Distinct variable groups:    x, w, y, A    w, B, x, y    ph, x, y    ps, w    z, w, x, y
Allowed substitution hints:    ph( z,  w)    ps( x,  y,  z)    A( z)    B( z)

Proof of Theorem dfoprab4
StepHypRef Expression
1 xpss 4883 . . . . . 6  |-  ( A  X.  B )  C_  ( _V  X.  _V )
21sseli 3244 . . . . 5  |-  ( w  e.  ( A  X.  B )  ->  w  e.  ( _V  X.  _V ) )
32adantr 276 . . . 4  |-  ( ( w  e.  ( A  X.  B )  /\  ph )  ->  w  e.  ( _V  X.  _V )
)
43pm4.71ri 396 . . 3  |-  ( ( w  e.  ( A  X.  B )  /\  ph )  <->  ( w  e.  ( _V  X.  _V )  /\  ( w  e.  ( A  X.  B
)  /\  ph ) ) )
54opabbii 4198 . 2  |-  { <. w ,  z >.  |  ( w  e.  ( A  X.  B )  /\  ph ) }  =  { <. w ,  z >.  |  ( w  e.  ( _V  X.  _V )  /\  ( w  e.  ( A  X.  B
)  /\  ph ) ) }
6 eleq1 2301 . . . . 5  |-  ( w  =  <. x ,  y
>.  ->  ( w  e.  ( A  X.  B
)  <->  <. x ,  y
>.  e.  ( A  X.  B ) ) )
7 opelxp 4804 . . . . 5  |-  ( <.
x ,  y >.  e.  ( A  X.  B
)  <->  ( x  e.  A  /\  y  e.  B ) )
86, 7bitrdi 196 . . . 4  |-  ( w  =  <. x ,  y
>.  ->  ( w  e.  ( A  X.  B
)  <->  ( x  e.  A  /\  y  e.  B ) ) )
9 dfoprab4.1 . . . 4  |-  ( w  =  <. x ,  y
>.  ->  ( ph  <->  ps )
)
108, 9anbi12d 477 . . 3  |-  ( w  =  <. x ,  y
>.  ->  ( ( w  e.  ( A  X.  B )  /\  ph ) 
<->  ( ( x  e.  A  /\  y  e.  B )  /\  ps ) ) )
1110dfoprab3 6425 . 2  |-  { <. w ,  z >.  |  ( w  e.  ( _V 
X.  _V )  /\  (
w  e.  ( A  X.  B )  /\  ph ) ) }  =  { <. <. x ,  y
>. ,  z >.  |  ( ( x  e.  A  /\  y  e.  B )  /\  ps ) }
125, 11eqtri 2259 1  |-  { <. w ,  z >.  |  ( w  e.  ( A  X.  B )  /\  ph ) }  =  { <. <. x ,  y
>. ,  z >.  |  ( ( x  e.  A  /\  y  e.  B )  /\  ps ) }
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209   _Vcvv 2821   <.cop 3712   {copab 4191    X. cxp 4772   {coprab 6086
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-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-fn 5380  df-f 5381  df-fo 5383  df-fv 5385  df-oprab 6089  df-1st 6374  df-2nd 6375
This theorem is used by:  dfoprab4f  6427  dfxp3  6430
  Copyright terms: Public domain W3C validator