Mathlib Map

Theorems · Definition · order theory

Finpartition.restrict

{α : Type u_1} →
  [inst : DistribLattice α] →
    [inst_1 : OrderBot α] → [DecidableEq α] → {a b : α} → Finpartition a → b ≤ a → Finpartition b

Restrict a partition of a to b where b ≤ a by intersecting each part with b.

Defined in
Mathlib.Order.Partition.Finpartition
Cited by
2 results in Mathlib
Foundations
Depth 80 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
DistribLatticeOrderBotDecidableEq

Around this declaration

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

Cites7

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.