Theorems · Theorem · order theory

Finset.supIndep_map

∀ {α : Type u_1} {ι : Type u_3} {ι' : Type u_4} [inst : Lattice α] [inst_1 : OrderBot α] {f : ι → α} {s : Finset ι'}
  {g : ι' ↪ ι}, (Finset.map g s).SupIndep f ↔ s.SupIndep (f ∘ ⇑g)

Defined in

Mathlib.Order.SupIndep

Cited by

1 results in Mathlib

Foundations

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

Assumes

LatticeOrderBot