Mathbox for BJ |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > bj-nsnid | Structured version Visualization version GIF version |
Description: A set does not contain the singleton formed on it. More precisely, one can prove that a class contains the singleton formed on it if and only if it is proper and contains the empty set (since it is "the singleton formed on" any proper class, see snprc 4653): ⊢ ¬ ({𝐴} ∈ 𝐴 ↔ (∅ ∈ 𝐴 → 𝐴 ∈ V)). (Contributed by BJ, 4-Feb-2023.) |
Ref | Expression |
---|---|
bj-nsnid | ⊢ (𝐴 ∈ 𝑉 → ¬ {𝐴} ∈ 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | en2lp 9069 | . 2 ⊢ ¬ (𝐴 ∈ {𝐴} ∧ {𝐴} ∈ 𝐴) | |
2 | snidg 4599 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ {𝐴}) | |
3 | 2 | anim1i 616 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ {𝐴} ∈ 𝐴) → (𝐴 ∈ {𝐴} ∧ {𝐴} ∈ 𝐴)) |
4 | 3 | ex 415 | . 2 ⊢ (𝐴 ∈ 𝑉 → ({𝐴} ∈ 𝐴 → (𝐴 ∈ {𝐴} ∧ {𝐴} ∈ 𝐴))) |
5 | 1, 4 | mtoi 201 | 1 ⊢ (𝐴 ∈ 𝑉 → ¬ {𝐴} ∈ 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 398 ∈ wcel 2114 {csn 4567 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pr 5330 ax-reg 9056 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-sbc 3773 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-sn 4568 df-pr 4570 df-op 4574 df-br 5067 df-opab 5129 df-eprel 5465 df-fr 5514 |
This theorem is referenced by: bj-inftyexpitaudisj 34490 |
Copyright terms: Public domain | W3C validator |