| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > resabs2 | Structured version Visualization version GIF version | ||
| Description: Absorption law for restriction. (Contributed by NM, 27-Mar-1998.) |
| Ref | Expression |
|---|---|
| resabs2 | ⊢ (𝐵 ⊆ 𝐶 → ((𝐴 ↾ 𝐵) ↾ 𝐶) = (𝐴 ↾ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rescom 5992 | . 2 ⊢ ((𝐴 ↾ 𝐵) ↾ 𝐶) = ((𝐴 ↾ 𝐶) ↾ 𝐵) | |
| 2 | resabs1 5996 | . 2 ⊢ (𝐵 ⊆ 𝐶 → ((𝐴 ↾ 𝐶) ↾ 𝐵) = (𝐴 ↾ 𝐵)) | |
| 3 | 1, 2 | eqtrid 2812 | 1 ⊢ (𝐵 ⊆ 𝐶 → ((𝐴 ↾ 𝐵) ↾ 𝐶) = (𝐴 ↾ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1563 ⊆ wss 3907 ↾ cres 5654 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-ext 2737 ax-sep 5251 ax-pr 5395 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-sb 2094 df-clab 2744 df-cleq 2757 df-clel 2840 df-ral 3080 df-rex 3090 df-rab 3418 df-v 3459 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-nul 4289 df-if 4484 df-sn 4586 df-pr 4588 df-op 4592 df-opab 5168 df-xp 5658 df-rel 5659 df-res 5664 |
| This theorem is referenced by: residm 6000 fresaunres2 6740 resabs2i 45716 resabs2d 45976 fourierdlem104 46782 fouriersw 46803 |
| Copyright terms: Public domain | W3C validator |