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

Theorem dmopab3 4905
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 2490 . 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 1494 . 2  |-  ( A. x ( x  e.  A  ->  E. y ph )  <->  A. x ( x  e.  A  <->  ( x  e.  A  /\  E. y ph ) ) )
4 dmopab 4903 . . . . 5  |-  dom  { <. x ,  y >.  |  ( x  e.  A  /\  ph ) }  =  { x  |  E. y ( x  e.  A  /\  ph ) }
5 19.42v 1931 . . . . . 6  |-  ( E. y ( x  e.  A  /\  ph )  <->  ( x  e.  A  /\  E. y ph ) )
65abbii 2322 . . . . 5  |-  { x  |  E. y ( x  e.  A  /\  ph ) }  =  {
x  |  ( x  e.  A  /\  E. y ph ) }
74, 6eqtri 2227 . . . 4  |-  dom  { <. x ,  y >.  |  ( x  e.  A  /\  ph ) }  =  { x  |  ( x  e.  A  /\  E. y ph ) }
87eqeq1i 2214 . . 3  |-  ( dom 
{ <. x ,  y
>.  |  ( x  e.  A  /\  ph ) }  =  A  <->  { x  |  ( x  e.  A  /\  E. y ph ) }  =  A )
9 eqcom 2208 . . 3  |-  ( A  =  { x  |  ( x  e.  A  /\  E. y ph ) } 
<->  { x  |  ( x  e.  A  /\  E. y ph ) }  =  A )
10 abeq2 2315 . . 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 1371    = wceq 1373   E.wex 1516    e. wcel 2177   {cab 2192   A.wral 2485   {copab 4115   dom cdm 4688
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 4173  ax-pow 4229  ax-pr 4264
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-ral 2490  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 4055  df-opab 4117  df-dm 4698
This theorem is referenced by:  dmxpm  4912  dmxpid  4913  fnopabg  5414  acfun  7345  ccfunen  7406
  Copyright terms: Public domain W3C validator