![]() |
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 4153 | . . 3 ⊢ (𝐵 ∪ 𝐶) = (𝐶 ∪ 𝐵) | |
2 | 1 | sseq2i 4011 | . 2 ⊢ (𝐴 ⊆ (𝐵 ∪ 𝐶) ↔ 𝐴 ⊆ (𝐶 ∪ 𝐵)) |
3 | ssundif 4487 | . 2 ⊢ (𝐴 ⊆ (𝐵 ∪ 𝐶) ↔ (𝐴 ∖ 𝐵) ⊆ 𝐶) | |
4 | ssundif 4487 | . 2 ⊢ (𝐴 ⊆ (𝐶 ∪ 𝐵) ↔ (𝐴 ∖ 𝐶) ⊆ 𝐵) | |
5 | 2, 3, 4 | 3bitr3i 300 | 1 ⊢ ((𝐴 ∖ 𝐵) ⊆ 𝐶 ↔ (𝐴 ∖ 𝐶) ⊆ 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 ∖ cdif 3945 ∪ cun 3946 ⊆ wss 3948 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2703 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-tru 1544 df-ex 1782 df-sb 2068 df-clab 2710 df-cleq 2724 df-clel 2810 df-v 3476 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 |
This theorem is referenced by: pssdifcom1 4489 pssdifcom2 4490 isreg2 22880 restmetu 24078 conss1 43193 icccncfext 44593 |
Copyright terms: Public domain | W3C validator |