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

Theorem dmopab3 4950
Description: The domain of a restricted class of ordered pairs. (Contributed by NM, 31-Jan-2004.)
Assertion
Ref Expression
dmopab3  |-  ( A. x  e.  A  E. y ph  <->  dom  { <. x ,  y >.  |  ( x  e.  A  /\  ph ) }  =  A )
Distinct variable group:    x, y, A
Allowed substitution hints:    ph( x, y)

Proof of Theorem dmopab3
StepHypRef Expression
1 df-ral 2516 . 2  |-  ( A. x  e.  A  E. y ph  <->  A. x ( x  e.  A  ->  E. y ph ) )
2 pm4.71 389 . . 3  |-  ( ( x  e.  A  ->  E. y ph )  <->  ( x  e.  A  <->  ( x  e.  A  /\  E. y ph ) ) )
32albii 1519 . 2  |-  ( A. x ( x  e.  A  ->  E. y ph )  <->  A. x ( x  e.  A  <->  ( x  e.  A  /\  E. y ph ) ) )
4 dmopab 4948 . . . . 5  |-  dom  { <. x ,  y >.  |  ( x  e.  A  /\  ph ) }  =  { x  |  E. y ( x  e.  A  /\  ph ) }
5 19.42v 1955 . . . . . 6  |-  ( E. y ( x  e.  A  /\  ph )  <->  ( x  e.  A  /\  E. y ph ) )
65abbii 2347 . . . . 5  |-  { x  |  E. y ( x  e.  A  /\  ph ) }  =  {
x  |  ( x  e.  A  /\  E. y ph ) }
74, 6eqtri 2252 . . . 4  |-  dom  { <. x ,  y >.  |  ( x  e.  A  /\  ph ) }  =  { x  |  ( x  e.  A  /\  E. y ph ) }
87eqeq1i 2239 . . 3  |-  ( dom 
{ <. x ,  y
>.  |  ( x  e.  A  /\  ph ) }  =  A  <->  { x  |  ( x  e.  A  /\  E. y ph ) }  =  A )
9 eqcom 2233 . . 3  |-  ( A  =  { x  |  ( x  e.  A  /\  E. y ph ) } 
<->  { x  |  ( x  e.  A  /\  E. y ph ) }  =  A )
10 abeq2 2340 . . 3  |-  ( A  =  { x  |  ( x  e.  A  /\  E. y ph ) } 
<-> 
A. x ( x  e.  A  <->  ( x  e.  A  /\  E. y ph ) ) )
118, 9, 103bitr2ri 209 . 2  |-  ( A. x ( x  e.  A  <->  ( x  e.  A  /\  E. y ph ) )  <->  dom  { <. x ,  y >.  |  ( x  e.  A  /\  ph ) }  =  A )
121, 3, 113bitri 206 1  |-  ( A. x  e.  A  E. y ph  <->  dom  { <. x ,  y >.  |  ( x  e.  A  /\  ph ) }  =  A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105   A.wal 1396    = wceq 1398   E.wex 1541    e. wcel 2202   {cab 2217   A.wral 2511   {copab 4154   dom cdm 4731
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-v 2805  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-br 4094  df-opab 4156  df-dm 4741
This theorem is referenced by:  dmxpm  4958  dmxpid  4959  fnopabg  5463  opabn1stprc  6367  acfun  7465  ccfunen  7526
  Copyright terms: Public domain W3C validator