![]() |
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 5994 | . 2 ⊢ (((𝑥 ∈ 𝐴 ↦ 𝐶) ↾ 𝐴) ↾ 𝐵) = ((𝑥 ∈ 𝐴 ↦ 𝐶) ↾ (𝐴 ∩ 𝐵)) | |
2 | ssid 4004 | . . . 4 ⊢ 𝐴 ⊆ 𝐴 | |
3 | resmpt 6037 | . . . 4 ⊢ (𝐴 ⊆ 𝐴 → ((𝑥 ∈ 𝐴 ↦ 𝐶) ↾ 𝐴) = (𝑥 ∈ 𝐴 ↦ 𝐶)) | |
4 | 2, 3 | ax-mp 5 | . . 3 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐶) ↾ 𝐴) = (𝑥 ∈ 𝐴 ↦ 𝐶) |
5 | 4 | reseq1i 5977 | . 2 ⊢ (((𝑥 ∈ 𝐴 ↦ 𝐶) ↾ 𝐴) ↾ 𝐵) = ((𝑥 ∈ 𝐴 ↦ 𝐶) ↾ 𝐵) |
6 | inss1 4228 | . . 3 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐴 | |
7 | resmpt 6037 | . . 3 ⊢ ((𝐴 ∩ 𝐵) ⊆ 𝐴 → ((𝑥 ∈ 𝐴 ↦ 𝐶) ↾ (𝐴 ∩ 𝐵)) = (𝑥 ∈ (𝐴 ∩ 𝐵) ↦ 𝐶)) | |
8 | 6, 7 | ax-mp 5 | . 2 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐶) ↾ (𝐴 ∩ 𝐵)) = (𝑥 ∈ (𝐴 ∩ 𝐵) ↦ 𝐶) |
9 | 1, 5, 8 | 3eqtr3i 2767 | 1 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐶) ↾ 𝐵) = (𝑥 ∈ (𝐴 ∩ 𝐵) ↦ 𝐶) |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1540 ∩ cin 3947 ⊆ wss 3948 ↦ cmpt 5231 ↾ cres 5678 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-12 2170 ax-ext 2702 ax-sep 5299 ax-nul 5306 ax-pr 5427 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-clab 2709 df-cleq 2723 df-clel 2809 df-rab 3432 df-v 3475 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-nul 4323 df-if 4529 df-sn 4629 df-pr 4631 df-op 4635 df-opab 5211 df-mpt 5232 df-xp 5682 df-rel 5683 df-res 5688 |
This theorem is referenced by: mptima 6071 offres 7974 lo1resb 15515 o1resb 15517 measinb2 33687 eulerpartgbij 33837 imassmpt 44429 limsupresicompt 44934 liminfresicompt 44958 |
Copyright terms: Public domain | W3C validator |