| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > resiun1 | GIF version | ||
| Description: Distribution of restriction over indexed union. (Contributed by Mario Carneiro, 29-May-2015.) |
| Ref | Expression |
|---|---|
| resiun1 | ⊢ (∪ 𝑥 ∈ 𝐴 𝐵 ↾ 𝐶) = ∪ 𝑥 ∈ 𝐴 (𝐵 ↾ 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | iunin2 4005 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 ((𝐶 × V) ∩ 𝐵) = ((𝐶 × V) ∩ ∪ 𝑥 ∈ 𝐴 𝐵) | |
| 2 | df-res 4705 | . . . . 5 ⊢ (𝐵 ↾ 𝐶) = (𝐵 ∩ (𝐶 × V)) | |
| 3 | incom 3373 | . . . . 5 ⊢ (𝐵 ∩ (𝐶 × V)) = ((𝐶 × V) ∩ 𝐵) | |
| 4 | 2, 3 | eqtri 2228 | . . . 4 ⊢ (𝐵 ↾ 𝐶) = ((𝐶 × V) ∩ 𝐵) |
| 5 | 4 | a1i 9 | . . 3 ⊢ (𝑥 ∈ 𝐴 → (𝐵 ↾ 𝐶) = ((𝐶 × V) ∩ 𝐵)) |
| 6 | 5 | iuneq2i 3959 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 (𝐵 ↾ 𝐶) = ∪ 𝑥 ∈ 𝐴 ((𝐶 × V) ∩ 𝐵) |
| 7 | df-res 4705 | . . 3 ⊢ (∪ 𝑥 ∈ 𝐴 𝐵 ↾ 𝐶) = (∪ 𝑥 ∈ 𝐴 𝐵 ∩ (𝐶 × V)) | |
| 8 | incom 3373 | . . 3 ⊢ (∪ 𝑥 ∈ 𝐴 𝐵 ∩ (𝐶 × V)) = ((𝐶 × V) ∩ ∪ 𝑥 ∈ 𝐴 𝐵) | |
| 9 | 7, 8 | eqtri 2228 | . 2 ⊢ (∪ 𝑥 ∈ 𝐴 𝐵 ↾ 𝐶) = ((𝐶 × V) ∩ ∪ 𝑥 ∈ 𝐴 𝐵) |
| 10 | 1, 6, 9 | 3eqtr4ri 2239 | 1 ⊢ (∪ 𝑥 ∈ 𝐴 𝐵 ↾ 𝐶) = ∪ 𝑥 ∈ 𝐴 (𝐵 ↾ 𝐶) |
| Colors of variables: wff set class |
| Syntax hints: = wceq 1373 ∈ wcel 2178 Vcvv 2776 ∩ cin 3173 ∪ ciun 3941 × cxp 4691 ↾ cres 4695 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-ext 2189 |
| This theorem depends on definitions: df-bi 117 df-tru 1376 df-nf 1485 df-sb 1787 df-clab 2194 df-cleq 2200 df-clel 2203 df-nfc 2339 df-ral 2491 df-rex 2492 df-v 2778 df-in 3180 df-ss 3187 df-iun 3943 df-res 4705 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |