Mathlib Map

Theorems · Theorem · combinatorics

Set.Intersecting.disjoint_map_compl

∀ {α : Type u_1} [inst : BooleanAlgebra α] {s : Finset α},
  (↑s).Intersecting → Disjoint s (Finset.map { toFun := compl, inj' := ⋯ } s)
Defined in
Mathlib.Combinatorics.SetFamily.Intersecting
Cited by
2 results in Mathlib
Foundations
Depth 59 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
BooleanAlgebra
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Set.Intersecting.card_le · cited by 3Intersecting.card_leSet.Intersecting.is_max_iff_card_eq · cited by 2Intersecting.is_max_iff_c…DFunLike.coe · cited by 62936DFunLike.coeFinset · cited by 13712FinsetSetLike.coe · cited by 8199SetLike.coeCompl.compl · cited by 2925Compl.complDisjoint · cited by 2201DisjointFinset.map · cited by 747Finset.mapBooleanAlgebra · cited by 300BooleanAlgebraFinset.disjoint_left · cited by 50Finset.disjoint_leftFinset.mem_map · cited by 32Finset.mem_mapSet.Intersecting · cited by 22Set.Intersectingcompl_injective · cited by 22compl_injectiveSet.Intersecting.compl_notMem · cited by 1Intersecting.compl_notMemIntersecting.disjoint_map_com…CITED BYCITES

Cites12

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by2

Results whose statement or proof uses this declaration.