| 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 3935 | . 2 ⊢ dom 𝐴 ⊆ dom 𝐴 | |
| 2 | relssres 6029 | . 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 1570 ⊆ wss 3900 dom cdm 5658 ↾ cres 5660 Rel wrel 5663 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 ax-sep 5255 ax-pr 5398 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-br 5109 df-opab 5174 df-xp 5664 df-rel 5665 df-dm 5668 df-res 5670 |
| This theorem is used by: resindm 6037 resindmOLD 6038 reldmun 6041 reldisjunOLD 6042 relresdm1 6043 imadifssranOLDOLD 6222 resdm2 6251 relresfldOLD 6303 fimadmfoALT 6837 fnex 7254 dftpos2 8298 tfrlem11 8434 tfrlem15 8438 tfrlem16 8439 pmresg 8936 domss2 9193 axdc3lem4 10570 gruima 10926 nosupbnd2lem1 28129 nosupbnd2 28130 noinfbnd2lem1 28144 noinfbnd2 28145 noetasuplem2 28148 noetasuplem3 28149 noetasuplem4 28150 noetainflem2 28152 bnj1321 35768 funsseq 36748 alrmomodm 39557 relbrcoss 39734 unidmqs 39937 releldmqs 39941 releldmqscoss 39943 seff 45554 sblpnf 45555 f1cof1blem 48417 funfocofob 48421 itcoval1 50106 |
| Copyright terms: Public domain | W3C validator |