# Homework Help: Proof by contradiction logic

1. Feb 18, 2012

### p3forlife

Hi, I have a question about proofs by contradiction in general. Without getting into the mathematical details, suppose we had the statement:

For every (condition A), B is true.

If we want to prove this by contradiction, we want to assume the negation of this statement, and then prove it to be false.

My question is, what is the statement we assume when we prove it by contradiction? Is it:

1. There exists a (condition A) such that B is not true.
2. For every (condition A), B is not true.

My guess is 1. But in this case, wouldn't it be hard to prove 1 by contradiction, because you are trying to prove a specific case to be false?

I usually have confusion with logic when "for every" and "there exist" crop up in statements. Then I'm not sure which "for every" and "there exist" to change to prove by contradiction or by contrapositive.

1. The problem statement, all variables and given/known data

2. Relevant equations

3. The attempt at a solution

2. Feb 18, 2012

### HallsofIvy

The "inverse" of "for every A, B is true" is "there exist A such that B is not true".

Think about it- if there exist a single condition on A for which B is not true, then "for every A, B is true" is wrong.

3. Feb 18, 2012

### HmBe

Let A be the event it rains. Let B be the event that the ground gets wet.

For all A, B = Whenever it rains, the ground gets wet.