[Math] Proof that the subset relation is reflexive and transitive

Question

I'm teaching myself set theory, and I'm not sure how detailed I should be when asked to prove things.

Here is my proof that $A\subseteq A$ (the subset relation is reflexive):

$A \subseteq B$ iff $((x \in A) \implies (x \in B))$

$A \subseteq A$ iff $((x \in A) \implies (x \in A))$

$(x \in A) \implies (x \in A)$ is always true, as something implying itself must be true (is there a formal way to write this?)

Hence $ A \subseteq A$ is always true.

Is this proof formal enough, and does it contain the right amount of detail?

Answer 1

Your proof is right.

Two comments :

(i) Instead of $A⊆B \implies ((x∈A) \implies (x∈B))$ I prefer :

$A⊆B$ iff $((x∈A) \implies (x∈B))$

because the RHS is the definition of set inclusion.

(ii) $x \in A \implies x \in A$ is an instance of the "logical law" :

$\mathcal A \implies \mathcal A$

which is a tautology of propositional logic.

The rules of logic allow us to substitute for the propositional letter $\mathcal A$ a formula whatever, and the result is still true, provided that we replace all the occurrences of $\mathcal A$ with the same formula.