| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Deduction for generalization rule for negated wff. |
| Ref | Expression |
|---|---|
| nexdv.1 |
|
| Ref | Expression |
|---|---|
| nexdv |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-17 925 |
. 2
| |
| 2 | nexdv.1 |
. 2
| |
| 3 | 1, 2 | nexd 780 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: sbc2or 1454 imasn 2616 fvprc 2829 genpnnp 3902 |
| This theorem was proved from axioms: ax-1 3 ax-2 4 ax-3 5 ax-mp 6 ax-4 673 ax-5 674 ax-gen 677 ax-17 925 |
| This theorem depends on definitions: df-bi 128 df-ex 679 |