AFTD Auto-Formalizing Theoretical Domains

op_639_edge_is_four_transversal

theoremverified

In a 4-uniform intersecting family F, every edge e in F has cardinality 4 and intersects every edge e' in F, hence is a size-4 transversal.

Statement

theorem op_639_edge_is_four_transversal
    {V : Type*} [DecidableEq V] (F : Finset (Finset V))
    (hunif : ∀ e ∈ F, e.card = 4)
    (hinter : (F : Set (Finset V)).Intersecting)
    (e : Finset V) (he : e ∈ F) :
    e.card = 4 ∧ ∀ e' ∈ F, ¬Disjoint e' e
Source
step towards op_639_intersecting_four_uniform_covering_four_card_le_forty_two
Verified
31 Oct 2026
Axioms
Classical.choiceQuot.soundpropext

The proof, explained

To show that any edge e in a 4-uniform intersecting family F is a 4-transversal, the proof constructs a pair directly satisfying the two conjuncts. The cardinality condition |e| = 4 is immediate from the 4-uniformity hypothesis applied to e. The intersection condition follows from the definition of an intersecting family applied to e' and e for every edge e' in F.

  1. |e| = 4 and e intersects every edge e' ∈ F

    The proof constructs both parts of the conjunction directly. The first part, |e| = 4, follows by applying the 4-uniformity hypothesis (hunif) to the edge e and its membership proof he. The second part, showing that ¬Disjoint e' e for every e' ∈ F, follows by considering an arbitrary e' with he' : e' ∈ F and applying the intersecting family hypothesis (hinter) to the pair of edges e' and e.

    line 7

        e.card = 4 ∧ ∀ e' ∈ F, ¬Disjoint e' e := ⟨hunif e he, fun _ he' => hinter he' he⟩

Written by a model (gemini-3.8-flash) from the Lean source alone (no goal states were available). Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

/-- In any 4-uniform intersecting hypergraph, every edge e in F is itself a transversal of size 4. -/theorem op_639_edge_is_four_transversal    {V : Type*} [DecidableEq V] (F : Finset (Finset V))    (hunif : ∀ e ∈ F, e.card = 4)    (hinter : (F : Set (Finset V)).Intersecting)    (e : Finset V) (he : e ∈ F) :    e.card = 4 ∧ ∀ e' ∈ F, ¬Disjoint e' e := ⟨hunif e he, fun _ he' => hinter he' he⟩
See it in the graphDiscuss this resultChallenge it