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

Theorem difin2 3196
Description: Represent a set difference as an intersection with a larger difference. (Contributed by Jeff Madsen, 2-Sep-2009.)
Assertion
Ref Expression
difin2 (𝐴𝐶 → (𝐴𝐵) = ((𝐶𝐵) ∩ 𝐴))

Proof of Theorem difin2
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 ssel 2936 . . . . 5 (𝐴𝐶 → (𝑥𝐴𝑥𝐶))
21pm4.71d 373 . . . 4 (𝐴𝐶 → (𝑥𝐴 ↔ (𝑥𝐴𝑥𝐶)))
32anbi1d 438 . . 3 (𝐴𝐶 → ((𝑥𝐴 ∧ ¬ 𝑥𝐵) ↔ ((𝑥𝐴𝑥𝐶) ∧ ¬ 𝑥𝐵)))
4 eldif 2924 . . 3 (𝑥 ∈ (𝐴𝐵) ↔ (𝑥𝐴 ∧ ¬ 𝑥𝐵))
5 elin 3123 . . . 4 (𝑥 ∈ ((𝐶𝐵) ∩ 𝐴) ↔ (𝑥 ∈ (𝐶𝐵) ∧ 𝑥𝐴))
6 eldif 2924 . . . . 5 (𝑥 ∈ (𝐶𝐵) ↔ (𝑥𝐶 ∧ ¬ 𝑥𝐵))
76anbi1i 431 . . . 4 ((𝑥 ∈ (𝐶𝐵) ∧ 𝑥𝐴) ↔ ((𝑥𝐶 ∧ ¬ 𝑥𝐵) ∧ 𝑥𝐴))
8 ancom 253 . . . . 5 (((𝑥𝐶 ∧ ¬ 𝑥𝐵) ∧ 𝑥𝐴) ↔ (𝑥𝐴 ∧ (𝑥𝐶 ∧ ¬ 𝑥𝐵)))
9 anass 381 . . . . 5 (((𝑥𝐴𝑥𝐶) ∧ ¬ 𝑥𝐵) ↔ (𝑥𝐴 ∧ (𝑥𝐶 ∧ ¬ 𝑥𝐵)))
108, 9bitr4i 176 . . . 4 (((𝑥𝐶 ∧ ¬ 𝑥𝐵) ∧ 𝑥𝐴) ↔ ((𝑥𝐴𝑥𝐶) ∧ ¬ 𝑥𝐵))
115, 7, 103bitri 195 . . 3 (𝑥 ∈ ((𝐶𝐵) ∩ 𝐴) ↔ ((𝑥𝐴𝑥𝐶) ∧ ¬ 𝑥𝐵))
123, 4, 113bitr4g 212 . 2 (𝐴𝐶 → (𝑥 ∈ (𝐴𝐵) ↔ 𝑥 ∈ ((𝐶𝐵) ∩ 𝐴)))
1312eqrdv 2038 1 (𝐴𝐶 → (𝐴𝐵) = ((𝐶𝐵) ∩ 𝐴))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 97   = wceq 1243  wcel 1393  cdif 2911  cin 2913  wss 2914
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in1 544  ax-in2 545  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022
This theorem depends on definitions:  df-bi 110  df-tru 1246  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-v 2556  df-dif 2917  df-in 2921  df-ss 2928
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator