| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fcoi1 | Structured version Visualization version GIF version | ||
| Description: Composition of a mapping and restricted identity. (Contributed by NM, 13-Dec-2003.) (Proof shortened by Andrew Salmon, 17-Sep-2011.) |
| Ref | Expression |
|---|---|
| fcoi1 | ⊢ (𝐹:𝐴⟶𝐵 → (𝐹 ∘ ( I ↾ 𝐴)) = 𝐹) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ffn 6707 | . 2 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 Fn 𝐴) | |
| 2 | df-fn 6540 | . . 3 ⊢ (𝐹 Fn 𝐴 ↔ (Fun 𝐹 ∧ dom 𝐹 = 𝐴)) | |
| 3 | eqimss 3989 | . . . . 5 ⊢ (dom 𝐹 = 𝐴 → dom 𝐹 ⊆ 𝐴) | |
| 4 | cnvi 5863 | . . . . . . . . . 10 ⊢ ◡ I = I | |
| 5 | 4 | reseq1i 5966 | . . . . . . . . 9 ⊢ (◡ I ↾ 𝐴) = ( I ↾ 𝐴) |
| 6 | 5 | cnveqi 5852 | . . . . . . . 8 ⊢ ◡(◡ I ↾ 𝐴) = ◡( I ↾ 𝐴) |
| 7 | cnvresid 6617 | . . . . . . . 8 ⊢ ◡( I ↾ 𝐴) = ( I ↾ 𝐴) | |
| 8 | 6, 7 | eqtr2i 2785 | . . . . . . 7 ⊢ ( I ↾ 𝐴) = ◡(◡ I ↾ 𝐴) |
| 9 | 8 | coeq2i 5838 | . . . . . 6 ⊢ (𝐹 ∘ ( I ↾ 𝐴)) = (𝐹 ∘ ◡(◡ I ↾ 𝐴)) |
| 10 | cores2 6260 | . . . . . 6 ⊢ (dom 𝐹 ⊆ 𝐴 → (𝐹 ∘ ◡(◡ I ↾ 𝐴)) = (𝐹 ∘ I )) | |
| 11 | 9, 10 | eqtrid 2808 | . . . . 5 ⊢ (dom 𝐹 ⊆ 𝐴 → (𝐹 ∘ ( I ↾ 𝐴)) = (𝐹 ∘ I )) |
| 12 | 3, 11 | syl 18 | . . . 4 ⊢ (dom 𝐹 = 𝐴 → (𝐹 ∘ ( I ↾ 𝐴)) = (𝐹 ∘ I )) |
| 13 | funrel 6554 | . . . . 5 ⊢ (Fun 𝐹 → Rel 𝐹) | |
| 14 | coi1 6263 | . . . . 5 ⊢ (Rel 𝐹 → (𝐹 ∘ I ) = 𝐹) | |
| 15 | 13, 14 | syl 18 | . . . 4 ⊢ (Fun 𝐹 → (𝐹 ∘ I ) = 𝐹) |
| 16 | 12, 15 | sylan9eqr 2818 | . . 3 ⊢ ((Fun 𝐹 ∧ dom 𝐹 = 𝐴) → (𝐹 ∘ ( I ↾ 𝐴)) = 𝐹) |
| 17 | 2, 16 | sylbi 220 | . 2 ⊢ (𝐹 Fn 𝐴 → (𝐹 ∘ ( I ↾ 𝐴)) = 𝐹) |
| 18 | 1, 17 | syl 18 | 1 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹 ∘ ( I ↾ 𝐴)) = 𝐹) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ⊆ wss 3899 I cid 5545 ◡ccnv 5650 dom cdm 5651 ↾ cres 5653 ∘ ccom 5655 Rel wrel 5656 Fun wfun 6531 Fn wfn 6532 ⟶wf 6533 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-pr 5391 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-br 5104 df-opab 5168 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-fun 6539 df-fn 6540 df-f 6541 |
| This theorem is used by: fcof1oinvd 7299 mapen 9153 mapfien 9393 hashfacen 14592 cofurid 18059 setccatid 18252 estrccatid 18299 curf2ndf 18414 efmndid 19077 efmndmnd 19078 f1omvdco2 19655 psgnunilem1 19700 pf1mpf 22663 pf1ind 22666 wilthlem3 27390 hoico1 32351 fmptco1f1o 33220 fcobijfs 33306 cocnvf1o 33314 cycpmconjslem2 33709 cycpmconjs 33710 cyc3conja 33711 1arithidomlem2 34061 mplvrpmga 34170 mplvrpmrhm 34172 reprpmtf1o 35248 ltrncoidN 41165 trlcoabs2N 41759 trlcoat 41760 cdlemg47a 41771 cdlemg46 41772 trljco 41777 tendo1mulr 41808 tendo0co2 41825 cdlemi2 41856 cdlemk2 41869 cdlemk4 41871 cdlemk8 41875 cdlemk53 41994 cdlemk55a 41996 dvhopN 42153 dihopelvalcpre 42285 dihmeetlem1N 42327 dihglblem5apreN 42328 diophrw 43749 mendring 44174 rngccatidALTV 49338 ringccatidALTV 49372 |
| Copyright terms: Public domain | W3C validator |