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

Theorem dmopab3 4747
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 2419 . 2  |-  ( A. x  e.  A  E. y ph  <->  A. x ( x  e.  A  ->  E. y ph ) )
2 pm4.71 386 . . 3  |-  ( ( x  e.  A  ->  E. y ph )  <->  ( x  e.  A  <->  ( x  e.  A  /\  E. y ph ) ) )
32albii 1446 . 2  |-  ( A. x ( x  e.  A  ->  E. y ph )  <->  A. x ( x  e.  A  <->  ( x  e.  A  /\  E. y ph ) ) )
4 dmopab 4745 . . . . 5  |-  dom  { <. x ,  y >.  |  ( x  e.  A  /\  ph ) }  =  { x  |  E. y ( x  e.  A  /\  ph ) }
5 19.42v 1878 . . . . . 6  |-  ( E. y ( x  e.  A  /\  ph )  <->  ( x  e.  A  /\  E. y ph ) )
65abbii 2253 . . . . 5  |-  { x  |  E. y ( x  e.  A  /\  ph ) }  =  {
x  |  ( x  e.  A  /\  E. y ph ) }
74, 6eqtri 2158 . . . 4  |-  dom  { <. x ,  y >.  |  ( x  e.  A  /\  ph ) }  =  { x  |  ( x  e.  A  /\  E. y ph ) }
87eqeq1i 2145 . . 3  |-  ( dom 
{ <. x ,  y
>.  |  ( x  e.  A  /\  ph ) }  =  A  <->  { x  |  ( x  e.  A  /\  E. y ph ) }  =  A )
9 eqcom 2139 . . 3  |-  ( A  =  { x  |  ( x  e.  A  /\  E. y ph ) } 
<->  { x  |  ( x  e.  A  /\  E. y ph ) }  =  A )
10 abeq2 2246 . . 3  |-  ( A  =  { x  |  ( x  e.  A  /\  E. y ph ) } 
<-> 
A. x ( x  e.  A  <->  ( x  e.  A  /\  E. y ph ) ) )
118, 9, 103bitr2ri 208 . 2  |-  ( A. x ( x  e.  A  <->  ( x  e.  A  /\  E. y ph ) )  <->  dom  { <. x ,  y >.  |  ( x  e.  A  /\  ph ) }  =  A )
121, 3, 113bitri 205 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 103    <-> wb 104   A.wal 1329    = wceq 1331   E.wex 1468    e. wcel 1480   {cab 2123   A.wral 2414   {copab 3983   dom cdm 4534
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-sep 4041  ax-pow 4093  ax-pr 4126
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ral 2419  df-v 2683  df-un 3070  df-in 3072  df-ss 3079  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-br 3925  df-opab 3985  df-dm 4544
This theorem is referenced by:  dmxpm  4754  dmxpid  4755  fnopabg  5241  acfun  7056  ccfunen  7072
  Copyright terms: Public domain W3C validator