ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  ssconb GIF version

Theorem ssconb 3362
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 3242 . . . . . . 7 (𝐴 ⊆ 𝐶 → (𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐶))
2 ssel 3242 . . . . . . 7 (𝐵 ⊆ 𝐶 → (𝑥 ∈ 𝐵 → 𝑥 ∈ 𝐶))
3 pm5.1 609 . . . . . . 7 (((𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐶) ∧ (𝑥 ∈ 𝐵 → 𝑥 ∈ 𝐶)) → ((𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐶) ↔ (𝑥 ∈ 𝐵 → 𝑥 ∈ 𝐶)))
41, 2, 3syl2an 289 . . . . . 6 ((𝐴 ⊆ 𝐶 ∧ 𝐵 ⊆ 𝐶) → ((𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐶) ↔ (𝑥 ∈ 𝐵 → 𝑥 ∈ 𝐶)))
5 con2b 679 . . . . . . 7 ((𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐵) ↔ (𝑥 ∈ 𝐵 → ¬ 𝑥 ∈ 𝐴))
65a1i 9 . . . . . 6 ((𝐴 ⊆ 𝐶 ∧ 𝐵 ⊆ 𝐶) → ((𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐵) ↔ (𝑥 ∈ 𝐵 → ¬ 𝑥 ∈ 𝐴)))
74, 6anbi12d 477 . . . . 5 ((𝐴 ⊆ 𝐶 ∧ 𝐵 ⊆ 𝐶) → (((𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐶) ∧ (𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐵)) ↔ ((𝑥 ∈ 𝐵 → 𝑥 ∈ 𝐶) ∧ (𝑥 ∈ 𝐵 → ¬ 𝑥 ∈ 𝐴))))
8 jcab 611 . . . . 5 ((𝑥 ∈ 𝐴 → (𝑥 ∈ 𝐶 ∧ ¬ 𝑥 ∈ 𝐵)) ↔ ((𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐶) ∧ (𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐵)))
9 jcab 611 . . . . 5 ((𝑥 ∈ 𝐵 → (𝑥 ∈ 𝐶 ∧ ¬ 𝑥 ∈ 𝐴)) ↔ ((𝑥 ∈ 𝐵 → 𝑥 ∈ 𝐶) ∧ (𝑥 ∈ 𝐵 → ¬ 𝑥 ∈ 𝐴)))
107, 8, 93bitr4g 223 . . . 4 ((𝐴 ⊆ 𝐶 ∧ 𝐵 ⊆ 𝐶) → ((𝑥 ∈ 𝐴 → (𝑥 ∈ 𝐶 ∧ ¬ 𝑥 ∈ 𝐵)) ↔ (𝑥 ∈ 𝐵 → (𝑥 ∈ 𝐶 ∧ ¬ 𝑥 ∈ 𝐴))))
11 eldif 3229 . . . . 5 (𝑥 ∈ (𝐶 ∖ 𝐵) ↔ (𝑥 ∈ 𝐶 ∧ ¬ 𝑥 ∈ 𝐵))
1211imbi2i 226 . . . 4 ((𝑥 ∈ 𝐴 → 𝑥 ∈ (𝐶 ∖ 𝐵)) ↔ (𝑥 ∈ 𝐴 → (𝑥 ∈ 𝐶 ∧ ¬ 𝑥 ∈ 𝐵)))
13 eldif 3229 . . . . 5 (𝑥 ∈ (𝐶 ∖ 𝐴) ↔ (𝑥 ∈ 𝐶 ∧ ¬ 𝑥 ∈ 𝐴))
1413imbi2i 226 . . . 4 ((𝑥 ∈ 𝐵 → 𝑥 ∈ (𝐶 ∖ 𝐴)) ↔ (𝑥 ∈ 𝐵 → (𝑥 ∈ 𝐶 ∧ ¬ 𝑥 ∈ 𝐴)))
1510, 12, 143bitr4g 223 . . 3 ((𝐴 ⊆ 𝐶 ∧ 𝐵 ⊆ 𝐶) → ((𝑥 ∈ 𝐴 → 𝑥 ∈ (𝐶 ∖ 𝐵)) ↔ (𝑥 ∈ 𝐵 → 𝑥 ∈ (𝐶 ∖ 𝐴))))
1615albidv 1877 . 2 ((𝐴 ⊆ 𝐶 ∧ 𝐵 ⊆ 𝐶) → (∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ (𝐶 ∖ 𝐵)) ↔ ∀𝑥(𝑥 ∈ 𝐵 → 𝑥 ∈ (𝐶 ∖ 𝐴))))
17 ssalel 3235 . 2 (𝐴 ⊆ (𝐶 ∖ 𝐵) ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ (𝐶 ∖ 𝐵)))
18 ssalel 3235 . 2 (𝐵 ⊆ (𝐶 ∖ 𝐴) ↔ ∀𝑥(𝑥 ∈ 𝐵 → 𝑥 ∈ (𝐶 ∖ 𝐴)))
1916, 17, 183bitr4g 223 1 ((𝐴 ⊆ 𝐶 ∧ 𝐵 ⊆ 𝐶) → (𝐴 ⊆ (𝐶 ∖ 𝐵) ↔ 𝐵 ⊆ (𝐶 ∖ 𝐴)))
Colors of variables:    wff set class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105  ∀wal 1400   ∈ wcel 2209   ∖ cdif 3217   ⊆ wss 3220
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This proof depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-v 2823  df-dif 3222  df-in 3226  df-ss 3233
This theorem is used by:  sbthlem1  7274  sbthlem2  7275  setscom  13444
  Copyright terms: Public domain W3C validator