| 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 6758 | . 2 ⊢ (𝐹:𝐴–1-1→𝐵 → Fun 𝐹) | |
| 2 | funcocnv2 6828 | . 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 1559 I cid 5539 ◡ccnv 5644 ran crn 5646 ↾ cres 5647 ∘ ccom 5649 Fun wfun 6511 –1-1→wf1 6514 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-ext 2733 ax-sep 5245 ax-pr 5389 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-sb 2090 df-clab 2740 df-cleq 2753 df-clel 2836 df-ral 3076 df-rex 3086 df-rab 3414 df-v 3455 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4480 df-sn 4582 df-pr 4584 df-op 4588 df-br 5100 df-opab 5162 df-id 5540 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-fun 6519 df-fn 6520 df-f 6521 df-f1 6522 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |