| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > resdm | Structured version Visualization version GIF version | ||
| Description: A relation restricted to its domain equals itself. (Contributed by NM, 12-Dec-2006.) |
| Ref | Expression |
|---|---|
| resdm | ⊢ (Rel 𝐴 → (𝐴 ↾ dom 𝐴) = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssid 3931 | . 2 ⊢ dom 𝐴 ⊆ dom 𝐴 | |
| 2 | relssres 6012 | . 2 ⊢ ((Rel 𝐴 ∧ dom 𝐴 ⊆ dom 𝐴) → (𝐴 ↾ dom 𝐴) = 𝐴) | |
| 3 | 1, 2 | mpan2 704 | 1 ⊢ (Rel 𝐴 → (𝐴 ↾ dom 𝐴) = 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1569 ⊆ wss 3896 dom cdm 5650 ↾ cres 5652 Rel wrel 5655 |
| 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 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 ax-sep 5248 ax-pr 5390 |
| 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 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-ss 3897 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-sn 4585 df-pr 4587 df-op 4835 df-br 5103 df-opab 5167 df-xp 5656 df-rel 5657 df-dm 5660 df-res 5662 |
| This theorem is used by: resindm 6020 resindmOLD 6021 reldmun 6024 reldisjunOLD 6025 relresdm1 6026 imadifssranOLDOLD 6205 resdm2 6234 relresfldOLD 6281 fimadmfoALT 6810 fnex 7225 dftpos2 8265 tfrlem11 8401 tfrlem15 8405 tfrlem16 8406 pmresg 8903 domss2 9160 axdc3lem4 10536 gruima 10892 nosupbnd2lem1 28079 nosupbnd2 28080 noinfbnd2lem1 28094 noinfbnd2 28095 noetasuplem2 28098 noetasuplem3 28099 noetasuplem4 28100 noetainflem2 28102 bnj1321 35705 funsseq 36627 alrmomodm 39398 relbrcoss 39575 unidmqs 39778 releldmqs 39782 releldmqscoss 39784 seff 45400 sblpnf 45401 f1cof1blem 48251 funfocofob 48255 itcoval1 49882 |
| Copyright terms: Public domain | W3C validator |