| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Deduction for generalization rule for negated wff. |
| Ref | Expression |
|---|---|
| nexd.1 |
|
| nexd.2 |
|
| Ref | Expression |
|---|---|
| nexd |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nexd.1 |
. . 3
| |
| 2 | nexd.2 |
. . 3
| |
| 3 | 1, 2 | 19.21ai 998 |
. 2
|
| 4 | alnex 1033 |
. 2
| |
| 5 | 3, 4 | sylib 198 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: nexdv 1326 axrepnd 4946 axunndlem1 4947 axunnd 4948 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-gen 963 ax-4 973 ax-5o 975 |
| This theorem depends on definitions: df-bi 147 df-ex 981 |