Mathbox for Andrew Salmon |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > conss2 | Structured version Visualization version GIF version |
Description: Contrapositive law for subsets. (Contributed by Andrew Salmon, 15-Jul-2011.) |
Ref | Expression |
---|---|
conss2 | ⊢ (𝐴 ⊆ (V ∖ 𝐵) ↔ 𝐵 ⊆ (V ∖ 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ssv 3991 | . 2 ⊢ 𝐴 ⊆ V | |
2 | ssv 3991 | . 2 ⊢ 𝐵 ⊆ V | |
3 | ssconb 4114 | . 2 ⊢ ((𝐴 ⊆ V ∧ 𝐵 ⊆ V) → (𝐴 ⊆ (V ∖ 𝐵) ↔ 𝐵 ⊆ (V ∖ 𝐴))) | |
4 | 1, 2, 3 | mp2an 690 | 1 ⊢ (𝐴 ⊆ (V ∖ 𝐵) ↔ 𝐵 ⊆ (V ∖ 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 208 Vcvv 3494 ∖ cdif 3933 ⊆ wss 3936 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-v 3496 df-dif 3939 df-in 3943 df-ss 3952 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |