![]() |
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 4453 | . 2 ⊢ ((𝐴 ∩ 𝐵) = ∅ ↔ 𝐴 = (𝐴 ∖ 𝐵)) | |
2 | eqcom 2738 | . 2 ⊢ (𝐴 = (𝐴 ∖ 𝐵) ↔ (𝐴 ∖ 𝐵) = 𝐴) | |
3 | difss 4131 | . . . 4 ⊢ (𝐴 ∖ 𝐵) ⊆ 𝐴 | |
4 | dfpss2 4085 | . . . 4 ⊢ ((𝐴 ∖ 𝐵) ⊊ 𝐴 ↔ ((𝐴 ∖ 𝐵) ⊆ 𝐴 ∧ ¬ (𝐴 ∖ 𝐵) = 𝐴)) | |
5 | 3, 4 | mpbiran 706 | . . 3 ⊢ ((𝐴 ∖ 𝐵) ⊊ 𝐴 ↔ ¬ (𝐴 ∖ 𝐵) = 𝐴) |
6 | 5 | con2bii 357 | . 2 ⊢ ((𝐴 ∖ 𝐵) = 𝐴 ↔ ¬ (𝐴 ∖ 𝐵) ⊊ 𝐴) |
7 | 1, 2, 6 | 3bitri 297 | 1 ⊢ ((𝐴 ∩ 𝐵) = ∅ ↔ ¬ (𝐴 ∖ 𝐵) ⊊ 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ↔ wb 205 = wceq 1540 ∖ cdif 3945 ∩ cin 3947 ⊆ wss 3948 ⊊ wpss 3949 ∅c0 4322 |
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 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-ext 2702 |
This theorem depends on definitions: df-bi 206 df-an 396 df-tru 1543 df-fal 1553 df-ex 1781 df-sb 2067 df-clab 2709 df-cleq 2723 df-clel 2809 df-ne 2940 df-ral 3061 df-v 3475 df-dif 3951 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 |
This theorem is referenced by: marypha1lem 9434 infeq5i 9637 wilthlem2 26824 topdifinffinlem 36544 |
Copyright terms: Public domain | W3C validator |