Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nfneg | Structured version Visualization version GIF version |
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.) |
Ref | Expression |
---|---|
nfneg.1 | ⊢ Ⅎ𝑥𝐴 |
Ref | Expression |
---|---|
nfneg | ⊢ Ⅎ𝑥-𝐴 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfneg.1 | . . . 4 ⊢ Ⅎ𝑥𝐴 | |
2 | 1 | a1i 11 | . . 3 ⊢ (⊤ → Ⅎ𝑥𝐴) |
3 | 2 | nfnegd 10276 | . 2 ⊢ (⊤ → Ⅎ𝑥-𝐴) |
4 | 3 | trud 1493 | 1 ⊢ Ⅎ𝑥-𝐴 |
Colors of variables: wff setvar class |
Syntax hints: ⊤wtru 1484 Ⅎwnfc 2751 -cneg 10267 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ral 2917 df-rex 2918 df-rab 2921 df-v 3202 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-br 4654 df-iota 5851 df-fv 5896 df-ov 6653 df-neg 10269 |
This theorem is referenced by: riotaneg 11002 zriotaneg 11491 infcvgaux1i 14589 mbfposb 23420 dvfsum2 23797 infnsuprnmpt 39465 neglimc 39879 stoweidlem23 40240 stoweidlem47 40264 |
Copyright terms: Public domain | W3C validator |