summaryrefslogtreecommitdiff
path: root/test/phase5/exact-local-definition.tex
blob: a1d2fcf81c3cbf22df9cfcae2cd76fa515297f91 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
\begin{proposition}\label{phase5_local_definition}
    For all $A$ we have $A = A$.
\end{proposition}
\begin{proof}
    Fix $A$.
    Let $B = \{x \in A \mid x = x\}$.
    Show for all $x$ we have if $x \in B$, then $x \in A$.
    \begin{subproof}
        Fix $x$.
        Assume $x \in B$.
        Follows by assumption.
    \end{subproof}
    Follows by assumption.
\end{proof}