FormalConjecturesForMathlib/Combinatorics/SetFamily/Sunflower.lean
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
- def
IsSunflowerWithKernelA sunflowerFwith kernelSis a collection of sets in which all possible distinct pairs of sets share the same intersectionSline 34 sourceSource documentation
A sunflower
Fwith kernelSis a collection of sets in which all possible distinct pairs of sets share the same intersectionS.no axioms what this means
Statement uses:
SetProof uses:
Set.Pairwise,Eq,Inter.inter1 instances, coercions and auxiliary constants left out.
def IsSunflowerWithKernel (F : Set (Set α)) (S : Set α) : Prop := …
- theorem
isSunflowerWithKernel_emptyline 37 sourcestandard axioms: propext what this means
Statement uses:
Set, IsSunflowerWithKernel,EmptyCollection.emptyCollectionProof uses:
of_eq_true,Set.Pairwise,Eq,Inter.inter4 instances, coercions and auxiliary constants left out.
Tactic trace: 1 steps
Open to load the checked before-and-after goal states.
- theorem
isSunflowerWithKernel_singletonline 40 sourcestandard axioms: propext what this means
Statement uses:
Set, IsSunflowerWithKernel,Singleton.singletonProof uses:
of_eq_true,Set.Pairwise,Eq,Inter.inter4 instances, coercions and auxiliary constants left out.
Tactic trace: 1 steps
Open to load the checked before-and-after goal states.
- def
IsSunflowerA sunflowerFis a collection of sets in which all possible distinct pairs of sets share the same intersection line 48 sourceSource documentation
A sunflower
Fis a collection of sets in which all possible distinct pairs of sets share the same intersection.no axioms what this means
Statement uses:
SetProof uses:
Exists, IsSunflowerWithKerneldef IsSunflower (F : Set (Set α)) : Prop := ∃ S, IsSunflowerWithKernel F S
Mentions: IsSunflowerWithKernel
- theorem
isSunflower_emptyline 50 sourcestandard axioms: Quot.sound, propext what this means
Statement uses: IsSunflower,
EmptyCollection.emptyCollection,SetProof uses:
of_eq_true,Exists, IsSunflowerWithKernel,Eq.trans,True,congrArg,funext6 instances, coercions and auxiliary constants left out.
Tactic trace: 1 steps
Open to load the checked before-and-after goal states.
- theorem
isSunflower_singletonline 53 sourcestandard axioms: Quot.sound, propext what this means
Statement uses:
Set, IsSunflower,Singleton.singletonProof uses:
of_eq_true,Exists, IsSunflowerWithKernel,Eq.trans,True,congrArg,funext6 instances, coercions and auxiliary constants left out.
Tactic trace: 1 steps
Open to load the checked before-and-after goal states.