| 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 4334 | . . . 4 ⊢ (V ∖ ∅) = V | |
| 2 | 0iun 5029 | . . . . 5 ⊢ ∪ 𝑥 ∈ ∅ 𝐵 = ∅ | |
| 3 | 2 | difeq2i 4078 | . . . 4 ⊢ (V ∖ ∪ 𝑥 ∈ ∅ 𝐵) = (V ∖ ∅) |
| 4 | 0iin 5030 | . . . 4 ⊢ ∩ 𝑥 ∈ ∅ (V ∖ 𝐵) = V | |
| 5 | 1, 3, 4 | 3eqtr4ri 2799 | . . 3 ⊢ ∩ 𝑥 ∈ ∅ (V ∖ 𝐵) = (V ∖ ∪ 𝑥 ∈ ∅ 𝐵) |
| 6 | iineq1 4976 | . . 3 ⊢ (𝐴 = ∅ → ∩ 𝑥 ∈ 𝐴 (V ∖ 𝐵) = ∩ 𝑥 ∈ ∅ (V ∖ 𝐵)) | |
| 7 | iuneq1 4975 | . . . 4 ⊢ (𝐴 = ∅ → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ 𝑥 ∈ ∅ 𝐵) | |
| 8 | 7 | difeq2d 4081 | . . 3 ⊢ (𝐴 = ∅ → (V ∖ ∪ 𝑥 ∈ 𝐴 𝐵) = (V ∖ ∪ 𝑥 ∈ ∅ 𝐵)) |
| 9 | 5, 6, 8 | 3eqtr4a 2826 | . 2 ⊢ (𝐴 = ∅ → ∩ 𝑥 ∈ 𝐴 (V ∖ 𝐵) = (V ∖ ∪ 𝑥 ∈ 𝐴 𝐵)) |
| 10 | iindif2 5045 | . 2 ⊢ (𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 (V ∖ 𝐵) = (V ∖ ∪ 𝑥 ∈ 𝐴 𝐵)) | |
| 11 | 9, 10 | pm2.61ine 3043 | 1 ⊢ ∩ 𝑥 ∈ 𝐴 (V ∖ 𝐵) = (V ∖ ∪ 𝑥 ∈ 𝐴 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 Vcvv 3457 ∖ cdif 3903 ∅c0 4286 ∪ ciun 4958 ∩ ciin 4959 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-12 2216 ax-ext 2737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-clab 2744 df-cleq 2757 df-clel 2840 df-ne 2961 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-dif 3909 df-ss 3923 df-nul 4287 df-iun 4960 df-iin 4961 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |