| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > snssb | Structured version Visualization version GIF version | ||
| Description: Characterization of the inclusion of a singleton in a class. (Contributed by BJ, 1-Jan-2025.) |
| Ref | Expression |
|---|---|
| snssb | ⊢ ({𝐴} ⊆ 𝐵 ↔ (𝐴 ∈ V → 𝐴 ∈ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-ss 3925 | . 2 ⊢ ({𝐴} ⊆ 𝐵 ↔ ∀𝑥(𝑥 ∈ {𝐴} → 𝑥 ∈ 𝐵)) | |
| 2 | velsn 4610 | . . . 4 ⊢ (𝑥 ∈ {𝐴} ↔ 𝑥 = 𝐴) | |
| 3 | 2 | imbi1i 352 | . . 3 ⊢ ((𝑥 ∈ {𝐴} → 𝑥 ∈ 𝐵) ↔ (𝑥 = 𝐴 → 𝑥 ∈ 𝐵)) |
| 4 | 3 | albii 1852 | . 2 ⊢ (∀𝑥(𝑥 ∈ {𝐴} → 𝑥 ∈ 𝐵) ↔ ∀𝑥(𝑥 = 𝐴 → 𝑥 ∈ 𝐵)) |
| 5 | eleq1 2854 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ 𝐵 ↔ 𝐴 ∈ 𝐵)) | |
| 6 | 5 | pm5.74i 274 | . . . 4 ⊢ ((𝑥 = 𝐴 → 𝑥 ∈ 𝐵) ↔ (𝑥 = 𝐴 → 𝐴 ∈ 𝐵)) |
| 7 | 6 | albii 1852 | . . 3 ⊢ (∀𝑥(𝑥 = 𝐴 → 𝑥 ∈ 𝐵) ↔ ∀𝑥(𝑥 = 𝐴 → 𝐴 ∈ 𝐵)) |
| 8 | 19.23v 1975 | . . 3 ⊢ (∀𝑥(𝑥 = 𝐴 → 𝐴 ∈ 𝐵) ↔ (∃𝑥 𝑥 = 𝐴 → 𝐴 ∈ 𝐵)) | |
| 9 | isset 3472 | . . . . 5 ⊢ (𝐴 ∈ V ↔ ∃𝑥 𝑥 = 𝐴) | |
| 10 | 9 | bicomi 227 | . . . 4 ⊢ (∃𝑥 𝑥 = 𝐴 ↔ 𝐴 ∈ V) |
| 11 | 10 | imbi1i 352 | . . 3 ⊢ ((∃𝑥 𝑥 = 𝐴 → 𝐴 ∈ 𝐵) ↔ (𝐴 ∈ V → 𝐴 ∈ 𝐵)) |
| 12 | 7, 8, 11 | 3bitri 300 | . 2 ⊢ (∀𝑥(𝑥 = 𝐴 → 𝑥 ∈ 𝐵) ↔ (𝐴 ∈ V → 𝐴 ∈ 𝐵)) |
| 13 | 1, 4, 12 | 3bitri 300 | 1 ⊢ ({𝐴} ⊆ 𝐵 ↔ (𝐴 ∈ V → 𝐴 ∈ 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∀wal 1568 = wceq 1570 ∃wex 1812 ∈ wcel 2146 Vcvv 3458 ⊆ wss 3908 {csn 4594 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-ext 2738 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2745 df-cleq 2758 df-clel 2841 df-v 3460 df-ss 3925 df-sn 4595 |
| This theorem is used by: snssg 4754 |
| Copyright terms: Public domain | W3C validator |