MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ssconb Structured version   Visualization version   GIF version

Theorem ssconb 4081
Description: Contraposition law for subsets. (Contributed by NM, 22-Mar-1998.)
Assertion
Ref Expression
ssconb ((𝐴 ⊆ 𝐶 ∧ 𝐵 ⊆ 𝐶) → (𝐴 ⊆ (𝐶 ∖ 𝐵) ↔ 𝐵 ⊆ (𝐶 ∖ 𝐴)))

Proof of Theorem ssconb
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 ssel 3907 . . . . . . 7 (𝐴 ⊆ 𝐶 → (𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐶))
2 ssel 3907 . . . . . . 7 (𝐵 ⊆ 𝐶 → (𝑥 ∈ 𝐵 → 𝑥 ∈ 𝐶))
3 pm5.1 836 . . . . . . 7 (((𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐶) ∧ (𝑥 ∈ 𝐵 → 𝑥 ∈ 𝐶)) → ((𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐶) ↔ (𝑥 ∈ 𝐵 → 𝑥 ∈ 𝐶)))
41, 2, 3syl2an 608 . . . . . 6 ((𝐴 ⊆ 𝐶 ∧ 𝐵 ⊆ 𝐶) → ((𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐶) ↔ (𝑥 ∈ 𝐵 → 𝑥 ∈ 𝐶)))
5 con2b 362 . . . . . . 7 ((𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐵) ↔ (𝑥 ∈ 𝐵 → ¬ 𝑥 ∈ 𝐴))
65a1i 11 . . . . . 6 ((𝐴 ⊆ 𝐶 ∧ 𝐵 ⊆ 𝐶) → ((𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐵) ↔ (𝑥 ∈ 𝐵 → ¬ 𝑥 ∈ 𝐴)))
74, 6anbi12d 644 . . . . 5 ((𝐴 ⊆ 𝐶 ∧ 𝐵 ⊆ 𝐶) → (((𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐶) ∧ (𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐵)) ↔ ((𝑥 ∈ 𝐵 → 𝑥 ∈ 𝐶) ∧ (𝑥 ∈ 𝐵 → ¬ 𝑥 ∈ 𝐴))))
8 jcab 527 . . . . 5 ((𝑥 ∈ 𝐴 → (𝑥 ∈ 𝐶 ∧ ¬ 𝑥 ∈ 𝐵)) ↔ ((𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐶) ∧ (𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐵)))
9 jcab 527 . . . . 5 ((𝑥 ∈ 𝐵 → (𝑥 ∈ 𝐶 ∧ ¬ 𝑥 ∈ 𝐴)) ↔ ((𝑥 ∈ 𝐵 → 𝑥 ∈ 𝐶) ∧ (𝑥 ∈ 𝐵 → ¬ 𝑥 ∈ 𝐴)))
107, 8, 93bitr4g 317 . . . 4 ((𝐴 ⊆ 𝐶 ∧ 𝐵 ⊆ 𝐶) → ((𝑥 ∈ 𝐴 → (𝑥 ∈ 𝐶 ∧ ¬ 𝑥 ∈ 𝐵)) ↔ (𝑥 ∈ 𝐵 → (𝑥 ∈ 𝐶 ∧ ¬ 𝑥 ∈ 𝐴))))
11 eldif 4052 . . . . 5 (𝑥 ∈ (𝐶 ∖ 𝐵) ↔ (𝑥 ∈ 𝐶 ∧ ¬ 𝑥 ∈ 𝐵))
1211imbi2i 339 . . . 4 ((𝑥 ∈ 𝐴 → 𝑥 ∈ (𝐶 ∖ 𝐵)) ↔ (𝑥 ∈ 𝐴 → (𝑥 ∈ 𝐶 ∧ ¬ 𝑥 ∈ 𝐵)))
13 eldif 4052 . . . . 5 (𝑥 ∈ (𝐶 ∖ 𝐴) ↔ (𝑥 ∈ 𝐶 ∧ ¬ 𝑥 ∈ 𝐴))
1413imbi2i 339 . . . 4 ((𝑥 ∈ 𝐵 → 𝑥 ∈ (𝐶 ∖ 𝐴)) ↔ (𝑥 ∈ 𝐵 → (𝑥 ∈ 𝐶 ∧ ¬ 𝑥 ∈ 𝐴)))
1510, 12, 143bitr4g 317 . . 3 ((𝐴 ⊆ 𝐶 ∧ 𝐵 ⊆ 𝐶) → ((𝑥 ∈ 𝐴 → 𝑥 ∈ (𝐶 ∖ 𝐵)) ↔ (𝑥 ∈ 𝐵 → 𝑥 ∈ (𝐶 ∖ 𝐴))))
1615albidv 1955 . 2 ((𝐴 ⊆ 𝐶 ∧ 𝐵 ⊆ 𝐶) → (∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ (𝐶 ∖ 𝐵)) ↔ ∀𝑥(𝑥 ∈ 𝐵 → 𝑥 ∈ (𝐶 ∖ 𝐴))))
17 df-ss 3901 . 2 (𝐴 ⊆ (𝐶 ∖ 𝐵) ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ (𝐶 ∖ 𝐵)))
18 df-ss 3901 . 2 (𝐵 ⊆ (𝐶 ∖ 𝐴) ↔ ∀𝑥(𝑥 ∈ 𝐵 → 𝑥 ∈ (𝐶 ∖ 𝐴)))
1916, 17, 183bitr4g 317 1 ((𝐴 ⊆ 𝐶 ∧ 𝐵 ⊆ 𝐶) → (𝐴 ⊆ (𝐶 ∖ 𝐵) ↔ 𝐵 ⊆ (𝐶 ∖ 𝐴)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   ∈ wcel 2147   ⊆ wss 3900   ∖ cdif 4048
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-v 3456  df-ss 3901  df-dif 4050
This theorem is used by:  pssdifcom1  4448  pssdifcom2  4449  sbthlem1  9142  sbthlem2  9143  rpnnen2lem11  16433  setscom  17399  dpjidcl  20316  clsval2  23412  regsep2  23738  cyc3conja  33807  ordtconnlem1  34660  conss2  45680
  Copyright terms: Public domain W3C validator