AFTD Auto-Formalizing Theoretical Domains

segments_block_points_of_card_le_one

theoremverified

Any finite point set in ℝ² of cardinality at most 1 is vacuously blocked by any finite family of segments L under the triangle-free crossing property.

Statement

theorem segments_block_points_of_card_le_one (L : Finset (Sym2 (ℝ × ℝ))) {P : Finset (ℝ × ℝ)}
    (hP : P.card ≤ 1) : segments_block_points L P
Source
step towards triangle_free_blocking_ge_vertex_cover
Verified
22 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
  • segments_block_pointsA finite family of segments L blocks a finite point set P under the triangle-free crossing property if for every pair of distinct points…
  • segment_crossing_graphThe crossing graph G(L) of a finite family of line segments L is the simple graph with vertex set L and edges between segments whose…
Used by 1

Lean source view module on GitHub

/-- Any finite point set of cardinality at most 1 is vacuously blocked under the triangle-free crossing property. -/
theorem segments_block_points_of_card_le_one (L : Finset (Sym2 (ℝ × ℝ))) {P : Finset (ℝ × ℝ)}
    (hP : P.card ≤ 1) : segments_block_points L P := by
  intro u v hu hv hne
  exact (hne (Finset.card_le_one_iff.mp hP hu hv)).elim
See it in the graphDiscuss this resultChallenge it