diff --git a/OrderedSemigroups/Basic.lean b/OrderedSemigroups/Basic.lean
index 4ab0f85..db89d7c 100644
--- a/OrderedSemigroups/Basic.lean
+++ b/OrderedSemigroups/Basic.lean
@@ -26,40 +26,96 @@ class Semigroup' (α : Type u) extends Semigroup α where
   nppow_one : ∀ x, nppow 1 x = x := by intros; rfl
   nppow_succ : ∀ (n : ℕ+) (x), nppow (n+1) x = nppow n x * x
 
+section Semigroup'
+variable [Semigroup' α]
+
 /-- Define the exponentiation notation for the action of ℕ+ on a semigroup' -/
-instance (α : Type u) [Semigroup' α] : Pow α ℕ+ :=
+instance : Pow α ℕ+ :=
   ⟨fun x n ↦ Semigroup'.nppow n x⟩
 
-theorem nppow_eq_pow [Semigroup' α] (n : ℕ+) (x : α) : Semigroup'.nppow n x = x ^ n := rfl
-theorem ppow_one [Semigroup' α] (x : α) : x ^ (1 : ℕ+) = x := Semigroup'.nppow_one x
-theorem ppow_succ [Semigroup' α] (n : ℕ+) (x : α) : x ^ (n + 1) = x ^ n * x := Semigroup'.nppow_succ n x
+theorem nppow_eq_pow (n : ℕ+) (x : α) : Semigroup'.nppow n x = x ^ n := rfl
+
+@[simp]
+theorem ppow_one (x : α) : x ^ (1 : ℕ+) = x := Semigroup'.nppow_one x
+
+theorem ppow_succ (n : ℕ+) (x : α) : x ^ (n + 1) = x ^ n * x := Semigroup'.nppow_succ n x
+
+theorem ppow_comm (n : ℕ+) (x : α) : x^n * x = x * x^n := by
+  induction n using PNat.recOn with
+  | p1 => simp
+  | hp n ih =>
+    simp [ppow_succ, ih, mul_assoc]
+
+theorem ppow_succ' (n : ℕ+) (x : α) : x ^ (n + 1) = x * x^n := by
+  rw [ppow_succ, ppow_comm]
 
 /-- If `n > 1`, then `(a*b)^n = a*(b*a)^(n-1)*b`-/
-theorem split_first_and_last_factor_of_product [Semigroup' α] {a b : α} {n : ℕ+} (h : n > 1) :
-  (a*b)^n = a*(b*a)^(n-1)*b := by
+theorem split_first_and_last_factor_of_product [Semigroup' α] {a b : α} {n : ℕ+} :
+  (a*b)^(n+1) = a*(b*a)^n*b := by
   induction n using PNat.recOn with
-  | p1 => contradiction
+  | p1 => simp [ppow_succ, mul_assoc]
   | hp n ih =>
-    cases n using PNat.recOn with
-    | p1 =>
-      simp [ppow_succ, ppow_one, mul_assoc]
-    | hp n z =>
-      rw [ppow_succ]
-      rw [ih (PNat.lt_add_left 1 n)]
-      have : a * (b * a) ^ (n + 1 - 1) * b * (a * b) = a * ((b * a) ^ (n + 1 - 1) * (b * a)) * b := by simp [mul_assoc]
-      rw [this, ←ppow_succ]
-      simp
+    calc
+      (a * b)^(n + 1 + 1) = (a*b)^(n+1) * (a*b) := by rw [ppow_succ]
+      _                   = a * (b*a)^n * b * (a*b) := by simp [ih]
+      _                   = a * ((b*a)^n * (b*a)) * b := by simp [mul_assoc]
+      _                   = a * (b*a)^(n+1) * b := by rw [←ppow_succ]
+
+end Semigroup'
 
 class OrderedSemigroup (α : Type u) extends Semigroup' α, PartialOrder α where
   mul_le_mul_left : ∀ a b : α, a ≤ b → ∀ c : α, c * a ≤ c * b
   mul_le_mul_right : ∀ a b : α, a ≤ b → ∀ c : α, a * c ≤ b * c
 
-instance (α : Type u) [OrderedSemigroup α] : CovariantClass α α (· * ·) (· ≤ ·) where
+section OrderedSemigroup
+variable [OrderedSemigroup α]
+
+instance : CovariantClass α α (· * ·) (· ≤ ·) where
   elim a b c bc := OrderedSemigroup.mul_le_mul_left b c bc a
 
-instance (α : Type u) [OrderedSemigroup α] : CovariantClass α α (Function.swap (· * ·)) (· ≤ ·) where
+instance : CovariantClass α α (Function.swap (· * ·)) (· ≤ ·) where
   elim a b c bc := OrderedSemigroup.mul_le_mul_right b c bc a
 
+theorem le_pow {a b : α} (h : a ≤ b) (n : ℕ+) : a^n ≤ b^n := by
+  induction n using PNat.recOn with
+  | p1 =>
+    simp
+    assumption
+  | hp n ih =>
+    simp [ppow_succ]
+    exact mul_le_mul' ih h
+
+theorem middle_swap {a b c d : α} (h : a ≤ b) : c * a * d ≤ c * b * d := by
+  have : a * d ≤ b * d := OrderedSemigroup.mul_le_mul_right a b h d
+  have : c * (a * d) ≤ c * (b * d) := OrderedSemigroup.mul_le_mul_left (a*d) (b*d) this c
+  simp [mul_assoc]
+  trivial
+
+theorem comm_factor_le {a b : α} (h : a*b ≤ b*a) (n : ℕ+) : a^n * b^n ≤ (a*b)^n := by
+  induction n using PNat.recOn with
+  | p1 => simp
+  | hp n ih =>
+    calc
+      a^(n+1) * b^(n+1) = a * (a^n * b^n) * b := by simp [ppow_succ, ppow_comm, mul_assoc]
+      _                 ≤ a * (a * b)^n * b := middle_swap ih
+      _                 ≤ a * (b * a)^n * b := middle_swap (le_pow h n)
+      _                 = (a * b)^(n+1) := by rw [←split_first_and_last_factor_of_product]
+
+theorem comm_swap_le [OrderedSemigroup α] {a b : α} (h : a*b ≤ b*a) (n : ℕ+) : (a*b)^n ≤ (b*a)^n := le_pow h n
+
+theorem comm_dist_le [OrderedSemigroup α] {a b : α} (h : a*b ≤ b*a) (n : ℕ+) : (b*a)^n ≤ b^n * a^n := by
+  induction n using PNat.recOn with
+  | p1 => simp
+  | hp n ih =>
+    calc
+      (b*a)^(n+1) = b * (a*b)^n * a := by rw [split_first_and_last_factor_of_product]
+      _           ≤ b * (b*a)^n * a := middle_swap (le_pow h n)
+      _           ≤ b * (b^n * a^n) * a := middle_swap ih
+      _           = (b * b^n) * (a^n * a) := by simp [mul_assoc]
+      _           = b^(n+1) * a^(n+1) := by simp [ppow_succ, ←ppow_succ']
+
+end OrderedSemigroup
+
 class OrderedCancelSemigroup (α : Type u) extends OrderedSemigroup α where
   le_of_mul_le_mul_left : ∀ a b c : α, a * b ≤ a * c → b ≤ c
   le_of_mul_le_mul_right : ∀ a b c : α, b * a ≤ c * a → b ≤ c