| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sseq0b | Structured version Visualization version GIF version | ||
| Description: The only subclass of the empty class is itself. (Contributed by NM, 7-Mar-2007.) Strengthen sseq0 4353 to a biconditional. (Revised by BJ, 19-Jul-2026.) |
| Ref | Expression |
|---|---|
| sseq0b | ⊢ (𝐴 = ∅ → (𝐵 ⊆ 𝐴 ↔ 𝐵 = ∅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sseq2 3934 | . 2 ⊢ (𝐴 = ∅ → (𝐵 ⊆ 𝐴 ↔ 𝐵 ⊆ ∅)) | |
| 2 | ss0b 4350 | . 2 ⊢ (𝐵 ⊆ ∅ ↔ 𝐵 = ∅) | |
| 3 | 1, 2 | bitrdi 290 | 1 ⊢ (𝐴 = ∅ → (𝐵 ⊆ 𝐴 ↔ 𝐵 = ∅)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1569 ⊆ wss 3895 ∅c0 4278 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-ss 3896 df-dif 4047 df-nul 4279 |
| This theorem is used by: sseq0 4353 |
| Copyright terms: Public domain | W3C validator |