Thread: proof involving subests

Prove or give a counter example.
I said
True.
let then
let then


is that enough of a proof?

Originally Posted by Jskid

Prove or give a counter example.
I said
True.
let then
let then

is that enough of a proof?

You need to start with: suppose that .
then .
Now what?

Suppose it is an if and only if statment. Then I need to prove it forwards (which I did) and backwards. It really confuses me this direction thing. How would the backwards proof look like?
Wouldn't it be the same
Suppose ...

the forward direction has 3 premises:
A ⊆ C, B ⊆ D, and (x,y) ∈ AxB

from which you derive (x,y) ∈ CxD showing the set containment AxB ⊆ CxD.

the reverse implication (backwards) also has 3 premises:

AxB ⊆ CxD, x ∈ A, y ∈ B

from which you derive the 2 conclusions x ∈ C, y ∈ D, showing the containments A ⊆ C, B ⊆ D.

do you see the difference?

Ok,

I have a related advice here. When the problem says to check the following statement , if its true then prove it. If its false give counterexample. In these kinds of problems, its difficult to figure whats the situation. The best approach which I have found is start proving the given statement. If its true, then you will prove it somehow. If its not true, then you will get stuck at some point in the proof. Its this place where you will get hints to come up with counterexample. I think this is the best approach when the problem asks for counterexample to some given statement.