| 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 6702 | . 2 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 Fn 𝐴) | |
| 2 | df-fn 6536 | . . 3 ⊢ (𝐹 Fn 𝐴 ↔ (Fun 𝐹 ∧ dom 𝐹 = 𝐴)) | |
| 3 | eqimss 3989 | . . . . 5 ⊢ (dom 𝐹 = 𝐴 → dom 𝐹 ⊆ 𝐴) | |
| 4 | cnvi 5865 | . . . . . . . . . 10 ⊢ ◡ I = I | |
| 5 | 4 | reseq1i 5968 | . . . . . . . . 9 ⊢ (◡ I ↾ 𝐴) = ( I ↾ 𝐴) |
| 6 | 5 | cnveqi 5854 | . . . . . . . 8 ⊢ ◡(◡ I ↾ 𝐴) = ◡( I ↾ 𝐴) |
| 7 | cnvresid 6612 | . . . . . . . 8 ⊢ ◡( I ↾ 𝐴) = ( I ↾ 𝐴) | |
| 8 | 6, 7 | eqtr2i 2784 | . . . . . . 7 ⊢ ( I ↾ 𝐴) = ◡(◡ I ↾ 𝐴) |
| 9 | 8 | coeq2i 5840 | . . . . . 6 ⊢ (𝐹 ∘ ( I ↾ 𝐴)) = (𝐹 ∘ ◡(◡ I ↾ 𝐴)) |
| 10 | cores2 6256 | . . . . . 6 ⊢ (dom 𝐹 ⊆ 𝐴 → (𝐹 ∘ ◡(◡ I ↾ 𝐴)) = (𝐹 ∘ I )) | |
| 11 | 9, 10 | eqtrid 2807 | . . . . 5 ⊢ (dom 𝐹 ⊆ 𝐴 → (𝐹 ∘ ( I ↾ 𝐴)) = (𝐹 ∘ I )) |
| 12 | 3, 11 | syl 18 | . . . 4 ⊢ (dom 𝐹 = 𝐴 → (𝐹 ∘ ( I ↾ 𝐴)) = (𝐹 ∘ I )) |
| 13 | funrel 6550 | . . . . 5 ⊢ (Fun 𝐹 → Rel 𝐹) | |
| 14 | coi1 6259 | . . . . 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 1570 ⊆ wss 3899 I cid 5549 ◡ccnv 5654 dom cdm 5655 ↾ cres 5657 ∘ ccom 5659 Rel wrel 5660 Fun wfun 6527 Fn wfn 6528 ⟶wf 6529 |
| 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 2732 ax-sep 5251 ax-pr 5398 |
| 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 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-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 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-fun 6535 df-fn 6536 df-f 6537 |
| This theorem is used by: fcof1oinvd 7294 mapen 9139 mapfien 9378 hashfacen 14519 cofurid 17980 setccatid 18173 estrccatid 18220 curf2ndf 18335 efmndid 18997 efmndmnd 18998 f1omvdco2 19575 psgnunilem1 19620 pf1mpf 22577 pf1ind 22580 wilthlem3 27306 hoico1 32237 fmptco1f1o 33106 fcobijfs 33192 cocnvf1o 33200 cycpmconjslem2 33595 cycpmconjs 33596 cyc3conja 33597 1arithidomlem2 33946 mplvrpmga 34055 mplvrpmrhm 34057 reprpmtf1o 35134 ltrncoidN 41001 trlcoabs2N 41595 trlcoat 41596 cdlemg47a 41607 cdlemg46 41608 trljco 41613 tendo1mulr 41644 tendo0co2 41661 cdlemi2 41692 cdlemk2 41705 cdlemk4 41707 cdlemk8 41711 cdlemk53 41830 cdlemk55a 41832 dvhopN 41989 dihopelvalcpre 42121 dihmeetlem1N 42163 dihglblem5apreN 42164 diophrw 43604 mendring 44029 rngccatidALTV 49187 ringccatidALTV 49221 |
| Copyright terms: Public domain | W3C validator |