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

Theorem resmpt3 6030
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 5984 . 2 (((𝑥𝐴𝐶) ↾ 𝐴) ↾ 𝐵) = ((𝑥𝐴𝐶) ↾ (𝐴𝐵))
2 ssid 3986 . . . 4 𝐴𝐴
3 resmpt 6029 . . . 4 (𝐴𝐴 → ((𝑥𝐴𝐶) ↾ 𝐴) = (𝑥𝐴𝐶))
42, 3ax-mp 5 . . 3 ((𝑥𝐴𝐶) ↾ 𝐴) = (𝑥𝐴𝐶)
54reseq1i 5967 . 2 (((𝑥𝐴𝐶) ↾ 𝐴) ↾ 𝐵) = ((𝑥𝐴𝐶) ↾ 𝐵)
6 inss1 4217 . . 3 (𝐴𝐵) ⊆ 𝐴
7 resmpt 6029 . . 3 ((𝐴𝐵) ⊆ 𝐴 → ((𝑥𝐴𝐶) ↾ (𝐴𝐵)) = (𝑥 ∈ (𝐴𝐵) ↦ 𝐶))
86, 7ax-mp 5 . 2 ((𝑥𝐴𝐶) ↾ (𝐴𝐵)) = (𝑥 ∈ (𝐴𝐵) ↦ 𝐶)
91, 5, 83eqtr3i 2767 1 ((𝑥𝐴𝐶) ↾ 𝐵) = (𝑥 ∈ (𝐴𝐵) ↦ 𝐶)
Colors of variables: wff setvar class
Syntax hints:   = wceq 1540  cin 3930  wss 3931  cmpt 5206  cres 5661
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-12 2178  ax-ext 2708  ax-sep 5271  ax-nul 5281  ax-pr 5407
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-clab 2715  df-cleq 2728  df-clel 2810  df-ral 3053  df-rex 3062  df-rab 3421  df-v 3466  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-nul 4314  df-if 4506  df-sn 4607  df-pr 4609  df-op 4613  df-opab 5187  df-mpt 5207  df-xp 5665  df-rel 5666  df-res 5671
This theorem is referenced by:  mptima  6064  offres  7987  lo1resb  15585  o1resb  15587  measinb2  34259  eulerpartgbij  34409  imassmpt  45266  limsupresicompt  45765  liminfresicompt  45789  tposrescnv  48834
  Copyright terms: Public domain W3C validator