Theorems · Theorem · order theory

Finset.supIndep_product_iff

∀ {α : Type u_1} {ι : Type u_3} {ι' : Type u_4} [inst : Lattice α] [IsModularLattice α] [inst_2 : OrderBot α]
  {s : Finset ι} {t : Finset ι'} {f : ι × ι' → α},
  (s.product t).SupIndep f ↔
    (s.SupIndep fun i => t.sup fun i' => f (i, i')) ∧ t.SupIndep fun i' => s.sup fun i => f (i, i')

Defined in

Mathlib.Order.SupIndep

Cited by

0 results in Mathlib

Foundations

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

Assumes

LatticeIsModularLatticeOrderBot