Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > resdmdfsn | Structured version Visualization version GIF version |
Description: Restricting a relation to its domain without a set is the same as restricting the relation to the universe without this set. (Contributed by AV, 2-Dec-2018.) |
Ref | Expression |
---|---|
resdmdfsn | ⊢ (Rel 𝑅 → (𝑅 ↾ (V ∖ {𝑋})) = (𝑅 ↾ (dom 𝑅 ∖ {𝑋}))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | resindm 5929 | . 2 ⊢ (Rel 𝑅 → (𝑅 ↾ ((V ∖ {𝑋}) ∩ dom 𝑅)) = (𝑅 ↾ (V ∖ {𝑋}))) | |
2 | indif1 4202 | . . . 4 ⊢ ((V ∖ {𝑋}) ∩ dom 𝑅) = ((V ∩ dom 𝑅) ∖ {𝑋}) | |
3 | incom 4131 | . . . . . 6 ⊢ (V ∩ dom 𝑅) = (dom 𝑅 ∩ V) | |
4 | inv1 4325 | . . . . . 6 ⊢ (dom 𝑅 ∩ V) = dom 𝑅 | |
5 | 3, 4 | eqtri 2766 | . . . . 5 ⊢ (V ∩ dom 𝑅) = dom 𝑅 |
6 | 5 | difeq1i 4049 | . . . 4 ⊢ ((V ∩ dom 𝑅) ∖ {𝑋}) = (dom 𝑅 ∖ {𝑋}) |
7 | 2, 6 | eqtri 2766 | . . 3 ⊢ ((V ∖ {𝑋}) ∩ dom 𝑅) = (dom 𝑅 ∖ {𝑋}) |
8 | 7 | reseq2i 5877 | . 2 ⊢ (𝑅 ↾ ((V ∖ {𝑋}) ∩ dom 𝑅)) = (𝑅 ↾ (dom 𝑅 ∖ {𝑋})) |
9 | 1, 8 | eqtr3di 2794 | 1 ⊢ (Rel 𝑅 → (𝑅 ↾ (V ∖ {𝑋})) = (𝑅 ↾ (dom 𝑅 ∖ {𝑋}))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1539 Vcvv 3422 ∖ cdif 3880 ∩ cin 3882 {csn 4558 dom cdm 5580 ↾ cres 5582 Rel wrel 5585 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pr 5347 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-clab 2716 df-cleq 2730 df-clel 2817 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-sn 4559 df-pr 4561 df-op 4565 df-br 5071 df-opab 5133 df-xp 5586 df-rel 5587 df-dm 5590 df-res 5592 |
This theorem is referenced by: funresdfunsn 7043 |
Copyright terms: Public domain | W3C validator |