Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > resmpt3 | Structured version Visualization version GIF version |
Description: Unconditional restriction of the mapping operation. (Contributed by Stefan O'Rear, 24-Jan-2015.) (Proof shortened by Mario Carneiro, 22-Mar-2015.) |
Ref | Expression |
---|---|
resmpt3 | ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐶) ↾ 𝐵) = (𝑥 ∈ (𝐴 ∩ 𝐵) ↦ 𝐶) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | resres 5893 | . 2 ⊢ (((𝑥 ∈ 𝐴 ↦ 𝐶) ↾ 𝐴) ↾ 𝐵) = ((𝑥 ∈ 𝐴 ↦ 𝐶) ↾ (𝐴 ∩ 𝐵)) | |
2 | ssid 3939 | . . . 4 ⊢ 𝐴 ⊆ 𝐴 | |
3 | resmpt 5934 | . . . 4 ⊢ (𝐴 ⊆ 𝐴 → ((𝑥 ∈ 𝐴 ↦ 𝐶) ↾ 𝐴) = (𝑥 ∈ 𝐴 ↦ 𝐶)) | |
4 | 2, 3 | ax-mp 5 | . . 3 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐶) ↾ 𝐴) = (𝑥 ∈ 𝐴 ↦ 𝐶) |
5 | 4 | reseq1i 5876 | . 2 ⊢ (((𝑥 ∈ 𝐴 ↦ 𝐶) ↾ 𝐴) ↾ 𝐵) = ((𝑥 ∈ 𝐴 ↦ 𝐶) ↾ 𝐵) |
6 | inss1 4159 | . . 3 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐴 | |
7 | resmpt 5934 | . . 3 ⊢ ((𝐴 ∩ 𝐵) ⊆ 𝐴 → ((𝑥 ∈ 𝐴 ↦ 𝐶) ↾ (𝐴 ∩ 𝐵)) = (𝑥 ∈ (𝐴 ∩ 𝐵) ↦ 𝐶)) | |
8 | 6, 7 | ax-mp 5 | . 2 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐶) ↾ (𝐴 ∩ 𝐵)) = (𝑥 ∈ (𝐴 ∩ 𝐵) ↦ 𝐶) |
9 | 1, 5, 8 | 3eqtr3i 2774 | 1 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐶) ↾ 𝐵) = (𝑥 ∈ (𝐴 ∩ 𝐵) ↦ 𝐶) |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1539 ∩ cin 3882 ⊆ wss 3883 ↦ cmpt 5153 ↾ cres 5582 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pr 5347 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-clab 2716 df-cleq 2730 df-clel 2817 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-sn 4559 df-pr 4561 df-op 4565 df-opab 5133 df-mpt 5154 df-xp 5586 df-rel 5587 df-res 5592 |
This theorem is referenced by: mptima 5970 offres 7799 lo1resb 15201 o1resb 15203 measinb2 32091 eulerpartgbij 32239 imassmpt 42699 limsupresicompt 43187 liminfresicompt 43211 |
Copyright terms: Public domain | W3C validator |