Theorem fv0p1e1 9257

Description: Function value at N + 1 with N replaced by 0. Technical theorem to be used to reduce the size of a significant number of proofs. (Contributed by AV, 13-Aug-2022.)

Assertion

Ref	Expression
fv0p1e1	|- ( N = 0 -> ( F ` ( N + 1 ) ) = ( F ` 1 ) )

Proof of Theorem fv0p1e1

Step	Hyp	Ref	Expression
1		oveq1 6024	. . 3 |- ( N = 0 -> ( N + 1 ) = ( 0 + 1 ) )
2		0p1e1 9256	. . 3 |- ( 0 + 1 ) = 1
3	1, 2	eqtrdi 2280	. 2 |- ( N = 0 -> ( N + 1 ) = 1 )
4	3	fveq2d 5643	1 |- ( N = 0 -> ( F ` ( N + 1 ) ) = ( F ` 1 ) )

Syntax hints:   -> wi 4   = wceq 1397   ` cfv 5326  (class class class)co 6017   0cc0 8031   1c1 8032   + caddc 8034

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213  ax-1cn 8124  ax-icn 8126  ax-addcl 8127  ax-mulcl 8129  ax-addcom 8131  ax-i2m1 8136  ax-0id 8139

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-rex 2516  df-v 2804  df-un 3204  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-iota 5286  df-fv 5334  df-ov 6020

This theorem is referenced by:  mertenslem2  12096  fprodfac  12175  2wlklem  16226  clwwlkn2  16271