statement stringlengths 1 4.33k | proof stringlengths 0 37.9k | type stringclasses 25
values | symbolic_name stringlengths 1 67 | library stringclasses 10
values | filename stringclasses 112
values | imports listlengths 2 138 | deps listlengths 0 64 | docstring stringclasses 798
values | source_url stringclasses 1
value | commit stringclasses 1
value |
|---|---|---|---|---|---|---|---|---|---|---|
lt x y | := (x.1 <= y.1) && ((x.1 >= y.1) ==> (x.2 < y.2)). | Let | lt | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
refl : reflexive le. | Proof. by move=> ?; rewrite /le !lexx. Qed. | Fact | refl | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"le",
"lexx"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
trans : transitive le. | Proof.
move=> y x z /andP [hxy /implyP hxy'] /andP [hyz /implyP hyz'].
rewrite /le (le_trans hxy) //=; apply/implyP => hzx.
by apply/le_trans/hxy'/(le_trans hyz): (hyz' (le_trans hzx hxy)).
Qed. | Fact | trans | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"apply",
"le",
"le_trans"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
lt_le_def x y : lt x y = le x y && ~~ le y x. | Proof.
rewrite /lt /le; case: x y => [x1 x2] [y1 y2]/=.
case/boolP: (x1 <= y1); case/boolP: (y1 <= x1) => //= _ _.
exact/lt_le_def.
Qed. | Fact | lt_le_def | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"le",
"lt"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
leEprodlexi x y :
(x <= y) = (x.1 <= y.1) && ((x.1 >= y.1) ==> (x.2 <= y.2)). | Proof. by []. Qed. | Lemma | leEprodlexi | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
ltEprodlexi x y :
(x < y) = (x.1 <= y.1) && ((x.1 >= y.1) ==> (x.2 < y.2)). | Proof. by []. Qed. | Lemma | ltEprodlexi | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
lexi_pair (x1 y1 : T1) (x2 y2 : T2) :
((x1, x2) <= (y1, y2) :> T1 * T2) = (x1 <= y1) && ((x1 >= y1) ==> (x2 <= y2)). | Proof. by []. Qed. | Lemma | lexi_pair | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
ltxi_pair (x1 y1 : T1) (x2 y2 : T2) :
((x1, x2) < (y1, y2) :> T1 * T2) = (x1 <= y1) && ((x1 >= y1) ==> (x2 < y2)). | Proof. by []. Qed. | Lemma | ltxi_pair | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
le0x x : (\bot, \bot) <= x :> T1 * T2. | Proof. by rewrite leEprodlexi !le0x implybT. Qed. | Fact | le0x | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"bot",
"leEprodlexi"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
botEprodlexi : \bot = (\bot, \bot) :> T1 * T2. | Proof. by []. Qed. | Lemma | botEprodlexi | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"bot"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
topEprodlexi : \top = (\top, \top) :> T1 * T2. | Proof. by []. Qed. | Lemma | topEprodlexi | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
sub_prod_lexi (disp1 disp2 disp3 disp4 : disp_t)
(T1 : preorderType disp1) (T2 : preorderType disp2) :
subrel (<=%O : rel (T1 *prod[disp3] T2)) (<=%O : rel (type disp4 T1 T2)). | Proof.
case=> [x1 x2] [y1 y2]; rewrite leEprod leEprodlexi /= => /andP[] -> ->.
exact: implybT.
Qed. | Lemma | sub_prod_lexi | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"disp_t",
"leEprod",
"leEprodlexi",
"prod",
"rel",
"type"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"T *lexi[ d ] T'" | := (type d T T')
(at level 70, d at next level, format "T *lexi[ d ] T'") : type_scope. | Notation | T *lexi[ d ] T' | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"T'",
"next",
"type"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"T *l T'" | := (type_ T T')
(at level 70, format "T *l T'") : type_scope. | Notation | T *l T' | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"T'",
"type_"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
leEprodlexi | := @leEprodlexi. | Definition | leEprodlexi | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
ltEprodlexi | := @ltEprodlexi. | Definition | ltEprodlexi | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
lexi_pair | := @lexi_pair. | Definition | lexi_pair | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
ltxi_pair | := @ltxi_pair. | Definition | ltxi_pair | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
topEprodlexi | := @topEprodlexi. | Definition | topEprodlexi | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
botEprodlexi | := @botEprodlexi. | Definition | botEprodlexi | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
sub_prod_lexi | := @sub_prod_lexi. | Definition | sub_prod_lexi | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
type (disp : disp_t) T | := seq T. | Definition | type | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"disp_t",
"seq"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
type_ (disp : disp_t) (T : preorderType disp) | :=
type (seqprod_display disp) T. | Definition | type_ | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"disp_t",
"seqprod_display",
"type"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
le s1 s2 | := if s1 isn't x1 :: s1' then true else
if s2 isn't x2 :: s2' then false else
(x1 <= x2) && le s1' s2'. | Fixpoint | le | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"s1",
"s2"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
refl : reflexive le. | Proof. by elim=> //= ? ? ?; rewrite !lexx. Qed. | Fact | refl | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"le",
"lexx"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
trans : transitive le. | Proof.
elim=> [|y ys ihs] [|x xs] [|z zs] //= /andP[xy xys] /andP[yz yzs].
by rewrite (le_trans xy)// ihs.
Qed. | Fact | trans | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"le",
"le_trans"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
leEseq s1 s2 : (s1 <= s2) = if s1 isn't x1 :: s1' then true else
if s2 isn't x2 :: s2' then false else
(x1 <= x2) && (s1' <= s2' :> seq _). | Proof. by case: s1. Qed. | Lemma | leEseq | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"s1",
"s2",
"seq"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
le0s s : [::] <= s :> seq _. | Proof. by []. Qed. | Lemma | le0s | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"seq"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
les0 s : (s <= [::]) = (s == [::]). | Proof. by rewrite leEseq. Qed. | Lemma | les0 | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"leEseq"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
le_cons x1 s1 x2 s2 :
(x1 :: s1 <= x2 :: s2 :> seq _) = (x1 <= x2) && (s1 <= s2). | Proof. by []. Qed. | Lemma | le_cons | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"s1",
"s2",
"seq"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
botEseq : \bot = [::] :> seq T. | Proof. by []. Qed. | Lemma | botEseq | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"bot",
"seq"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
seqprod_with | := type. | Notation | seqprod_with | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"type"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
seqprod | := type_. | Notation | seqprod | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"type_"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
leEseq | := @leEseq. | Definition | leEseq | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
le0s | := @le0s. | Definition | le0s | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
les0 | := @les0. | Definition | les0 | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
le_cons | := @le_cons. | Definition | le_cons | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
botEseq | := @botEseq. | Definition | botEseq | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
seqprod | := (seqprod_with (seqprod_display disp)). | Notation | seqprod | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"seqprod_display",
"seqprod_with"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
type_ (disp : disp_t) (T : preorderType disp) | :=
type (seqlexi_display disp) T. | Definition | type_ | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"disp_t",
"seqlexi_display",
"type"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
le s1 s2 | := if s1 isn't x1 :: s1' then true else
if s2 isn't x2 :: s2' then false else
(x1 <= x2) && ((x1 >= x2) ==> le s1' s2'). | Fixpoint | le | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"s1",
"s2"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
lt s1 s2 | := if s2 isn't x2 :: s2' then false else
if s1 isn't x1 :: s1' then true else
(x1 <= x2) && ((x1 >= x2) ==> lt s1' s2'). | Fixpoint | lt | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"s1",
"s2"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
refl: reflexive le. | Proof. by elim => [|x s ih] //=; rewrite lexx. Qed. | Fact | refl | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"le",
"lexx"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
trans: transitive le. | Proof.
elim=> [|y sy ihs] [|x sx] [|z sz] //= /andP[] xy /implyP yx /andP[] yz /implyP zy /=.
rewrite (le_trans xy yz)/=; apply/implyP => zx.
apply/ihs; first exact/yx/(le_trans yz zx).
exact/zy/(le_trans zx xy).
Qed. | Fact | trans | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"apply",
"le",
"le_trans"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
lt_le_def s1 s2 : lt s1 s2 = le s1 s2 && ~~ le s2 s1. | Proof.
elim: s1 s2 => [|x s1 ihs1] [|y s2]//=; rewrite ihs1.
by case: (x <= y); case (y <= x).
Qed. | Lemma | lt_le_def | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"le",
"lt",
"s1",
"s2"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
leEseqlexi s1 s2 :
(s1 <= s2) = if s1 isn't x1 :: s1' then true else
if s2 isn't x2 :: s2' then false else
(x1 <= x2) && ((x1 >= x2) ==> (s1' <= s2' :> seq T)). | Proof. by case: s1. Qed. | Lemma | leEseqlexi | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"s1",
"s2",
"seq"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
ltEseqlexi s1 s2 :
(s1 < s2) = if s2 isn't x2 :: s2' then false else
if s1 isn't x1 :: s1' then true else
(x1 <= x2) && ((x1 >= x2) ==> (s1' < s2' :> seq T)). | Proof. by case: s1. Qed. | Lemma | ltEseqlexi | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"s1",
"s2",
"seq"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
lexi0s s : [::] <= s :> seq T. | Proof. by []. Qed. | Lemma | lexi0s | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"seq"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
lexis0 s : (s <= [::]) = (s == [::]). | Proof. by rewrite leEseqlexi. Qed. | Lemma | lexis0 | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"leEseqlexi"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
ltxi0s s : ([::] < s :> seq T) = (s != [::]). | Proof. by case: s. Qed. | Lemma | ltxi0s | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"seq"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
ltxis0 s : (s < [::]) = false. | Proof. by rewrite ltEseqlexi. Qed. | Lemma | ltxis0 | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"ltEseqlexi"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
lexi_cons x1 s1 x2 s2 :
(x1 :: s1 <= x2 :: s2 :> seq T) = (x1 <= x2) && ((x1 >= x2) ==> (s1 <= s2)). | Proof. by []. Qed. | Lemma | lexi_cons | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"s1",
"s2",
"seq"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
ltxi_cons x1 s1 x2 s2 :
(x1 :: s1 < x2 :: s2 :> seq T) = (x1 <= x2) && ((x1 >= x2) ==> (s1 < s2)). | Proof. by []. Qed. | Lemma | ltxi_cons | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"s1",
"s2",
"seq"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
lexi_lehead x s1 y s2 : x :: s1 <= y :: s2 :> seq T -> x <= y. | Proof. by rewrite lexi_cons => /andP[]. Qed. | Lemma | lexi_lehead | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"lexi_cons",
"s1",
"s2",
"seq"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
ltxi_lehead x s1 y s2 : x :: s1 < y :: s2 :> seq T -> x <= y. | Proof. by rewrite ltxi_cons => /andP[]. Qed. | Lemma | ltxi_lehead | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"ltxi_cons",
"s1",
"s2",
"seq"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
eqhead_lexiE (x : T) s1 s2 : (x :: s1 <= x :: s2 :> seq _) = (s1 <= s2). | Proof. by rewrite lexi_cons lexx. Qed. | Lemma | eqhead_lexiE | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"lexi_cons",
"lexx",
"s1",
"s2",
"seq"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
eqhead_ltxiE (x : T) s1 s2 : (x :: s1 < x :: s2 :> seq _) = (s1 < s2). | Proof. by rewrite ltxi_cons lexx. Qed. | Lemma | eqhead_ltxiE | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"lexx",
"ltxi_cons",
"s1",
"s2",
"seq"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
sub_seqprod_lexi d (T : preorderType disp) :
subrel (<=%O : rel (seqprod_with d T)) (<=%O : rel (seq T)). | Proof.
elim=> [|x1 s1 ihs1] [|x2 s2]//=; rewrite le_cons lexi_cons /=.
by move=> /andP[-> /ihs1->]; rewrite implybT.
Qed. | Lemma | sub_seqprod_lexi | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"le_cons",
"lexi_cons",
"rel",
"s1",
"s2",
"seq",
"seqprod_with"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
seqlexi_with | := type. | Notation | seqlexi_with | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"type"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
seqlexi | := type_. | Notation | seqlexi | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"type_"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
leEseqlexi | := @leEseqlexi. | Definition | leEseqlexi | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
lexi0s | := @lexi0s. | Definition | lexi0s | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
lexis0 | := @lexis0. | Definition | lexis0 | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
lexi_cons | := @lexi_cons. | Definition | lexi_cons | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
lexi_lehead | := @lexi_lehead. | Definition | lexi_lehead | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
eqhead_lexiE | := @eqhead_lexiE. | Definition | eqhead_lexiE | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
ltEseqltxi | := @ltEseqlexi. | Definition | ltEseqltxi | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"ltEseqlexi"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
ltxi0s | := @ltxi0s. | Definition | ltxi0s | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
ltxis0 | := @ltxis0. | Definition | ltxis0 | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
ltxi_cons | := @ltxi_cons. | Definition | ltxi_cons | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
ltxi_lehead | := @ltxi_lehead. | Definition | ltxi_lehead | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
eqhead_ltxiE | := @eqhead_ltxiE. | Definition | eqhead_ltxiE | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
sub_seqprod_lexi | := @sub_seqprod_lexi. | Definition | sub_seqprod_lexi | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
seqlexi | := (seqlexi_with (seqlexi_display disp)). | Notation | seqlexi | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"seqlexi_display",
"seqlexi_with"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
type (disp : disp_t) n T | := n.-tuple T. | Definition | type | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"disp_t",
"tuple"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
type_ (disp : disp_t) n (T : preorderType disp) | :=
type (seqprod_display disp) n T. | Definition | type_ | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"disp_t",
"seqprod_display",
"type"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
leEtprod n T (t1 t2 : n.-tuple T) :
(t1 <= t2) = [forall i, tnth t1 i <= tnth t2 i]. | Proof.
elim: n => [|n IHn] in t1 t2 *.
by rewrite tuple0 [t2]tuple0/= lexx; symmetry; apply/forallP => [].
case: (tupleP t1) (tupleP t2) => [x1 {}t1] [x2 {}t2].
rewrite [_ <= _]le_cons [t1 <= t2 :> seq _]IHn.
apply/idP/forallP => [/andP[lex12 /forallP/= let12 i]|lext12].
by case: (unliftP ord0 i) => [j ->|->]//; re... | Lemma | leEtprod | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"apply",
"forallP",
"le_cons",
"lexx",
"lift",
"ord0",
"seq",
"tnth",
"tnthS",
"tuple",
"tuple0",
"tupleP",
"unliftP"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
ltEtprod n T (t1 t2 : n.-tuple T) :
(t1 < t2) = [exists i, tnth t1 i < tnth t2 i] &&
[forall i, tnth t1 i <= tnth t2 i]. | Proof.
rewrite lt_leAnge !leEtprod negb_forall andbC.
apply/andP/andP => -[] /existsP[x] xlt le; split=> //; apply/existsP; exists x.
rewrite lt_leAnge xlt.
by move: le => /forallP ->.
by move: xlt; rewrite lt_leAnge => /andP[].
Qed. | Lemma | ltEtprod | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"apply",
"existsP",
"forallP",
"le",
"leEtprod",
"lt_leAnge",
"negb_forall",
"split",
"tnth",
"tuple"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
le0x t : [tuple \bot | _ < n] <= t :> n.-tuple T. | Proof. by rewrite leEtprod; apply/forallP => i; rewrite tnth_mktuple le0x. Qed. | Fact | le0x | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"apply",
"bot",
"forallP",
"leEtprod",
"tnth_mktuple",
"tuple"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
botEtprod : \bot = [tuple \bot | _ < n] :> n.-tuple T. | Proof. by []. Qed. | Lemma | botEtprod | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"bot",
"tuple"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
lex1 t : t <= [tuple \top | _ < n] :> n.-tuple T. | Proof. by rewrite leEtprod; apply/forallP => i; rewrite tnth_mktuple lex1. Qed. | Fact | lex1 | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"apply",
"forallP",
"leEtprod",
"tnth_mktuple",
"top",
"tuple"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
topEtprod : \top = [tuple \top | _ < n] :> n.-tuple T. | Proof. by []. Qed. | Lemma | topEtprod | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"top",
"tuple"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"n .-tupleprod[ disp ]" | := (type disp n)
(format "n .-tupleprod[ disp ]") : type_scope. | Notation | n .-tupleprod[ disp ] | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"type"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"n .-tupleprod" | := (type_ n)
(format "n .-tupleprod") : type_scope. | Notation | n .-tupleprod | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"type_"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
leEtprod | := @leEtprod. | Definition | leEtprod | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
ltEtprod | := @ltEtprod. | Definition | ltEtprod | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
botEtprod | := @botEtprod. | Definition | botEtprod | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
topEtprod | := @topEtprod. | Definition | topEtprod | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"n .-tupleprod" | := n.-tupleprod[seqprod_display disp]. | Notation | n .-tupleprod | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"seqprod_display"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
type_ (disp : disp_t) n (T : preorderType disp) | :=
type (seqlexi_display disp) n T. | Definition | type_ | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"disp_t",
"seqlexi_display",
"type"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
le0x t : [tuple \bot | _ < n] <= t :> n.-tuple T. | Proof. by apply: sub_seqprod_lexi; apply: le0x (t : n.-tupleprod T). Qed. | Fact | le0x | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"apply",
"bot",
"sub_seqprod_lexi",
"tuple"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
botEtlexi : \bot = [tuple \bot | _ < n] :> n.-tuple T. | Proof. by []. Qed. | Lemma | botEtlexi | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"bot",
"tuple"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
lex1 t : t <= [tuple \top | _ < n]. | Proof. by apply: sub_seqprod_lexi; apply: lex1 (t : n.-tupleprod T). Qed. | Fact | lex1 | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"apply",
"sub_seqprod_lexi",
"top",
"tuple"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
topEtlexi : \top = [tuple \top | _ < n] :> n.-tuple T. | Proof. by []. Qed. | Lemma | topEtlexi | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"top",
"tuple"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
sub_tprod_lexi d n (T : preorderType disp) :
subrel (<=%O : rel (n.-tupleprod[d] T)) (<=%O : rel (n.-tuple T)). | Proof. exact: sub_seqprod_lexi. Qed. | Lemma | sub_tprod_lexi | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"rel",
"sub_seqprod_lexi",
"tuple"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"n .-tuplelexi[ disp ]" | := (type disp n)
(format "n .-tuplelexi[ disp ]") : type_scope. | Notation | n .-tuplelexi[ disp ] | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"type"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"n .-tuplelexi" | := (type_ n)
(format "n .-tuplelexi") : type_scope. | Notation | n .-tuplelexi | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [
"type_"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
topEtlexi | := @topEtlexi. | Definition | topEtlexi | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
botEtlexi | := @botEtlexi. | Definition | botEtlexi | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
sub_tprod_lexi | := @sub_tprod_lexi. | Definition | sub_tprod_lexi | order | order/preorder.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"DvdSyntax",
"DefaultSeqProdOrder",
"DefaultSeqLexiOrder",
"SetSubsetOrder.Exports",
"OrdinalOrd... | [] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.