| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > resindi | Structured version Visualization version GIF version | ||
| Description: Class restriction distributes over intersection. (Contributed by FL, 6-Oct-2008.) |
| Ref | Expression |
|---|---|
| resindi | ⊢ (𝐴 ↾ (𝐵 ∩ 𝐶)) = ((𝐴 ↾ 𝐵) ∩ (𝐴 ↾ 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | xpindir 5798 | . . . 4 ⊢ ((𝐵 ∩ 𝐶) × V) = ((𝐵 × V) ∩ (𝐶 × V)) | |
| 2 | 1 | ineq2i 4180 | . . 3 ⊢ (𝐴 ∩ ((𝐵 ∩ 𝐶) × V)) = (𝐴 ∩ ((𝐵 × V) ∩ (𝐶 × V))) |
| 3 | inindi 4198 | . . 3 ⊢ (𝐴 ∩ ((𝐵 × V) ∩ (𝐶 × V))) = ((𝐴 ∩ (𝐵 × V)) ∩ (𝐴 ∩ (𝐶 × V))) | |
| 4 | 2, 3 | eqtri 2752 | . 2 ⊢ (𝐴 ∩ ((𝐵 ∩ 𝐶) × V)) = ((𝐴 ∩ (𝐵 × V)) ∩ (𝐴 ∩ (𝐶 × V))) |
| 5 | df-res 5650 | . 2 ⊢ (𝐴 ↾ (𝐵 ∩ 𝐶)) = (𝐴 ∩ ((𝐵 ∩ 𝐶) × V)) | |
| 6 | df-res 5650 | . . 3 ⊢ (𝐴 ↾ 𝐵) = (𝐴 ∩ (𝐵 × V)) | |
| 7 | df-res 5650 | . . 3 ⊢ (𝐴 ↾ 𝐶) = (𝐴 ∩ (𝐶 × V)) | |
| 8 | 6, 7 | ineq12i 4181 | . 2 ⊢ ((𝐴 ↾ 𝐵) ∩ (𝐴 ↾ 𝐶)) = ((𝐴 ∩ (𝐵 × V)) ∩ (𝐴 ∩ (𝐶 × V))) |
| 9 | 4, 5, 8 | 3eqtr4i 2762 | 1 ⊢ (𝐴 ↾ (𝐵 ∩ 𝐶)) = ((𝐴 ↾ 𝐵) ∩ (𝐴 ↾ 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1540 Vcvv 3447 ∩ cin 3913 × cxp 5636 ↾ cres 5640 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pr 5387 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2066 df-clab 2708 df-cleq 2721 df-clel 2803 df-ral 3045 df-rex 3054 df-rab 3406 df-v 3449 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-nul 4297 df-if 4489 df-sn 4590 df-pr 4592 df-op 4596 df-opab 5170 df-xp 5644 df-rel 5645 df-res 5650 |
| This theorem is referenced by: resindm 6001 gsum2dlem2 19901 fnresin 32550 fressupp 32611 disjresdisj 38229 |
| Copyright terms: Public domain | W3C validator |