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

Theorem dmopabss 4547
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 4546 . 2  |-  dom  { <. x ,  y >.  |  ( x  e.  A  /\  ph ) }  =  { x  |  E. y ( x  e.  A  /\  ph ) }
2 19.42v 1786 . . . 4  |-  ( E. y ( x  e.  A  /\  ph )  <->  ( x  e.  A  /\  E. y ph ) )
32abbii 2153 . . 3  |-  { x  |  E. y ( x  e.  A  /\  ph ) }  =  {
x  |  ( x  e.  A  /\  E. y ph ) }
4 ssab2 3024 . . 3  |-  { x  |  ( x  e.  A  /\  E. y ph ) }  C_  A
53, 4eqsstri 2975 . 2  |-  { x  |  E. y ( x  e.  A  /\  ph ) }  C_  A
61, 5eqsstri 2975 1  |-  dom  { <. x ,  y >.  |  ( x  e.  A  /\  ph ) }  C_  A
Colors of variables: wff set class
Syntax hints:    /\ wa 97   E.wex 1381    e. wcel 1393   {cab 2026    C_ wss 2917   {copab 3817   dom cdm 4345
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-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
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-v 2559  df-un 2922  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-br 3765  df-opab 3819  df-dm 4355
This theorem is referenced by:  opabex  5385
  Copyright terms: Public domain W3C validator