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

Theorem eqabb 2374
Description: Equality of a class variable and a class abstraction (also called a class builder). Theorem 5.1 of [Quine] p. 34. This theorem shows the relationship between expressions with class abstractions and expressions with class variables. Note that abbib 2356 and its relatives are among those useful for converting theorems with class variables to equivalent theorems with wff variables, by first substituting a class abstraction for each class variable.

Class variables can always be eliminated from a theorem to result in an equivalent theorem with wff variables, and vice-versa. The idea is roughly as follows. To convert a theorem with a wff variable  ph (that has a free variable  x) to a theorem with a class variable  A, we substitute  x  e.  A for  ph throughout and simplify, where  A is a new class variable not already in the wff. An example is the conversion of sepgi 4250 to inex1 4265 (look at the instance of sepgi 4250 that occurs in the proof of inex1 4265). Conversely, to convert a theorem with a class variable  A to one with  ph, we substitute  { x  | 
ph } for  A throughout and simplify, where  x and  ph are new setvar and wff variables not already in the wff. For more information on class variables, see Quine pp. 15-21 and/or Takeuti and Zaring pp. 10-13.

(Contributed by NM, 26-May-1993.) (Proof shortened by Wolf Lammen, 12-Feb-2025.)

Assertion
Ref Expression
eqabb  |-  ( A  =  { x  | 
ph }  <->  A. x
( x  e.  A  <->  ph ) )
Distinct variable group:    x, A
Allowed substitution hint:    ph( x)

Proof of Theorem eqabb
StepHypRef Expression
1 abid1 2372 . . 3  |-  A  =  { x  |  x  e.  A }
21eqeq1i 2246 . 2  |-  ( A  =  { x  | 
ph }  <->  { x  |  x  e.  A }  =  { x  |  ph } )
3 abbib 2356 . 2  |-  ( { x  |  x  e.  A }  =  {
x  |  ph }  <->  A. x ( x  e.  A  <->  ph ) )
42, 3bitri 184 1  |-  ( A  =  { x  | 
ph }  <->  A. x
( x  e.  A  <->  ph ) )
Colors of variables: wff set class
Syntax hints:    <-> wb 105   A.wal 1400    = wceq 1402    e. wcel 2209   {cab 2224
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 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-ext 2220
This theorem depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234
This theorem is referenced by:  eqabbw  2375  eqabcb  2377
  Copyright terms: Public domain W3C validator