# Fix any errors in my proof (beginner)

Critique my proof of the following theorem on correctness, structure, etc.*Theorem. *Suppose $A$ and $B$ are sets. Prove that if $A \cap B = A$, then $A \subseteq B$.*Proof. *Suppose $A \cap B = A$. Let $x$ be arbitrary and $x \in A$. Because $A \cap B = A$, it follows that $x \in A$ and $x \in B$. Because x is arbitrary, it must be the case that $\forall x(x\in A \implies x \in B)$, so $A \subseteq B$. Therefore, if $A\cap B = A$, then $A \subseteq B$.

## Answer

**Answers can be viewed only if**

- The questioner was satisfied and accepted the answer, or
- The answer was disputed, but the judge evaluated it as 100% correct.

The answer is accepted.

Join Matchmaticians Affiliate Marketing
Program to earn up to 50% commission on every question your affiliated users ask or answer.

- answered
- 158 views
- $5.00

### Related Questions

- Proof through inclusion (A∆B) ∪ A = A ∪ B
- Prove that: |x| + |y| ≤ |x + y| + |x − y|.
- Topic: Large deviations, in particular: Sanov's theorem
- Fix any errors in my proof (beginner)
- Fix any errors in my proof (beginner)
- Induction proof for an algorithm. Introductory level discrete math course. See attachment for details
- Suppose that $(ab)^3 = a^3 b^3$ for all $a, b \in G$. Prove that G must be an abelian goup [Group Theory].
- Let $f\in C (\mathbb{R})$ and $f_n=\frac{1}{n}\sum\limits_{k=0}^{n-1} f(x+\frac{k}{n})$. Prove that $f_n$ converges uniformly on every finite interval.