| Mathbox for Wolf Lammen |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > wl-dfclel | Structured version Visualization version GIF version | ||
| Description: The defining characterization of class membership. Unlike the forms on which it is based, it is unrestricted. Proven in Tarski's FOL, from the axiom of (set) extensionality (ax-ext 2738), the definitions df-clel 2841 and df-cleq . (Contributed by BJ, 27-Jun-2019.) Base on wl-dfclel.just 38192. (Revised by Wolf Lammen, 13-Apr-2026.) |
| Ref | Expression |
|---|---|
| wl-dfclel | ⊢ (𝐴 ∈ 𝐵 ↔ ∃𝑥(𝑥 = 𝐴 ∧ 𝑥 ∈ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqeq1 2770 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝑥 = 𝐴 ↔ 𝑦 = 𝐴)) | |
| 2 | eleq1w 2849 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝐵 ↔ 𝑦 ∈ 𝐵)) | |
| 3 | 1, 2 | anbi12d 644 | . . 3 ⊢ (𝑥 = 𝑦 → ((𝑥 = 𝐴 ∧ 𝑥 ∈ 𝐵) ↔ (𝑦 = 𝐴 ∧ 𝑦 ∈ 𝐵))) |
| 4 | 3 | cbvexvw 2070 | . 2 ⊢ (∃𝑥(𝑥 = 𝐴 ∧ 𝑥 ∈ 𝐵) ↔ ∃𝑦(𝑦 = 𝐴 ∧ 𝑦 ∈ 𝐵)) |
| 5 | 4 | wl-dfclel.just 38192 | 1 ⊢ (𝐴 ∈ 𝐵 ↔ ∃𝑥(𝑥 = 𝐴 ∧ 𝑥 ∈ 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 = wceq 1570 ∃wex 1812 ∈ wcel 2146 |
| 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 2738 |
| This proof depends on definitions: df-bi 210 df-an 402 df-ex 1813 df-cleq 2758 df-clel 2841 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |