Distinctness of the three modular residues
ProvedKnodelPrimeCordial_knodel_three_regular_side1_residue_card__p2m_165d50bc_4001_44b9_bb11_e1f7ef0e1992_a1graph-labelingknodel-graphp2o-gran-per-chapterp2o-plan-paperp2o-v1prime-cordial
For m ≥ 5 and j : Fin m, the residues j, j−1 modulo m, and j−3 modulo m are pairwise distinct, so their Finset has cardinality three.
Preamble
import Mathlib
Formal statement
theorem KnodelPrimeCordial_knodel_three_regular_side1_residue_card__p2m_165d50bc_4001_44b9_bb11_e1f7ef0e1992_a1 (m : ℕ) (hm : 5 ≤ m) (j : Fin m) : ({j.val, (j.val + m - 1) % m, (j.val + m - 3) % m} : Finset ℕ).card = 3 := by sorrySource
Haque, Khanam, Shahriar, Prime cordial labeling of Knödel graph, manuscript (2026) (held version, sha256 366502170d8d7c65ccc2fcc6f5373dac872d6efdc838ba9e671eb578e4c08c60), Lemma 2.3, p.3 (PDF p.3); proof pp.4–6