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 4655): ⊢ ¬ ({𝐴} ∈ 𝐴 ↔ (∅ ∈ 𝐴 → 𝐴 ∈ V)). (Contributed by BJ, 4-Feb-2023.) |
Ref | Expression |
---|---|
bj-nsnid | ⊢ (𝐴 ∈ 𝑉 → ¬ {𝐴} ∈ 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | en2lp 9071 | . 2 ⊢ ¬ (𝐴 ∈ {𝐴} ∧ {𝐴} ∈ 𝐴) | |
2 | snidg 4601 | . . . 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 4569 |
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 2795 ax-sep 5205 ax-nul 5212 ax-pr 5332 ax-reg 9058 |
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 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-ral 3145 df-rex 3146 df-rab 3149 df-v 3498 df-sbc 3775 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-sn 4570 df-pr 4572 df-op 4576 df-br 5069 df-opab 5131 df-eprel 5467 df-fr 5516 |
This theorem is referenced by: bj-inftyexpitaudisj 34489 |
Copyright terms: Public domain | W3C validator |