| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > resresdm | Structured version Visualization version GIF version | ||
| Description: A restriction by an arbitrary set is a restriction by its domain. (Contributed by AV, 16-Nov-2020.) |
| Ref | Expression |
|---|---|
| resresdm | ⊢ (𝐹 = (𝐸 ↾ 𝐴) → 𝐹 = (𝐸 ↾ dom 𝐹)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | id 22 | . 2 ⊢ (𝐹 = (𝐸 ↾ 𝐴) → 𝐹 = (𝐸 ↾ 𝐴)) | |
| 2 | dmeq 5854 | . . . 4 ⊢ (𝐹 = (𝐸 ↾ 𝐴) → dom 𝐹 = dom (𝐸 ↾ 𝐴)) | |
| 3 | 2 | reseq2d 5940 | . . 3 ⊢ (𝐹 = (𝐸 ↾ 𝐴) → (𝐸 ↾ dom 𝐹) = (𝐸 ↾ dom (𝐸 ↾ 𝐴))) |
| 4 | resdmres 6192 | . . 3 ⊢ (𝐸 ↾ dom (𝐸 ↾ 𝐴)) = (𝐸 ↾ 𝐴) | |
| 5 | 3, 4 | eqtr2di 2789 | . 2 ⊢ (𝐹 = (𝐸 ↾ 𝐴) → (𝐸 ↾ 𝐴) = (𝐸 ↾ dom 𝐹)) |
| 6 | 1, 5 | eqtrd 2772 | 1 ⊢ (𝐹 = (𝐸 ↾ 𝐴) → 𝐹 = (𝐸 ↾ dom 𝐹)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 dom cdm 5626 ↾ cres 5628 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 ax-sep 5232 ax-pr 5372 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-br 5087 df-opab 5149 df-xp 5632 df-rel 5633 df-cnv 5634 df-dm 5636 df-rn 5637 df-res 5638 |
| This theorem is referenced by: uhgrspan1 29390 |
| Copyright terms: Public domain | W3C validator |