Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > residm | Structured version Visualization version GIF version |
Description: Idempotent law for restriction. (Contributed by NM, 27-Mar-1998.) |
Ref | Expression |
---|---|
residm | ⊢ ((𝐴 ↾ 𝐵) ↾ 𝐵) = (𝐴 ↾ 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ssid 3943 | . 2 ⊢ 𝐵 ⊆ 𝐵 | |
2 | resabs2 5923 | . 2 ⊢ (𝐵 ⊆ 𝐵 → ((𝐴 ↾ 𝐵) ↾ 𝐵) = (𝐴 ↾ 𝐵)) | |
3 | 1, 2 | ax-mp 5 | 1 ⊢ ((𝐴 ↾ 𝐵) ↾ 𝐵) = (𝐴 ↾ 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1539 ⊆ wss 3887 ↾ cres 5591 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pr 5352 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-rab 3073 df-v 3434 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-sn 4562 df-pr 4564 df-op 4568 df-opab 5137 df-xp 5595 df-rel 5596 df-res 5601 |
This theorem is referenced by: resima 5925 dffv2 6863 fvsnun2 7055 qtopres 22849 bnj1253 32997 eldioph2lem1 40582 eldioph2lem2 40583 relexpiidm 41312 |
Copyright terms: Public domain | W3C validator |