| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nfnt | Structured version Visualization version GIF version | ||
| Description: If a variable is nonfree in a proposition, then it is nonfree in its negation. (Contributed by Mario Carneiro, 24-Sep-2016.) (Proof shortened by Wolf Lammen, 28-Dec-2017.) (Revised by BJ, 24-Jul-2019.) df-nf 1784 changed. (Revised by Wolf Lammen, 4-Oct-2021.) |
| Ref | Expression |
|---|---|
| nfnt | ⊢ (Ⅎ𝑥𝜑 → Ⅎ𝑥 ¬ 𝜑) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfnbi 1855 | . 2 ⊢ (Ⅎ𝑥𝜑 ↔ Ⅎ𝑥 ¬ 𝜑) | |
| 2 | 1 | biimpi 216 | 1 ⊢ (Ⅎ𝑥𝜑 → Ⅎ𝑥 ¬ 𝜑) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 Ⅎwnf 1783 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 |
| This theorem depends on definitions: df-bi 207 df-or 848 df-ex 1780 df-nf 1784 |
| This theorem is referenced by: nfn 1857 nfnd 1858 wl-nfeqfb 37559 wl-sb8eft 37574 |
| Copyright terms: Public domain | W3C validator |