| 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 4355 | . 2 ⊢ ∅ ⊆ {∅} | |
| 2 | disjxsn 5095 | . 2 ⊢ Disj 𝑥 ∈ {∅}𝐵 | |
| 3 | disjss1 5074 | . 2 ⊢ (∅ ⊆ {∅} → (Disj 𝑥 ∈ {∅}𝐵 → Disj 𝑥 ∈ ∅ 𝐵)) | |
| 4 | 1, 2, 3 | mp2 9 | 1 ⊢ Disj 𝑥 ∈ ∅ 𝐵 |
| Colors of variables: wff setvar class |
| Syntax hints: ⊆ wss 3905 ∅c0 4286 {csn 4583 Disj wdisj 5068 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1816 ax-4 1830 ax-5 1931 ax-6 1988 ax-7 2029 ax-8 2145 ax-9 2153 ax-ext 2735 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-tru 1564 df-fal 1574 df-ex 1801 df-sb 2092 df-mo 2567 df-clab 2742 df-cleq 2755 df-clel 2838 df-rmo 3368 df-dif 3908 df-ss 3922 df-nul 4287 df-sn 4584 df-disj 5069 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |