Proving Proposition: ##\forall x (P(x) \implies Q(x))##

  • Thread starter Thread starter Mr Davis 97
  • Start date Start date
Mr Davis 97
Messages
1,461
Reaction score
44

Homework Statement


What is the first step in proving a proposition of the form ##\forall x (P(x) \implies Q(x))##

Homework Equations

The Attempt at a Solution


So this isn't exactly a homework question, but I am just trying to figure things out. So say that we have a conjecture of the form ##\forall x (P(x) \implies Q(x))##. In my textbook, it says that to (formally) prove a proposition such as this, we first prove ##P(c) \implies Q(c)##, where c is an arbitrary element of the domain of discourse, and then by the inference rule of universal generalization, conclude that ##\forall x (P(x) \implies Q(x))##.

However, I confused as to how to get to the second step. First we begin with ##\forall x (P(x) \implies Q(x))##. So to get to ##P(c) \implies Q(c)## don't we need to apply universal instantiation? And to apply universal instantiation, don't we first need to know that ##\forall x (P(x) \implies Q(x))## is true? Isn't that kind of circular?
 
Physics news on Phys.org
Mr Davis 97 said:

Homework Statement


What is the first step in proving a proposition of the form ##\forall x (P(x) \implies Q(x))##

Homework Equations

The Attempt at a Solution


So this isn't exactly a homework question, but I am just trying to figure things out. So say that we have a conjecture of the form ##\forall x (P(x) \implies Q(x))##. In my textbook, it says that to (formally) prove a proposition such as this, we first prove ##P(c) \implies Q(c)##, where c is an arbitrary element of the domain of discourse, and then by the inference rule of universal generalization, conclude that ##\forall x (P(x) \implies Q(x))##.
I don't see that a second step is needed. Since c is chosen arbitrarily, and ##P(c) \implies Q(c)##, you can conclude that ##P(x) \implies Q(x)## for any x in the domain you're considering.
Mr Davis 97 said:
However, I confused as to how to get to the second step. First we begin with ##\forall x (P(x) \implies Q(x))##. So to get to ##P(c) \implies Q(c)## don't we need to apply universal instantiation? And to apply universal instantiation, don't we first need to know that ##\forall x (P(x) \implies Q(x))## is true? Isn't that kind of circular?
 
Mr Davis 97 said:

Homework Statement


What is the first step in proving a proposition of the form ##\forall x (P(x) \implies Q(x))##

Homework Equations

The Attempt at a Solution


So this isn't exactly a homework question, but I am just trying to figure things out. So say that we have a conjecture of the form ##\forall x (P(x) \implies Q(x))##. In my textbook, it says that to (formally) prove a proposition such as this, we first prove ##P(c) \implies Q(c)##, where c is an arbitrary element of the domain of discourse, and then by the inference rule of universal generalization, conclude that ##\forall x (P(x) \implies Q(x))##.

However, I confused as to how to get to the second step. First we begin with ##\forall x (P(x) \implies Q(x))##. So to get to ##P(c) \implies Q(c)## don't we need to apply universal instantiation? And to apply universal instantiation, don't we first need to know that ##\forall x (P(x) \implies Q(x))## is true? Isn't that kind of circular?

The statement ##P(x) \implies Q(x)## might be a theorem of some kind. Then establishing ##P(c) \implies Q(c)## amounts to giving a proof of the theorem. That may be easy, or it might be very difficult.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top