Theorems · Definition · order theory

Finpartition.bind

{α : Type u_1} →
  [inst : Lattice α] →
    [inst_1 : OrderBot α] →
      [IsModularLattice α] →
        [DecidableEq α] → {a : α} → (P : Finpartition a) → ((i : α) → i ∈ P.parts → Finpartition i) → Finpartition a

Given a finpartition P of a and finpartitions of each part of P, this yields the finpartition of a obtained by juxtaposing all the subpartitions.

Defined in

Mathlib.Order.Partition.Finpartition

Cited by

5 results in Mathlib

Foundations

Depth 85 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

LatticeOrderBotIsModularLatticeDecidableEq