MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  eqabb Structured version   Visualization version   GIF version

Theorem eqabb 2899
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 2829 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 𝜑 (that has a free variable 𝑥) to a theorem with a class variable 𝐴, we substitute 𝑥 ∈ 𝐴 for 𝜑 throughout and simplify, where 𝐴 is a new class variable not already in the wff. An example is the conversion of sepgi 5251 to inex1 5276 (look at the instance of sepgi 5251 that occurs in the proof of inex1 5276). Conversely, to convert a theorem with a class variable 𝐴 to one with 𝜑, we substitute {𝑥 ∣ 𝜑} for 𝐴 throughout and simplify, where 𝑥 and 𝜑 are new setvar and wff variables not already in the wff. Examples include dfsymdif2 4206 and cp 9958; the latter derives a formula containing wff variables from substitution instances of the class variables in its equivalent formulation cplem2 9956. For more information on class variables, see Quine pp. 15-21 and/or Takeuti and Zaring pp. 10-13.

Usage of eqabbw 2833 is preferred since it requires fewer axioms. (Contributed by NM, 26-May-1993.) (Proof shortened by Wolf Lammen, 12-Feb-2025.)

Assertion
Ref Expression
eqabb (𝐴 = {𝑥 ∣ 𝜑} ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝜑))
Distinct variable group:   𝑥,𝐴
Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem eqabb
StepHypRef Expression
1 abid1 2896 . . 3 𝐴 = {𝑥 ∣ 𝑥 ∈ 𝐴}
21eqeq1i 2765 . 2 (𝐴 = {𝑥 ∣ 𝜑} ↔ {𝑥 ∣ 𝑥 ∈ 𝐴} = {𝑥 ∣ 𝜑})
3 abbib 2829 . 2 ({𝑥 ∣ 𝑥 ∈ 𝐴} = {𝑥 ∣ 𝜑} ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝜑))
42, 3bitri 278 1 (𝐴 = {𝑥 ∣ 𝜑} ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝜑))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209  ∀wal 1567   = wceq 1569   ∈ wcel 2144  {cab 2738
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-ex 1812  df-nf 1816  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835
This theorem is used by:  eqabcb  2900  clabel  2905  sbcabel  3824  zfrep4  5245  dmopab3  5900  rnopab3  5937  fineqvrep  35839  bj-abex  38036  qseq  39759  sticksstones1  43290  sticksstones2  43291
  Copyright terms: Public domain W3C validator