| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cvjust | Structured version Visualization version GIF version | ||
| Description: Every set is a class. Proposition 4.9 of [TakeutiZaring] p. 13. This theorem shows that a setvar variable can be expressed as a class abstraction. This provides a motivation for the class syntax construction cv 1568, which allows to substitute a setvar variable for a class variable. See also cab 2738 and df-clab 2739. Note that this is not a rigorous justification, because cv 1568 is used as part of the proof of this theorem, but a careful argument can be made outside of the formalism of Metamath, for example as is done in Chapter 4 of Takeuti and Zaring. See also the discussion under the definition of class in [Jech] p. 4 showing that "Every set can be considered to be a class." See abid1 2896 for the version of cvjust 2754 extended to classes. (Contributed by NM, 7-Nov-2006.) Avoid ax-13 2401. (Revised by Wolf Lammen, 4-May-2023.) |
| Ref | Expression |
|---|---|
| cvjust | ⊢ 𝑥 = {𝑦 ∣ 𝑦 ∈ 𝑥} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfcleq 2753 | . 2 ⊢ (𝑥 = {𝑦 ∣ 𝑦 ∈ 𝑥} ↔ ∀𝑧(𝑧 ∈ 𝑥 ↔ 𝑧 ∈ {𝑦 ∣ 𝑦 ∈ 𝑥})) | |
| 2 | df-clab 2739 | . . 3 ⊢ (𝑧 ∈ {𝑦 ∣ 𝑦 ∈ 𝑥} ↔ [𝑧 / 𝑦]𝑦 ∈ 𝑥) | |
| 3 | elsb1 2152 | . . 3 ⊢ ([𝑧 / 𝑦]𝑦 ∈ 𝑥 ↔ 𝑧 ∈ 𝑥) | |
| 4 | 2, 3 | bitr2i 279 | . 2 ⊢ (𝑧 ∈ 𝑥 ↔ 𝑧 ∈ {𝑦 ∣ 𝑦 ∈ 𝑥}) |
| 5 | 1, 4 | mpgbir 1831 | 1 ⊢ 𝑥 = {𝑦 ∣ 𝑦 ∈ 𝑥} |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 = wceq 1569 [wsb 2098 ∈ 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-ext 2732 |
| This proof depends on definitions: df-bi 210 df-an 402 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 |
| This theorem is used by: cnambfre 38680 |
| Copyright terms: Public domain | W3C validator |