19 lines
388 B
Text
19 lines
388 B
Text
exit
|
|
open eq.ops
|
|
|
|
inductive Nat : Type :=
|
|
zero : Nat |
|
|
succ : Nat → Nat
|
|
|
|
namespace Nat
|
|
|
|
definition pred (n : Nat) := Nat.rec zero (fun m x, m) n
|
|
theorem pred_succ (n : Nat) : pred (succ n) = n := rfl
|
|
|
|
theorem succ.inj {n m : Nat} (H : succ n = succ m) : n = m
|
|
:= calc
|
|
n = pred (succ n) : pred_succ n
|
|
... = pred (succ m) : by rewrite H
|
|
... = m : pred_succ m
|
|
|
|
end Nat
|