| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rescom | Structured version Visualization version GIF version | ||
| Description: Commutative law for restriction. (Contributed by NM, 27-Mar-1998.) |
| Ref | Expression |
|---|---|
| rescom | ⊢ ((𝐴 ↾ 𝐵) ↾ 𝐶) = ((𝐴 ↾ 𝐶) ↾ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | incom 4149 | . . 3 ⊢ (𝐵 ∩ 𝐶) = (𝐶 ∩ 𝐵) | |
| 2 | 1 | reseq2i 5941 | . 2 ⊢ (𝐴 ↾ (𝐵 ∩ 𝐶)) = (𝐴 ↾ (𝐶 ∩ 𝐵)) |
| 3 | resres 5957 | . 2 ⊢ ((𝐴 ↾ 𝐵) ↾ 𝐶) = (𝐴 ↾ (𝐵 ∩ 𝐶)) | |
| 4 | resres 5957 | . 2 ⊢ ((𝐴 ↾ 𝐶) ↾ 𝐵) = (𝐴 ↾ (𝐶 ∩ 𝐵)) | |
| 5 | 2, 3, 4 | 3eqtr4i 2769 | 1 ⊢ ((𝐴 ↾ 𝐵) ↾ 𝐶) = ((𝐴 ↾ 𝐶) ↾ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1542 ∩ cin 3888 ↾ cres 5633 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2708 ax-sep 5231 ax-pr 5375 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2715 df-cleq 2728 df-clel 2811 df-ral 3052 df-rex 3062 df-rab 3390 df-v 3431 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-sn 4568 df-pr 4570 df-op 4574 df-opab 5148 df-xp 5637 df-rel 5638 df-res 5643 |
| This theorem is referenced by: resabs2 5974 setscom 17150 dvres3a 25881 cpnres 25904 dvmptres3 25923 limsupresuz 46131 liminfresuz 46212 tposresg 49353 |
| Copyright terms: Public domain | W3C validator |