Instances on PUnit

This file collects facts about algebraic structures on the one-element type, e.g. that it is a commutative ring.

theorem PUnit.addCommGroup.proof_2 : ∀ (a : PUnit.{u_1 + 1} ), 0 + a = 0 + a

instance PUnit.addCommGroup : AddCommGroup PUnit.{u_1 + 1}

Equations

• PUnit.addCommGroup = AddCommGroup.mk PUnit.addCommGroup.proof_11

theorem PUnit.addCommGroup.proof_4 : ∀ (x : PUnit.{u_1 + 1} ), (fun (x : ℕ) (x : PUnit.{u_1 + 1} ) => PUnit.unit) 0 x = (fun (x : ℕ) (x : PUnit.{u_1 + 1} ) => PUnit.unit) 0 x

theorem PUnit.addCommGroup.proof_6 : ∀ (a b : PUnit.{u_1 + 1} ), a - b = a - b

theorem PUnit.addCommGroup.proof_3 : ∀ (a : PUnit.{u_1 + 1} ), a + 0 = a + 0

theorem PUnit.addCommGroup.proof_9 : ∀ (n : ℕ) (a : PUnit.{u_1 + 1} ), (fun (x : ℤ) (x : PUnit.{u_1 + 1} ) => PUnit.unit) (Int.negSucc n) a = (fun (x : ℤ) (x : PUnit.{u_1 + 1} ) => PUnit.unit) (Int.negSucc n) a

theorem PUnit.addCommGroup.proof_7 : ∀ (a : PUnit.{u_1 + 1} ), (fun (x : ℤ) (x : PUnit.{u_1 + 1} ) => PUnit.unit) 0 a = (fun (x : ℤ) (x : PUnit.{u_1 + 1} ) => PUnit.unit) 0 a

theorem PUnit.addCommGroup.proof_8 : ∀ (n : ℕ) (a : PUnit.{u_1 + 1} ), (fun (x : ℤ) (x : PUnit.{u_1 + 1} ) => PUnit.unit) (Int.ofNat n.succ) a = (fun (x : ℤ) (x : PUnit.{u_1 + 1} ) => PUnit.unit) (Int.ofNat n.succ) a

theorem PUnit.addCommGroup.proof_1 : ∀ (a b c : PUnit.{u_1 + 1} ), a + b + c = a + b + c

theorem PUnit.addCommGroup.proof_10 : ∀ (a : PUnit.{u_1 + 1} ), -a + a = -a + a

theorem PUnit.addCommGroup.proof_5 : ∀ (n : ℕ) (x : PUnit.{u_1 + 1} ), (fun (x : ℕ) (x : PUnit.{u_1 + 1} ) => PUnit.unit) (n + 1) x = (fun (x : ℕ) (x : PUnit.{u_1 + 1} ) => PUnit.unit) (n + 1) x

theorem PUnit.addCommGroup.proof_11 : ∀ (a b : PUnit.{u_1 + 1} ), a + b = a + b

instance PUnit.commGroup : CommGroup PUnit.{u_1 + 1}

Equations

• PUnit.commGroup = CommGroup.mk PUnit.commGroup.proof_11

instance PUnit.instZero : Zero PUnit.{1}

Equations

• PUnit.instZero = { zero := () }

instance PUnit.instOne : One PUnit.{1}

Equations

• PUnit.instOne = { one := () }

instance PUnit.instAdd_mathlib : Add PUnit.{1}

Equations

• PUnit.instAdd_mathlib = { add := fun (x x : PUnit.{1}) => () }

instance PUnit.instMul_mathlib : Mul PUnit.{1}

Equations

• PUnit.instMul_mathlib = { mul := fun (x x : PUnit.{1}) => () }

instance PUnit.instSub_mathlib : Sub PUnit.{1}

Equations

• PUnit.instSub_mathlib = { sub := fun (x x : PUnit.{1}) => () }

instance PUnit.instDiv_mathlib : Div PUnit.{1}

Equations

• PUnit.instDiv_mathlib = { div := fun (x x : PUnit.{1}) => () }

instance PUnit.instNeg : Neg PUnit.{1}

Equations

• PUnit.instNeg = { neg := fun (x : PUnit.{1}) => () }

instance PUnit.instInv : Inv PUnit.{1}

Equations

• PUnit.instInv = { inv := fun (x : PUnit.{1}) => () }

@[simp]

theorem PUnit.zero_eq : 0 = PUnit.unit

@[simp]

theorem PUnit.one_eq : 1 = PUnit.unit

theorem PUnit.add_eq {x : PUnit.{1}} {y : PUnit.{1}} : x + y = PUnit.unit

theorem PUnit.mul_eq {x : PUnit.{1}} {y : PUnit.{1}} : x * y = PUnit.unit

@[simp]

theorem PUnit.sub_eq {x : PUnit.{1}} {y : PUnit.{1}} : x - y = PUnit.unit

@[simp]

theorem PUnit.div_eq {x : PUnit.{1}} {y : PUnit.{1}} : x / y = PUnit.unit

@[simp]

theorem PUnit.neg_eq {x : PUnit.{1}} : -x = PUnit.unit

@[simp]

theorem PUnit.inv_eq {x : PUnit.{1}} : x⁻¹ = PUnit.unit

instance PUnit.commRing : CommRing PUnit.{u_1 + 1}

Equations

• PUnit.commRing = let __spread.0 := PUnit.commGroup; let __spread.1 := PUnit.addCommGroup; CommRing.mk ⋯

instance PUnit.cancelCommMonoidWithZero : CancelCommMonoidWithZero PUnit.{u_1 + 1}

Equations

• PUnit.cancelCommMonoidWithZero = CancelCommMonoidWithZero.mk

instance PUnit.normalizedGCDMonoid : NormalizedGCDMonoid PUnit.{u_1 + 1}

Equations

• PUnit.normalizedGCDMonoid = NormalizedGCDMonoid.mk PUnit.normalizedGCDMonoid.proof_10 PUnit.normalizedGCDMonoid.proof_11

theorem PUnit.gcd_eq {x : PUnit.{u_1 + 1} } {y : PUnit.{u_1 + 1} } : gcd x y = PUnit.unit

theorem PUnit.lcm_eq {x : PUnit.{u_1 + 1} } {y : PUnit.{u_1 + 1} } : lcm x y = PUnit.unit

@[simp]

theorem PUnit.norm_unit_eq {x : PUnit.{u_1 + 1} } : normUnit x = 1