MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  dmoprab Structured version   Unicode version

Theorem dmoprab 6363
Description: The domain of an operation class abstraction. (Contributed by NM, 17-Mar-1995.) (Revised by David Abernethy, 19-Jun-2012.)
Assertion
Ref Expression
dmoprab  |-  dom  { <. <. x ,  y
>. ,  z >.  | 
ph }  =  { <. x ,  y >.  |  E. z ph }
Distinct variable groups:    x, z    y, z
Allowed substitution hints:    ph( x, y, z)

Proof of Theorem dmoprab
Dummy variable  w is distinct from all other variables.
StepHypRef Expression
1 dfoprab2 6323 . . 3  |-  { <. <.
x ,  y >. ,  z >.  |  ph }  =  { <. w ,  z >.  |  E. x E. y ( w  =  <. x ,  y
>.  /\  ph ) }
21dmeqi 5024 . 2  |-  dom  { <. <. x ,  y
>. ,  z >.  | 
ph }  =  dom  {
<. w ,  z >.  |  E. x E. y
( w  =  <. x ,  y >.  /\  ph ) }
3 dmopab 5033 . 2  |-  dom  { <. w ,  z >.  |  E. x E. y
( w  =  <. x ,  y >.  /\  ph ) }  =  {
w  |  E. z E. x E. y ( w  =  <. x ,  y >.  /\  ph ) }
4 exrot3 1876 . . . . 5  |-  ( E. z E. x E. y ( w  = 
<. x ,  y >.  /\  ph )  <->  E. x E. y E. z ( w  =  <. x ,  y >.  /\  ph ) )
5 19.42v 1799 . . . . . 6  |-  ( E. z ( w  = 
<. x ,  y >.  /\  ph )  <->  ( w  =  <. x ,  y
>.  /\  E. z ph ) )
652exbii 1689 . . . . 5  |-  ( E. x E. y E. z ( w  = 
<. x ,  y >.  /\  ph )  <->  E. x E. y ( w  = 
<. x ,  y >.  /\  E. z ph )
)
74, 6bitri 249 . . . 4  |-  ( E. z E. x E. y ( w  = 
<. x ,  y >.  /\  ph )  <->  E. x E. y ( w  = 
<. x ,  y >.  /\  E. z ph )
)
87abbii 2536 . . 3  |-  { w  |  E. z E. x E. y ( w  = 
<. x ,  y >.  /\  ph ) }  =  { w  |  E. x E. y ( w  =  <. x ,  y
>.  /\  E. z ph ) }
9 df-opab 4453 . . 3  |-  { <. x ,  y >.  |  E. z ph }  =  {
w  |  E. x E. y ( w  = 
<. x ,  y >.  /\  E. z ph ) }
108, 9eqtr4i 2434 . 2  |-  { w  |  E. z E. x E. y ( w  = 
<. x ,  y >.  /\  ph ) }  =  { <. x ,  y
>.  |  E. z ph }
112, 3, 103eqtri 2435 1  |-  dom  { <. <. x ,  y
>. ,  z >.  | 
ph }  =  { <. x ,  y >.  |  E. z ph }
Colors of variables: wff setvar class
Syntax hints:    /\ wa 367    = wceq 1405   E.wex 1633   {cab 2387   <.cop 3977   {copab 4451   dom cdm 4822   {coprab 6278
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1639  ax-4 1652  ax-5 1725  ax-6 1771  ax-7 1814  ax-9 1846  ax-10 1861  ax-11 1866  ax-12 1878  ax-13 2026  ax-ext 2380  ax-sep 4516  ax-nul 4524  ax-pr 4629
This theorem depends on definitions:  df-bi 185  df-or 368  df-an 369  df-3an 976  df-tru 1408  df-ex 1634  df-nf 1638  df-sb 1764  df-eu 2242  df-mo 2243  df-clab 2388  df-cleq 2394  df-clel 2397  df-nfc 2552  df-ne 2600  df-rab 2762  df-v 3060  df-dif 3416  df-un 3418  df-in 3420  df-ss 3427  df-nul 3738  df-if 3885  df-sn 3972  df-pr 3974  df-op 3978  df-br 4395  df-opab 4453  df-dm 4832  df-oprab 6281
This theorem is referenced by:  dmoprabss  6364  reldmoprab  6367  fnoprabg  6383  1st2val  6809  2nd2val  6810  joindm  15955  meetdm  15969  linedegen  30468
  Copyright terms: Public domain W3C validator