Theorems · Theorem · order theory
Finite.ciSup_prod
∀ {α : Type u_1} {ι : Type u_2} {ι' : Type u_3} [Finite ι] [Finite ι'] [inst : ConditionallyCompleteLattice α]
(f : ι × ι' → α), ⨆ a, f a = ⨆ i, ⨆ i', f (i, i')- Defined in
- Mathlib.Data.Fintype.Order
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 83 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finitestatement and proof · cited by 3,029
- iSupstatement · cited by 2,415
- ConditionallyCompleteLatticestatement and proof · cited by 364
- Finite.bddAbove_rangeproof · cited by 11
- ciSup_prodproof · cited by 2
Cited by2
Results whose statement or proof uses this declaration.
- Real.iSup_fun_mul_eq_iSup_mul_iSup_of_nonnegproof · cited by 1
- Finite.ciInf_prodproof · cited by 0