Question about proof from a guy with a highschool education

Click For Summary
The discussion focuses on understanding mathematical proofs, particularly how to present them correctly. A user seeks to prove that if A + B = C, then A - B = C - 2B, and receives feedback on the importance of justifying each step and clearly stating axioms and lemmas. Participants emphasize that proofs should start from accepted assumptions and proceed logically, avoiding assumptions that are not proven. The conversation also touches on the common lack of proof-writing skills among high school and undergraduate students, highlighting the need for practice and guidance. Overall, the thread serves as a resource for beginners to improve their understanding of mathematical proofs.
  • #601
micromass said:
What is the definition of ##(1,2)## and the other couples?

Definition of a couple? Not sure , my guess would be that the first componant is an element of ##A## and the second is an element of ##B##.

What if you take the union?

What do you mean by "take the union"?
 
Mathematics news on Phys.org
  • #603
reenmachine said:
So does ##(1,2)\cup (1,3)\cup (2,2)\cup (2,3) = \{1,2,3\}## ?

reenmachine said:
Definition of a couple? Not sure
"Couple" isn't the right word in English. It's "pair". And when we say "pair", we mean "ordered pair".

reenmachine said:
What do you mean by "take the union"?
Use the definition of ##\cup## to rewrite ##(1,2)\cup (1,3)\cup (2,2)\cup (2,3)## in the form {something,something,...,something}.

Then use that you know what it means for two sets to be equal. X=Y if and only if...
 
  • #604
Fredrik said:
You're making it complicated by choosing a set with ordered pairs as elements, but maybe you meant { when you wrote (? I will consider the example with { instead.

If ##A=\{\{0,1\},\{1,2\}\}##, then ##\bigcup A=\{0,1\}\cup\{1,2\}=\{0,1,2\}##.

This is the post that confused me yesterday , in MY quote I used ordered pairs but you didn't but I got mixed up for some reasons.So I thought you could take all the components of the ordered pairs to form the new ##\cup## set.
 
  • #605
Fredrik said:
Use the definition of ##\cup## to rewrite ##(1,2)\cup (1,3)\cup (2,2)\cup (2,3)## in the form {something,something,...,something}.

Then use that you know what it means for two sets to be equal. X=Y if and only if...

That would be ##\{ \{1\} , \{1,2\} , \{1,3\} , \{2\} , \{2,2\} , \{2,3\} \}##

X=Y if and only if all elements of X are in Y and all elements of Y are in X.
 
  • #606
reenmachine said:
That would be ##\{ \{1\} , \{1,2\} , \{1,3\} , \{2\} , \{2,2\} , \{2,3\} \}##

Right. So

\bigcup (A\times B) = \{ \{1\} , \{1,2\} , \{1,3\} , \{2\} , \{2,2\} , \{2,3\} \}

Now, what about

\bigcup \bigcup (A\times B) = \bigcup \{ \{1\} , \{1,2\} , \{1,3\} , \{2\} , \{2,2\} , \{2,3\} \}
 
  • #607
micromass said:
Right. So

\bigcup (A\times B) = \{ \{1\} , \{1,2\} , \{1,3\} , \{2\} , \{2,2\} , \{2,3\} \}

Now, what about

\bigcup \bigcup (A\times B) = \bigcup \{ \{1\} , \{1,2\} , \{1,3\} , \{2\} , \{2,2\} , \{2,3\} \}

Since the elements aren't ordered pairs anymore , then now I guess ##\bigcup \{ \{1\} , \{1,2\} , \{1,3\} , \{2\} , \{2,2\} , \{2,3\} \} = \{1,2,3\}##

So basically my hypothesis that you need a ''higher'' level of U to achieve this result was true?
 
  • #608
reenmachine said:
Since the elements aren't ordered pairs anymore , then now I guess ##\bigcup \{ \{1\} , \{1,2\} , \{1,3\} , \{2\} , \{2,2\} , \{2,3\} \} = \{1,2,3\}##

Yes.

So basically my hypothesis that you need a ''higher'' level of U to achieve this result was true?

Correct.
 
  • #609
micromass said:
Yes.
Correct.

Finally I get something right , getting rare these days :smile:

thanks guys!
 
  • #610
It still leaves me with the problem $$\bigcup_{i \in N}R × [i , i + 1]$$.

