![]() |
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 4220 | . . 3 ⊢ (𝐵 ∩ 𝐶) = (𝐶 ∩ 𝐵) | |
2 | 1 | reseq2i 6001 | . 2 ⊢ (𝐴 ↾ (𝐵 ∩ 𝐶)) = (𝐴 ↾ (𝐶 ∩ 𝐵)) |
3 | resres 6017 | . 2 ⊢ ((𝐴 ↾ 𝐵) ↾ 𝐶) = (𝐴 ↾ (𝐵 ∩ 𝐶)) | |
4 | resres 6017 | . 2 ⊢ ((𝐴 ↾ 𝐶) ↾ 𝐵) = (𝐴 ↾ (𝐶 ∩ 𝐵)) | |
5 | 2, 3, 4 | 3eqtr4i 2775 | 1 ⊢ ((𝐴 ↾ 𝐵) ↾ 𝐶) = ((𝐴 ↾ 𝐶) ↾ 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1539 ∩ cin 3965 ↾ cres 5695 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2708 ax-sep 5305 ax-nul 5315 ax-pr 5441 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1542 df-fal 1552 df-ex 1779 df-sb 2065 df-clab 2715 df-cleq 2729 df-clel 2816 df-ral 3062 df-rex 3071 df-rab 3437 df-v 3483 df-dif 3969 df-un 3971 df-in 3973 df-ss 3983 df-nul 4343 df-if 4535 df-sn 4635 df-pr 4637 df-op 4641 df-opab 5214 df-xp 5699 df-rel 5700 df-res 5705 |
This theorem is referenced by: resabs2 6034 setscom 17223 dvres3a 25975 cpnres 25999 dvmptres3 26020 limsupresuz 45687 liminfresuz 45768 |
Copyright terms: Public domain | W3C validator |