Mathbox for Thierry Arnoux < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  iundifdifd Structured version   Visualization version   GIF version

Theorem iundifdifd 28762
 Description: The intersection of a set is the complement of the union of the complements. (Contributed by Thierry Arnoux, 19-Dec-2016.)
Assertion
Ref Expression
iundifdifd (𝐴 ⊆ 𝒫 𝑂 → (𝐴 ≠ ∅ → 𝐴 = (𝑂 𝑥𝐴 (𝑂𝑥))))
Distinct variable groups:   𝑥,𝐴   𝑥,𝑂

Proof of Theorem iundifdifd
StepHypRef Expression
1 iundif2 4523 . . . . 5 𝑥𝐴 (𝑂𝑥) = (𝑂 𝑥𝐴 𝑥)
2 intiin 4510 . . . . . 6 𝐴 = 𝑥𝐴 𝑥
32difeq2i 3687 . . . . 5 (𝑂 𝐴) = (𝑂 𝑥𝐴 𝑥)
41, 3eqtr4i 2635 . . . 4 𝑥𝐴 (𝑂𝑥) = (𝑂 𝐴)
54difeq2i 3687 . . 3 (𝑂 𝑥𝐴 (𝑂𝑥)) = (𝑂 ∖ (𝑂 𝐴))
6 intssuni2 4437 . . . . 5 ((𝐴 ⊆ 𝒫 𝑂𝐴 ≠ ∅) → 𝐴 𝒫 𝑂)
7 unipw 4845 . . . . 5 𝒫 𝑂 = 𝑂
86, 7syl6sseq 3614 . . . 4 ((𝐴 ⊆ 𝒫 𝑂𝐴 ≠ ∅) → 𝐴𝑂)
9 dfss4 3820 . . . 4 ( 𝐴𝑂 ↔ (𝑂 ∖ (𝑂 𝐴)) = 𝐴)
108, 9sylib 207 . . 3 ((𝐴 ⊆ 𝒫 𝑂𝐴 ≠ ∅) → (𝑂 ∖ (𝑂 𝐴)) = 𝐴)
115, 10syl5req 2657 . 2 ((𝐴 ⊆ 𝒫 𝑂𝐴 ≠ ∅) → 𝐴 = (𝑂 𝑥𝐴 (𝑂𝑥)))
1211ex 449 1 (𝐴 ⊆ 𝒫 𝑂 → (𝐴 ≠ ∅ → 𝐴 = (𝑂 𝑥𝐴 (𝑂𝑥))))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 383   = wceq 1475   ≠ wne 2780   ∖ cdif 3537   ⊆ wss 3540  ∅c0 3874  𝒫 cpw 4108  ∪ cuni 4372  ∩ cint 4410  ∪ ciun 4455  ∩ ciin 4456 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-pw 4110  df-sn 4126  df-pr 4128  df-uni 4373  df-int 4411  df-iun 4457  df-iin 4458 This theorem is referenced by:  sigaclci  29522
 Copyright terms: Public domain W3C validator