# Library uuu

# Introduction. Vladimir Voevodsky . Feb. 2010 - Sep. 2011

This is the first in the group of files which contain the (current state of) the mathematical library for theproof assistant Coq based on the Univalent Foundations. It contains some new notations for constructions defined in Coq.Init library as well as the definition of dependent sum as a record.

Preambule.

Unset Automatic Introduction.

This line has to be removed for the file to compile with Coq8.2

Universe structure

Empty type. The empty type is introduced in Coq.Init.Datatypes by the line:

Inductive Empty_set : Set := .

Inductive Empty_set : Set := .

Identity Types. Idenity types are introduced in Coq.Init.Datatypes by the lines :

Inductive identity ( A : Type ) ( a : A ) : A -> Type := identity_refl : identity _ a a . Hint Resolve identity_refl : core .

Inductive identity ( A : Type ) ( a : A ) : A -> Type := identity_refl : identity _ a a . Hint Resolve identity_refl : core .

Dpendent sums.

One can not use a new record each time one needs it because the general theorems about this construction would not apply to new instances of "Record" due to the "generativity" of inductive definitions in Coq. One could use "Inductive" instead of "Record" here but using "Record" which is equivalent to "Structure" allows us later to use the mechanism of canonical structures with total2.

One can not use a new record each time one needs it because the general theorems about this construction would not apply to new instances of "Record" due to the "generativity" of inductive definitions in Coq. One could use "Inductive" instead of "Record" here but using "Record" which is equivalent to "Structure" allows us later to use the mechanism of canonical structures with total2.

Record total2 { T: Type } ( P: T -> Type ) := tpair { pr21_c : T ; pr22_c : P pr21_c }.

Definition pr21 { T: Type } { P : T -> Type } ( tp : total2 P ) := match tp with tpair t p => t end .

Definition pr22 { T: Type } { P : T -> Type } ( tp : total2 P ) := match tp as a return P ( pr21 a ) with tpair t p => p end .

Implicit Arguments tpair [ T ] .

Coproducts .

The coproduct of two types is introduced in Coq.Init.Datatypes by the lines:

Inductive sum (A BType:) : Type := | inl : A -> sum A B | inr : B -> sum A B.

The coproduct of two types is introduced in Coq.Init.Datatypes by the lines:

Inductive sum (A BType:) : Type := | inl : A -> sum A B | inr : B -> sum A B.

Notation coprod := sum .

Notation ii1fun := inl .

Notation ii2fun := inr .

Notation ii1 := inl .

Notation ii2 := inr .

Implicit Arguments ii1 [ A B ] .

Implicit Arguments ii2 [ A B ] .

The following command checks wheather the patch which modifies the universe level assignement for inductive types have been installed. With the patch it returns paths 0 0 : UUU . Without the patch it returns paths 0 0 : Prop .