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

Theorem rnoprab 6001
Description: The range of an operation class abstraction. (Contributed by NM, 30-Aug-2004.) (Revised by David Abernethy, 19-Apr-2013.)
Assertion
Ref Expression
rnoprab  |-  ran  { <. <. x ,  y
>. ,  z >.  | 
ph }  =  {
z  |  E. x E. y ph }
Distinct variable groups:    x, z    y,
z
Allowed substitution hints:    ph( x, y, z)

Proof of Theorem rnoprab
Dummy variable  w is distinct from all other variables.
StepHypRef Expression
1 dfoprab2 5965 . . 3  |-  { <. <.
x ,  y >. ,  z >.  |  ph }  =  { <. w ,  z >.  |  E. x E. y ( w  =  <. x ,  y
>.  /\  ph ) }
21rneqi 4890 . 2  |-  ran  { <. <. x ,  y
>. ,  z >.  | 
ph }  =  ran  {
<. w ,  z >.  |  E. x E. y
( w  =  <. x ,  y >.  /\  ph ) }
3 rnopab 4909 . 2  |-  ran  { <. w ,  z >.  |  E. x E. y
( w  =  <. x ,  y >.  /\  ph ) }  =  {
z  |  E. w E. x E. y ( w  =  <. x ,  y >.  /\  ph ) }
4 exrot3 1701 . . . 4  |-  ( E. w E. x E. y ( w  = 
<. x ,  y >.  /\  ph )  <->  E. x E. y E. w ( w  =  <. x ,  y >.  /\  ph ) )
5 vex 2763 . . . . . . . 8  |-  x  e. 
_V
6 vex 2763 . . . . . . . 8  |-  y  e. 
_V
75, 6opex 4258 . . . . . . 7  |-  <. x ,  y >.  e.  _V
87isseti 2768 . . . . . 6  |-  E. w  w  =  <. x ,  y >.
9 19.41v 1914 . . . . . 6  |-  ( E. w ( w  = 
<. x ,  y >.  /\  ph )  <->  ( E. w  w  =  <. x ,  y >.  /\  ph ) )
108, 9mpbiran 942 . . . . 5  |-  ( E. w ( w  = 
<. x ,  y >.  /\  ph )  <->  ph )
11102exbii 1617 . . . 4  |-  ( E. x E. y E. w ( w  = 
<. x ,  y >.  /\  ph )  <->  E. x E. y ph )
124, 11bitri 184 . . 3  |-  ( E. w E. x E. y ( w  = 
<. x ,  y >.  /\  ph )  <->  E. x E. y ph )
1312abbii 2309 . 2  |-  { z  |  E. w E. x E. y ( w  =  <. x ,  y
>.  /\  ph ) }  =  { z  |  E. x E. y ph }
142, 3, 133eqtri 2218 1  |-  ran  { <. <. x ,  y
>. ,  z >.  | 
ph }  =  {
z  |  E. x E. y ph }
Colors of variables: wff set class
Syntax hints:    /\ wa 104    = wceq 1364   E.wex 1503   {cab 2179   <.cop 3621   {copab 4089   ran crn 4660   {coprab 5919
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 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-v 2762  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-br 4030  df-opab 4091  df-cnv 4667  df-dm 4669  df-rn 4670  df-oprab 5922
This theorem is referenced by:  rnoprab2  6002
  Copyright terms: Public domain W3C validator