-- Copyright 2020 INP Toulouse.
-- Authors : Mathieu Montin.

-- This version of Unif is provided to you free of charge. It is released under the FSF GPL license, http://www.fsf.org/licenses/gpl.html. 
-- As a counterpart to the access to the source code and rights to copy, modify and redistribute granted by the license, users  are provided only 
-- with a limited warranty and the software's author, the holder of the economic rights, and the successive licensors have only limited liability. 
-- In this respect, the user's attention is drawn to the risks associated with loading, using, modifying and/or developing or reproducing the 
-- software by the user in light of its specific status of free software, that may mean that it is complicated to manipulate, and that also there-
-- fore means that it is reserved for developers and experienced professionals having in-depth computer knowledge. Users are therefore encouraged 
-- to load and test the software's suitability as regards their requirements in conditions enabling the security of their systems and/or data to 
-- be ensured and, more generally, to use and operate it in the same conditions as regards security.
-- The fact that you are presently reading this means that you have had knowledge of the FSF GPL version 3 license and that you accept its terms.

module Unif where

open import Relation.Binary.PropositionalEquality

trans≡ :  {a} {A : Set a} {x y z : A} 
  x  y  y  z  x  z
trans≡ {x = x} {.x} {.x} refl refl = refl

cong≡ :  {a b} {A : Set a} {B : Set b} {x y} 
  (f : A  B)  x  y  f x  f y
cong≡ {x = x} {.x} f refl = refl