Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nfna1 | Structured version Visualization version GIF version |
Description: A convenience theorem particularly designed to remove dependencies on ax-11 2021 in conjunction with distinctors. (Contributed by Wolf Lammen, 2-Sep-2018.) |
Ref | Expression |
---|---|
nfna1 | ⊢ Ⅎ𝑥 ¬ ∀𝑥𝜑 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfa1 2015 | . 2 ⊢ Ⅎ𝑥∀𝑥𝜑 | |
2 | 1 | nfn 1768 | 1 ⊢ Ⅎ𝑥 ¬ ∀𝑥𝜑 |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ∀wal 1473 Ⅎwnf 1699 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-10 2006 |
This theorem depends on definitions: df-bi 196 df-or 384 df-ex 1696 df-nf 1701 |
This theorem is referenced by: dvelimhw 2159 nfeqf 2289 equs5 2339 nfsb2 2348 wl-equsb3 32516 wl-sbcom2d-lem1 32521 wl-ax11-lem3 32543 wl-ax11-lem4 32544 wl-ax11-lem6 32546 wl-ax11-lem7 32547 |
Copyright terms: Public domain | W3C validator |