Metamath Proof Explorer


Theorem nfafv2

Description: Bound-variable hypothesis builder for function value, analogous to nffv . To prove a deduction version of this analogous to nffvd is not easily possible because a deduction version of nfdfat cannot be shown easily. (Contributed by AV, 4-Sep-2022)

Ref Expression
Hypotheses nfafv2.1 ⊢ Ⅎ _ x F
nfafv2.2 ⊢ Ⅎ _ x A
Assertion nfafv2 ⊢ Ⅎ _ x F '''' A

Proof

Step Hyp Ref Expression
1 nfafv2.1 ⊢ Ⅎ _ x F
2 nfafv2.2 ⊢ Ⅎ _ x A
3 df-afv2 ⊢ F '''' A = if F defAt A ι y | A F y 𝒫 ⋃ ran ⁡ F
4 1 2 nfdfat ⊢ Ⅎ x F defAt A
5 nfcv ⊢ Ⅎ _ x y
6 2 1 5 nfbr ⊢ Ⅎ x A F y
7 6 nfiotaw ⊢ Ⅎ _ x ι y | A F y
8 1 nfrn ⊢ Ⅎ _ x ran ⁡ F
9 8 nfuni ⊢ Ⅎ _ x ⋃ ran ⁡ F
10 9 nfpw ⊢ Ⅎ _ x 𝒫 ⋃ ran ⁡ F
11 4 7 10 nfif ⊢ Ⅎ _ x if F defAt A ι y | A F y 𝒫 ⋃ ran ⁡ F
12 3 11 nfcxfr ⊢ Ⅎ _ x F '''' A