Theorem residm 6006

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

This proof depends on syntax axioms:   = wceq 1569   ⊆ wss 3899   ↾ cres 5656

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-ext 2735  ax-sep 5251  ax-pr 5394

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2101  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4838  df-opab 5170  df-xp 5660  df-rel 5661  df-res 5666

This theorem is used by:  resima  6061  dffv2  6988  fvsnun2  7195  qtopres  24029  bnj1253  35700  eldioph2lem1  43911  eldioph2lem2  43912  relexpiidm  44844