| 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 1569, which allows to substitute a setvar variable for a class variable. See also cab 2743 and df-clab 2744. Note that this is not a rigorous justification, because cv 1569 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 2901 for the version of cvjust 2759 extended to classes. (Contributed by NM, 7-Nov-2006.) Avoid ax-13 2406. (Revised by Wolf Lammen, 4-May-2023.) |
| Ref | Expression |
|---|---|
| cvjust | ⊢ 𝑥 = {𝑦 ∣ 𝑦 ∈ 𝑥} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfcleq 2758 | . 2 ⊢ (𝑥 = {𝑦 ∣ 𝑦 ∈ 𝑥} ↔ ∀𝑧(𝑧 ∈ 𝑥 ↔ 𝑧 ∈ {𝑦 ∣ 𝑦 ∈ 𝑥})) | |
| 2 | df-clab 2744 | . . 3 ⊢ (𝑧 ∈ {𝑦 ∣ 𝑦 ∈ 𝑥} ↔ [𝑧 / 𝑦]𝑦 ∈ 𝑥) | |
| 3 | elsb1 2154 | . . 3 ⊢ ([𝑧 / 𝑦]𝑦 ∈ 𝑥 ↔ 𝑧 ∈ 𝑥) | |
| 4 | 2, 3 | bitr2i 279 | . 2 ⊢ (𝑧 ∈ 𝑥 ↔ 𝑧 ∈ {𝑦 ∣ 𝑦 ∈ 𝑥}) |
| 5 | 1, 4 | mpgbir 1832 | 1 ⊢ 𝑥 = {𝑦 ∣ 𝑦 ∈ 𝑥} |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 = wceq 1570 [wsb 2099 ∈ wcel 2146 {cab 2743 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-ext 2737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-ex 1813 df-sb 2100 df-clab 2744 df-cleq 2757 |
| This theorem is used by: cnambfre 38352 |
| Copyright terms: Public domain | W3C validator |