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 6672 | . 2 ⊢ (𝐹:𝐴–1-1→𝐵 → Fun 𝐹) | |
2 | funcocnv2 6741 | . 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 1539 I cid 5488 ◡ccnv 5588 ran crn 5590 ↾ cres 5591 ∘ ccom 5593 Fun wfun 6427 –1-1→wf1 6430 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pr 5352 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3434 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-sn 4562 df-pr 4564 df-op 4568 df-br 5075 df-opab 5137 df-id 5489 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |