| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > f1cocnv2 | Structured version Visualization version GIF version | ||
| Description: Composition of an injective function with its converse. (Contributed by FL, 11-Nov-2011.) |
| Ref | Expression |
|---|---|
| f1cocnv2 | ⊢ (𝐹:𝐴–1-1→𝐵 → (𝐹 ∘ ◡𝐹) = ( I ↾ ran 𝐹)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | f1fun 6726 | . 2 ⊢ (𝐹:𝐴–1-1→𝐵 → Fun 𝐹) | |
| 2 | funcocnv2 6793 | . 2 ⊢ (Fun 𝐹 → (𝐹 ∘ ◡𝐹) = ( I ↾ ran 𝐹)) | |
| 3 | 1, 2 | syl 17 | 1 ⊢ (𝐹:𝐴–1-1→𝐵 → (𝐹 ∘ ◡𝐹) = ( I ↾ ran 𝐹)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1540 I cid 5517 ◡ccnv 5622 ran crn 5624 ↾ cres 5625 ∘ ccom 5627 Fun wfun 6480 –1-1→wf1 6483 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2701 ax-sep 5238 ax-nul 5248 ax-pr 5374 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2066 df-clab 2708 df-cleq 2721 df-clel 2803 df-ral 3045 df-rex 3054 df-rab 3397 df-v 3440 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4479 df-sn 4580 df-pr 4582 df-op 4586 df-br 5096 df-opab 5158 df-id 5518 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |