| 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 5881 | . . . 4 ⊢ (𝐹 = (𝐸 ↾ 𝐴) → dom 𝐹 = dom (𝐸 ↾ 𝐴)) | |
| 3 | 2 | reseq2d 5967 | . . 3 ⊢ (𝐹 = (𝐸 ↾ 𝐴) → (𝐸 ↾ dom 𝐹) = (𝐸 ↾ dom (𝐸 ↾ 𝐴))) |
| 4 | resdmres 6221 | . . 3 ⊢ (𝐸 ↾ dom (𝐸 ↾ 𝐴)) = (𝐸 ↾ 𝐴) | |
| 5 | 3, 4 | eqtr2di 2816 | . 2 ⊢ (𝐹 = (𝐸 ↾ 𝐴) → (𝐸 ↾ 𝐴) = (𝐸 ↾ dom 𝐹)) |
| 6 | 1, 5 | eqtrd 2799 | 1 ⊢ (𝐹 = (𝐸 ↾ 𝐴) → 𝐹 = (𝐸 ↾ dom 𝐹)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1562 dom cdm 5649 ↾ cres 5651 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-ext 2736 ax-sep 5248 ax-pr 5392 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-sb 2093 df-clab 2743 df-cleq 2756 df-clel 2839 df-ral 3079 df-rex 3089 df-rab 3417 df-v 3458 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-br 5103 df-opab 5165 df-xp 5655 df-rel 5656 df-cnv 5657 df-dm 5659 df-rn 5660 df-res 5661 |
| This theorem is referenced by: uhgrspan1 29506 |
| Copyright terms: Public domain | W3C validator |