zero_mul

formal source

 180
 181@[simp] theorem mul_succ (n m : LogicNat) : n * succ m = n * m + n := rfl
 182
 183theorem zero_mul (n : LogicNat) : zero * n = zero := by
 184  induction n with
 185  | identity => rfl
 186  | step n ih =>
 187    show zero * succ n = zero
 188    rw [mul_succ, ih, zero_add]
 189
 190theorem mul_one (n : LogicNat) : n * succ zero = n := by
 191  show n * succ zero = n
 192  rw [mul_succ, mul_zero, zero_add]
 193
 194theorem one_mul (n : LogicNat) : succ zero * n = n := by
 195  induction n with
 196  | identity => rfl
 197  | step n ih =>
 198    show succ zero * succ n = succ n
 199    rw [mul_succ, ih]
 200    show n + succ zero = succ n
 201    rw [add_succ, add_zero]
 202
 203theorem mul_add (a b c : LogicNat) : a * (b + c) = a * b + a * c := by
 204  induction c with
 205  | identity =>
 206    show a * (b + zero) = a * b + a * zero
 207    rw [add_zero, mul_zero, add_zero]
 208  | step c ih =>
 209    show a * (b + succ c) = a * b + a * succ c
 210    rw [add_succ, mul_succ, mul_succ, ih, add_assoc]
 211
 212/-! ## 5. Recovery Theorem: LogicNat ≃ Nat
 213