| 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 5037 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 (𝐵 ∩ (𝐶 × V)) = (∪ 𝑥 ∈ 𝐴 𝐵 ∩ (𝐶 × V)) | |
| 2 | df-res 5675 | . . . 4 ⊢ (𝐵 ↾ 𝐶) = (𝐵 ∩ (𝐶 × V)) | |
| 3 | 2 | a1i 11 | . . 3 ⊢ (𝑥 ∈ 𝐴 → (𝐵 ↾ 𝐶) = (𝐵 ∩ (𝐶 × V))) |
| 4 | 3 | iuneq2i 4979 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 (𝐵 ↾ 𝐶) = ∪ 𝑥 ∈ 𝐴 (𝐵 ∩ (𝐶 × V)) |
| 5 | df-res 5675 | . 2 ⊢ (∪ 𝑥 ∈ 𝐴 𝐵 ↾ 𝐶) = (∪ 𝑥 ∈ 𝐴 𝐵 ∩ (𝐶 × V)) | |
| 6 | 1, 4, 5 | 3eqtr4ri 2797 | 1 ⊢ (∪ 𝑥 ∈ 𝐴 𝐵 ↾ 𝐶) = ∪ 𝑥 ∈ 𝐴 (𝐵 ↾ 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1570 ∈ wcel 2143 Vcvv 3455 ∩ cin 3905 ∪ ciun 4957 × cxp 5661 ↾ cres 5665 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-tru 1573 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-in 3913 df-ss 3923 df-iun 4959 df-res 5675 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |