Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > nfnt | GIF version |
Description: If 𝑥 is not free in 𝜑, then it is not free in ¬ 𝜑. (Contributed by Mario Carneiro, 24-Sep-2016.) (Proof shortened by Wolf Lammen, 28-Dec-2017.) (Revised by BJ, 24-Jul-2019.) |
Ref | Expression |
---|---|
nfnt | ⊢ (Ⅎ𝑥𝜑 → Ⅎ𝑥 ¬ 𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfnf1 1542 | . 2 ⊢ Ⅎ𝑥Ⅎ𝑥𝜑 | |
2 | df-nf 1459 | . . 3 ⊢ (Ⅎ𝑥𝜑 ↔ ∀𝑥(𝜑 → ∀𝑥𝜑)) | |
3 | hbnt 1651 | . . 3 ⊢ (∀𝑥(𝜑 → ∀𝑥𝜑) → (¬ 𝜑 → ∀𝑥 ¬ 𝜑)) | |
4 | 2, 3 | sylbi 121 | . 2 ⊢ (Ⅎ𝑥𝜑 → (¬ 𝜑 → ∀𝑥 ¬ 𝜑)) |
5 | 1, 4 | nfd 1521 | 1 ⊢ (Ⅎ𝑥𝜑 → Ⅎ𝑥 ¬ 𝜑) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∀wal 1351 Ⅎwnf 1458 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 614 ax-in2 615 ax-5 1445 ax-gen 1447 ax-ie2 1492 ax-4 1508 ax-ial 1532 |
This theorem depends on definitions: df-bi 117 df-tru 1356 df-fal 1359 df-nf 1459 |
This theorem is referenced by: nfnd 1655 nfn 1656 |
Copyright terms: Public domain | W3C validator |