Theorems · Theorem · order theory
add_upperClosure
∀ {α : Type u_1} [inst : AddCommGroup α] [inst_1 : Preorder α] [IsOrderedAddMonoid α] (s t : Set α),
s + ↑(upperClosure t) = ↑(upperClosure (s + t))- Defined in
- Mathlib.Algebra.Order.UpperLower
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 67 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites16
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- AddCommGroupstatement and proof · cited by 12,871
- SetLike.coestatement and proof · cited by 8,199
- Preorderstatement and proof · cited by 7,952
- Set.iUnionproof · cited by 2,483
- HVAdd.hVAddproof · cited by 1,820
- iInfproof · cited by 1,690
- IsOrderedAddMonoidstatement and proof · cited by 1,659
- Set.addstatement · cited by 338
- UpperSetstatement · cited by 245
- iInf_congr_Propproof · cited by 218
- upperClosurestatement and proof · cited by 84
Cited by2
Results whose statement or proof uses this declaration.
- upperClosure_addproof · cited by 1
- upperClosure_add_distribproof · cited by 0