Theorem nfdfat 43683

Description: Bound-variable hypothesis builder for "defined at". To prove a deduction version of this theorem is not easily possible because many deduction versions for bound-variable hypothesis builder for constructs the definition of "defined at" is based on are not available (e.g., for Fun/Rel, dom, ⊆, etc.). (Contributed by Alexander van der Vekens, 26-May-2017.)

Hypotheses

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

Assertion

Ref	Expression
nfdfat	⊢ Ⅎ𝑥 𝐹 defAt 𝐴

Proof of Theorem nfdfat

Step	Hyp	Ref	Expression
1		df-dfat 43675	. 2 ⊢ (𝐹 defAt 𝐴 ↔ (𝐴 ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {𝐴})))
2		nfdfat.2	. . . 4 ⊢ Ⅎ𝑥𝐴
3		nfdfat.1	. . . . 5 ⊢ Ⅎ𝑥𝐹
4	3	nfdm 5787	. . . 4 ⊢ Ⅎ𝑥dom 𝐹
5	2, 4	nfel 2969	. . 3 ⊢ Ⅎ𝑥 𝐴 ∈ dom 𝐹
6	2	nfsn 4603	. . . . 5 ⊢ Ⅎ𝑥{𝐴}
7	3, 6	nfres 5820	. . . 4 ⊢ Ⅎ𝑥(𝐹 ↾ {𝐴})
8	7	nffun 6347	. . 3 ⊢ Ⅎ𝑥Fun (𝐹 ↾ {𝐴})
9	5, 8	nfan 1900	. 2 ⊢ Ⅎ𝑥(𝐴 ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {𝐴}))
10	1, 9	nfxfr 1854	1 ⊢ Ⅎ𝑥 𝐹 defAt 𝐴

Syntax hints:   ∧ wa 399  Ⅎwnf 1785   ∈ wcel 2111  Ⅎwnfc 2936  {csn 4525  dom cdm 5519   ↾ cres 5521  Fun wfun 6318   defAt wdfat 43672

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ral 3111  df-rab 3115  df-v 3443  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-sn 4526  df-pr 4528  df-op 4532  df-br 5031  df-opab 5093  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-res 5531  df-fun 6326  df-dfat 43675

This theorem is referenced by:  nfafv  43692  nfafv2  43774