MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  resmpt3 Structured version   Visualization version   GIF version

Theorem resmpt3 6023
Description: Unconditional restriction of the mapping operation. (Contributed by Stefan O'Rear, 24-Jan-2015.) (Proof shortened by Mario Carneiro, 22-Mar-2015.)
Assertion
Ref Expression
resmpt3 ((𝑥𝐴𝐶) ↾ 𝐵) = (𝑥 ∈ (𝐴𝐵) ↦ 𝐶)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵
Allowed substitution hint:   𝐶(𝑥)

Proof of Theorem resmpt3
StepHypRef Expression
1 resres 5974 . 2 (((𝑥𝐴𝐶) ↾ 𝐴) ↾ 𝐵) = ((𝑥𝐴𝐶) ↾ (𝐴𝐵))
2 ssid 3956 . . . 4 𝐴𝐴
3 resmpt 6022 . . . 4 (𝐴𝐴 → ((𝑥𝐴𝐶) ↾ 𝐴) = (𝑥𝐴𝐶))
42, 3ax-mp 5 . . 3 ((𝑥𝐴𝐶) ↾ 𝐴) = (𝑥𝐴𝐶)
54reseq1i 5957 . 2 (((𝑥𝐴𝐶) ↾ 𝐴) ↾ 𝐵) = ((𝑥𝐴𝐶) ↾ 𝐵)
6 inss1 4186 . . 3 (𝐴𝐵) ⊆ 𝐴
7 resmpt 6022 . . 3 ((𝐴𝐵) ⊆ 𝐴 → ((𝑥𝐴𝐶) ↾ (𝐴𝐵)) = (𝑥 ∈ (𝐴𝐵) ↦ 𝐶))
86, 7ax-mp 5 . 2 ((𝑥𝐴𝐶) ↾ (𝐴𝐵)) = (𝑥 ∈ (𝐴𝐵) ↦ 𝐶)
91, 5, 83eqtr3i 2792 1 ((𝑥𝐴𝐶) ↾ 𝐵) = (𝑥 ∈ (𝐴𝐵) ↦ 𝐶)
Colors of variables: wff setvar class
Syntax hints:   = wceq 1559  cin 3901  wss 3902  cmpt 5178  cres 5645
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-12 2211  ax-ext 2733  ax-sep 5243  ax-pr 5387
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4478  df-sn 4580  df-pr 4582  df-op 4586  df-opab 5160  df-mpt 5179  df-xp 5649  df-rel 5650  df-res 5655
This theorem is referenced by:  mptima  6057  offres  7959  lo1resb  15582  o1resb  15584  measinb2  34481  eulerpartgbij  34630  imassmpt  45798  limsupresicompt  46291  liminfresicompt  46315  tposrescnv  49461
  Copyright terms: Public domain W3C validator