Documentation

theorem IsUpperSet.vadd_subset {α : Type u_1} [AddCommMonoid α] [Preorder α] [IsOrderedAddMonoid α] {s : Set α} {x : α} (hs : IsUpperSet s) (hx : 0 ≤ x) :

x +ᵥ s ⊆ s

theorem IsLowerSet.smul_subset {α : Type u_1} [CommMonoid α] [Preorder α] [IsOrderedMonoid α] {s : Set α} {x : α} (hs : IsLowerSet s) (hx : x ≤ 1) :

x • s ⊆ s

theorem IsLowerSet.vadd_subset {α : Type u_1} [AddCommMonoid α] [Preorder α] [IsOrderedAddMonoid α] {s : Set α} {x : α} (hs : IsLowerSet s) (hx : x ≤ 0) :

x +ᵥ s ⊆ s

theorem IsUpperSet.smul {α : Type u_1} [CommGroup α] [Preorder α] [IsOrderedMonoid α] {s : Set α} {a : α} (hs : IsUpperSet s) :

IsUpperSet (a • s)

theorem IsUpperSet.vadd {α : Type u_1} [AddCommGroup α] [Preorder α] [IsOrderedAddMonoid α] {s : Set α} {a : α} (hs : IsUpperSet s) :

IsUpperSet (a +ᵥ s)

theorem IsLowerSet.smul {α : Type u_1} [CommGroup α] [Preorder α] [IsOrderedMonoid α] {s : Set α} {a : α} (hs : IsLowerSet s) :

IsLowerSet (a • s)

theorem IsLowerSet.vadd {α : Type u_1} [AddCommGroup α] [Preorder α] [IsOrderedAddMonoid α] {s : Set α} {a : α} (hs : IsLowerSet s) :

IsLowerSet (a +ᵥ s)

theorem Set.OrdConnected.smul {α : Type u_1} [CommGroup α] [Preorder α] [IsOrderedMonoid α] {s : Set α} {a : α} (hs : s.OrdConnected) :

(a • s).OrdConnected

theorem Set.OrdConnected.vadd {α : Type u_1} [AddCommGroup α] [Preorder α] [IsOrderedAddMonoid α] {s : Set α} {a : α} (hs : s.OrdConnected) :

(a +ᵥ s).OrdConnected

theorem IsUpperSet.mul_left {α : Type u_1} [CommGroup α] [Preorder α] [IsOrderedMonoid α] {s t : Set α} (ht : IsUpperSet t) :

IsUpperSet (s * t)

theorem IsUpperSet.add_left {α : Type u_1} [AddCommGroup α] [Preorder α] [IsOrderedAddMonoid α] {s t : Set α} (ht : IsUpperSet t) :

IsUpperSet (s + t)

theorem IsUpperSet.mul_right {α : Type u_1} [CommGroup α] [Preorder α] [IsOrderedMonoid α] {s t : Set α} (hs : IsUpperSet s) :

IsUpperSet (s * t)

theorem IsUpperSet.add_right {α : Type u_1} [AddCommGroup α] [Preorder α] [IsOrderedAddMonoid α] {s t : Set α} (hs : IsUpperSet s) :

IsUpperSet (s + t)

theorem IsLowerSet.mul_left {α : Type u_1} [CommGroup α] [Preorder α] [IsOrderedMonoid α] {s t : Set α} (ht : IsLowerSet t) :

IsLowerSet (s * t)

theorem IsLowerSet.add_left {α : Type u_1} [AddCommGroup α] [Preorder α] [IsOrderedAddMonoid α] {s t : Set α} (ht : IsLowerSet t) :

IsLowerSet (s + t)

theorem IsLowerSet.mul_right {α : Type u_1} [CommGroup α] [Preorder α] [IsOrderedMonoid α] {s t : Set α} (hs : IsLowerSet s) :

IsLowerSet (s * t)

theorem IsLowerSet.add_right {α : Type u_1} [AddCommGroup α] [Preorder α] [IsOrderedAddMonoid α] {s t : Set α} (hs : IsLowerSet s) :

IsLowerSet (s + t)

theorem IsUpperSet.inv {α : Type u_2} [CommGroup α] [PartialOrder α] [IsOrderedMonoid α] {s : Set α} (hs : IsUpperSet s) :

IsLowerSet s⁻¹

theorem IsUpperSet.neg {α : Type u_2} [AddCommGroup α] [PartialOrder α] [IsOrderedAddMonoid α] {s : Set α} (hs : IsUpperSet s) :

IsLowerSet (-s)

theorem IsLowerSet.inv {α : Type u_2} [CommGroup α] [PartialOrder α] [IsOrderedMonoid α] {s : Set α} (hs : IsLowerSet s) :