If elements are going to ressemble something like ##\{π\} , \{π , 4.3565\}##(with ##i = 4##) (from the ordered pair ##(π,4.3565)##) , but ##\{π\}## isn't ##π## so how do I proceed to describe them?

##\{π\}## isn't in ##R## right?

But ##π## is.

Edit: What I do know is that $$\bigcup(\bigcup_{i \in N}R × [i , i + 1]) = R$$

So $$\bigcup_{i \in N}R × [i , i + 1]$$ will be the set of all element ##\{a\}## with ##a \in R## and all elements ##\{a,d\}## with ##d \in R \ \ 1 ≤ d##.
 
Last edited:
  • #611
reenmachine said:
I'm back!

I want something to be crystal clear in my head:

##A=\{1,2\}##
##B=\{2,3\}##
##A \cup B = \{1,2,3\}##
##A \cap B = \{2\}##
##A × B = \{(1,2) , (1,3) , (2,2) , (2,3)\}##

Then what exactly is $$\bigcup(A × B)$$ ?

Is it ##\{1,2,3\}##?

Basically , when you have to unionize a cartesian product set , you take all the elements inside the ordered pairs to make the set?

So any notation like $$\bigcup(A × B)$$ with a cartesian product will be equal to ##A \cup B##?

Formally, the ordered set (a,b) denotes the set {{a}, {a,b}}. Hence

##\bigcup{(A{\times}B)}=\bigcup{\{(1,2),(1,3),(2,2),(2,3)\}}##

##=\bigcup{ \{\{\{1\},\{1,2\}\},\{\{1\},\{1,3\}\},\{\{2\},\{2,2\}\},\{\{2\},\{2,3\}\}\} }##

##=\bigcup{ \{\{\{1\},\{1,2\}\},\{\{1\},\{1,3\}\},\{\{2\},\{2\}\},\{\{2\},\{2,3\}\}\} }##

##=\bigcup{ \{\{\{1\},\{1,2\}\},\{\{1\},\{1,3\}\},\{\{2\}\},\{\{2\},\{2,3\}\}\} }##

##=\{\{1\},\{1,2\},\{1\},\{1,3\},\{2\},\{2\},\{2,3\}\}##

##=\{\{1\},\{1,2\},\{1,3\},\{2\},\{2,3\}\}.##

Hope this helps.
 
  • #612
About $$\bigcup_{i \in N}R × [i , i + 1]$$

Since this is probably more of a conceptual question I'll ask it here.

My last and final attempt at denoting this set : ##\{\{x\},\{x,y\} |\ x,y \in R \ \ y ≥ 1 \}##

I checked the book's solution , which is ##\{(x,y) : x,y \in R \ \ y ≥ 1\}##

I find it weird that the dummy variables would be put between "()" like it's an ordered pair to present the set such as "the set of all (x,y) such that...".Anybody can enlighten me on using my method versus the one in the book concerning the left side of the notation?

If the elements of the set I'm trying to denote will be between brackets such as ##\{1\} , \{1,2\}, \{2\} , \{2,1\}## for the set ##(1,2) \cup (2,1)## then why would I present the dummy variables between "()" in the notation instead of {}?
 
  • #613
reenmachine said:
About $$\bigcup_{i \in N}R × [i , i + 1]$$

Since this is probably more of a conceptual question I'll ask it here.

My last and final attempt at denoting this set : ##\{\{x\},\{x,y\} |\ x,y \in R \ \ y ≥ 1 \}##

I checked the book's solution , which is ##\{(x,y) : x,y \in R \ \ y ≥ 1\}##

I find it weird that the dummy variables would be put between "()" like it's an ordered pair to present the set such as "the set of all (x,y) such that...".Anybody can enlighten me on using my method versus the one in the book concerning the left side of the notation?

If the elements of the set I'm trying to denote will be between brackets such as ##\{1\} , \{1,2\}, \{2\} , \{2,1\}## for the set ##(1,2) \cup (2,1)## then why would I present the dummy variables between "()" in the notation instead of {}?
The elements of ##\bigcup_{i \in N}\mathbb R × [i , i + 1]## are all ordered pairs, so it makes a lot of sense to describe the set in the form "the set of all ordered pairs such that..." You could write {{x},{x,y}} instead of (x,y), but you wrote {x},{x,y}. Apart from that it's fine, but I would prefer to see a comma or a ##\land## between the two properties. Without a symbol there, a reader might think that you forgot to put one there, and might be unsure if you meant ##\land##, ##\lor## or something else.

