| Mathbox for Scott Fenton |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > untelirr | Structured version Visualization version GIF version | ||
| Description: We call a class "untanged" if all its members are not members of themselves. The term originates from Isbell (see citation in dfon2 35793). Using this concept, we can avoid a lot of the uses of the Axiom of Regularity. Here, we prove a series of properties of untanged classes. First, we prove that an untangled class is not a member of itself. (Contributed by Scott Fenton, 28-Feb-2011.) |
| Ref | Expression |
|---|---|
| untelirr | ⊢ (∀𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝑥 → ¬ 𝐴 ∈ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eleq1 2829 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ 𝑥 ↔ 𝐴 ∈ 𝑥)) | |
| 2 | eleq2 2830 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝐴 ∈ 𝑥 ↔ 𝐴 ∈ 𝐴)) | |
| 3 | 1, 2 | bitrd 279 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ 𝑥 ↔ 𝐴 ∈ 𝐴)) |
| 4 | 3 | notbid 318 | . . 3 ⊢ (𝑥 = 𝐴 → (¬ 𝑥 ∈ 𝑥 ↔ ¬ 𝐴 ∈ 𝐴)) |
| 5 | 4 | rspccv 3619 | . 2 ⊢ (∀𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝑥 → (𝐴 ∈ 𝐴 → ¬ 𝐴 ∈ 𝐴)) |
| 6 | 5 | pm2.01d 190 | 1 ⊢ (∀𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝑥 → ¬ 𝐴 ∈ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 = wceq 1540 ∈ wcel 2108 ∀wral 3061 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1543 df-ex 1780 df-sb 2065 df-clab 2715 df-cleq 2729 df-clel 2816 df-ral 3062 |
| This theorem is referenced by: untsucf 35710 untangtr 35714 dfon2lem3 35786 dfon2lem7 35790 dfon2lem8 35791 dfon2lem9 35792 |
| Copyright terms: Public domain | W3C validator |