IsUpperSet s⁻¹

theorem IsLowerSet.neg {α : Type u_2} [AddCommGroup α] [PartialOrder α] [IsOrderedAddMonoid α] {s : Set α} (hs : IsLowerSet s) :

IsUpperSet (-s)

theorem IsUpperSet.div_left {α : Type u_2} [CommGroup α] [PartialOrder α] [IsOrderedMonoid α] {s t : Set α} (ht : IsUpperSet t) :

IsLowerSet (s / t)

theorem IsUpperSet.sub_left {α : Type u_2} [AddCommGroup α] [PartialOrder α] [IsOrderedAddMonoid α] {s t : Set α} (ht : IsUpperSet t) :

IsLowerSet (s - t)

theorem IsUpperSet.div_right {α : Type u_1} [CommGroup α] [Preorder α] [IsOrderedMonoid α] {s t : Set α} (hs : IsUpperSet s) :

IsUpperSet (s / t)

theorem IsUpperSet.sub_right {α : Type u_1} [AddCommGroup α] [Preorder α] [IsOrderedAddMonoid α] {s t : Set α} (hs : IsUpperSet s) :

IsUpperSet (s - t)

theorem IsLowerSet.div_left {α : Type u_2} [CommGroup α] [PartialOrder α] [IsOrderedMonoid α] {s t : Set α} (ht : IsLowerSet t) :

IsUpperSet (s / t)

theorem IsLowerSet.sub_left {α : Type u_2} [AddCommGroup α] [PartialOrder α] [IsOrderedAddMonoid α] {s t : Set α} (ht : IsLowerSet t) :

IsUpperSet (s - t)

theorem IsLowerSet.div_right {α : Type u_1} [CommGroup α] [Preorder α] [IsOrderedMonoid α] {s t : Set α} (hs : IsLowerSet s) :

IsLowerSet (s / t)

theorem IsLowerSet.sub_right {α : Type u_1} [AddCommGroup α] [Preorder α] [IsOrderedAddMonoid α] {s t : Set α} (hs : IsLowerSet s) :

IsLowerSet (s - t)

@[implicit_reducible]

instance UpperSet.instOne {α : Type u_1} [CommGroup α] [Preorder α] :

One (UpperSet α)

@[implicit_reducible]

instance UpperSet.instZero {α : Type u_1} [AddCommGroup α] [Preorder α] :

Zero (UpperSet α)

@[implicit_reducible]

instance UpperSet.instMul {α : Type u_1} [CommGroup α] [Preorder α] [IsOrderedMonoid α] :

Mul (UpperSet α)

@[implicit_reducible]

instance UpperSet.instAdd {α : Type u_1} [AddCommGroup α] [Preorder α] [IsOrderedAddMonoid α] :

Add (UpperSet α)

@[implicit_reducible]

instance UpperSet.instDiv {α : Type u_1} [CommGroup α] [Preorder α] [IsOrderedMonoid α] :

Div (UpperSet α)

@[implicit_reducible]

instance UpperSet.instSub {α : Type u_1} [AddCommGroup α] [Preorder α] [IsOrderedAddMonoid α] :

Sub (UpperSet α)

@[implicit_reducible]

instance UpperSet.instSMul {α : Type u_1} [CommGroup α] [Preorder α] [IsOrderedMonoid α] :

SMul α (UpperSet α)

@[implicit_reducible]

instance UpperSet.instVAdd {α : Type u_1} [AddCommGroup α] [Preorder α] [IsOrderedAddMonoid α] :

VAdd α (UpperSet α)

@[simp]

theorem UpperSet.coe_one {α : Type u_1} [CommGroup α] [Preorder α] :

↑1 = Set.Ici 1

@[simp]

theorem UpperSet.coe_zero {α : Type u_1} [AddCommGroup α] [Preorder α] :

↑0 = Set.Ici 0

@[simp]

theorem UpperSet.coe_mul {α : Type u_1} [CommGroup α] [Preorder α] [IsOrderedMonoid α] (s t : UpperSet α) :

↑(s * t) = ↑s * ↑t

@[simp]

theorem UpperSet.coe_add {α : Type u_1} [AddCommGroup α] [Preorder α] [IsOrderedAddMonoid α] (s t : UpperSet α) :

↑(s + t) = ↑s + ↑t

@[simp]

theorem UpperSet.coe_div {α : Type u_1} [CommGroup α] [Preorder α] [IsOrderedMonoid α] (s t : UpperSet α) :

↑(s / t) = ↑s / ↑t

@[simp]

theorem UpperSet.coe_sub {α : Type u_1} [AddCommGroup α] [Preorder α] [IsOrderedAddMonoid α] (s t : UpperSet α) :

↑(s - t) = ↑s - ↑t

@[simp]

