summaryrefslogtreecommitdiff
path: root/test/phase5/exact-induction-nested.tex
blob: e9c5402f4f713de5efffb825229bbe4e11e4a323 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
\begin{proposition}\label{phase5_nested_set_induction}
    Let $A$ be a set.
    Then for all $x\in A$ such that $x\neq A$ we have $x = x$.
\end{proposition}
\begin{proof}
    Show for all $x\in A$ such that $x\neq A$ we have $x = x$.
    \begin{subproof}[Proof by \in-induction]
        Assume $x\in A$ and $x\neq A$.
        Follows by assumption.
    \end{subproof}
    Follows by assumption.
\end{proof}