Theorem nfneg 8095

Description: Bound-variable hypothesis builder for the negative of a complex number. (Contributed by NM, 12-Jun-2005.) (Revised by Mario Carneiro, 15-Oct-2016.)

Hypothesis

Ref	Expression
nfneg.1	⊢ Ⅎ𝑥𝐴

Assertion

Ref	Expression
nfneg	⊢ Ⅎ𝑥-𝐴

Proof of Theorem nfneg

Step	Hyp	Ref	Expression
1		nfneg.1	. . . 4 ⊢ Ⅎ𝑥𝐴
2	1	a1i 9	. . 3 ⊢ (⊤ → Ⅎ𝑥𝐴)
3	2	nfnegd 8094	. 2 ⊢ (⊤ → Ⅎ𝑥-𝐴)
4	3	mptru 1352	1 ⊢ Ⅎ𝑥-𝐴

Syntax hints:  ⊤wtru 1344  Ⅎwnfc 2295  -cneg 8070

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-ext 2147

This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-rex 2450  df-v 2728  df-un 3120  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-br 3983  df-iota 5153  df-fv 5196  df-ov 5845  df-neg 8072

This theorem is referenced by:  infssuzcldc  11884