Theorem nfdfat 48196

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 48188	. 2 ⊢ (𝐹 defAt 𝐴 ↔ (𝐴 ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {𝐴})))
2		nfdfat.2	. . . 4 ⊢ Ⅎ𝑥𝐴
3		nfdfat.1	. . . . 5 ⊢ Ⅎ𝑥𝐹
4	3	nfdm 5933	. . . 4 ⊢ Ⅎ𝑥dom 𝐹
5	2, 4	nfel 2937	. . 3 ⊢ Ⅎ𝑥 𝐴 ∈ dom 𝐹
6	2	nfsn 4668	. . . . 5 ⊢ Ⅎ𝑥{𝐴}
7	3, 6	nfres 5972	. . . 4 ⊢ Ⅎ𝑥(𝐹 ↾ {𝐴})
8	7	nffun 6562	. . 3 ⊢ Ⅎ𝑥Fun (𝐹 ↾ {𝐴})
9	5, 8	nfan 1932	. 2 ⊢ Ⅎ𝑥(𝐴 ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {𝐴}))
10	1, 9	nfxfr 1886	1 ⊢ Ⅎ𝑥 𝐹 defAt 𝐴

This proof depends on syntax axioms:   ∧ wa 401  Ⅎwnf 1816   ∈ wcel 2145  Ⅎwnfc 2908  {csn 4584  dom cdm 5651   ↾ cres 5653  Fun wfun 6532   defAt wdfat 48185

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ral 3078  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-res 5663  df-fun 6540  df-dfat 48188

This theorem is used by:  nfafv  48205  nfafv2  48287