| 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 4330 | . . . 4 ⊢ (V ∖ ∅) = V | |
| 2 | 0iun 5018 | . . . . 5 ⊢ ∪ 𝑥 ∈ ∅ 𝐵 = ∅ | |
| 3 | 2 | difeq2i 4075 | . . . 4 ⊢ (V ∖ ∪ 𝑥 ∈ ∅ 𝐵) = (V ∖ ∅) |
| 4 | 0iin 5019 | . . . 4 ⊢ ∩ 𝑥 ∈ ∅ (V ∖ 𝐵) = V | |
| 5 | 1, 3, 4 | 3eqtr4ri 2770 | . . 3 ⊢ ∩ 𝑥 ∈ ∅ (V ∖ 𝐵) = (V ∖ ∪ 𝑥 ∈ ∅ 𝐵) |
| 6 | iineq1 4964 | . . 3 ⊢ (𝐴 = ∅ → ∩ 𝑥 ∈ 𝐴 (V ∖ 𝐵) = ∩ 𝑥 ∈ ∅ (V ∖ 𝐵)) | |
| 7 | iuneq1 4963 | . . . 4 ⊢ (𝐴 = ∅ → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ 𝑥 ∈ ∅ 𝐵) | |
| 8 | 7 | difeq2d 4078 | . . 3 ⊢ (𝐴 = ∅ → (V ∖ ∪ 𝑥 ∈ 𝐴 𝐵) = (V ∖ ∪ 𝑥 ∈ ∅ 𝐵)) |
| 9 | 5, 6, 8 | 3eqtr4a 2797 | . 2 ⊢ (𝐴 = ∅ → ∩ 𝑥 ∈ 𝐴 (V ∖ 𝐵) = (V ∖ ∪ 𝑥 ∈ 𝐴 𝐵)) |
| 10 | iindif2 5032 | . 2 ⊢ (𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 (V ∖ 𝐵) = (V ∖ ∪ 𝑥 ∈ 𝐴 𝐵)) | |
| 11 | 9, 10 | pm2.61ine 3015 | 1 ⊢ ∩ 𝑥 ∈ 𝐴 (V ∖ 𝐵) = (V ∖ ∪ 𝑥 ∈ 𝐴 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1541 Vcvv 3440 ∖ cdif 3898 ∅c0 4285 ∪ ciun 4946 ∩ ciin 4947 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-12 2184 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-clab 2715 df-cleq 2728 df-clel 2811 df-ne 2933 df-ral 3052 df-rex 3061 df-rab 3400 df-v 3442 df-dif 3904 df-ss 3918 df-nul 4286 df-iun 4948 df-iin 4949 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |