Tell me more ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

What I'm trying to prove, using propositional and quantifier rules, is

$$\neg \exists{x} \; A(x) \iff \forall{x} \; \neg A(x).$$

So far, I've only started proving it left to the right, and I'm stuck. What I have:

1: $\neg \exists{x} \; A(x)$

2: x fresh 2. open UG box

3: $\neg\neg A(x)$ 3. open RAA box

n-2. # n-2. close RAA

n-1. not A n-1. RAA 3 to n-2, close UG box

n. $\forall{x} \; \neg A(x)$

I just don't know how to deal with the 'not' in line 1.

share|improve this question
5  
Please reveal which quantifier rules you're allowed to use here. "UG box" and "RAA box" don't seem to be standard notation; they might be specific to the text you're working from. – Henning Makholm Oct 9 '12 at 18:47

1 Answer

Hint. Try this strategy instead. After line 1, start a subproof with the assumption $A(a)$. That quickly yields a contradiction (why)? So you can use RAA to conclude $\neg A(a)$. And now the end is in sight ...

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.