| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > resiun1 | Structured version Visualization version GIF version | ||
| Description: Distribution of restriction over indexed union. (Contributed by Mario Carneiro, 29-May-2015.) (Proof shortened by JJ, 25-Aug-2021.) |
| Ref | Expression |
|---|---|
| resiun1 | ⊢ (∪ 𝑥 ∈ 𝐴 𝐵 ↾ 𝐶) = ∪ 𝑥 ∈ 𝐴 (𝐵 ↾ 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | iunin1 5029 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 (𝐵 ∩ (𝐶 × V)) = (∪ 𝑥 ∈ 𝐴 𝐵 ∩ (𝐶 × V)) | |
| 2 | df-res 5662 | . . . 4 ⊢ (𝐵 ↾ 𝐶) = (𝐵 ∩ (𝐶 × V)) | |
| 3 | 2 | a1i 11 | . . 3 ⊢ (𝑥 ∈ 𝐴 → (𝐵 ↾ 𝐶) = (𝐵 ∩ (𝐶 × V))) |
| 4 | 3 | iuneq2i 4972 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 (𝐵 ↾ 𝐶) = ∪ 𝑥 ∈ 𝐴 (𝐵 ∩ (𝐶 × V)) |
| 5 | df-res 5662 | . 2 ⊢ (∪ 𝑥 ∈ 𝐴 𝐵 ↾ 𝐶) = (∪ 𝑥 ∈ 𝐴 𝐵 ∩ (𝐶 × V)) | |
| 6 | 1, 4, 5 | 3eqtr4ri 2794 | 1 ⊢ (∪ 𝑥 ∈ 𝐴 𝐵 ↾ 𝐶) = ∪ 𝑥 ∈ 𝐴 (𝐵 ↾ 𝐶) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1569 ∈ wcel 2144 Vcvv 3450 ∩ cin 4089 ∪ ciun 4950 × cxp 5648 ↾ cres 5652 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1572 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-ss 3896 df-in 4091 df-iun 4952 df-res 5662 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |