Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > 0disj | GIF version |
Description: Any collection of empty sets is disjoint. (Contributed by Mario Carneiro, 14-Nov-2016.) |
Ref | Expression |
---|---|
0disj | ⊢ Disj 𝑥 ∈ 𝐴 ∅ |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 0ss 3401 | . . 3 ⊢ ∅ ⊆ {𝑥} | |
2 | 1 | rgenw 2487 | . 2 ⊢ ∀𝑥 ∈ 𝐴 ∅ ⊆ {𝑥} |
3 | sndisj 3925 | . 2 ⊢ Disj 𝑥 ∈ 𝐴 {𝑥} | |
4 | disjss2 3909 | . 2 ⊢ (∀𝑥 ∈ 𝐴 ∅ ⊆ {𝑥} → (Disj 𝑥 ∈ 𝐴 {𝑥} → Disj 𝑥 ∈ 𝐴 ∅)) | |
5 | 2, 3, 4 | mp2 16 | 1 ⊢ Disj 𝑥 ∈ 𝐴 ∅ |
Colors of variables: wff set class |
Syntax hints: ∀wral 2416 ⊆ wss 3071 ∅c0 3363 {csn 3527 Disj wdisj 3906 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 |
This theorem depends on definitions: df-bi 116 df-tru 1334 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ral 2421 df-rmo 2424 df-v 2688 df-dif 3073 df-in 3077 df-ss 3084 df-nul 3364 df-sn 3533 df-disj 3907 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |