English
If a finite family of left cosets covers G, then there exists i ∈ s with H_i finite index and index(H_i) ≤ |s|.
Русский
Если множество левых косет покрывает G, существует i ∈ s such that H_i конечного индекса и индекс(H_i) ≤ |s|.
LaTeX
$$$\exists i \in s, (H_i).FiniteIndex \land (H_i).index \le |s|$$$
Lean4
@[to_additive]
theorem index_le_of_leftCoset_cover_const : H.index ≤ s.card := by
cases H.index.eq_zero_or_pos with
| inl h => exact h ▸ s.card.zero_le
| inr h =>
rw [leftCoset_cover_const_iff_surjOn, Set.surjOn_iff_surjective] at hcovers
exact (Nat.card_le_card_of_surjective _ hcovers).trans_eq (Nat.card_eq_finsetCard _)