Theorem iundifdif 33255

Description: The intersection of a set is the complement of the union of the complements. TODO: shorten using iundifdifd 33254. (Contributed by Thierry Arnoux, 4-Sep-2016.)

Hypotheses

Ref	Expression
iundifdif.o	⊢ 𝑂 ∈ V
iundifdif.2	⊢ 𝐴 ⊆ 𝒫 𝑂

Assertion

Ref	Expression
iundifdif	⊢ (𝐴 ≠ ∅ → ∩ 𝐴 = (𝑂 ∖ ∪ 𝑥 ∈ 𝐴 (𝑂 ∖ 𝑥)))

Distinct variable groups:   𝑥,𝐴   𝑥,𝑂

Proof of Theorem iundifdif

Step	Hyp	Ref	Expression
1		iundif2 5037	. . . 4 ⊢ ∪ 𝑥 ∈ 𝐴 (𝑂 ∖ 𝑥) = (𝑂 ∖ ∩ 𝑥 ∈ 𝐴 𝑥)
2		intiin 5023	. . . . 5 ⊢ ∩ 𝐴 = ∩ 𝑥 ∈ 𝐴 𝑥
3	2	difeq2i 4063	. . . 4 ⊢ (𝑂 ∖ ∩ 𝐴) = (𝑂 ∖ ∩ 𝑥 ∈ 𝐴 𝑥)
4	1, 3	eqtr4i 2789	. . 3 ⊢ ∪ 𝑥 ∈ 𝐴 (𝑂 ∖ 𝑥) = (𝑂 ∖ ∩ 𝐴)
5	4	difeq2i 4063	. 2 ⊢ (𝑂 ∖ ∪ 𝑥 ∈ 𝐴 (𝑂 ∖ 𝑥)) = (𝑂 ∖ (𝑂 ∖ ∩ 𝐴))
6		iundifdif.2	. . . . 5 ⊢ 𝐴 ⊆ 𝒫 𝑂
7	6	jctl 533	. . . 4 ⊢ (𝐴 ≠ ∅ → (𝐴 ⊆ 𝒫 𝑂 ∧ 𝐴 ≠ ∅))
8		intssuni2 4938	. . . 4 ⊢ ((𝐴 ⊆ 𝒫 𝑂 ∧ 𝐴 ≠ ∅) → ∩ 𝐴 ⊆ ∪ 𝒫 𝑂)
9		unipw 5425	. . . . . 6 ⊢ ∪ 𝒫 𝑂 = 𝑂
10	9	sseq2i 3942	. . . . 5 ⊢ (∩ 𝐴 ⊆ ∪ 𝒫 𝑂 ↔ ∩ 𝐴 ⊆ 𝑂)
11	10	biimpi 219	. . . 4 ⊢ (∩ 𝐴 ⊆ ∪ 𝒫 𝑂 → ∩ 𝐴 ⊆ 𝑂)
12	7, 8, 11	3syl 19	. . 3 ⊢ (𝐴 ≠ ∅ → ∩ 𝐴 ⊆ 𝑂)
13		dfss4 4217	. . 3 ⊢ (∩ 𝐴 ⊆ 𝑂 ↔ (𝑂 ∖ (𝑂 ∖ ∩ 𝐴)) = ∩ 𝐴)
14	12, 13	sylib 221	. 2 ⊢ (𝐴 ≠ ∅ → (𝑂 ∖ (𝑂 ∖ ∩ 𝐴)) = ∩ 𝐴)
15	5, 14	eqtr2id 2811	1 ⊢ (𝐴 ≠ ∅ → ∩ 𝐴 = (𝑂 ∖ ∪ 𝑥 ∈ 𝐴 (𝑂 ∖ 𝑥)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  Vcvv 3454   ⊆ wss 3900   ∖ cdif 4048  ∅c0 4281  𝒫 cpw 4560  ∪ cuni 4872  ∩ cint 4912  ∪ ciun 4956  ∩ ciin 4957

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  ax-sep 5255  ax-pr 5398

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-pw 4562  df-sn 4589  df-pr 4591  df-uni 4873  df-int 4913  df-iun 4958  df-iin 4959

This theorem is used by: (None)