Theorems · Theorem · order theory
Finset.SupIndep.image
∀ {α : Type u_1} {ι : Type u_3} {ι' : Type u_4} [inst : Lattice α] [inst_1 : OrderBot α] {f : ι → α}
[inst_2 : DecidableEq ι] {s : Finset ι'} {g : ι' → ι}, s.SupIndep (f ∘ g) → (Finset.image g s).SupIndep f- Defined in
- Mathlib.Order.SupIndep
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 80 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- LatticeOrderBotDecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- Disjointproof · cited by 2,201
- OrderBotstatement and proof · cited by 1,055
- Latticestatement and proof · cited by 916
- Finset.imagestatement and proof · cited by 910
- Finset.mem_imageproof · cited by 105
- Finset.mem_image_of_memproof · cited by 81
- Finset.SupIndepstatement and proof · cited by 52
- Finset.sup_imageproof · cited by 28
- Finset.subset_image_iffproof · cited by 1
Cited by2
Results whose statement or proof uses this declaration.
- Finset.supIndep_mapproof · cited by 1
- Finset.SupIndep.productproof · cited by 1