From 51fe28bdd9943e359de5835d2737c0fdc8618df7 Mon Sep 17 00:00:00 2001
From: adelon <22380201+adelon@users.noreply.github.com>
Date: Tue, 8 Jul 2025 21:20:20 +0200
Subject: Linting and optimization

---
 library/set/regularity.tex | 9 +++++----
 1 file changed, 5 insertions(+), 4 deletions(-)

(limited to 'library/set/regularity.tex')

diff --git a/library/set/regularity.tex b/library/set/regularity.tex
index 794d34f..068d6a8 100644
--- a/library/set/regularity.tex
+++ b/library/set/regularity.tex
@@ -31,7 +31,7 @@
     Then there exists a \in-minimal element of $A$.
 \end{proposition}
 \begin{proof}
-    Follows by \cref{regularity_aux,inhabited}.
+    Follows by \cref{regularity_aux}.
 \end{proof}
 
 
@@ -44,10 +44,11 @@
 \begin{proof}
     \begin{byCase}
         \caseOf{$A = \emptyset$.}
-            Straightforward.
-        \caseOf{$A$ is inhabited.}
-            Take $a$ such that $a$ is a \in-minimal element of $A$.
+            Follows by assumption.
+        \caseOf{$A \neq\emptyset$.}
+            Take $a$ such that $a$ is a \in-minimal element of $A$ by \cref{nonempty_inhabited,regularity}.
             Then for all $x\in a$ we have $x\notin A$.
+            Follows by assumption.
     \end{byCase}
 \end{proof}.
 
-- 
cgit v1.2.3

