(************************************************************************)
(*         *      The Rocq Prover / The Rocq Development Team           *)
(*  v      *         Copyright INRIA, CNRS and contributors             *)
(* <O___,, * (see version control and CREDITS file for authors & dates) *)
(*   \VV/  **************************************************************)
(*    //   *    This file is distributed under the terms of the         *)
(*         *     GNU Lesser General Public License Version 2.1          *)
(*         *     (see LICENSE file for the text of the license)         *)
(************************************************************************)
(** Implementation of the Cantor pairing and its inverse function *)
(** Bijections between [nat * nat] and [nat] *)
(** Cantor pairing [to_nat] *)
Definition to_nat '(x, y) : nat :=
y + (nat_rec _ 0 (fun i m => (S i) + m) (y + x)).
(** Cantor pairing inverse [of_nat] *)
Definition of_nat (n : nat) : nat * nat :=
nat_rec _ (0, 0) (fun _ '(x, y) =>
match x with | S x => (x, S y) | _ => (S y, 0) end) n.
(** [of_nat] is the left inverse for [to_nat] *)

(** [to_nat] is the left inverse for [of_nat] *)
Lemma cancel_to_of n : to_nat (of_nat n) = n.