Theorem residm 6039

Description: Idempotent law for restriction. (Contributed by NM, 27-Mar-1998.)

Assertion

Ref	Expression
residm	⊢ ((𝐴 ↾ 𝐵) ↾ 𝐵) = (𝐴 ↾ 𝐵)

Proof of Theorem residm

Step	Hyp	Ref	Expression
1		ssid 4031	. 2 ⊢ 𝐵 ⊆ 𝐵
2		resabs2 6038	. 2 ⊢ (𝐵 ⊆ 𝐵 → ((𝐴 ↾ 𝐵) ↾ 𝐵) = (𝐴 ↾ 𝐵))
3	1, 2	ax-mp 5	1 ⊢ ((𝐴 ↾ 𝐵) ↾ 𝐵) = (𝐴 ↾ 𝐵)

Syntax hints:   = wceq 1537   ⊆ wss 3976   ↾ cres 5702

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-opab 5229  df-xp 5706  df-rel 5707  df-res 5712

This theorem is referenced by:  resima  6044  dffv2  7017  fvsnun2  7217  qtopres  23727  bnj1253  34993  eldioph2lem1  42716  eldioph2lem2  42717  relexpiidm  43666