English
Theorem: For predicate p, there is a Galois connection between count p and nth p; i.e., count p and nth p are related by a Galois correspondence.
Русский
Существует Галуа-коотношение между count p и nth p.
LaTeX
$$$$ \\text{Galois connection between } \\mathrm{count}(p) \\text{ and } \\mathrm{nth}(p). $$$$
Lean4
theorem gc_count_nth (hp : (setOf p).Infinite) : GaloisConnection (count p) (nth p) :=
(giCountNth hp).gc