Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > complss | Structured version Visualization version GIF version |
Description: Complementation reverses inclusion. (Contributed by Andrew Salmon, 15-Jul-2011.) (Proof shortened by BJ, 19-Mar-2021.) |
Ref | Expression |
---|---|
complss | ⊢ (𝐴 ⊆ 𝐵 ↔ (V ∖ 𝐵) ⊆ (V ∖ 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sscon 4114 | . 2 ⊢ (𝐴 ⊆ 𝐵 → (V ∖ 𝐵) ⊆ (V ∖ 𝐴)) | |
2 | sscon 4114 | . . 3 ⊢ ((V ∖ 𝐵) ⊆ (V ∖ 𝐴) → (V ∖ (V ∖ 𝐴)) ⊆ (V ∖ (V ∖ 𝐵))) | |
3 | ddif 4112 | . . 3 ⊢ (V ∖ (V ∖ 𝐴)) = 𝐴 | |
4 | ddif 4112 | . . 3 ⊢ (V ∖ (V ∖ 𝐵)) = 𝐵 | |
5 | 2, 3, 4 | 3sstr3g 4010 | . 2 ⊢ ((V ∖ 𝐵) ⊆ (V ∖ 𝐴) → 𝐴 ⊆ 𝐵) |
6 | 1, 5 | impbii 211 | 1 ⊢ (𝐴 ⊆ 𝐵 ↔ (V ∖ 𝐵) ⊆ (V ∖ 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 208 Vcvv 3494 ∖ cdif 3932 ⊆ wss 3935 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-v 3496 df-dif 3938 df-in 3942 df-ss 3951 |
This theorem is referenced by: compleq 4123 |
Copyright terms: Public domain | W3C validator |