∀ (C : Type u_1) [inst : CategoryTheory.Category.{v_1, u_1} C] [inst_1 : CategoryTheory.FinitaryPreExtensive C],
  CategoryTheory.extensiveCoverage C =
    {
      coverings := fun B =>
        {S |
          ∃ α,
            ∃ (x : Finite α),
              ∃ X π,
                S = CategoryTheory.Presieve.ofArrows X π ∧ CategoryTheory.IsIso (CategoryTheory.Limits.Sigma.desc π)},
      pullback := ⋯ }