Most people prefer to write (x,y) because it's simpler. Some (e.g. physics students) do it because they don't even know that there's a definition of (x,y). They just know that ordered pairs have the property that (a,b)=(c,d) if and only if a=c and b=d.

The set can also be written as
$$\{(x,y)\in\mathbb R\times\mathbb R : y\geq 1\}$$ or as
$$\{z\in\mathbb R\times\mathbb R:\exists x,y~~(z=(x,y)~\land~y\geq 1)\}.$$
 
Last edited:
  • #614
Fredrik said:
The elements of ##\bigcup_{i \in N}\mathbb R × [i , i + 1]## are all ordered pairs, so it makes a lot of sense to describe the set in the form "the set of all ordered pairs such that..." You could write {{x},{x,y}} instead of (x,y), but you wrote {x},{x,y}. Apart from that it's fine, but I would prefer to see a comma or a ##\land## between the two properties. Without a symbol there, a reader might think that you forgot to put one there, and might be unsure if you meant ##\land##, ##\lor## or something else.

Most people prefer to write (x,y) because it's simpler. Some (e.g. physics students) do it because they don't even know that there's a definition of (x,y). They just know that ordered pairs have the property that (a,b)=(c,d) if and only if a=c and b=d.

The set can also be written as
$$\{(x,y)\in\mathbb R\times\mathbb R : y\geq 1\}$$ or as
$$\{z\in\mathbb R\times\mathbb R:\exists x,y~~(z=(x,y)~\land~y\geq 1)\}.$$

Now I'm lost again.

You ask me to re-write ##(1,2)\cup (1,3)\cup (2,2)\cup (2,3)## in the form of ##\{something,something...\}##.

I then responded with ##\{ \{1\} , \{1,2\} , \{1,3\} , \{2\} , \{2,2\} , \{2,3\} \}## to which micromass responded that I was correct.But in ##\{ \{1\} , \{1,2\} , \{1,3\} , \{2\} , \{2,2\} , \{2,3\} \}## , the ordered pairs aren't between brackets like for example: ##\{ \{\{1\} , \{1,2\}\} , \{\{1\},\{1,3\}\} , \{\{2\} , \{2,2\}\} ,\{\{2\} \{2,3\}\} \}##.

Micromass then asked me to find the elements of \bigcup \bigcup (A\times B) = \bigcup \{ \{1\} , \{1,2\} , \{1,3\} , \{2\} , \{2,2\} , \{2,3\} \}

To which I responded ##\{1,2,3\}##.

But if the previous set was to be ##\{ \{\{1\} , \{1,2\}\} , \{\{1\},\{1,3\}\} , \{\{2\} , \{2,2\}\} ,\{\{2\} \{2,3\}\} \}## instead of ##\{ \{1\} , \{1,2\} , \{1,3\} , \{2\} , \{2,2\} , \{2,3\} \}## , then the double-unionized set would have been ##\{ \{1\} , \{1,2\} , \{1,3\} , \{2\} , \{2,2\} , \{2,3\} \}## instead of ##\{1,2,3\}## no?

What am I missing?
 
  • #615
reenmachine said:
You ask me to re-write ##(1,2)\cup (1,3)\cup (2,2)\cup (2,3)## in the form of ##\{something,something...\}##.
You asked if ##(1,2)\cup (1,3)\cup (2,2)\cup (2,3) = \{1,2,3\}##, so I asked you to rewrite the left-hand side in the form {something,something,...} so you can check if this equality holds or not.

reenmachine said:
I then responded with ##\{ \{1\} , \{1,2\} , \{1,3\} , \{2\} , \{2,2\} , \{2,3\} \}## to which micromass responded that I was correct.
\begin{align}&(1,2)\cup (1,3)\cup (2,2)\cup (2,3)\\
&=\{\{1\},\{1,2\}\} \cup\{\{1\},\{1,3\}\} \cup\{\{2\},\{2,2\}\} \cup\{\{2\},\{2,3\}\}\\
&=\{ \{1\},\{1,2\},\{1\},\{1,3\},\{2\},\{2,2\},\{2\},\{2,3\} \}\\
&=\{\{1\},\{1,2\},\{1,3\},\{2\},\{2,2\},\{2,3\}\}
\end{align} Now it's trivial to see that the equality you asked about doesn't hold. You just have to see that {3} is an element of the set on the right, but not an element of the set on the left.

