From 50fc6a55e9c581d99708ecd948c84faee388a708 Mon Sep 17 00:00:00 2001
From: zeramorphic <50671761+zeramorphic@users.noreply.github.com>
Date: Fri, 16 Feb 2024 13:00:36 +0000
Subject: [PATCH] Fix typo

---
 iii/forcing/03_forcing.tex | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/iii/forcing/03_forcing.tex b/iii/forcing/03_forcing.tex
index 112964b..046c28d 100644
--- a/iii/forcing/03_forcing.tex
+++ b/iii/forcing/03_forcing.tex
@@ -374,7 +374,7 @@ \subsection{Pairing}
 We can define unordered and ordered pairs of names, with sensible interpretations.
 \begin{definition}
     Given \( \mathbb P \)-names \( \dot x, \dot y \), let
-    \[ \operatorname{up}(\dot x, \dot y) = \qty{\langle \Bbbone, \dot x \rangle, \langle Bbbone, \dot y \rangle} \]
+    \[ \operatorname{up}(\dot x, \dot y) = \qty{\langle \Bbbone, \dot x \rangle, \langle \Bbbone, \dot y \rangle} \]
     and
     \[ \operatorname{op}(\dot x, \dot y) = \operatorname{up}(\operatorname{up}(\dot x, \dot x), \operatorname{up}(\dot x, \dot y)) \]
 \end{definition}