![]() |
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 33150). 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 2877 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ 𝑥 ↔ 𝐴 ∈ 𝑥)) | |
2 | eleq2 2878 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝐴 ∈ 𝑥 ↔ 𝐴 ∈ 𝐴)) | |
3 | 1, 2 | bitrd 282 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ 𝑥 ↔ 𝐴 ∈ 𝐴)) |
4 | 3 | notbid 321 | . . 3 ⊢ (𝑥 = 𝐴 → (¬ 𝑥 ∈ 𝑥 ↔ ¬ 𝐴 ∈ 𝐴)) |
5 | 4 | rspccv 3568 | . 2 ⊢ (∀𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝑥 → (𝐴 ∈ 𝐴 → ¬ 𝐴 ∈ 𝐴)) |
6 | 5 | pm2.01d 193 | 1 ⊢ (∀𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝑥 → ¬ 𝐴 ∈ 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 = wceq 1538 ∈ wcel 2111 ∀wral 3106 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-ext 2770 |
This theorem depends on definitions: df-bi 210 df-an 400 df-ex 1782 df-cleq 2791 df-clel 2870 df-ral 3111 |
This theorem is referenced by: untsucf 33049 untangtr 33053 dfon2lem3 33143 dfon2lem7 33147 dfon2lem8 33148 dfon2lem9 33149 |
Copyright terms: Public domain | W3C validator |