reenmachine said:
But in ##\{ \{1\} , \{1,2\} , \{1,3\} , \{2\} , \{2,2\} , \{2,3\} \}## , the ordered pairs aren't between brackets
None of the elements of this set is an ordered pair. But some of its subsets are, e.g. ##\{\{1\},\{1,3\}\}## and ##\{\{2\},\{2,3\}\}##.

reenmachine said:
like for example: ##\{ \{\{1\} , \{1,2\}\} , \{\{1\},\{1,3\}\} , \{\{2\} , \{2,2\}\} ,\{\{2\} \{2,3\}\} \}##.
This set is equal to {(1,2),(1,3),(2,2),(2,3)}.

reenmachine said:
Micromass then asked me to find the elements of \bigcup \bigcup (A\times B) = \bigcup \{ \{1\} , \{1,2\} , \{1,3\} , \{2\} , \{2,2\} , \{2,3\} \}

To which I responded ##\{1,2,3\}##.
Good.

reenmachine said:
But if the previous set was to be ##\{ \{\{1\} , \{1,2\}\} , \{\{1\},\{1,3\}\} , \{\{2\} , \{2,2\}\} ,\{\{2\} \{2,3\}\} \}## instead of ##\{ \{1\} , \{1,2\} , \{1,3\} , \{2\} , \{2,2\} , \{2,3\} \}## ,
It wasn't. That first set is equal to {(1,2),(1,3),(2,2),(2,3)}, which is equal to ##A\times B##. The second is equal to ##\bigcup A\times B##.
 
  • #616
Fredrik said:
\begin{align}&(1,2)\cup (1,3)\cup (2,2)\cup (2,3)\\
&=\{\{1\},\{1,2\}\} \cup\{\{1\},\{1,3\}\} \cup\{\{2\},\{2,2\}\} \cup\{\{2\},\{2,3\}\}\\
&=\{ \{1\},\{1,2\},\{1\},\{1,3\},\{2\},\{2,2\},\{2\},\{2,3\} \}\\
&=\{\{1\},\{1,2\},\{1,3\},\{2\},\{2,2\},\{2,3\}\}
\end{align} Now it's trivial to see that the equality you asked about doesn't hold. You just have to see that {3} is an element of the set on the right, but not an element of the set on the left.

Hmm yeah that makes more sense.

None of the elements of this set is an ordered pair. But some of its subsets are, e.g. ##\{\{1\},\{1,3\}\}## and ##\{\{2\},\{2,3\}\}##.

Fredrik said:
The elements of ##\bigcup_{i \in N}\mathbb R × [i , i + 1]## are all ordered pairs

Ok , but since ##\{\{1\},\{1,2\},\{1,3\},\{2\},\{2,2\},\{2,3\}\} = \bigcup A × B## if ##A=\{1,2\}## and ##B=\{2,3\}## and you're saying that none of the elements of this set is an ordered pair , why would the elements of the set ##\bigcup_{i \in N}R × [i , i +1]## be ordered pairs? Isn't this the same situation as ##\bigcup A × B##? This is probably the key part that I'm not sure to understand.What is the difference? The very exemple we were talking about is the reason I wrote ##\{x\},\{x,y\}## instead of ##(x,y)##.

Basically , what I think is that elements of ##R × [i , i +1]## are ordered pairs but that elements of ##\bigcup_{i \in N}R × [i , i +1]## will come out similarly to the elements of the set ##\{\{1\},\{1,2\},\{1,3\},\{2\},\{2,2\},\{2,3\}\}## , which you told me weren't ordered pairs.

thanks man! Hope you are having a nice week-end!
 
Last edited:
  • #617
reenmachine said:
Ok , but since ##\{\{1\},\{1,2\},\{1,3\},\{2\},\{2,2\},\{2,3\}\} = \bigcup A × B## if ##A=\{1,2\}## and ##B=\{2,3\}## and you're saying that none of the elements of this set is an ordered pair , why would the elements of the set ##\bigcup_{i \in N}R × [i , i +1]## be ordered pairs? Isn't this the same situation as ##\bigcup A × B##? This is probably the key part that I'm not sure to understand.What is the difference? The very exemple we were talking about is the reason I wrote ##\{x\},\{x,y\}## instead of ##(x,y)##.

