Theorems · Inductive type · combinatorics
Matroid.IsFlat
{α : Type u_2} → Matroid α → Set α → PropA flat is a maximal set having a given basis
- Defined in
- Mathlib.Combinatorics.Matroid.Closure
- Cited by
- 27 results in Mathlib
- Foundations
- Depth 1 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Cited by31
Results whose statement or proof uses this declaration.
- Matroid.closureproof · cited by 272
- Matroid.closure_subset_closureproof · cited by 24
- Matroid.subset_closureproof · cited by 23
- Matroid.closure_inter_groundproof · cited by 22
- Matroid.closure_closureproof · cited by 14
- Matroid.Indep.closure_eq_setOfPred_isBasis_insertproof · cited by 6
- Matroid.IsFlat.subset_groundstatement and proof · cited by 5
- Matroid.closure_iUnion_closure_eq_closure_iUnionproof · cited by 4
- Matroid.subtypeClosureproof · cited by 4
- Matroid.IsFlat.closurestatement and proof · cited by 3
- Matroid.closure_def'statement and proof · cited by 3
- Matroid.ground_isFlatstatement · cited by 2