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

Theorem eqabb 2903
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 2832 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 5256 to inex1 5282 (look at the instance of sepgi 5256 that occurs in the proof of inex1 5282). 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 4209 and cp 9984; the latter derives a formula containing wff variables from substitution instances of the class variables in its equivalent formulation cplem2 9982. For more information on class variables, see Quine pp. 15-21 and/or Takeuti and Zaring pp. 10-13.

Usage of eqabbw 2837 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 2900 . . 3 𝐴 = {𝑥 ∣ 𝑥 ∈ 𝐴}
21eqeq1i 2768 . 2 (𝐴 = {𝑥 ∣ 𝜑} ↔ {𝑥 ∣ 𝑥 ∈ 𝐴} = {𝑥 ∣ 𝜑})
3 abbib 2832 . 2 ({𝑥 ∣ 𝑥 ∈ 𝐴} = {𝑥 ∣ 𝜑} ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝜑))
42, 3bitri 278 1 (𝐴 = {𝑥 ∣ 𝜑} ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝜑))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209  ∀wal 1568   = wceq 1570   ∈ wcel 2147  {cab 2741
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839
This theorem is used by:  eqabcb  2904  clabel  2909  sbcabel  3829  zfrep4  5250  dmopab3  5909  rnopab3  5946  fineqvrep  35895  bj-abex  38134  qseq  39868  sticksstones1  43399  sticksstones2  43400
  Copyright terms: Public domain W3C validator