| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > disjx0 | Structured version Visualization version GIF version | ||
| Description: An empty collection is disjoint. (Contributed by Mario Carneiro, 14-Nov-2016.) |
| Ref | Expression |
|---|---|
| disjx0 | ⊢ Disj 𝑥 ∈ ∅ 𝐵 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0ss 4365 | . 2 ⊢ ∅ ⊆ {∅} | |
| 2 | disjxsn 5103 | . 2 ⊢ Disj 𝑥 ∈ {∅}𝐵 | |
| 3 | disjss1 5082 | . 2 ⊢ (∅ ⊆ {∅} → (Disj 𝑥 ∈ {∅}𝐵 → Disj 𝑥 ∈ ∅ 𝐵)) | |
| 4 | 1, 2, 3 | mp2 9 | 1 ⊢ Disj 𝑥 ∈ ∅ 𝐵 |
| Colors of variables: wff setvar class |
| Syntax hints: ⊆ wss 3916 ∅c0 4298 {csn 4591 Disj wdisj 5076 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2702 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2066 df-mo 2534 df-clab 2709 df-cleq 2722 df-clel 2804 df-rmo 3356 df-dif 3919 df-ss 3933 df-nul 4299 df-sn 4592 df-disj 5077 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |