| 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 6714 | . 2 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 Fn 𝐴) | |
| 2 | df-fn 6546 | . . 3 ⊢ (𝐹 Fn 𝐴 ↔ (Fun 𝐹 ∧ dom 𝐹 = 𝐴)) | |
| 3 | eqimss 3967 | . . . . 5 ⊢ (dom 𝐹 = 𝐴 → dom 𝐹 ⊆ 𝐴) | |
| 4 | cnvi 5864 | . . . . . . . . . 10 ⊢ ◡ I = I | |
| 5 | 4 | reseq1i 5967 | . . . . . . . . 9 ⊢ (◡ I ↾ 𝐴) = ( I ↾ 𝐴) |
| 6 | 5 | cnveqi 5853 | . . . . . . . 8 ⊢ ◡(◡ I ↾ 𝐴) = ◡( I ↾ 𝐴) |
| 7 | cnvresid 6624 | . . . . . . . 8 ⊢ ◡( I ↾ 𝐴) = ( I ↾ 𝐴) | |
| 8 | 6, 7 | eqtr2i 2784 | . . . . . . 7 ⊢ ( I ↾ 𝐴) = ◡(◡ I ↾ 𝐴) |
| 9 | 8 | coeq2i 5839 | . . . . . 6 ⊢ (𝐹 ∘ ( I ↾ 𝐴)) = (𝐹 ∘ ◡(◡ I ↾ 𝐴)) |
| 10 | cores2 6264 | . . . . . 6 ⊢ (dom 𝐹 ⊆ 𝐴 → (𝐹 ∘ ◡(◡ I ↾ 𝐴)) = (𝐹 ∘ I )) | |
| 11 | 9, 10 | eqtrid 2807 | . . . . 5 ⊢ (dom 𝐹 ⊆ 𝐴 → (𝐹 ∘ ( I ↾ 𝐴)) = (𝐹 ∘ I )) |
| 12 | 3, 11 | syl 18 | . . . 4 ⊢ (dom 𝐹 = 𝐴 → (𝐹 ∘ ( I ↾ 𝐴)) = (𝐹 ∘ I )) |
| 13 | funrel 6561 | . . . . 5 ⊢ (Fun 𝐹 → Rel 𝐹) | |
| 14 | coi1 6267 | . . . . 5 ⊢ (Rel 𝐹 → (𝐹 ∘ I ) = 𝐹) | |
| 15 | 13, 14 | syl 18 | . . . 4 ⊢ (Fun 𝐹 → (𝐹 ∘ I ) = 𝐹) |
| 16 | 12, 15 | sylan9eqr 2817 | . . 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 1569 ⊆ wss 3896 I cid 5545 ◡ccnv 5650 dom cdm 5651 ↾ cres 5653 ∘ ccom 5655 Rel wrel 5656 Fun wfun 6537 Fn wfn 6538 ⟶wf 6539 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-pr 5391 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-ss 3897 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-sn 4585 df-pr 4587 df-op 4835 df-br 5103 df-opab 5167 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 6545 df-fn 6546 df-f 6547 |
| This theorem is used by: fcof1oinvd 7305 mapen 9167 mapfien 9407 hashfacen 14606 cofurid 18075 setccatid 18268 estrccatid 18315 curf2ndf 18430 efmndid 19093 efmndmnd 19094 f1omvdco2 19671 psgnunilem1 19716 pf1mpf 22679 pf1ind 22682 wilthlem3 27406 hoico1 32367 fmptco1f1o 33278 fcobijfs 33363 cocnvf1o 33371 cycpmconjslem2 33766 cycpmconjs 33767 cyc3conja 33768 1arithidomlem2 34118 mplvrpmga 34227 mplvrpmrhm 34229 reprpmtf1o 35305 ltrncoidN 41294 trlcoabs2N 41888 trlcoat 41889 cdlemg47a 41900 cdlemg46 41901 trljco 41906 tendo1mulr 41937 tendo0co2 41954 cdlemi2 41985 cdlemk2 41998 cdlemk4 42000 cdlemk8 42004 cdlemk53 42123 cdlemk55a 42125 dvhopN 42282 dihopelvalcpre 42414 dihmeetlem1N 42456 dihglblem5apreN 42457 diophrw 43879 mendring 44299 rngccatidALTV 49477 ringccatidALTV 49511 fucoridid 50594 |
| Copyright terms: Public domain | W3C validator |