FormalConjecturesForMathlib/Combinatorics/SetFamily/Sunflower.lean

GitHub source file

Explanation legend Lean4 Domain Explanation Language (L4DEL)

L4DEL explanations are a separate layer. They do not change the Lean source. Intuition is explanatory prose; numbered items are a reading path; sources link the wording back to evidence.

L4DEL
Lean4 Domain Explanation Language

Credit: The upstream authors and contributors retain credit for the project and mathematics. lean4-explainer only renders their pinned source and adds the separately disclosed explanation layer.

Project sources: Pinned project documentation, Formal Conjectures paper, arXiv v1

6 declarations, 0 contain sorry, 0 declared as axioms

Sunflowers

This file defines sunflowers of set families.

Imports (1)
Imported by 1 file
  1. def IsSunflowerWithKernel A sunflower F with kernel S is a collection of sets in which all possible distinct pairs of sets share the same intersection S line 34 source

    Source documentation

    A sunflower F with kernel S is a collection of sets in which all possible distinct pairs of sets share the same intersection S.

    no axioms what this means

    Statement uses: Set

    Proof uses: Set.Pairwise, Eq, Inter.inter

    1 instances, coercions and auxiliary constants left out.

    def IsSunflowerWithKernel (F : Set (Set α)) (S : Set α) : Prop :=
    …
  2. theorem isSunflowerWithKernel_empty line 37 source

    standard axioms: propext what this means

    Statement uses: Set, IsSunflowerWithKernel, EmptyCollection.emptyCollection

    Proof uses: of_eq_true, Set.Pairwise, Eq, Inter.inter

    4 instances, coercions and auxiliary constants left out.

    Tactic trace: 1 steps

    Open to load the checked before-and-after goal states.

  3. theorem isSunflowerWithKernel_singleton line 40 source

    standard axioms: propext what this means

    Statement uses: Set, IsSunflowerWithKernel, Singleton.singleton

    Proof uses: of_eq_true, Set.Pairwise, Eq, Inter.inter

    4 instances, coercions and auxiliary constants left out.

    Tactic trace: 1 steps

    Open to load the checked before-and-after goal states.

  4. def IsSunflower A sunflower F is a collection of sets in which all possible distinct pairs of sets share the same intersection line 48 source

    Source documentation

    A sunflower F is a collection of sets in which all possible distinct pairs of sets share the same intersection.

    no axioms what this means

    Statement uses: Set

    Proof uses: Exists, IsSunflowerWithKernel

    def IsSunflower (F : Set (Set α)) : Prop := ∃ S, IsSunflowerWithKernel F S

    Mentions: IsSunflowerWithKernel

  5. theorem isSunflower_empty line 50 source

    standard axioms: Quot.sound, propext what this means

    Statement uses: IsSunflower, EmptyCollection.emptyCollection, Set

    Proof uses: of_eq_true, Exists, IsSunflowerWithKernel, Eq.trans, True, congrArg, funext

    6 instances, coercions and auxiliary constants left out.

    Tactic trace: 1 steps

    Open to load the checked before-and-after goal states.

  6. theorem isSunflower_singleton line 53 source

    standard axioms: Quot.sound, propext what this means

    Statement uses: Set, IsSunflower, Singleton.singleton

    Proof uses: of_eq_true, Exists, IsSunflowerWithKernel, Eq.trans, True, congrArg, funext

    6 instances, coercions and auxiliary constants left out.

    Tactic trace: 1 steps

    Open to load the checked before-and-after goal states.