My difficulties in the text _How to Prove It: A Structured Approach, 2 ed_

This is a thread for any major difficulties I come across in *How to Prove It: A Structured Approach, 2nd edition* by Daniel J. Velleman. This has a counterpart thread at Physics Forums, but it's been a day since I started it with no help yet.

**The Problem**

Exercise 1-(c), page 81. Analyze the logical forms of the following statements. You may use the symbols , , , , , , , , , and in your answers, but not , , , , , \, , , or . (Thus, you must write out the definitions of some set theory notation, and you must use equivalences to get rid of any occurrences of .)

Statement (c) is .

**My Solution Attempt**

The following answer seems correct to me, based on what I think I know from all the discussion in the text coming before this point. However, his answer in the appendix seems to be derived from facts that either were too subtle for me in the text or were not introduced. My answer ends on the fourth line, before the ellipses. Velleman's answer is on the last line after the ellipses. What I would like to know are the additional standard definitions or logical equivalences needed to arrive at his answer, even if I have to back up or start over.

Re: My difficulties in the text _How to Prove It: A Structured Approach, 2 ed_

I do now know why you complicated it like the third line. Where is the problem if it is like this

Your statement

?

Re: My difficulties in the text _How to Prove It: A Structured Approach, 2 ed_

The reason I might've overcomplicated it is because a major part of the section leading up to this problem discusses indexed families, where he says, "In general, any indexed family can also be defined as . It follows that the statement means the same thing as ." It's possible that I would've arrived at his answer if I fully grasped one of the three examples that came immediately after these statements, the third example of these three in particular, but in the second example of these three he indicates that "the easier equivalent way" of writing out the definitions logically, which he writes out and doesn't really explain, "would require the methods we will be studying in Chapter 3 [to show how they're equivalent]."

The third example of this set of examples goes like this:

3.

and

are not disjoint.

We must say that the two sets have a common element, so one solution is to start by writing

. However, in the last statement,

*there is an easier way* [my emphasis, where my mind would shut down because of what he said in the previous example indicating that the easier way involves an understanding given in the next chapter]. An element common to the two sets would have to be the square of some natural number and also the cube of some (possibly different) natural number. Thus, we could say that there is such a common element by saying

. [. . .]

Now you are probably right, but I am unfamiliar with the ampersand symbol . What does it mean exactly?

Re: My difficulties in the text _How to Prove It: A Structured Approach, 2 ed_

Re: My difficulties in the text _How to Prove It: A Structured Approach, 2 ed_

Kmath, would you be able to help me translate it? I am unable to translate the statement in a way that I know to be grammatically correct. Also, could you tell me a general rule that you use, something like

,

but that would help me understand the rule?

Re: My difficulties in the text _How to Prove It: A Structured Approach, 2 ed_

I did not quite understand your last post, If you mean the meaning of the symbol "&" I said it means "and".

for the second part: is the following not enough?

"if x=a and x=b then a=b"

"for all x=b there is x=c is the same as for all there is b and a=b"

Re: My difficulties in the text _How to Prove It: A Structured Approach, 2 ed_

Quote:

Originally Posted by

**Kmath** I do now know why you complicated it like the third line. Where is the problem if it is like this

Your statement

?

Sorry, this is a misleading answer. First, & is not among the allowed symbols in post #1. Even if & is a synonym for ∧, is not a well-formed formula (part). Perhaps you mean or . A similar remark can be made about the second half of the formula with ∃. Overall, it is hard to say what you mean. Also, {nē + n + 1} is a singleton; it is very different from {nē + n + 1 | n ∈ ℕ}.

Re: My difficulties in the text _How to Prove It: A Structured Approach, 2 ed_

Quote:

Originally Posted by

**emakarov** Sorry, this is a misleading answer. First, & is not among the allowed symbols in post #1. Even if & is a synonym for ∧,

is not a well-formed formula (part). Perhaps you mean

or

. A similar remark can be made about the second half of the formula with ∃. Overall, it is hard to say what you mean. Also, {nē + n + 1} is a singleton; it is very different from {nē + n + 1 | n ∈ ℕ}.

yes you are completely right. I just use contractions and I think my idea is reached.

Re: My difficulties in the text _How to Prove It: A Structured Approach, 2 ed_

It also seemed to me not to be a wff, but I wasn't sure. Kmath, I meant that I couldn't myself translate the logical statement in your first post into a grammatically correct one.

I looked over the second example in the text that I alluded to earlier, probably for the 20th time, and then just took it all for granted. The following is that example, and then after that is my new solution patterned after this example, which I will have to reflect on a little more so that I feel that I understand it sufficiently.

**The Example**

2. Analyze the logical form of the statement

by writing out the definitions of the set theory notation used.

*Solution*. By the definition of subset we must say that every element of

is also an element of

, so we could start by writing

. Filling in the meaning of

, which we worked out earlier, we would end up with

. But since the elements of

are just the

's, for all

, perhaps an easier way of saying that every element of

is an element of

would be

. The two answers we have given are equivalent, but showing this would require the methods we will be studying in Chapter 3.

**My New Solution**

If Example 2 says, in regard to a certain set being a subset of another set, that "every element of is an element of would be [to say] ," then the logical form of the statement can be analyzed as