Basically , what I think is that elements of ##R × [i , i +1]## are ordered pairs but that elements of ##\bigcup_{i \in N}R × [i , i +1]## will come out similarly to the elements of the set ##\{\{1\},\{1,2\},\{1,3\},\{2\},\{2,2\},\{2,3\}\}## , which you told me weren't ordered pairs.

thanks man! Hope you are having a nice week-end!
All you have to do to see that the elements of ##\bigcup_{i\in\mathbb N}\mathbb R\times[i,i+1]## are ordered pairs is to note that every element of ##\bigcup_{i\in\mathbb N}\mathbb R\times[i,i+1]## is an element of at least one of the ##\mathbb R\times[i,i+1]## sets.

The source of the confusion seems to be the similarity between the notations
$$\bigcup A\times B$$ and
$$\bigcup_{i\in\mathbb N}A\times B_i.$$ The former denotes the union of the elements of ##A\times B##, but the latter denotes the union of the sets ##A\times B_i##, not their elements.
$$\bigcup_{i\in\mathbb N}A\times B_i=(A\times B_1)\cup (A\times B_2)\cup\cdots.$$ I guess this sort of thing is why micromass said that he doesn't like the ##\bigcup S## notation.
 
  • #618
I will have to agree with micromass there.

This is a pretty disgusting way to denote all of this :smile:

Thanks , it finally start to make sense (well except for that choice of notation).
 
  • #619
This also means that $$\bigcap_{i \in N}R × [i , i +1] = \varnothing $$ right?
 
  • #620
That equality holds since no ##(x,y)\in\mathbb R\times\mathbb R## is an element of all of those sets. In fact, a given (x,y) can belong to at most two of those sets.
 
  • #621
Fredrik said:
That equality holds since no ##(x,y)\in\mathbb R\times\mathbb R## is an element of all of those sets. In fact, a given (x,y) can belong to at most two of those sets.

How could this happen?
 
  • #622
For example, (0,2) is an element of ℝ×[1,2] and an element of ℝ×[2,3].
 
  • #623
So if we unionize this set , like

$$\bigcup\bigcup_{i \in N}R × [i , i +1]$$

do we now get ##\{x\}## and ##\{x,y\}## type of elements? (that aren't ordered pairs anymore)
 
  • #624
That's right. Since e.g. (2,3)={{2},{2,3}} is an element of ##\bigcup_{i\in\mathbb N}\mathbb R\times[i,i+1]##, we know that {2} and {2,3} are elements of ##\bigcup\bigcup_{i\in\mathbb N}\mathbb R\times[i,i+1]##.

So the elements of ##\bigcup\bigcup\bigcup_{i\in\mathbb N}\mathbb R\times[i,i+1]## will be real numbers. (Edit: The previous sentence was corrected after reenmachine's reply below). So we have ##\bigcup\bigcup\bigcup_{i\in\mathbb N}\mathbb R\times[i,i+1]=\mathbb R##.
 
Last edited:
  • #625
Fredrik said:
That's right. Since e.g. (2,3)={{2},{2,3}} is an element of ##\bigcup_{i\in\mathbb N}\mathbb R\times[i,i+1]##, we know that {2} and {2,3} are elements of ##\bigcup\bigcup_{i\in\mathbb N}\mathbb R\times[i,i+1]##.

So the elements of ##\bigcup\bigcup\bigcup_{i\in\mathbb N}\mathbb R\times[i,i+1]## will all be singleton sets whose elements are real numbers. So we have ##\bigcup\bigcup\bigcup_{i\in\mathbb N}\mathbb R\times[i,i+1]=\mathbb R##.

Thank you!

When you mean singleton sets , you mean that that elements like {2},{2,3} will finish as {2},{3}.Only point I'm still wondering is I thought ##\{\{2\},\{3\}\}## didn't equal ##\{2,3\}## since the elements of the former are sets containing real numbers and the elements of the latter are real numbers.I thought R would only be the latter.So basically 4 unions instead of 3.

Or did you just meant that in ##\{...2,3,4...\}## the numbers are all singletons even if they arent between brackets?
 
  • #626
