| 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 4353 | . 2 ⊢ ∅ ⊆ {∅} | |
| 2 | disjxsn 5101 | . 2 ⊢ Disj 𝑥 ∈ {∅}𝐵 | |
| 3 | disjss1 5080 | . 2 ⊢ (∅ ⊆ {∅} → (Disj 𝑥 ∈ {∅}𝐵 → Disj 𝑥 ∈ ∅ 𝐵)) | |
| 4 | 1, 2, 3 | mp2 9 | 1 ⊢ Disj 𝑥 ∈ ∅ 𝐵 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ⊆ wss 3902 ∅c0 4282 {csn 4587 Disj wdisj 5074 |
| 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 2147 ax-9 2155 ax-ext 2734 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-mo 2566 df-clab 2741 df-cleq 2754 df-clel 2837 df-rmo 3367 df-dif 3905 df-ss 3919 df-nul 4283 df-sn 4588 df-disj 5075 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |