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

Theorem dmopabss 4888
Description: Upper bound for the domain of a restricted class of ordered pairs. (Contributed by NM, 31-Jan-2004.)
Assertion
Ref Expression
dmopabss  |-  dom  { <. x ,  y >.  |  ( x  e.  A  /\  ph ) }  C_  A
Distinct variable group:    x, y, A
Allowed substitution hints:    ph( x, y)

Proof of Theorem dmopabss
StepHypRef Expression
1 dmopab 4887 . 2  |-  dom  { <. x ,  y >.  |  ( x  e.  A  /\  ph ) }  =  { x  |  E. y ( x  e.  A  /\  ph ) }
2 19.42v 1929 . . . 4  |-  ( E. y ( x  e.  A  /\  ph )  <->  ( x  e.  A  /\  E. y ph ) )
32abbii 2320 . . 3  |-  { x  |  E. y ( x  e.  A  /\  ph ) }  =  {
x  |  ( x  e.  A  /\  E. y ph ) }
4 ssab2 3276 . . 3  |-  { x  |  ( x  e.  A  /\  E. y ph ) }  C_  A
53, 4eqsstri 3224 . 2  |-  { x  |  E. y ( x  e.  A  /\  ph ) }  C_  A
61, 5eqsstri 3224 1  |-  dom  { <. x ,  y >.  |  ( x  e.  A  /\  ph ) }  C_  A
Colors of variables: wff set class
Syntax hints:    /\ wa 104   E.wex 1514    e. wcel 2175   {cab 2190    C_ wss 3165   {copab 4103   dom cdm 4673
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 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-14 2178  ax-ext 2186  ax-sep 4161  ax-pow 4217  ax-pr 4252
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1375  df-nf 1483  df-sb 1785  df-eu 2056  df-mo 2057  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-v 2773  df-un 3169  df-in 3171  df-ss 3178  df-pw 3617  df-sn 3638  df-pr 3639  df-op 3641  df-br 4044  df-opab 4105  df-dm 4683
This theorem is referenced by:  opabex  5798
  Copyright terms: Public domain W3C validator