| 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 3921 | . 2 ⊢ ({𝐴} ⊆ 𝐵 ↔ ∀𝑥(𝑥 ∈ {𝐴} → 𝑥 ∈ 𝐵)) | |
| 2 | velsn 4604 | . . . 4 ⊢ (𝑥 ∈ {𝐴} ↔ 𝑥 = 𝐴) | |
| 3 | 2 | imbi1i 352 | . . 3 ⊢ ((𝑥 ∈ {𝐴} → 𝑥 ∈ 𝐵) ↔ (𝑥 = 𝐴 → 𝑥 ∈ 𝐵)) |
| 4 | 3 | albii 1848 | . 2 ⊢ (∀𝑥(𝑥 ∈ {𝐴} → 𝑥 ∈ 𝐵) ↔ ∀𝑥(𝑥 = 𝐴 → 𝑥 ∈ 𝐵)) |
| 5 | eleq1 2850 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ 𝐵 ↔ 𝐴 ∈ 𝐵)) | |
| 6 | 5 | pm5.74i 274 | . . . 4 ⊢ ((𝑥 = 𝐴 → 𝑥 ∈ 𝐵) ↔ (𝑥 = 𝐴 → 𝐴 ∈ 𝐵)) |
| 7 | 6 | albii 1848 | . . 3 ⊢ (∀𝑥(𝑥 = 𝐴 → 𝑥 ∈ 𝐵) ↔ ∀𝑥(𝑥 = 𝐴 → 𝐴 ∈ 𝐵)) |
| 8 | 19.23v 1971 | . . 3 ⊢ (∀𝑥(𝑥 = 𝐴 → 𝐴 ∈ 𝐵) ↔ (∃𝑥 𝑥 = 𝐴 → 𝐴 ∈ 𝐵)) | |
| 9 | isset 3468 | . . . . 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 1567 = wceq 1569 ∃wex 1808 ∈ wcel 2142 Vcvv 3454 ⊆ wss 3904 {csn 4588 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-ext 2734 |
| This proof depends on definitions: df-bi 210 df-an 401 df-tru 1572 df-ex 1809 df-sb 2096 df-clab 2741 df-cleq 2754 df-clel 2837 df-v 3456 df-ss 3921 df-sn 4589 |
| This theorem is used by: snssg 4748 |
| Copyright terms: Public domain | W3C validator |