| 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 3953 | . 2 ⊢ dom 𝐴 ⊆ dom 𝐴 | |
| 2 | relssres 6015 | . 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 3899 dom cdm 5655 ↾ cres 5657 Rel wrel 5660 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2732 ax-sep 5251 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 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-br 5104 df-opab 5168 df-xp 5661 df-rel 5662 df-dm 5665 df-res 5667 |
| This theorem is used by: resindm 6023 resindmOLD 6024 reldmun 6027 reldisjunOLD 6028 relresdm1 6029 imadifssranOLD 6198 resdm2 6227 relresfldOLD 6274 fimadmfoALT 6800 fnex 7216 dftpos2 8241 tfrlem11 8377 tfrlem15 8381 tfrlem16 8382 pmresg 8877 domss2 9134 axdc3lem4 10455 gruima 10811 nosupbnd2lem1 27951 nosupbnd2 27952 noinfbnd2lem1 27966 noinfbnd2 27967 noetasuplem2 27970 noetasuplem3 27971 noetasuplem4 27972 noetainflem2 27974 bnj1321 35536 funsseq 36347 alrmomodm 39107 relbrcoss 39284 unidmqs 39487 releldmqs 39491 releldmqscoss 39493 seff 45133 sblpnf 45134 f1cof1blem 47962 funfocofob 47966 itcoval1 49593 |
| Copyright terms: Public domain | W3C validator |