P (constructor)
pair [in Coq.Init.Datatypes]
partial_order_equivalence [in Coq.Classes.RelationClasses]
permA_trans [in Coq.Lists.SetoidPermutation]
permA_swap [in Coq.Lists.SetoidPermutation]
permA_skip [in Coq.Lists.SetoidPermutation]
permA_nil [in Coq.Lists.SetoidPermutation]
perm_trans [in Coq.Sorting.Permutation]
perm_swap [in Coq.Sorting.Permutation]
perm_skip [in Coq.Sorting.Permutation]
perm_nil [in Coq.Sorting.Permutation]
PositiveMap.Leaf [in Coq.FSets.FMapPositive]
PositiveMap.Node [in Coq.FSets.FMapPositive]
PositiveSet.ct_lgx [in Coq.FSets.FSetPositive]
PositiveSet.ct_glx [in Coq.FSets.FSetPositive]
PositiveSet.ct_exx [in Coq.FSets.FSetPositive]
PositiveSet.ct_xex [in Coq.FSets.FSetPositive]
PositiveSet.ct_xxx [in Coq.FSets.FSetPositive]
PositiveSet.ct_lgx [in Coq.MSets.MSetPositive]
PositiveSet.ct_glx [in Coq.MSets.MSetPositive]
PositiveSet.ct_exx [in Coq.MSets.MSetPositive]
PositiveSet.ct_xex [in Coq.MSets.MSetPositive]
PositiveSet.ct_xxx [in Coq.MSets.MSetPositive]
PositiveSet.Leaf [in Coq.FSets.FSetPositive]
PositiveSet.Leaf [in Coq.MSets.MSetPositive]
PositiveSet.Node [in Coq.FSets.FSetPositive]
PositiveSet.Node [in Coq.MSets.MSetPositive]
Pos.IsNeg [in Coq.PArith.BinPosDef]
Pos.IsNul [in Coq.PArith.BinPosDef]
Pos.IsPos [in Coq.PArith.BinPosDef]
Pos.PeanoOne [in Coq.PArith.BinPos]
Pos.PeanoSucc [in Coq.PArith.BinPos]
Pos.SqrtApprox [in Coq.PArith.BinPos]
Pos.SqrtExact [in Coq.PArith.BinPos]
Pos.SubIsNeg [in Coq.PArith.BinPos]
Pos.SubIsNul [in Coq.PArith.BinPos]
Pos.SubIsPos [in Coq.PArith.BinPos]
prime_intro [in Coq.ZArith.Znumtheory]
proper_proxy [in Coq.Classes.Morphisms]
proper_prf [in Coq.Classes.Morphisms]
Props.BSLeaf [in Coq.MSets.MSetGenTree]
Props.BSNode [in Coq.MSets.MSetGenTree]
Props.InLeft [in Coq.MSets.MSetGenTree]
Props.InRight [in Coq.MSets.MSetGenTree]
Props.IsRoot [in Coq.MSets.MSetGenTree]
Props.ok [in Coq.MSets.MSetGenTree]