Theorems · Theorem · order theory

Finset.supIndep_pair

∀ {α : Type u_1} {ι : Type u_3} [inst : Lattice α] [inst_1 : OrderBot α] {f : ι → α} [inst_2 : DecidableEq ι] {i j : ι},
  i ≠ j → ({i, j}.SupIndep f ↔ Disjoint (f i) (f j))

Defined in

Mathlib.Order.SupIndep

Cited by

3 results in Mathlib

Foundations

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

Assumes

LatticeOrderBotDecidableEq