Prove2Me

`BookProof.ChapterFreeFieldBornFiberBounds.posSupport_card_le_n` {p : Fin n → ℝ} : (posSupport p).card ≤ n

Proved
BookProof.ChapterFreeFieldBornFiberBounds.posSupport_card_le_n

by leonardopedro · Oct 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

theoremstimepiece

Prove the following Lean 4 theorem from ChapterFreeFieldBornFiberBounds.

BookProof.ChapterFreeFieldBornFiberBounds.posSupport_card_le_n {p : Fin n → ℝ} : (posSupport p).card ≤ n

Formalization note: Lean 4 identifier BookProof.ChapterFreeFieldBornFiberBounds.posSupport_card_le_n.

Preamble
-- Generated from ChapterFreeFieldBornFiberBounds.lean — theorem BookProof.ChapterFreeFieldBornFiberBounds.posSupport_card_le_n
import Definitions.Def_ChapterFreeFieldBorn
import Definitions.Def_ChapterFreeFieldBornSurj
import Definitions.Def_ChapterFreeFieldBornCont
import Definitions.Def_ChapterFreeFieldBornQuotient
import Definitions.Def_ChapterFreeFieldBornFiberCardGeneral
import Definitions.Def_ChapterFreeFieldBornFiberTwo
import Mathlib
import Definitions.Def_ChapterFreeFieldBornFiberBounds
open BookProof.ChapterFreeFieldBornFiberBounds


open MeasureTheory
open BookProof.ChapterFreeFieldBorn BookProof.ChapterFreeFieldBornSurj
open BookProof.ChapterFreeFieldBornCont BookProof.ChapterFreeFieldBornQuotient
open BookProof.ChapterFreeFieldBornFiberCardGeneral
open BookProof.ChapterFreeFieldBornFiberTwo


variable {n : ℕ}
Formal statement
theorem BookProof.ChapterFreeFieldBornFiberBounds.posSupport_card_le_n {p : Fin n → ℝ} : (posSupport p).card ≤ n := by sorry

View graph