Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > hbnt | Structured version Visualization version GIF version |
Description: Closed theorem version of bound-variable hypothesis builder hbn 2295. (Contributed by NM, 10-May-1993.) (Proof shortened by Wolf Lammen, 14-Oct-2021.) |
Ref | Expression |
---|---|
hbnt | ⊢ (∀𝑥(𝜑 → ∀𝑥𝜑) → (¬ 𝜑 → ∀𝑥 ¬ 𝜑)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nf5-1 2144 | . . 3 ⊢ (∀𝑥(𝜑 → ∀𝑥𝜑) → Ⅎ𝑥𝜑) | |
2 | 1 | nfnd 1864 | . 2 ⊢ (∀𝑥(𝜑 → ∀𝑥𝜑) → Ⅎ𝑥 ¬ 𝜑) |
3 | 2 | nf5rd 2192 | 1 ⊢ (∀𝑥(𝜑 → ∀𝑥𝜑) → (¬ 𝜑 → ∀𝑥 ¬ 𝜑)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∀wal 1539 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1801 ax-4 1815 ax-5 1916 ax-6 1974 ax-7 2014 ax-10 2140 ax-12 2174 |
This theorem depends on definitions: df-bi 206 df-or 844 df-ex 1786 df-nf 1790 |
This theorem is referenced by: hbn 2295 hbnd 2296 bj-hbext 34871 |
Copyright terms: Public domain | W3C validator |