| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sssn | Structured version Visualization version GIF version | ||
| Description: The subsets of a singleton. (Contributed by NM, 24-Apr-2004.) |
| Ref | Expression |
|---|---|
| sssn | ⊢ (𝐴 ⊆ {𝐵} ↔ (𝐴 = ∅ ∨ 𝐴 = {𝐵})) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | neq0 4302 | . . . . . . 7 ⊢ (¬ 𝐴 = ∅ ↔ ∃𝑥 𝑥 ∈ 𝐴) | |
| 2 | ssel 3907 | . . . . . . . . . . 11 ⊢ (𝐴 ⊆ {𝐵} → (𝑥 ∈ 𝐴 → 𝑥 ∈ {𝐵})) | |
| 3 | elsni 4601 | . . . . . . . . . . 11 ⊢ (𝑥 ∈ {𝐵} → 𝑥 = 𝐵) | |
| 4 | 2, 3 | syl6 36 | . . . . . . . . . 10 ⊢ (𝐴 ⊆ {𝐵} → (𝑥 ∈ 𝐴 → 𝑥 = 𝐵)) |
| 5 | eleq1 2852 | . . . . . . . . . 10 ⊢ (𝑥 = 𝐵 → (𝑥 ∈ 𝐴 ↔ 𝐵 ∈ 𝐴)) | |
| 6 | 4, 5 | syl6 36 | . . . . . . . . 9 ⊢ (𝐴 ⊆ {𝐵} → (𝑥 ∈ 𝐴 → (𝑥 ∈ 𝐴 ↔ 𝐵 ∈ 𝐴))) |
| 7 | 6 | ibd 272 | . . . . . . . 8 ⊢ (𝐴 ⊆ {𝐵} → (𝑥 ∈ 𝐴 → 𝐵 ∈ 𝐴)) |
| 8 | 7 | exlimdv 1968 | . . . . . . 7 ⊢ (𝐴 ⊆ {𝐵} → (∃𝑥 𝑥 ∈ 𝐴 → 𝐵 ∈ 𝐴)) |
| 9 | 1, 8 | biimtrid 245 | . . . . . 6 ⊢ (𝐴 ⊆ {𝐵} → (¬ 𝐴 = ∅ → 𝐵 ∈ 𝐴)) |
| 10 | snssi 4748 | . . . . . 6 ⊢ (𝐵 ∈ 𝐴 → {𝐵} ⊆ 𝐴) | |
| 11 | 9, 10 | syl6 36 | . . . . 5 ⊢ (𝐴 ⊆ {𝐵} → (¬ 𝐴 = ∅ → {𝐵} ⊆ 𝐴)) |
| 12 | 11 | anc2li 565 | . . . 4 ⊢ (𝐴 ⊆ {𝐵} → (¬ 𝐴 = ∅ → (𝐴 ⊆ {𝐵} ∧ {𝐵} ⊆ 𝐴))) |
| 13 | eqss 3928 | . . . 4 ⊢ (𝐴 = {𝐵} ↔ (𝐴 ⊆ {𝐵} ∧ {𝐵} ⊆ 𝐴)) | |
| 14 | 12, 13 | imbitrrdi 255 | . . 3 ⊢ (𝐴 ⊆ {𝐵} → (¬ 𝐴 = ∅ → 𝐴 = {𝐵})) |
| 15 | 14 | orrd 877 | . 2 ⊢ (𝐴 ⊆ {𝐵} → (𝐴 = ∅ ∨ 𝐴 = {𝐵})) |
| 16 | 0ss 4353 | . . . 4 ⊢ ∅ ⊆ {𝐵} | |
| 17 | sseq1 3938 | . . . 4 ⊢ (𝐴 = ∅ → (𝐴 ⊆ {𝐵} ↔ ∅ ⊆ {𝐵})) | |
| 18 | 16, 17 | mpbiri 261 | . . 3 ⊢ (𝐴 = ∅ → 𝐴 ⊆ {𝐵}) |
| 19 | eqimss 3971 | . . 3 ⊢ (𝐴 = {𝐵} → 𝐴 ⊆ {𝐵}) | |
| 20 | 18, 19 | jaoi 871 | . 2 ⊢ ((𝐴 = ∅ ∨ 𝐴 = {𝐵}) → 𝐴 ⊆ {𝐵}) |
| 21 | 15, 20 | impbii 212 | 1 ⊢ (𝐴 ⊆ {𝐵} ↔ (𝐴 = ∅ ∨ 𝐴 = {𝐵})) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 ↔ wb 209 ∧ wa 401 ∨ wo 861 = wceq 1570 ∃wex 1812 ∈ wcel 2147 ⊆ wss 3900 ∅c0 4281 {csn 4588 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-v 3456 df-ss 3901 df-dif 4050 df-nul 4282 df-sn 4589 |
| This theorem is used by: eqsn 4790 snsssn 4801 pwsn 4832 frsn 5747 foconst 6841 fin1a2lem12 10528 fpwwe2lem12 10766 gsumval2 18925 0top 23356 minveclem4a 25806 uvtx01vtx 30035 snsssng 33209 pmtrcnelor 33751 0ringsubrg 33911 lvecdim0 34350 locfinref 34584 0elscott 35878 ordcmp 37450 bj-snmoore 38304 nlpineqsn 38599 uneqsn 45286 mosssn 50257 mosssn2 50259 mofsssn 50288 |
| Copyright terms: Public domain | W3C validator |