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

Theorem dmopabss 4899
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 4898 . 2  |-  dom  { <. x ,  y >.  |  ( x  e.  A  /\  ph ) }  =  { x  |  E. y ( x  e.  A  /\  ph ) }
2 19.42v 1931 . . . 4  |-  ( E. y ( x  e.  A  /\  ph )  <->  ( x  e.  A  /\  E. y ph ) )
32abbii 2322 . . 3  |-  { x  |  E. y ( x  e.  A  /\  ph ) }  =  {
x  |  ( x  e.  A  /\  E. y ph ) }
4 ssab2 3281 . . 3  |-  { x  |  ( x  e.  A  /\  E. y ph ) }  C_  A
53, 4eqsstri 3229 . 2  |-  { x  |  E. y ( x  e.  A  /\  ph ) }  C_  A
61, 5eqsstri 3229 1  |-  dom  { <. x ,  y >.  |  ( x  e.  A  /\  ph ) }  C_  A
Colors of variables: wff set class
Syntax hints:    /\ wa 104   E.wex 1516    e. wcel 2177   {cab 2192    C_ wss 3170   {copab 4112   dom cdm 4683
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-14 2180  ax-ext 2188  ax-sep 4170  ax-pow 4226  ax-pr 4261
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-v 2775  df-un 3174  df-in 3176  df-ss 3183  df-pw 3623  df-sn 3644  df-pr 3645  df-op 3647  df-br 4052  df-opab 4114  df-dm 4693
This theorem is referenced by:  opabex  5821
  Copyright terms: Public domain W3C validator