theorem UpperSet.Ici_one {α : Type u_1} [CommGroup α] [Preorder α] :

Ici 1 = 1

@[simp]

theorem UpperSet.Ici_zero {α : Type u_1} [AddCommGroup α] [Preorder α] :

Ici 0 = 0

@[implicit_reducible]

instance UpperSet.instMulAction {α : Type u_1} [CommGroup α] [Preorder α] [IsOrderedMonoid α] :

MulAction α (UpperSet α)

@[implicit_reducible]

instance UpperSet.instAddAction {α : Type u_1} [AddCommGroup α] [Preorder α] [IsOrderedAddMonoid α] :

AddAction α (UpperSet α)

@[implicit_reducible]

instance UpperSet.commSemigroup {α : Type u_1} [CommGroup α] [Preorder α] [IsOrderedMonoid α] :

CommSemigroup (UpperSet α)

@[implicit_reducible]

instance UpperSet.addCommSemigroup {α : Type u_1} [AddCommGroup α] [Preorder α] [IsOrderedAddMonoid α] :

AddCommSemigroup (UpperSet α)

@[implicit_reducible]

instance UpperSet.instCommMonoid {α : Type u_1} [CommGroup α] [Preorder α] [IsOrderedMonoid α] :

CommMonoid (UpperSet α)

@[implicit_reducible]

instance UpperSet.instAddCommMonoid {α : Type u_1} [AddCommGroup α] [Preorder α] [IsOrderedAddMonoid α] :

AddCommMonoid (UpperSet α)

@[implicit_reducible]

instance LowerSet.instOne {α : Type u_1} [CommGroup α] [Preorder α] :

One (LowerSet α)

@[implicit_reducible]

instance LowerSet.instZero {α : Type u_1} [AddCommGroup α] [Preorder α] :

Zero (LowerSet α)

@[implicit_reducible]

instance LowerSet.instMul {α : Type u_1} [CommGroup α] [Preorder α] [IsOrderedMonoid α] :

Mul (LowerSet α)

@[implicit_reducible]

instance LowerSet.instAdd {α : Type u_1} [AddCommGroup α] [Preorder α] [IsOrderedAddMonoid α] :

Add (LowerSet α)

@[implicit_reducible]

instance LowerSet.instDiv {α : Type u_1} [CommGroup α] [Preorder α] [IsOrderedMonoid α] :

Div (LowerSet α)

@[implicit_reducible]

instance LowerSet.instSub {α : Type u_1} [AddCommGroup α] [Preorder α] [IsOrderedAddMonoid α] :

Sub (LowerSet α)

@[implicit_reducible]

instance LowerSet.instSMul {α : Type u_1} [CommGroup α] [Preorder α] [IsOrderedMonoid α] :

SMul α (LowerSet α)

@[implicit_reducible]

instance LowerSet.instVAdd {α : Type u_1} [AddCommGroup α] [Preorder α] [IsOrderedAddMonoid α] :

VAdd α (LowerSet α)

@[simp]

theorem LowerSet.coe_mul {α : Type u_1} [CommGroup α] [Preorder α] [IsOrderedMonoid α] (s t : LowerSet α) :

↑(s * t) = ↑s * ↑t

@[simp]

theorem LowerSet.coe_add {α : Type u_1} [AddCommGroup α] [Preorder α] [IsOrderedAddMonoid α] (s t : LowerSet α) :

↑(s + t) = ↑s + ↑t

@[simp]

theorem LowerSet.coe_div {α : Type u_1} [CommGroup α] [Preorder α] [IsOrderedMonoid α] (s t : LowerSet α) :

↑(s / t) = ↑s / ↑t

@[simp]

theorem LowerSet.coe_sub {α : Type u_1} [AddCommGroup α] [Preorder α] [IsOrderedAddMonoid α] (s t : LowerSet α) :

↑(s - t) = ↑s - ↑t

@[simp]

theorem LowerSet.Iic_one {α : Type u_1} [CommGroup α] [Preorder α] :

Iic 1 = 1

@[simp]

theorem LowerSet.Iic_zero {α : Type u_1} [AddCommGroup α] [Preorder α] :

Iic 0 = 0

@[implicit_reducible]

instance LowerSet.instMulAction {α : Type u_1} [CommGroup α] [Preorder α] [IsOrderedMonoid α] :

MulAction α (LowerSet α)

@[implicit_reducible]

instance LowerSet.instAddAction {α : Type u_1} [AddCommGroup α] [Preorder α] [IsOrderedAddMonoid α] :

AddAction α (LowerSet α)

@[implicit_reducible]

instance LowerSet.commSemigroup {α : Type u_1} [CommGroup α] [Preorder α] [IsOrderedMonoid α] :

