| 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 4405 | . 2 ⊢ ((𝐴 ∩ 𝐵) = ∅ ↔ 𝐴 = (𝐴 ∖ 𝐵)) | |
| 2 | eqcom 2768 | . 2 ⊢ (𝐴 = (𝐴 ∖ 𝐵) ↔ (𝐴 ∖ 𝐵) = 𝐴) | |
| 3 | difss 4087 | . . . 4 ⊢ (𝐴 ∖ 𝐵) ⊆ 𝐴 | |
| 4 | dfpss2 4039 | . . . 4 ⊢ ((𝐴 ∖ 𝐵) ⊊ 𝐴 ↔ ((𝐴 ∖ 𝐵) ⊆ 𝐴 ∧ ¬ (𝐴 ∖ 𝐵) = 𝐴)) | |
| 5 | 3, 4 | mpbiran 719 | . . 3 ⊢ ((𝐴 ∖ 𝐵) ⊊ 𝐴 ↔ ¬ (𝐴 ∖ 𝐵) = 𝐴) |
| 6 | 5 | con2bii 359 | . 2 ⊢ ((𝐴 ∖ 𝐵) = 𝐴 ↔ ¬ (𝐴 ∖ 𝐵) ⊊ 𝐴) |
| 7 | 1, 2, 6 | 3bitri 299 | 1 ⊢ ((𝐴 ∩ 𝐵) = ∅ ↔ ¬ (𝐴 ∖ 𝐵) ⊊ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ↔ wb 208 = wceq 1559 ∖ cdif 3899 ∩ cin 3901 ⊆ wss 3902 ⊊ wpss 3903 ∅c0 4283 |
| 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-ne 2957 df-ral 3076 df-v 3455 df-dif 3905 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 |
| This theorem is referenced by: marypha1lem 9372 infeq5i 9584 wilthlem2 27120 topdifinffinlem 37801 |
| Copyright terms: Public domain | W3C validator |