| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > snsssng | Structured version Visualization version GIF version | ||
| Description: If a singleton is a subset of another, their members are equal. (Contributed by NM, 28-May-2006.) (Revised by Thierry Arnoux, 11-Apr-2024.) |
| Ref | Expression |
|---|---|
| snsssng | ⊢ ((𝐴 ∈ 𝑉 ∧ {𝐴} ⊆ {𝐵}) → 𝐴 = 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sssn 4792 | . 2 ⊢ ({𝐴} ⊆ {𝐵} ↔ ({𝐴} = ∅ ∨ {𝐴} = {𝐵})) | |
| 2 | snnzg 4740 | . . . . . 6 ⊢ (𝐴 ∈ 𝑉 → {𝐴} ≠ ∅) | |
| 3 | 2 | neneqd 2963 | . . . . 5 ⊢ (𝐴 ∈ 𝑉 → ¬ {𝐴} = ∅) |
| 4 | 3 | pm2.21d 122 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → ({𝐴} = ∅ → 𝐴 = 𝐵)) |
| 5 | sneqrg 4804 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → ({𝐴} = {𝐵} → 𝐴 = 𝐵)) | |
| 6 | 4, 5 | jaod 872 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (({𝐴} = ∅ ∨ {𝐴} = {𝐵}) → 𝐴 = 𝐵)) |
| 7 | 6 | imp 411 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ ({𝐴} = ∅ ∨ {𝐴} = {𝐵})) → 𝐴 = 𝐵) |
| 8 | 1, 7 | sylan2b 605 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ {𝐴} ⊆ {𝐵}) → 𝐴 = 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 400 ∨ wo 860 = wceq 1570 ∈ wcel 2143 ⊆ wss 3905 ∅c0 4286 {csn 4589 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-ne 2959 df-v 3457 df-dif 3908 df-ss 3922 df-nul 4287 df-sn 4590 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |