Theorem nfafv 47822

Description: Bound-variable hypothesis builder for function value, analogous to nffv 6895. To prove a deduction version of this analogous to nffvd 6897 is not easily possible because a deduction version of nfdfat 47813 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 47818	. 2 ⊢ (𝐹'''𝐴) = if(𝐹 defAt 𝐴, (𝐹‘𝐴), V)
2		nfafv.1	. . . 4 ⊢ Ⅎ𝑥𝐹
3		nfafv.2	. . . 4 ⊢ Ⅎ𝑥𝐴
4	2, 3	nfdfat 47813	. . 3 ⊢ Ⅎ𝑥 𝐹 defAt 𝐴
5	2, 3	nffv 6895	. . 3 ⊢ Ⅎ𝑥(𝐹‘𝐴)
6		nfcv 2932	. . 3 ⊢ Ⅎ𝑥V
7	4, 5, 6	nfif 4523	. 2 ⊢ Ⅎ𝑥if(𝐹 defAt 𝐴, (𝐹‘𝐴), V)
8	1, 7	nfcxfr 2930	1 ⊢ Ⅎ𝑥(𝐹'''𝐴)

Syntax hints:  Ⅎwnfc 2917  Vcvv 3462  ifcif 4492  ‘cfv 6540   defAt wdfat 47802  '''cafv 47803

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2199  ax-12 2220  ax-ext 2742  ax-sep 5262  ax-nul 5274  ax-pr 5408

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1571  df-fal 1581  df-ex 1808  df-nf 1812  df-sb 2099  df-mo 2574  df-eu 2604  df-clab 2749  df-cleq 2762  df-clel 2845  df-nfc 2919  df-ne 2966  df-ral 3087  df-rex 3097  df-rab 3424  df-v 3464  df-sbc 3753  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-int 4918  df-br 5115  df-opab 5179  df-id 5560  df-xp 5671  df-rel 5672  df-cnv 5673  df-co 5674  df-dm 5675  df-res 5677  df-iota 6496  df-fun 6542  df-fv 6548  df-aiota 47771  df-dfat 47805  df-afv 47806

This theorem is referenced by:  csbafv12g  47823  nfaov  47865