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

Theorem ssddif 3465
Description: Double complement and subset. Similar to ddifss 3469 but inside a class 𝐵 instead of the universal class V. In classical logic the subset operation on the right hand side could be an equality (that is, 𝐴 ⊆ 𝐵 ↔ (𝐵 ∖ (𝐵 ∖ 𝐴)) = 𝐴). (Contributed by Jim Kingdon, 24-Jul-2018.)
Assertion
Ref Expression
ssddif (𝐴 ⊆ 𝐵 ↔ 𝐴 ⊆ (𝐵 ∖ (𝐵 ∖ 𝐴)))

Proof of Theorem ssddif
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 ancr 321 . . . . 5 ((𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵) → (𝑥 ∈ 𝐴 → (𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴)))
2 simpr 110 . . . . . . . 8 ((𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐴) → ¬ 𝑥 ∈ 𝐴)
32con2i 636 . . . . . . 7 (𝑥 ∈ 𝐴 → ¬ (𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐴))
43anim2i 342 . . . . . 6 ((𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) → (𝑥 ∈ 𝐵 ∧ ¬ (𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐴)))
5 eldif 3229 . . . . . . 7 (𝑥 ∈ (𝐵 ∖ (𝐵 ∖ 𝐴)) ↔ (𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ (𝐵 ∖ 𝐴)))
6 eldif 3229 . . . . . . . . 9 (𝑥 ∈ (𝐵 ∖ 𝐴) ↔ (𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐴))
76notbii 678 . . . . . . . 8 (¬ 𝑥 ∈ (𝐵 ∖ 𝐴) ↔ ¬ (𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐴))
87anbi2i 461 . . . . . . 7 ((𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ (𝐵 ∖ 𝐴)) ↔ (𝑥 ∈ 𝐵 ∧ ¬ (𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐴)))
95, 8bitri 184 . . . . . 6 (𝑥 ∈ (𝐵 ∖ (𝐵 ∖ 𝐴)) ↔ (𝑥 ∈ 𝐵 ∧ ¬ (𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐴)))
104, 9sylibr 134 . . . . 5 ((𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ (𝐵 ∖ (𝐵 ∖ 𝐴)))
111, 10syl6 33 . . . 4 ((𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵) → (𝑥 ∈ 𝐴 → 𝑥 ∈ (𝐵 ∖ (𝐵 ∖ 𝐴))))
12 eldifi 3351 . . . . 5 (𝑥 ∈ (𝐵 ∖ (𝐵 ∖ 𝐴)) → 𝑥 ∈ 𝐵)
1312imim2i 12 . . . 4 ((𝑥 ∈ 𝐴 → 𝑥 ∈ (𝐵 ∖ (𝐵 ∖ 𝐴))) → (𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵))
1411, 13impbii 126 . . 3 ((𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵) ↔ (𝑥 ∈ 𝐴 → 𝑥 ∈ (𝐵 ∖ (𝐵 ∖ 𝐴))))
1514albii 1523 . 2 (∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵) ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ (𝐵 ∖ (𝐵 ∖ 𝐴))))
16 ssalel 3235 . 2 (𝐴 ⊆ 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵))
17 ssalel 3235 . 2 (𝐴 ⊆ (𝐵 ∖ (𝐵 ∖ 𝐴)) ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ (𝐵 ∖ (𝐵 ∖ 𝐴))))
1815, 16, 173bitr4i 212 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:  ddifss  3469  inssddif  3472
  Copyright terms: Public domain W3C validator