diff --git a/MulticolorRamsey/RamseyBound.lean b/MulticolorRamsey/RamseyBound.lean
index b6fd79f..f593297 100644
--- a/MulticolorRamsey/RamseyBound.lean
+++ b/MulticolorRamsey/RamseyBound.lean
@@ -2,6 +2,7 @@ import MulticolorRamsey.Book
 
 import Mathlib.Algebra.Order.Floor.Semiring
 import Mathlib.Data.Fintype.Card
+import ToMathlib.SwapIteEq.Basic
 
 variable {V : Type} {r : ℕ} [Fintype V] [DecidableEq V] [Nonempty V] [Nonempty (Fin r)]
 
@@ -152,21 +153,6 @@ theorem lemma53r {r k : ℕ} (kge : 2 ≤ k) (rge : 2 ≤ r) {ε : ℝ} (εin :
       apply Real.rpow_le_rpow_of_exponent_le _ sbound
       simp; exact le_of_lt (Set.mem_Ioo.mp εin).1
 
--- TODO mathlib?
-theorem swap_ite_eq {K L : Type} [DecidableEq K] (c d : K) (t k : L) :
-  (fun x ↦ if x = d then t else k) ∘ (Equiv.swap c d) = (fun x ↦ if x = c then t else k) := by
-  ext x
-  wlog hcd : (c = d)
-  · push_neg at hcd
-    simp only [Function.comp_apply]
-    by_cases h1 : x = c
-    · simp [h1, Equiv.swap_apply_left]
-    · by_cases h2 : x = d
-      · simp only [h2, Equiv.swap_apply_right, hcd.symm, ↓reduceIte, ite_eq_right_iff]
-        intro; contradiction
-      · simp only [Equiv.swap_apply_of_ne_of_ne h1 h2, h2, ↓reduceIte, right_eq_ite_iff]
-        intro; contradiction
-  · simp [hcd]
 
 
 ----------------------------------------------------------------------------------------------------
diff --git a/ToMathlib/SwapIteEq/Basic.lean b/ToMathlib/SwapIteEq/Basic.lean
new file mode 100644
index 0000000..3f0f202
--- /dev/null
+++ b/ToMathlib/SwapIteEq/Basic.lean
@@ -0,0 +1,21 @@
+import Mathlib.Data.Fintype.Card
+
+/-!
+# Equiv.swap composition with if-then-else
+-/
+
+/-- Composing `Equiv.swap c d` with an if-then-else function swaps the test condition. -/
+theorem swap_ite_eq {α β : Type} [DecidableEq α] (c d : α) (t k : β) :
+  (fun x ↦ if x = d then t else k) ∘ (Equiv.swap c d) = (fun x ↦ if x = c then t else k) := by
+  ext x
+  wlog hcd : (c = d)
+  · push_neg at hcd
+    simp only [Function.comp_apply]
+    by_cases h1 : x = c
+    · simp [h1, Equiv.swap_apply_left]
+    · by_cases h2 : x = d
+      · simp only [h2, Equiv.swap_apply_right, hcd.symm, ↓reduceIte, ite_eq_right_iff]
+        intro; contradiction
+      · simp only [Equiv.swap_apply_of_ne_of_ne h1 h2, h2, ↓reduceIte, right_eq_ite_iff]
+        intro; contradiction
+  · simp [hcd]
diff --git a/ToMathlib/SwapIteEq/metadata.yaml b/ToMathlib/SwapIteEq/metadata.yaml
new file mode 100644
index 0000000..8af3fea
--- /dev/null
+++ b/ToMathlib/SwapIteEq/metadata.yaml
@@ -0,0 +1,16 @@
+name: swap_ite_eq
+status: tentative
+pr_number: null
+pr_url: null
+target_file: Mathlib.Logic.Equiv.Basic
+description: >
+  Composing Equiv.swap with an if-then-else function swaps the test condition.
+  Shows that (fun x ↦ if x = d then t else k) ∘ (Equiv.swap c d) equals
+  (fun x ↦ if x = c then t else k).
+merged_date: null
+contents:
+  - swap_ite_eq
+original_location: MulticolorRamsey/RamseyBound.lean:156-169
+notes: >
+  General-purpose lemma for working with permutations and conditionals.
+  Could be useful in combinatorics and group theory contexts.