Prove using set logic and notation.
1.IF A is a subset of B then A is a proper subset of B

Question

unklerhaukus · Answer

are you sure you have the question right?

anonymous · Answer

one sec

anonymous · Answer

yep that is the question im supposed to prove or disprove it

unklerhaukus · Answer

well thats different

anonymous · Answer

lol

anonymous · Answer

my bad

unklerhaukus · Answer

does it seam like a true statement?

unklerhaukus · Answer

$$ (A\subseteq B)\Rightarrow (A\subsetneq B)$$

anonymous · Answer

well the way you stated it there it does not seem so but

anonymous · Answer

i think there is an instance where this statement is true is where there exist an element in B that is not in A
hence  A and B are not equal but
A is still a subset of B

unklerhaukus · Answer

the statement is an implication , if an implication is ever false, it is always false  

the case to consider is when A=B

anonymous · Answer

i think i understand what ur saying

anonymous · Answer

but

anonymous · Answer

nahh ur right

anonymous · Answer

The problem is that we are dealing with one instance and
by definition of a proper set
If A is a subset of B and 
A is not equal to B
then A is a proper set of B


So if i cannot show that A is not equal to with what was given to me the statement must be false?

anonymous · Answer

oh wait nevermind i get it LOL