| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > disj2 | Structured version Visualization version GIF version | ||
| Description: Two ways of saying that two classes are disjoint. (Contributed by NM, 17-May-1998.) |
| Ref | Expression |
|---|---|
| disj2 | ⊢ ((𝐴 ∩ 𝐵) = ∅ ↔ 𝐴 ⊆ (V ∖ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssv 3958 | . 2 ⊢ 𝐴 ⊆ V | |
| 2 | reldisj 4405 | . 2 ⊢ (𝐴 ⊆ V → ((𝐴 ∩ 𝐵) = ∅ ↔ 𝐴 ⊆ (V ∖ 𝐵))) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ ((𝐴 ∩ 𝐵) = ∅ ↔ 𝐴 ⊆ (V ∖ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 = wceq 1541 Vcvv 3440 ∖ cdif 3898 ∩ cin 3900 ⊆ wss 3901 ∅c0 4285 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2715 df-cleq 2728 df-clel 2811 df-ral 3052 df-v 3442 df-dif 3904 df-in 3908 df-ss 3918 df-nul 4286 |
| This theorem is referenced by: ssindif0 4416 intirr 6075 setsres 17105 setscom 17107 f1omvdco3 19378 psgnunilem5 19423 opsrtoslem2 22011 clsconn 23374 cldsubg 24055 uniinn0 32625 imadifxp 32676 |
| Copyright terms: Public domain | W3C validator |