refactor(library/init/nat): use recursive equations to prove nat.has_decidable_eq
refactor(library/init/nat): use recursive equations to prove nat.has_decidable_eq

leanprover/lean,leanprover-community/lean,avigad/lean,levnach/lean,c-cube/lean,Kha/lean,leanprover/lean,javra/lean,fgdorais/lean,johoelzl/lean,UlrikBuchholtz/lean,fpvandoorn/lean,leanprover-community/lean,levnach/lean,rlewis1988/lean,fpvandoorn/lean,johoelzl/lean,leanprover/lean,rlewis1988/lean,digama0/lean,Kha/lean,fgdorais/lean,UlrikBuchholtz/lean,eigengrau/lean,htzh/lean,sp3ctum/lean,dselsam/lean,soonhokong/lean-windows,soonhokong/lean-osx,levnach/lean,fpvandoorn/lean,fgdorais/lean,johoelzl/lean,Kha/lean,soonhokong/lean,johoelzl/lean,rlewis1988/lean,soonhokong/lean,leanprover-community/lean,fpvandoorn/lean2,fpvandoorn/lean2,leanprover-community/lean,sp3ctum/lean,digama0/lean,eigengrau/lean,fgdorais/lean,htzh/lean,sp3ctum/lean,javra/lean,soonhokong/lean-osx,soonhokong/lean-osx,rlewis1988/lean,dselsam/lean,soonhokong/lean-windows,htzh/lean,digama0/lean,fpvandoorn/lean2,fgdorais/lean,javra/lean,UlrikBuchholtz/lean,c-cube/lean,eigengrau/lean,leanprover/lean,soonhokong/lean,levnach/lean,leanprover/lean,javra/lean,fpvandoorn/lean2,dselsam/lean,digama0/lean,soonhokong/lean,dselsam/lean,fpvandoorn/lean,Kha/lean,digama0/lean,johoelzl/lean,levnach/lean,leanprover-community/lean,johoelzl/lean,UlrikBuchholtz/lean,leodemoura/lean,avigad/lean,rlewis1988/lean,sp3ctum/lean,leodemoura/lean,sp3ctum/lean,c-cube/lean,UlrikBuchholtz/lean,c-cube/lean,Kha/lean,c-cube/lean,rlewis1988/lean,avigad/lean,soonhokong/lean-osx,fgdorais/lean,fpvandoorn/lean2,dselsam/lean,soonhokong/lean-windows,dselsam/lean,htzh/lean,leodemoura/lean,eigengrau/lean,soonhokong/lean-windows,javra/lean,leodemoura/lean,htzh/lean,avigad/lean,leanprover-community/lean,fpvandoorn/lean,soonhokong/lean,avigad/lean,soonhokong/lean-windows,Kha/lean,soonhokong/lean-osx,leodemoura/lean,avigad/lean,eigengrau/lean,digama0/lean,fpvandoorn/lean,leanprover/lean,leodemoura/lean