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 5704 | . . . 4 ⊢ ((𝐵 ∩ 𝐶) × V) = ((𝐵 × V) ∩ (𝐶 × V)) | |
2 | 1 | ineq2i 4185 | . . 3 ⊢ (𝐴 ∩ ((𝐵 ∩ 𝐶) × V)) = (𝐴 ∩ ((𝐵 × V) ∩ (𝐶 × V))) |
3 | inindi 4202 | . . 3 ⊢ (𝐴 ∩ ((𝐵 × V) ∩ (𝐶 × V))) = ((𝐴 ∩ (𝐵 × V)) ∩ (𝐴 ∩ (𝐶 × V))) | |
4 | 2, 3 | eqtri 2844 | . 2 ⊢ (𝐴 ∩ ((𝐵 ∩ 𝐶) × V)) = ((𝐴 ∩ (𝐵 × V)) ∩ (𝐴 ∩ (𝐶 × V))) |
5 | df-res 5566 | . 2 ⊢ (𝐴 ↾ (𝐵 ∩ 𝐶)) = (𝐴 ∩ ((𝐵 ∩ 𝐶) × V)) | |
6 | df-res 5566 | . . 3 ⊢ (𝐴 ↾ 𝐵) = (𝐴 ∩ (𝐵 × V)) | |
7 | df-res 5566 | . . 3 ⊢ (𝐴 ↾ 𝐶) = (𝐴 ∩ (𝐶 × V)) | |
8 | 6, 7 | ineq12i 4186 | . 2 ⊢ ((𝐴 ↾ 𝐵) ∩ (𝐴 ↾ 𝐶)) = ((𝐴 ∩ (𝐵 × V)) ∩ (𝐴 ∩ (𝐶 × V))) |
9 | 4, 5, 8 | 3eqtr4i 2854 | 1 ⊢ (𝐴 ↾ (𝐵 ∩ 𝐶)) = ((𝐴 ↾ 𝐵) ∩ (𝐴 ↾ 𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1533 Vcvv 3494 ∩ cin 3934 × cxp 5552 ↾ cres 5556 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5202 ax-nul 5209 ax-pr 5329 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-rab 3147 df-v 3496 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-sn 4567 df-pr 4569 df-op 4573 df-opab 5128 df-xp 5560 df-rel 5561 df-res 5566 |
This theorem is referenced by: resindm 5899 gsum2dlem2 19090 fnresin 30370 |
Copyright terms: Public domain | W3C validator |