Theorem nfdfat 48470

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 48463	. 2 ⊢ (𝐹 defAt 𝐴 ↔ (𝐴 ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {𝐴})))
2		nfdfat.2	. . . 4 ⊢ Ⅎ𝑥𝐴
3		nfdfat.1	. . . . 5 ⊢ Ⅎ𝑥𝐹
4	3	nfdm 5945	. . . 4 ⊢ Ⅎ𝑥dom 𝐹
5	2, 4	nfel 2940	. . 3 ⊢ Ⅎ𝑥 𝐴 ∈ dom 𝐹
6	2	nfsn 4669	. . . . 5 ⊢ Ⅎ𝑥{𝐴}
7	3, 6	nfres 5988	. . . 4 ⊢ Ⅎ𝑥(𝐹 ↾ {𝐴})
8	7	nffun 6590	. . 3 ⊢ Ⅎ𝑥Fun (𝐹 ↾ {𝐴})
9	5, 8	nfan 1934	. 2 ⊢ Ⅎ𝑥(𝐴 ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {𝐴}))
10	1, 9	nfxfr 1886	1 ⊢ Ⅎ𝑥 𝐹 defAt 𝐴

This proof depends on syntax axioms:   ∧ wa 401  Ⅎwnf 1816   ∈ wcel 2147  Ⅎwnfc 2911  {csn 4588  dom cdm 5658   ↾ cres 5660  Fun wfun 6560   defAt wdfat 48460

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735

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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-br 5109  df-opab 5174  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-res 5670  df-fun 6568  df-dfat 48463

This theorem is used by:  nfafv  48479  nfafv2  48561