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

Theorem reloprab 6136
Description: An operation class abstraction is a relation. (Contributed by NM, 16-Jun-2004.)
Assertion
Ref Expression
reloprab  |-  Rel  { <. <. x ,  y
>. ,  z >.  | 
ph }
Distinct variable groups:    x, z    y,
z
Allowed substitution hints:    ph( x,  y,  z)

Proof of Theorem reloprab
Dummy variable  w is distinct from all other variables.
StepHypRef Expression
1 dfoprab2 6135 . 2  |-  { <. <.
x ,  y >. ,  z >.  |  ph }  =  { <. w ,  z >.  |  E. x E. y ( w  =  <. x ,  y
>.  /\  ph ) }
21relopabi 4905 1  |-  Rel  { <. <. x ,  y
>. ,  z >.  | 
ph }
Colors of variables:    wff set class
This proof depends on syntax axioms:    /\ wa 104    = wceq 1402   E.wex 1545   <.cop 3712   Rel wrel 4779   {coprab 6086
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-opab 4193  df-xp 4780  df-rel 4781  df-oprab 6089
This theorem is used by:  oprabss  6174
  Copyright terms: Public domain W3C validator