CommSemigroup (LowerSet α)

@[implicit_reducible]

instance LowerSet.addCommSemigroup {α : Type u_1} [AddCommGroup α] [Preorder α] [IsOrderedAddMonoid α] :

AddCommSemigroup (LowerSet α)

@[implicit_reducible]

instance LowerSet.instCommMonoid {α : Type u_1} [CommGroup α] [Preorder α] [IsOrderedMonoid α] :

CommMonoid (LowerSet α)

@[implicit_reducible]

instance LowerSet.instAddCommMonoid {α : Type u_1} [AddCommGroup α] [Preorder α] [IsOrderedAddMonoid α] :

AddCommMonoid (LowerSet α)

@[simp]

theorem upperClosure_one {α : Type u_1} [CommGroup α] [Preorder α] :

upperClosure 1 = 1

@[simp]

theorem upperClosure_zero {α : Type u_1} [AddCommGroup α] [Preorder α] :

upperClosure 0 = 0

@[simp]

theorem lowerClosure_one {α : Type u_1} [CommGroup α] [Preorder α] :

lowerClosure 1 = 1

@[simp]

theorem lowerClosure_zero {α : Type u_1} [AddCommGroup α] [Preorder α] :

lowerClosure 0 = 0

@[simp]

theorem upperClosure_smul {α : Type u_1} [CommGroup α] [Preorder α] [IsOrderedMonoid α] (s : Set α) (a : α) :

upperClosure (a • s) = a • upperClosure s

@[simp]

theorem upperClosure_vadd {α : Type u_1} [AddCommGroup α] [Preorder α] [IsOrderedAddMonoid α] (s : Set α) (a : α) :

upperClosure (a +ᵥ s) = a +ᵥ upperClosure s

@[simp]

theorem lowerClosure_smul {α : Type u_1} [CommGroup α] [Preorder α] [IsOrderedMonoid α] (s : Set α) (a : α) :

lowerClosure (a • s) = a • lowerClosure s

@[simp]

theorem lowerClosure_vadd {α : Type u_1} [AddCommGroup α] [Preorder α] [IsOrderedAddMonoid α] (s : Set α) (a : α) :

lowerClosure (a +ᵥ s) = a +ᵥ lowerClosure s

theorem mul_upperClosure {α : Type u_1} [CommGroup α] [Preorder α] [IsOrderedMonoid α] (s t : Set α) :

s * ↑(upperClosure t) = ↑(upperClosure (s * t))

theorem add_upperClosure {α : Type u_1} [AddCommGroup α] [Preorder α] [IsOrderedAddMonoid α] (s t : Set α) :

s + ↑(upperClosure t) = ↑(upperClosure (s + t))

theorem mul_lowerClosure {α : Type u_1} [CommGroup α] [Preorder α] [IsOrderedMonoid α] (s t : Set α) :

s * ↑(lowerClosure t) = ↑(lowerClosure (s * t))

theorem add_lowerClosure {α : Type u_1} [AddCommGroup α] [Preorder α] [IsOrderedAddMonoid α] (s t : Set α) :

s + ↑(lowerClosure t) = ↑(lowerClosure (s + t))

theorem upperClosure_mul {α : Type u_1} [CommGroup α] [Preorder α] [IsOrderedMonoid α] (s t : Set α) :

↑(upperClosure s) * t = ↑(upperClosure (s * t))

theorem upperClosure_add {α : Type u_1} [AddCommGroup α] [Preorder α] [IsOrderedAddMonoid α] (s t : Set α) :

↑(upperClosure s) + t = ↑(upperClosure (s + t))

theorem lowerClosure_mul {α : Type u_1} [CommGroup α] [Preorder α] [IsOrderedMonoid α] (s t : Set α) :

↑(lowerClosure s) * t = ↑(lowerClosure (s * t))

theorem lowerClosure_add {α : Type u_1} [AddCommGroup α] [Preorder α] [IsOrderedAddMonoid α] (s t : Set α) :

↑(lowerClosure s) + t = ↑(lowerClosure (s + t))

@[simp]

theorem upperClosure_mul_distrib {α : Type u_1} [CommGroup α] [Preorder α] [IsOrderedMonoid α] (s t : Set α) :

upperClosure (s * t) = upperClosure s * upperClosure t

@[simp]

theorem upperClosure_add_distrib {α : Type u_1} [AddCommGroup α] [Preorder α] [IsOrderedAddMonoid α] (s t : Set α) :

upperClosure (s + t) = upperClosure s + upperClosure t

@[simp]

theorem lowerClosure_mul_distrib {α : Type u_1} [CommGroup α] [Preorder α] [IsOrderedMonoid α] (s t : Set α) :

lowerClosure (s * t) = lowerClosure s * lowerClosure t