Theorem conss1 45213

Description: Contrapositive law for subsets. (Contributed by Andrew Salmon, 15-Jul-2011.)

Assertion

Ref	Expression
conss1	⊢ ((V ∖ 𝐴) ⊆ 𝐵 ↔ (V ∖ 𝐵) ⊆ 𝐴)

Proof of Theorem conss1

Step	Hyp	Ref	Expression
1		difcom 4451	1 ⊢ ((V ∖ 𝐴) ⊆ 𝐵 ↔ (V ∖ 𝐵) ⊆ 𝐴)

This proof depends on syntax axioms:   ↔ wb 209  Vcvv 3457   ∖ cdif 3903   ⊆ wss 3906

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2737

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-v 3459  df-dif 3909  df-un 3911  df-ss 3923

This theorem is used by: (None)