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

Definition df-opab 4149
Description: Define the class abstraction of a collection of ordered pairs. Definition 3.3 of [Monk1] p. 34. Usually  x and  y are distinct, although the definition doesn't strictly require it. The brace notation is called "class abstraction" by Quine; it is also (more commonly) called a "class builder" in the literature. (Contributed by NM, 4-Jul-1994.)
Assertion
Ref Expression
df-opab  |-  { <. x ,  y >.  |  ph }  =  { z  |  E. x E. y
( z  =  <. x ,  y >.  /\  ph ) }
Distinct variable groups:    x, z    y,
z    ph, z
Allowed substitution hints:    ph( x, y)

Detailed syntax breakdown of Definition df-opab
StepHypRef Expression
1 wph . . 3  wff  ph
2 vx . . 3  setvar  x
3 vy . . 3  setvar  y
41, 2, 3copab 4147 . 2  class  { <. x ,  y >.  |  ph }
5 vz . . . . . . . 8  setvar  z
65cv 1394 . . . . . . 7  class  z
72cv 1394 . . . . . . . 8  class  x
83cv 1394 . . . . . . . 8  class  y
97, 8cop 3670 . . . . . . 7  class  <. x ,  y >.
106, 9wceq 1395 . . . . . 6  wff  z  = 
<. x ,  y >.
1110, 1wa 104 . . . . 5  wff  ( z  =  <. x ,  y
>.  /\  ph )
1211, 3wex 1538 . . . 4  wff  E. y
( z  =  <. x ,  y >.  /\  ph )
1312, 2wex 1538 . . 3  wff  E. x E. y ( z  = 
<. x ,  y >.  /\  ph )
1413, 5cab 2215 . 2  class  { z  |  E. x E. y ( z  = 
<. x ,  y >.  /\  ph ) }
154, 14wceq 1395 1  wff  { <. x ,  y >.  |  ph }  =  { z  |  E. x E. y
( z  =  <. x ,  y >.  /\  ph ) }
Colors of variables: wff set class
This definition is referenced by:  opabss  4151  opabbid  4152  nfopab  4155  nfopab1  4156  nfopab2  4157  cbvopab  4158  cbvopab1  4160  cbvopab2  4161  cbvopab1s  4162  cbvopab2v  4164  unopab  4166  opabid  4348  elopab  4350  ssopab2  4368  iunopab  4374  elxpi  4739  opabssxpd  4760  rabxp  4761  csbxpg  4805  relopabi  4853  opabbrex  6060  dfoprab2  6063  dmoprab  6097  dfopab2  6347  cnvoprab  6394
  Copyright terms: Public domain W3C validator