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

Theorem nexdv 1321
Description: Deduction for generalization rule for negated wff.
Hypothesis
Ref Expression
nexdv.1 |- (ph -> -. ps)
Assertion
Ref Expression
nexdv |- (ph -> -. E.xps)
Distinct variable group:   ph,x

Proof of Theorem nexdv
StepHypRef Expression
1 ax-17 968 . 2 |- (ph -> A.xph)
2 nexdv.1 . 2 |- (ph -> -. ps)
31, 2nexd 1098 1 |- (ph -> -. E.xps)
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3  E.wex 977
This theorem is referenced by:  sbc2or 1948  relimasn 3409  fvprc 3706  fvopabn 3771  genpnnp 5080  dffsum 6936  dfisum 7127  efilcp 10445  efilcp2 10450
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-gen 960  ax-17 968  ax-4 970  ax-5o 972
This theorem depends on definitions:  df-bi 147  df-ex 978
Copyright terms: Public domain