Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > iinvdif | Structured version Visualization version GIF version |
Description: The indexed intersection of a complement. (Contributed by Gérard Lang, 5-Aug-2018.) |
Ref | Expression |
---|---|
iinvdif | ⊢ ∩ 𝑥 ∈ 𝐴 (V ∖ 𝐵) = (V ∖ ∪ 𝑥 ∈ 𝐴 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dif0 4287 | . . . 4 ⊢ (V ∖ ∅) = V | |
2 | 0iun 4971 | . . . . 5 ⊢ ∪ 𝑥 ∈ ∅ 𝐵 = ∅ | |
3 | 2 | difeq2i 4034 | . . . 4 ⊢ (V ∖ ∪ 𝑥 ∈ ∅ 𝐵) = (V ∖ ∅) |
4 | 0iin 4972 | . . . 4 ⊢ ∩ 𝑥 ∈ ∅ (V ∖ 𝐵) = V | |
5 | 1, 3, 4 | 3eqtr4ri 2776 | . . 3 ⊢ ∩ 𝑥 ∈ ∅ (V ∖ 𝐵) = (V ∖ ∪ 𝑥 ∈ ∅ 𝐵) |
6 | iineq1 4921 | . . 3 ⊢ (𝐴 = ∅ → ∩ 𝑥 ∈ 𝐴 (V ∖ 𝐵) = ∩ 𝑥 ∈ ∅ (V ∖ 𝐵)) | |
7 | iuneq1 4920 | . . . 4 ⊢ (𝐴 = ∅ → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ 𝑥 ∈ ∅ 𝐵) | |
8 | 7 | difeq2d 4037 | . . 3 ⊢ (𝐴 = ∅ → (V ∖ ∪ 𝑥 ∈ 𝐴 𝐵) = (V ∖ ∪ 𝑥 ∈ ∅ 𝐵)) |
9 | 5, 6, 8 | 3eqtr4a 2804 | . 2 ⊢ (𝐴 = ∅ → ∩ 𝑥 ∈ 𝐴 (V ∖ 𝐵) = (V ∖ ∪ 𝑥 ∈ 𝐴 𝐵)) |
10 | iindif2 4985 | . 2 ⊢ (𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 (V ∖ 𝐵) = (V ∖ ∪ 𝑥 ∈ 𝐴 𝐵)) | |
11 | 9, 10 | pm2.61ine 3025 | 1 ⊢ ∩ 𝑥 ∈ 𝐴 (V ∖ 𝐵) = (V ∖ ∪ 𝑥 ∈ 𝐴 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1543 Vcvv 3408 ∖ cdif 3863 ∅c0 4237 ∪ ciun 4904 ∩ ciin 4905 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2112 ax-9 2120 ax-12 2175 ax-ext 2708 |
This theorem depends on definitions: df-bi 210 df-an 400 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2071 df-clab 2715 df-cleq 2729 df-clel 2816 df-ne 2941 df-ral 3066 df-rex 3067 df-rab 3070 df-v 3410 df-dif 3869 df-in 3873 df-ss 3883 df-nul 4238 df-iun 4906 df-iin 4907 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |