Theorem nfafv 46144

Description: Bound-variable hypothesis builder for function value, analogous to nffv 6902. To prove a deduction version of this analogous to nffvd 6904 is not easily possible because a deduction version of nfdfat 46135 cannot be shown easily. (Contributed by Alexander van der Vekens, 26-May-2017.)

Hypotheses

Ref	Expression
nfafv.1	⊢ Ⅎ𝑥𝐹
nfafv.2	⊢ Ⅎ𝑥𝐴

Assertion

Ref	Expression
nfafv	⊢ Ⅎ𝑥(𝐹'''𝐴)

Proof of Theorem nfafv

Step	Hyp	Ref	Expression
1		dfafv2 46140	. 2 ⊢ (𝐹'''𝐴) = if(𝐹 defAt 𝐴, (𝐹‘𝐴), V)
2		nfafv.1	. . . 4 ⊢ Ⅎ𝑥𝐹
3		nfafv.2	. . . 4 ⊢ Ⅎ𝑥𝐴
4	2, 3	nfdfat 46135	. . 3 ⊢ Ⅎ𝑥 𝐹 defAt 𝐴
5	2, 3	nffv 6902	. . 3 ⊢ Ⅎ𝑥(𝐹‘𝐴)
6		nfcv 2901	. . 3 ⊢ Ⅎ𝑥V
7	4, 5, 6	nfif 4559	. 2 ⊢ Ⅎ𝑥if(𝐹 defAt 𝐴, (𝐹‘𝐴), V)
8	1, 7	nfcxfr 2899	1 ⊢ Ⅎ𝑥(𝐹'''𝐴)

Syntax hints:  Ⅎwnfc 2881  Vcvv 3472  ifcif 4529  ‘cfv 6544   defAt wdfat 46124  '''cafv 46125

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-10 2135  ax-11 2152  ax-12 2169  ax-ext 2701  ax-sep 5300  ax-nul 5307  ax-pr 5428

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2532  df-eu 2561  df-clab 2708  df-cleq 2722  df-clel 2808  df-nfc 2883  df-ne 2939  df-ral 3060  df-rex 3069  df-rab 3431  df-v 3474  df-sbc 3779  df-csb 3895  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4324  df-if 4530  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4910  df-int 4952  df-br 5150  df-opab 5212  df-id 5575  df-xp 5683  df-rel 5684  df-cnv 5685  df-co 5686  df-dm 5687  df-res 5689  df-iota 6496  df-fun 6546  df-fv 6552  df-aiota 46093  df-dfat 46127  df-afv 46128

This theorem is referenced by:  csbafv12g  46145  nfaov  46187