![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > difcom | Structured version Visualization version GIF version |
Description: Swap the arguments of a class difference. (Contributed by NM, 29-Mar-2007.) |
Ref | Expression |
---|---|
difcom | ⊢ ((𝐴 ∖ 𝐵) ⊆ 𝐶 ↔ (𝐴 ∖ 𝐶) ⊆ 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | uncom 4181 | . . 3 ⊢ (𝐵 ∪ 𝐶) = (𝐶 ∪ 𝐵) | |
2 | 1 | sseq2i 4038 | . 2 ⊢ (𝐴 ⊆ (𝐵 ∪ 𝐶) ↔ 𝐴 ⊆ (𝐶 ∪ 𝐵)) |
3 | ssundif 4511 | . 2 ⊢ (𝐴 ⊆ (𝐵 ∪ 𝐶) ↔ (𝐴 ∖ 𝐵) ⊆ 𝐶) | |
4 | ssundif 4511 | . 2 ⊢ (𝐴 ⊆ (𝐶 ∪ 𝐵) ↔ (𝐴 ∖ 𝐶) ⊆ 𝐵) | |
5 | 2, 3, 4 | 3bitr3i 301 | 1 ⊢ ((𝐴 ∖ 𝐵) ⊆ 𝐶 ↔ (𝐴 ∖ 𝐶) ⊆ 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 206 ∖ cdif 3973 ∪ cun 3974 ⊆ wss 3976 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2711 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-tru 1540 df-ex 1778 df-sb 2065 df-clab 2718 df-cleq 2732 df-clel 2819 df-v 3490 df-dif 3979 df-un 3981 df-ss 3993 |
This theorem is referenced by: pssdifcom1 4513 pssdifcom2 4514 isreg2 23406 restmetu 24604 conss1 44413 icccncfext 45808 |
Copyright terms: Public domain | W3C validator |