Theorems · Theorem · order theory

Finset.SupIndep.biUnion

∀ {α : Type u_1} {ι : Type u_3} {ι' : Type u_4} [inst : Lattice α] [IsModularLattice α] [inst_2 : OrderBot α]
  [inst_3 : DecidableEq ι] {s : Finset ι'} {g : ι' → Finset ι} {f : ι → α},
  (s.SupIndep fun i => (g i).sup f) → (∀ i' ∈ s, (g i').SupIndep f) → (s.biUnion g).SupIndep f

Bind operation for SupIndep.

Defined in

Mathlib.Order.SupIndep

Cited by

4 results in Mathlib

Foundations

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

Assumes

LatticeIsModularLatticeOrderBotDecidableEq