Mathlib Map

Theorems · Theorem · order theory

Finpartition.ofErase.congr_simp

∀ {α : Type u_1} [inst : Lattice α] [inst_1 : OrderBot α] [inst_2 : DecidableEq α] {a : α} (parts parts_1 : Finset α)
  (e_parts : parts = parts_1) (sup_indep : parts.SupIndep id) (sup_parts : parts.sup id = a),
  Finpartition.ofErase parts sup_indep sup_parts = Finpartition.ofErase parts_1 ⋯ ⋯
Defined in
Mathlib.Order.Partition.Finpartition
Cited by
1 results in Mathlib
Foundations
Depth 60 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
LatticeOrderBotDecidableEq
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

Finpartition.atomise_empty · cited by 0Finpartition.atomise_emptyFinset · cited by 13712FinsetOrderBot · cited by 1055OrderBotLattice · cited by 916LatticeFinset.sup · cited by 530Finset.supFinpartition · cited by 199FinpartitionFinset.SupIndep · cited by 52Finset.SupIndepFinpartition.ofErase · cited by 3Finpartition.ofEraseofErase.congr_simpCITED BYCITES

Cites7

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

Cited by1

Results whose statement or proof uses this declaration.