HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem nexd 780
Description: Deduction for generalization rule for negated wff.
Hypotheses
Ref Expression
nexd.1 |- (ph -> A.xph)
nexd.2 |- (ph -> -. ps)
Assertion
Ref Expression
nexd |- (ph -> -. E.xps)

Proof of Theorem nexd
StepHypRef Expression
1 nexd.1 . . 3 |- (ph -> A.xph)
2 nexd.2 . . 3 |- (ph -> -. ps)
31, 219.21ai 740 . 2 |- (ph -> A.x -. ps)
4 alnex 716 . 2 |- (A.x -. ps <-> -. E.xps)
53, 4sylib 173 1 |- (ph -> -. E.xps)
Colors of variables: wff set class
Syntax hints:  -. wn 1   -> wi 2  A.wal 672  E.wex 678
This theorem is referenced by:  nexdv 983  axrepnd 3740  axunndlem1 3741  axunnd 3742
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
This theorem depends on definitions:  df-bi 128  df-ex 679
metamath.org