Theorem nfdfat 48336

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 48329	. 2 ⊢ (𝐹 defAt 𝐴 ↔ (𝐴 ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {𝐴})))
2		nfdfat.2	. . . 4 ⊢ Ⅎ𝑥𝐴
3		nfdfat.1	. . . . 5 ⊢ Ⅎ𝑥𝐹
4	3	nfdm 5937	. . . 4 ⊢ Ⅎ𝑥dom 𝐹
5	2, 4	nfel 2939	. . 3 ⊢ Ⅎ𝑥 𝐴 ∈ dom 𝐹
6	2	nfsn 4667	. . . . 5 ⊢ Ⅎ𝑥{𝐴}
7	3, 6	nfres 5976	. . . 4 ⊢ Ⅎ𝑥(𝐹 ↾ {𝐴})
8	7	nffun 6570	. . 3 ⊢ Ⅎ𝑥Fun (𝐹 ↾ {𝐴})
9	5, 8	nfan 1933	. 2 ⊢ Ⅎ𝑥(𝐴 ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {𝐴}))
10	1, 9	nfxfr 1885	1 ⊢ Ⅎ𝑥 𝐹 defAt 𝐴

This proof depends on syntax axioms:   ∧ wa 401  Ⅎwnf 1815   ∈ wcel 2146  Ⅎwnfc 2910  {csn 4587  dom cdm 5654   ↾ cres 5656  Fun wfun 6540   defAt wdfat 48326

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ral 3080  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4838  df-br 5106  df-opab 5170  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-res 5666  df-fun 6548  df-dfat 48329

This theorem is used by:  nfafv  48345  nfafv2  48427