Metamath Proof Explorer


Theorem nfdfat

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, C_ , etc.). (Contributed by Alexander van der Vekens, 26-May-2017)

Ref Expression
Hypotheses nfdfat.1 _xF
nfdfat.2 _xA
Assertion nfdfat xFdefAtA

Proof

Step Hyp Ref Expression
1 nfdfat.1 _xF
2 nfdfat.2 _xA
3 df-dfat FdefAtAAdomFFunFA
4 1 nfdm _xdomF
5 2 4 nfel xAdomF
6 2 nfsn _xA
7 1 6 nfres _xFA
8 7 nffun xFunFA
9 5 8 nfan xAdomFFunFA
10 3 9 nfxfr xFdefAtA