| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rescnvcnv | Structured version Visualization version GIF version | ||
| Description: The restriction of the double converse of a class. (Contributed by NM, 8-Apr-2007.) (Proof shortened by Andrew Salmon, 27-Aug-2011.) |
| Ref | Expression |
|---|---|
| rescnvcnv | ⊢ (◡◡𝐴 ↾ 𝐵) = (𝐴 ↾ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cnvcnv2 6181 | . . 3 ⊢ ◡◡𝐴 = (𝐴 ↾ V) | |
| 2 | 1 | reseq1i 5963 | . 2 ⊢ (◡◡𝐴 ↾ 𝐵) = ((𝐴 ↾ V) ↾ 𝐵) |
| 3 | resres 5980 | . 2 ⊢ ((𝐴 ↾ V) ↾ 𝐵) = (𝐴 ↾ (V ∩ 𝐵)) | |
| 4 | ssv 3962 | . . . 4 ⊢ 𝐵 ⊆ V | |
| 5 | sseqin2 4177 | . . . 4 ⊢ (𝐵 ⊆ V ↔ (V ∩ 𝐵) = 𝐵) | |
| 6 | 4, 5 | mpbi 232 | . . 3 ⊢ (V ∩ 𝐵) = 𝐵 |
| 7 | 6 | reseq2i 5964 | . 2 ⊢ (𝐴 ↾ (V ∩ 𝐵)) = (𝐴 ↾ 𝐵) |
| 8 | 2, 3, 7 | 3eqtri 2791 | 1 ⊢ (◡◡𝐴 ↾ 𝐵) = (𝐴 ↾ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1562 Vcvv 3456 ∩ cin 3905 ⊆ wss 3906 ◡ccnv 5648 ↾ 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-res 5661 |
| This theorem is referenced by: cnvcnvres 6194 imacnvcnv 6195 resdm2 6220 resdmres 6221 coires1 6254 f1oresrab 7111 |
| Copyright terms: Public domain | W3C validator |