| 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 6709 | . 2 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 Fn 𝐴) | |
| 2 | df-fn 6543 | . . 3 ⊢ (𝐹 Fn 𝐴 ↔ (Fun 𝐹 ∧ dom 𝐹 = 𝐴)) | |
| 3 | eqimss 3996 | . . . . 5 ⊢ (dom 𝐹 = 𝐴 → dom 𝐹 ⊆ 𝐴) | |
| 4 | cnvi 5873 | . . . . . . . . . 10 ⊢ ◡ I = I | |
| 5 | 4 | reseq1i 5976 | . . . . . . . . 9 ⊢ (◡ I ↾ 𝐴) = ( I ↾ 𝐴) |
| 6 | 5 | cnveqi 5862 | . . . . . . . 8 ⊢ ◡(◡ I ↾ 𝐴) = ◡( I ↾ 𝐴) |
| 7 | cnvresid 6619 | . . . . . . . 8 ⊢ ◡( I ↾ 𝐴) = ( I ↾ 𝐴) | |
| 8 | 6, 7 | eqtr2i 2789 | . . . . . . 7 ⊢ ( I ↾ 𝐴) = ◡(◡ I ↾ 𝐴) |
| 9 | 8 | coeq2i 5848 | . . . . . 6 ⊢ (𝐹 ∘ ( I ↾ 𝐴)) = (𝐹 ∘ ◡(◡ I ↾ 𝐴)) |
| 10 | cores2 6263 | . . . . . 6 ⊢ (dom 𝐹 ⊆ 𝐴 → (𝐹 ∘ ◡(◡ I ↾ 𝐴)) = (𝐹 ∘ I )) | |
| 11 | 9, 10 | eqtrid 2812 | . . . . 5 ⊢ (dom 𝐹 ⊆ 𝐴 → (𝐹 ∘ ( I ↾ 𝐴)) = (𝐹 ∘ I )) |
| 12 | 3, 11 | syl 18 | . . . 4 ⊢ (dom 𝐹 = 𝐴 → (𝐹 ∘ ( I ↾ 𝐴)) = (𝐹 ∘ I )) |
| 13 | funrel 6557 | . . . . 5 ⊢ (Fun 𝐹 → Rel 𝐹) | |
| 14 | coi1 6266 | . . . . 5 ⊢ (Rel 𝐹 → (𝐹 ∘ I ) = 𝐹) | |
| 15 | 13, 14 | syl 18 | . . . 4 ⊢ (Fun 𝐹 → (𝐹 ∘ I ) = 𝐹) |
| 16 | 12, 15 | sylan9eqr 2822 | . . 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 3906 I cid 5557 ◡ccnv 5662 dom cdm 5663 ↾ cres 5665 ∘ ccom 5667 Rel wrel 5668 Fun wfun 6534 Fn wfn 6535 ⟶wf 6536 |
| 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 2148 ax-9 2156 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-pr 5406 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-sn 4592 df-pr 4594 df-op 4598 df-br 5112 df-opab 5176 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-fun 6542 df-fn 6543 df-f 6544 |
| This theorem is used by: fcof1oinvd 7300 mapen 9136 mapfien 9375 hashfacen 14509 cofurid 17970 setccatid 18163 estrccatid 18210 curf2ndf 18325 efmndid 18984 efmndmnd 18985 f1omvdco2 19562 psgnunilem1 19607 pf1mpf 22562 pf1ind 22565 wilthlem3 27285 hoico1 32179 fmptco1f1o 33049 fcobijfs 33136 cocnvf1o 33144 cycpmconjslem2 33539 cycpmconjs 33540 cyc3conja 33541 1arithidomlem2 33890 mplvrpmga 33999 mplvrpmrhm 34001 reprpmtf1o 35078 ltrncoidN 40960 trlcoabs2N 41554 trlcoat 41555 cdlemg47a 41566 cdlemg46 41567 trljco 41572 tendo1mulr 41603 tendo0co2 41620 cdlemi2 41651 cdlemk2 41664 cdlemk4 41666 cdlemk8 41670 cdlemk53 41789 cdlemk55a 41791 dvhopN 41948 dihopelvalcpre 42080 dihmeetlem1N 42122 dihglblem5apreN 42123 diophrw 43548 mendring 43973 rngccatidALTV 49094 ringccatidALTV 49128 |
| Copyright terms: Public domain | W3C validator |