| 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 3960 | . 2 ⊢ 𝐴 ⊆ V | |
| 2 | reldisj 4406 | . 2 ⊢ (𝐴 ⊆ V → ((𝐴 ∩ 𝐵) = ∅ ↔ 𝐴 ⊆ (V ∖ 𝐵))) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ ((𝐴 ∩ 𝐵) = ∅ ↔ 𝐴 ⊆ (V ∖ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 208 = wceq 1559 Vcvv 3453 ∖ cdif 3901 ∩ cin 3903 ⊆ wss 3904 ∅c0 4285 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-ext 2733 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-tru 1562 df-fal 1572 df-ex 1799 df-sb 2090 df-clab 2740 df-cleq 2753 df-clel 2836 df-ral 3076 df-v 3455 df-dif 3907 df-in 3911 df-ss 3921 df-nul 4286 |
| This theorem is referenced by: ssindif0 4417 intirr 6102 setsres 17197 setscom 17199 f1omvdco3 19472 psgnunilem5 19517 opsrtoslem2 22089 clsconn 23470 cldsubg 24151 uniinn0 32699 imadifxp 32750 |
| Copyright terms: Public domain | W3C validator |