Theorem residm 5970

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 3966	. 2 ⊢ 𝐵 ⊆ 𝐵
2		resabs2 5969	. 2 ⊢ (𝐵 ⊆ 𝐵 → ((𝐴 ↾ 𝐵) ↾ 𝐵) = (𝐴 ↾ 𝐵))
3	1, 2	ax-mp 5	1 ⊢ ((𝐴 ↾ 𝐵) ↾ 𝐵) = (𝐴 ↾ 𝐵)

Syntax hints:   = wceq 1540   ⊆ wss 3911   ↾ cres 5633

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-ext 2701  ax-sep 5246  ax-nul 5256  ax-pr 5382

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-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-ral 3045  df-rex 3054  df-rab 3403  df-v 3446  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-nul 4293  df-if 4485  df-sn 4586  df-pr 4588  df-op 4592  df-opab 5165  df-xp 5637  df-rel 5638  df-res 5643

This theorem is referenced by:  resima  5975  dffv2  6938  fvsnun2  7139  qtopres  23561  bnj1253  34980  eldioph2lem1  42721  eldioph2lem2  42722  relexpiidm  43666