some changes

inputs/lecture_11.tex

@@ -173,10 +173,8 @@ i.e.~we want to associate a tree $T \subseteq  \N^{<\N}$}%
 Let \vocab{$\Tr$} $ \coloneqq  \{T \in {2^{\N}}^{<\N} : T \text{ is a tree}\} \subseteq {2^{\N}}^{<\N}$.
 
 \begin{observe}
-    \[
+    $\Tr \subseteq  {2^{\N}}^{<\N}$ is closed
-    \Tr \subseteq  {2^{\N}}^{<\N}
+    (where we take the topology of the Cantor space).
-    \]
-    is closed (where we take the topology of the Cantor space).
 \end{observe}
 \gist{%
 Indeed, for any $ s \in \N^{<\N}$

inputs/lecture_13.tex

@@ -33,7 +33,6 @@ with $(f^{-1}(\{1\}), <)$.
     and  $[\alpha_i, \alpha_{i+1})$ to $(i,i+1)$.
 \end{proof}
 
-% TODO ANKI-MARKER
 
 \begin{definition}[\vocab{Kleene-Brouwer ordering}]
     Let $(A,<)$ be a linear order and $A$ countable.
@@ -58,6 +57,7 @@ with $(f^{-1}(\{1\}), <)$.
     $(T, <_{KB}\defon{T})$ is well ordered.
 \end{proposition}
 \begin{proof}
+    \gist{%
         If $T$ is ill-founded and $x \in [T]$,
         then for all $n$, we have $x\defon{n+1} <_{KB} x\defon{n}$.
         Thus $(T, <_{KB}\defon{T})$ is not well ordered.
@@ -76,7 +76,11 @@ with $(f^{-1}(\{1\}), <)$.
         Let $a_1 \coloneqq s_{n_1}(1)$
         and so on.
         Then $(a_0,a_1,a_2, \ldots) \in [T]$.
+    }{easy}
 \end{proof}
+
+% TODO ANKI-MARKER
+
 \begin{theorem}[Lusin-Sierpinski]
     The set $\LO \setminus \WO$
     (resp.~$2^{\Q} \setminus \WO$)

jrpie-gist.sty

@@ -4,6 +4,7 @@
 % TODO gist info
 % TODO link to long version (provide link to main document)
 
+% TODO \phantomsection to cross link
 \newcommand{\gist}[2]{%
     \ifcsname EnableGist\endcsname%
         #2%