Skip to content

Commit

Permalink
LST: Fix typos
Browse files Browse the repository at this point in the history
  • Loading branch information
Zentrik committed May 21, 2024
1 parent 02804cb commit 4752166
Show file tree
Hide file tree
Showing 2 changed files with 2 additions and 2 deletions.
4 changes: 2 additions & 2 deletions LogicAndSetTheory/05_set_theory.tex
Original file line number Diff line number Diff line change
Expand Up @@ -329,9 +329,9 @@ \subsection{Transitive sets}

Then $x \in t$, since $x \in w$ ($\{(0, x)\}$ is an attempt).
Given $a \in t$, we have $a \in z$ for some $z \in w$.
Then there's an attempt $f$ and $n \in w$ s.t. $z = f(n)$. \\
Then there's an attempt $f$ and $n \in \dom f$ s.t. $z = f(n)$. \\
By $(\ast\ast)$ there's an attempt $g$ with $n^+ \in \dom g$.
Then $n \in \dom g$ so $\bigcup z = \bigcup f(n) = \bigcup g(n)$ by $(\ast)$ and $\bigcup g(n) = g(n^+) \in w$.
Then $n \in \dom g$\footnote{$\dom g$ transitive as members of $\omega$ transitive and $n \in n^+$.} so $\bigcup z = \bigcup f(n) = \bigcup g(n)$ by $(\ast)$ and $\bigcup g(n) = g(n^+) \in w$.
Thus for any $b \in a$, $b \in \cup z \in w$ so $b \in t$, i.e. $t$ transitive.
\end{proof}

Expand Down
Binary file modified LogicAndSetTheory/logicandsettheory.pdf
Binary file not shown.

0 comments on commit 4752166

Please sign in to comment.