| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fv0p1e1 | Structured version Visualization version GIF version | ||
| Description: Function value at 𝑁 + 1 with 𝑁 replaced by 0. Technical theorem to be used to reduce the size of a significant number of proofs. (Contributed by AV, 13-Aug-2022.) |
| Ref | Expression |
|---|---|
| fv0p1e1 | ⊢ (𝑁 = 0 → (𝐹‘(𝑁 + 1)) = (𝐹‘1)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | oveq1 7363 | . . 3 ⊢ (𝑁 = 0 → (𝑁 + 1) = (0 + 1)) | |
| 2 | 0p1e1 12260 | . . 3 ⊢ (0 + 1) = 1 | |
| 3 | 1, 2 | eqtrdi 2785 | . 2 ⊢ (𝑁 = 0 → (𝑁 + 1) = 1) |
| 4 | 3 | fveq2d 6836 | 1 ⊢ (𝑁 = 0 → (𝐹‘(𝑁 + 1)) = (𝐹‘1)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 ‘cfv 6490 (class class class)co 7356 0cc0 11024 1c1 11025 + caddc 11027 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 ax-resscn 11081 ax-1cn 11082 ax-icn 11083 ax-addcl 11084 ax-addrcl 11085 ax-mulcl 11086 ax-mulrcl 11087 ax-mulcom 11088 ax-addass 11089 ax-mulass 11090 ax-distr 11091 ax-i2m1 11092 ax-1ne0 11093 ax-1rid 11094 ax-rnegex 11095 ax-rrecex 11096 ax-cnre 11097 ax-pre-lttri 11098 ax-pre-lttrn 11099 ax-pre-ltadd 11100 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3059 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-br 5097 df-opab 5159 df-mpt 5178 df-id 5517 df-po 5530 df-so 5531 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-ov 7359 df-er 8633 df-en 8882 df-dom 8883 df-sdom 8884 df-pnf 11166 df-mnf 11167 df-ltxr 11169 |
| This theorem is referenced by: mertenslem2 15806 loglesqrt 26725 harmonicbnd3 26972 facgam 27030 wlkonl1iedg 29686 2wlklem 29688 pthdadjvtx 29750 lfgrn1cycl 29827 0enwwlksnge1 29886 2wlkdlem5 29951 2wlkdlem10 29957 rusgrnumwwlkl1 29993 clwwlkn2 30068 3wlkdlem5 30187 3wlkdlem10 30193 upgr3v3e3cycl 30204 upgr4cycl4dv4e 30209 subfacval2 35330 iccelpart 47621 bgoldbtbnd 47997 grtriclwlk3 48133 cycl3grtrilem 48134 gpgprismgr4cycllem10 48292 |
| Copyright terms: Public domain | W3C validator |