| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nexd | Structured version Visualization version GIF version | ||
| Description: Deduction for generalization rule for negated wff. (Contributed by Mario Carneiro, 24-Sep-2016.) |
| Ref | Expression |
|---|---|
| nexd.1 | ⊢ Ⅎ𝑥𝜑 |
| nexd.2 | ⊢ (𝜑 → ¬ 𝜓) |
| Ref | Expression |
|---|---|
| nexd | ⊢ (𝜑 → ¬ ∃𝑥𝜓) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nexd.1 | . . 3 ⊢ Ⅎ𝑥𝜑 | |
| 2 | 1 | nf5ri 2195 | . 2 ⊢ (𝜑 → ∀𝑥𝜑) |
| 3 | nexd.2 | . 2 ⊢ (𝜑 → ¬ 𝜓) | |
| 4 | 2, 3 | nexdh 1865 | 1 ⊢ (𝜑 → ¬ ∃𝑥𝜓) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∃wex 1779 Ⅎwnf 1783 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-12 2177 |
| This theorem depends on definitions: df-bi 207 df-ex 1780 df-nf 1784 |
| This theorem is referenced by: axrepnd 10634 axunnd 10636 |
| Copyright terms: Public domain | W3C validator |