Theorems · Theorem · order theory
Monotone.disjointed_add_one_sup
∀ {α : Type u_1} {ι : Type u_2} [inst : GeneralizedBooleanAlgebra α] [inst_1 : LinearOrder ι]
[inst_2 : LocallyFiniteOrderBot ι] [inst_3 : Add ι] [inst_4 : One ι] [SuccAddOrder ι] {f : ι → α},
Monotone f → ∀ (i : ι), disjointed f (i + 1) ⊔ f i = f (i + 1)- Defined in
- Mathlib.Algebra.Order.Disjointed
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 78 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- LinearOrderstatement and proof · cited by 8,572
- Monotonestatement and proof · cited by 1,397
- LocallyFiniteOrderBotstatement and proof · cited by 286
- GeneralizedBooleanAlgebrastatement and proof · cited by 204
- Order.succ_eq_add_oneproof · cited by 115
- SuccAddOrderstatement and proof · cited by 108
- disjointedstatement and proof · cited by 64
- Monotone.disjointed_succ_supproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- Finset.box_succ_union_prodproof · cited by 1