Here's an interesting exercise from the book of proof:

$$\bigcup_{x \in p(N)}X = ?$$

"p" being powerset here.

My answer would be ##N##.

So when you unionize the elements of a powerset , you always end up with the original set.

The only thing I'm wondering is what happens with ##\varnothing##

##\varnothing## would become an element of ##\bigcup X## but since I'm saying ##\bigcup X = N## is the presence of ##\varnothing## destroying the whole logic?
 
Last edited:
  • #627
reenmachine said:
Thank you!

When you mean singleton sets , you mean that that elements like {2},{2,3} will finish as {2},{3}.Only point I'm still wondering is I thought ##\{\{2\},\{3\}\}## didn't equal ##\{2,3\}## since the elements of the former are sets containing real numbers and the elements of the latter are real numbers.I thought R would only be the latter.So basically 4 unions instead of 3.

Or did you just meant that in ##\{...2,3,4...\}## the numbers are all singletons even if they arent between brackets?
If {2} and {2,3} are elements of a set S, then ##\{2\}\cup\{2,3\}=\{2,3\}## is a subset of ##\bigcup S##. This makes 2 and 3 elements of ##\bigcup S##.

What I said is that since {2} and {2,3} are elements of ##\bigcup\bigcup_{i\in\mathbb N}\mathbb R\times[i,i+1]##, the elements of ##\bigcup\bigcup\bigcup_{i\in\mathbb N}\mathbb R\times[i,i+1]## will be things like {2} and {3} (singleton sets whose elements are real numbers). I see now that this is wrong. ##\{2\}\cup\{2,3\}=\{2,3\}## will be a subset of ##\bigcup\bigcup\bigcup_{i\in\mathbb N}\mathbb R\times[i,i+1]##, so the elements of ##\bigcup\bigcup\bigcup_{i\in\mathbb N}\mathbb R\times[i,i+1]## will be things like 2 and 3. This implies that ##\bigcup\bigcup\bigcup_{i\in\mathbb N}\mathbb R\times[i,i+1]=\mathbb R##. Somehow I got the right final result even though made a blunder. Maybe I just made a second one that compensated for the first one.
 
  • #628
reenmachine said:
Here's an interesting exercise from the book of proof:

$$\bigcup_{x \in p(N)}X = ?$$

"p" being powerset here.

My answer would be ##N##.

So when you unionize the elements of a powerset , you always end up with the original set.

The only thing I'm wondering is what happens with ##\varnothing##

##\varnothing## would become an element of ##\bigcup X## but since I'm saying ##\bigcup X = N## is the presence of ##\varnothing## destroying the whole logic?
You're confusing the two notations again. We have
$$\bigcup X\neq \bigcup_{X\in\mathcal P(N)} X=\bigcup\mathcal P(N) =N.$$
 
  • #629
Fredrik said:
You're confusing the two notations again. We have
$$\bigcup X\neq \bigcup_{X\in\mathcal P(N)} X=\bigcup\mathcal P(N) =N.$$

I still don't get what happens to ##\varnothing##.

If ##\varnothing## is an element of P(N) , how could he be an element of N?

Is it ##\{P(1) \cup P(2) \cup P(3)...\}## ? Those notations are horrendous.

Is it the union of all elements of the powerset of N? This is where I was coming from with ##\varnothing## being an element of the union of all elements of the powerset of N.

I'm sorry if there's some endless confusions , I'm struggling more with the notations than with the logic they are describing.Thank you!
 
Last edited:
  • #630
I don't understand what ∅ has to do with this. ##\bigcup_{X\in\mathcal P(N)} X## and ##\bigcup\mathcal P(N)## both denote the union of all subsets of N, and this is clearly N (regardless of what set N is).

##\varnothing## is an element of ##\mathcal P(N)## (regardless of what N is), but not an element of ##N## (unless you have specifically chosen N to be a set that has ##\varnothing## as an element).

By the way, X is a dummy variable in the question you asked in post #631, so the notation ##\bigcup X## doesn't even make sense there.
 
Last edited:

Similar threads

  • · Replies 18 ·
Replies
18
Views
3K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 12 ·
Replies
12
Views
3K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
7
Views
2K
  • · Replies 105 ·
4
Replies
105
Views
8K
Replies
21
Views
3K
Replies
11
Views
2K