Theorems · Theorem · order theory
disjointed_apply
∀ {α : Type u_1} {ι : Type u_2} [inst : GeneralizedBooleanAlgebra α] [inst_1 : Preorder ι]
[inst_2 : LocallyFiniteOrderBot ι] (f : ι → α) (i : ι), disjointed f i = f i \ (Finset.Iio i).sup f- Defined in
- Mathlib.Order.Disjointed
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 53 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Preorderstatement and proof · cited by 7,952
- Finset.supstatement · cited by 530
- LocallyFiniteOrderBotstatement and proof · cited by 286
- GeneralizedBooleanAlgebrastatement and proof · cited by 204
- Finset.Iiostatement · cited by 147
- disjointedstatement · cited by 64
Cited by3
Results whose statement or proof uses this declaration.
- disjointed_succproof · cited by 3
- Monotone.disjointed_succ_supproof · cited by 1
- disjointed_eq_selfproof · cited by 1