| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > disj4 | Structured version Visualization version GIF version | ||
| Description: Two ways of saying that two classes are disjoint. (Contributed by NM, 21-Mar-2004.) |
| Ref | Expression |
|---|---|
| disj4 | ⊢ ((𝐴 ∩ 𝐵) = ∅ ↔ ¬ (𝐴 ∖ 𝐵) ⊊ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | disj3 4408 | . 2 ⊢ ((𝐴 ∩ 𝐵) = ∅ ↔ 𝐴 = (𝐴 ∖ 𝐵)) | |
| 2 | eqcom 2744 | . 2 ⊢ (𝐴 = (𝐴 ∖ 𝐵) ↔ (𝐴 ∖ 𝐵) = 𝐴) | |
| 3 | difss 4090 | . . . 4 ⊢ (𝐴 ∖ 𝐵) ⊆ 𝐴 | |
| 4 | dfpss2 4042 | . . . 4 ⊢ ((𝐴 ∖ 𝐵) ⊊ 𝐴 ↔ ((𝐴 ∖ 𝐵) ⊆ 𝐴 ∧ ¬ (𝐴 ∖ 𝐵) = 𝐴)) | |
| 5 | 3, 4 | mpbiran 710 | . . 3 ⊢ ((𝐴 ∖ 𝐵) ⊊ 𝐴 ↔ ¬ (𝐴 ∖ 𝐵) = 𝐴) |
| 6 | 5 | con2bii 357 | . 2 ⊢ ((𝐴 ∖ 𝐵) = 𝐴 ↔ ¬ (𝐴 ∖ 𝐵) ⊊ 𝐴) |
| 7 | 1, 2, 6 | 3bitri 297 | 1 ⊢ ((𝐴 ∩ 𝐵) = ∅ ↔ ¬ (𝐴 ∖ 𝐵) ⊊ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ↔ wb 206 = wceq 1542 ∖ cdif 3900 ∩ cin 3902 ⊆ wss 3903 ⊊ wpss 3904 ∅c0 4287 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ne 2934 df-ral 3053 df-v 3444 df-dif 3906 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 |
| This theorem is referenced by: marypha1lem 9348 infeq5i 9557 wilthlem2 27047 topdifinffinlem 37599 |
| Copyright terms: Public domain | W3C validator |