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 |
|---|---|---|---|---|---|---|---|---|---|---|
"\join^p_ ( i < n | P ) F" | :=
(\big[join / \bot]_(i < n | P%B) F%O) : order_scope. | Notation | \join^p_ ( i < n | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bot",
"join"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\join^p_ ( i < n ) F" | :=
(\big[join / \bot]_(i < n) F%O) : order_scope. | Notation | \join^p_ ( i < n ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bot",
"join"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\join^p_ ( i 'in' A | P ) F" | :=
(\big[join / \bot]_(i in A | P%B) F%O) : order_scope. | Notation | \join^p_ ( i 'in' A | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bot",
"join"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\join^p_ ( i 'in' A ) F" | :=
(\big[join / \bot]_(i in A) F%O) : order_scope. | Notation | \join^p_ ( i 'in' A ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bot",
"join"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\meet^p_ ( i <- r | P ) F" | :=
(\big[meet / \top]_(i <- r | P%B) F%O) : order_scope. | Notation | \meet^p_ ( i <- r | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"meet",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\meet^p_ ( i <- r ) F" | :=
(\big[meet / \top]_(i <- r) F%O) : order_scope. | Notation | \meet^p_ ( i <- r ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"meet",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\meet^p_ ( i | P ) F" | :=
(\big[meet / \top]_(i | P%B) F%O) : order_scope. | Notation | \meet^p_ ( i | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"meet",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\meet^p_ i F" | :=
(\big[meet / \top]_i F%O) : order_scope. | Notation | \meet^p_ i F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"meet",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\meet^p_ ( i : I | P ) F" | :=
(\big[meet / \top]_(i : I | P%B) F%O) (only parsing) : order_scope. | Notation | \meet^p_ ( i : I | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"meet",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\meet^p_ ( i : I ) F" | :=
(\big[meet / \top]_(i : I) F%O) (only parsing) : order_scope. | Notation | \meet^p_ ( i : I ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"meet",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\meet^p_ ( m <= i < n | P ) F" | :=
(\big[meet / \top]_(m <= i < n | P%B) F%O) : order_scope. | Notation | \meet^p_ ( m <= i < n | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"meet",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\meet^p_ ( m <= i < n ) F" | :=
(\big[meet / \top]_(m <= i < n) F%O) : order_scope. | Notation | \meet^p_ ( m <= i < n ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"meet",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\meet^p_ ( i < n | P ) F" | :=
(\big[meet / \top]_(i < n | P%B) F%O) : order_scope. | Notation | \meet^p_ ( i < n | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"meet",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\meet^p_ ( i < n ) F" | :=
(\big[meet / \top]_(i < n) F%O) : order_scope. | Notation | \meet^p_ ( i < n ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"meet",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\meet^p_ ( i 'in' A | P ) F" | :=
(\big[meet / \top]_(i in A | P%B) F%O) : order_scope. | Notation | \meet^p_ ( i 'in' A | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"meet",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\meet^p_ ( i 'in' A ) F" | :=
(\big[meet / \top]_(i in A) F%O) : order_scope. | Notation | \meet^p_ ( i 'in' A ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"meet",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\min^p_ i F" | :=
(\big[min/top]_i F) : order_scope. | Notation | \min^p_ i F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"min",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\min^p_ ( i <- r | P ) F" | :=
(\big[min/top]_(i <- r | P%B) F%O) : order_scope. | Notation | \min^p_ ( i <- r | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"min",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\min^p_ ( i < r ) F" | :=
(\big[min/top]_(i <- r) F%O) : order_scope. | Notation | \min^p_ ( i < r ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"min",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\min^p_ ( m <= i < n | P ) F" | :=
(\big[min/top]_(m <= i < n | P%B) F%O) : order_scope. | Notation | \min^p_ ( m <= i < n | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"min",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\min^p_ ( m <= i < n ) F" | :=
(\big[min/top]_(m <= i < n) F%O) : order_scope. | Notation | \min^p_ ( m <= i < n ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"min",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\min^p_ ( i | P ) F" | :=
(\big[min/top]_(i | P%B) F%O) : order_scope. | Notation | \min^p_ ( i | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"min",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\min^p_ ( i : t | P ) F" | :=
(\big[min/top]_(i : t | P%B) F%O) (only parsing) : order_scope. | Notation | \min^p_ ( i : t | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"min",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\min^p_ ( i : t ) F" | :=
(\big[min/top]_(i : t) F%O) (only parsing) : order_scope. | Notation | \min^p_ ( i : t ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"min",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\min^p_ ( i < n | P ) F" | :=
(\big[min/top]_(i < n | P%B) F%O) : order_scope. | Notation | \min^p_ ( i < n | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"min",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\min^p_ ( i < n ) F" | :=
(\big[min/top]_(i < n) F%O) : order_scope. | Notation | \min^p_ ( i < n ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"min",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\min^p_ ( i 'in' A | P ) F" | :=
(\big[min/top]_(i in A | P%B) F%O) : order_scope. | Notation | \min^p_ ( i 'in' A | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"min",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\min^p_ ( i 'in' A ) F" | :=
(\big[min/top]_(i in A) F%O) : order_scope. | Notation | \min^p_ ( i 'in' A ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"min",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\max^p_ i F" | :=
(\big[max/bottom]_i F%O) : order_scope. | Notation | \max^p_ i F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bottom",
"max"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\max^p_ ( i <- r | P ) F" | :=
(\big[max/bottom]_(i <- r | P%B) F%O) : order_scope. | Notation | \max^p_ ( i <- r | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bottom",
"max"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\max^p_ ( i < r ) F" | :=
(\big[max/bottom]_(i <- r) F%O) : order_scope. | Notation | \max^p_ ( i < r ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bottom",
"max"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\max^p_ ( m <= i < n | P ) F" | :=
(\big[max/bottom]_(m <= i < n | P%B) F%O) : order_scope. | Notation | \max^p_ ( m <= i < n | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bottom",
"max"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\max^p_ ( m <= i < n ) F" | :=
(\big[max/bottom]_(m <= i < n) F%O) : order_scope. | Notation | \max^p_ ( m <= i < n ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bottom",
"max"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\max^p_ ( i | P ) F" | :=
(\big[max/bottom]_(i | P%B) F%O) : order_scope. | Notation | \max^p_ ( i | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bottom",
"max"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\max^p_ ( i : t | P ) F" | :=
(\big[max/bottom]_(i : t | P%B) F%O) (only parsing) : order_scope. | Notation | \max^p_ ( i : t | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bottom",
"max"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\max^p_ ( i : t ) F" | :=
(\big[max/bottom]_(i : t) F%O) (only parsing) : order_scope. | Notation | \max^p_ ( i : t ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bottom",
"max"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\max^p_ ( i < n | P ) F" | :=
(\big[max/bottom]_(i < n | P%B) F%O) : order_scope. | Notation | \max^p_ ( i < n | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bottom",
"max"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\max^p_ ( i < n ) F" | :=
(\big[max/bottom]_(i < n) F%O) : order_scope. | Notation | \max^p_ ( i < n ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bottom",
"max"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\max^p_ ( i 'in' A | P ) F" | :=
(\big[max/bottom]_(i in A | P%B) F%O) : order_scope. | Notation | \max^p_ ( i 'in' A | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bottom",
"max"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\max^p_ ( i 'in' A ) F" | :=
(\big[max/bottom]_(i in A) F%O) : order_scope. | Notation | \max^p_ ( i 'in' A ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bottom",
"max"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\bot" | := (@bottom (seqprod_display _) _). | Notation | \bot | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bottom",
"seqprod_display"
] | \meet^sp_ notations later. Do not remove them. | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d |
"\top" | := (@top (seqprod_display _) _). | Notation | \top | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"seqprod_display",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
meet | := (@meet (seqprod_display _) _). | Notation | meet | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"seqprod_display"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
join | := (@join (seqprod_display _) _). | Notation | join | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"seqprod_display"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
min | := (@min (seqprod_display _) _). | Notation | min | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"seqprod_display"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
max | := (@max (seqprod_display _) _). | Notation | max | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"seqprod_display"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"x `&^sp` y" | := (meet x y) : order_scope. | Notation | x `&^sp` y | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"meet"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"x `|^sp` y" | := (join x y) : order_scope. | Notation | x `|^sp` y | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"join"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\join^sp_ ( i <- r | P ) F" | :=
(\big[join / \bot]_(i <- r | P%B) F%O) : order_scope. | Notation | \join^sp_ ( i <- r | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bot",
"join"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\join^sp_ ( i <- r ) F" | :=
(\big[join / \bot]_(i <- r) F%O) : order_scope. | Notation | \join^sp_ ( i <- r ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bot",
"join"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\join^sp_ ( i | P ) F" | :=
(\big[join / \bot]_(i | P%B) F%O) : order_scope. | Notation | \join^sp_ ( i | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bot",
"join"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\join^sp_ i F" | :=
(\big[join / \bot]_i F%O) : order_scope. | Notation | \join^sp_ i F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bot",
"join"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\join^sp_ ( i : I | P ) F" | :=
(\big[join / \bot]_(i : I | P%B) F%O) (only parsing) : order_scope. | Notation | \join^sp_ ( i : I | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bot",
"join"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\join^sp_ ( i : I ) F" | :=
(\big[join / \bot]_(i : I) F%O) (only parsing) : order_scope. | Notation | \join^sp_ ( i : I ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bot",
"join"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\join^sp_ ( m <= i < n | P ) F" | :=
(\big[join / \bot]_(m <= i < n | P%B) F%O) : order_scope. | Notation | \join^sp_ ( m <= i < n | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bot",
"join"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\join^sp_ ( m <= i < n ) F" | :=
(\big[join / \bot]_(m <= i < n) F%O) : order_scope. | Notation | \join^sp_ ( m <= i < n ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bot",
"join"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\join^sp_ ( i < n | P ) F" | :=
(\big[join / \bot]_(i < n | P%B) F%O) : order_scope. | Notation | \join^sp_ ( i < n | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bot",
"join"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\join^sp_ ( i < n ) F" | :=
(\big[join / \bot]_(i < n) F%O) : order_scope. | Notation | \join^sp_ ( i < n ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bot",
"join"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\join^sp_ ( i 'in' A | P ) F" | :=
(\big[join / \bot]_(i in A | P%B) F%O) : order_scope. | Notation | \join^sp_ ( i 'in' A | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bot",
"join"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\join^sp_ ( i 'in' A ) F" | :=
(\big[join / \bot]_(i in A) F%O) : order_scope. | Notation | \join^sp_ ( i 'in' A ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bot",
"join"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\meet^sp_ ( i <- r | P ) F" | :=
(\big[meet / \top]_(i <- r | P%B) F%O) : order_scope. | Notation | \meet^sp_ ( i <- r | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"meet",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\meet^sp_ ( i <- r ) F" | :=
(\big[meet / \top]_(i <- r) F%O) : order_scope. | Notation | \meet^sp_ ( i <- r ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"meet",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\meet^sp_ ( i | P ) F" | :=
(\big[meet / \top]_(i | P%B) F%O) : order_scope. | Notation | \meet^sp_ ( i | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"meet",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\meet^sp_ i F" | :=
(\big[meet / \top]_i F%O) : order_scope. | Notation | \meet^sp_ i F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"meet",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\meet^sp_ ( i : I | P ) F" | :=
(\big[meet / \top]_(i : I | P%B) F%O) (only parsing) : order_scope. | Notation | \meet^sp_ ( i : I | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"meet",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\meet^sp_ ( i : I ) F" | :=
(\big[meet / \top]_(i : I) F%O) (only parsing) : order_scope. | Notation | \meet^sp_ ( i : I ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"meet",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\meet^sp_ ( m <= i < n | P ) F" | :=
(\big[meet / \top]_(m <= i < n | P%B) F%O) : order_scope. | Notation | \meet^sp_ ( m <= i < n | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"meet",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\meet^sp_ ( m <= i < n ) F" | :=
(\big[meet / \top]_(m <= i < n) F%O) : order_scope. | Notation | \meet^sp_ ( m <= i < n ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"meet",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\meet^sp_ ( i < n | P ) F" | :=
(\big[meet / \top]_(i < n | P%B) F%O) : order_scope. | Notation | \meet^sp_ ( i < n | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"meet",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\meet^sp_ ( i < n ) F" | :=
(\big[meet / \top]_(i < n) F%O) : order_scope. | Notation | \meet^sp_ ( i < n ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"meet",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\meet^sp_ ( i 'in' A | P ) F" | :=
(\big[meet / \top]_(i in A | P%B) F%O) : order_scope. | Notation | \meet^sp_ ( i 'in' A | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"meet",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\meet^sp_ ( i 'in' A ) F" | :=
(\big[meet / \top]_(i in A) F%O) : order_scope. | Notation | \meet^sp_ ( i 'in' A ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"meet",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\min^sp_ i F" | :=
(\big[min/top]_i F) : order_scope. | Notation | \min^sp_ i F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"min",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\min^sp_ ( i <- r | P ) F" | :=
(\big[min/top]_(i <- r | P%B) F%O) : order_scope. | Notation | \min^sp_ ( i <- r | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"min",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\min^sp_ ( i < r ) F" | :=
(\big[min/top]_(i <- r) F%O) : order_scope. | Notation | \min^sp_ ( i < r ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"min",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\min^sp_ ( m <= i < n | P ) F" | :=
(\big[min/top]_(m <= i < n | P%B) F%O) : order_scope. | Notation | \min^sp_ ( m <= i < n | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"min",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\min^sp_ ( m <= i < n ) F" | :=
(\big[min/top]_(m <= i < n) F%O) : order_scope. | Notation | \min^sp_ ( m <= i < n ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"min",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\min^sp_ ( i | P ) F" | :=
(\big[min/top]_(i | P%B) F%O) : order_scope. | Notation | \min^sp_ ( i | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"min",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\min^sp_ ( i : t | P ) F" | :=
(\big[min/top]_(i : t | P%B) F%O) (only parsing) : order_scope. | Notation | \min^sp_ ( i : t | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"min",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\min^sp_ ( i : t ) F" | :=
(\big[min/top]_(i : t) F%O) (only parsing) : order_scope. | Notation | \min^sp_ ( i : t ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"min",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\min^sp_ ( i < n | P ) F" | :=
(\big[min/top]_(i < n | P%B) F%O) : order_scope. | Notation | \min^sp_ ( i < n | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"min",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\min^sp_ ( i < n ) F" | :=
(\big[min/top]_(i < n) F%O) : order_scope. | Notation | \min^sp_ ( i < n ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"min",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\min^sp_ ( i 'in' A | P ) F" | :=
(\big[min/top]_(i in A | P%B) F%O) : order_scope. | Notation | \min^sp_ ( i 'in' A | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"min",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\min^sp_ ( i 'in' A ) F" | :=
(\big[min/top]_(i in A) F%O) : order_scope. | Notation | \min^sp_ ( i 'in' A ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"min",
"top"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\max^sp_ i F" | :=
(\big[max/bottom]_i F%O) : order_scope. | Notation | \max^sp_ i F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bottom",
"max"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\max^sp_ ( i <- r | P ) F" | :=
(\big[max/bottom]_(i <- r | P%B) F%O) : order_scope. | Notation | \max^sp_ ( i <- r | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bottom",
"max"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\max^sp_ ( i < r ) F" | :=
(\big[max/bottom]_(i <- r) F%O) : order_scope. | Notation | \max^sp_ ( i < r ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bottom",
"max"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\max^sp_ ( m <= i < n | P ) F" | :=
(\big[max/bottom]_(m <= i < n | P%B) F%O) : order_scope. | Notation | \max^sp_ ( m <= i < n | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bottom",
"max"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\max^sp_ ( m <= i < n ) F" | :=
(\big[max/bottom]_(m <= i < n) F%O) : order_scope. | Notation | \max^sp_ ( m <= i < n ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bottom",
"max"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\max^sp_ ( i | P ) F" | :=
(\big[max/bottom]_(i | P%B) F%O) : order_scope. | Notation | \max^sp_ ( i | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bottom",
"max"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\max^sp_ ( i : t | P ) F" | :=
(\big[max/bottom]_(i : t | P%B) F%O) (only parsing) : order_scope. | Notation | \max^sp_ ( i : t | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bottom",
"max"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\max^sp_ ( i : t ) F" | :=
(\big[max/bottom]_(i : t) F%O) (only parsing) : order_scope. | Notation | \max^sp_ ( i : t ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bottom",
"max"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\max^sp_ ( i < n | P ) F" | :=
(\big[max/bottom]_(i < n | P%B) F%O) : order_scope. | Notation | \max^sp_ ( i < n | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bottom",
"max"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\max^sp_ ( i < n ) F" | :=
(\big[max/bottom]_(i < n) F%O) : order_scope. | Notation | \max^sp_ ( i < n ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bottom",
"max"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\max^sp_ ( i 'in' A | P ) F" | :=
(\big[max/bottom]_(i in A | P%B) F%O) : order_scope. | Notation | \max^sp_ ( i 'in' A | P ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bottom",
"max"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"\max^sp_ ( i 'in' A ) F" | :=
(\big[max/bottom]_(i in A) F%O) : order_scope. | Notation | \max^sp_ ( i 'in' A ) F | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"bottom",
"max"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
meetlexi | := (@meet (lexi_display _ _) _). | Notation | meetlexi | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"lexi_display",
"meet"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
joinlexi | := (@join (lexi_display _ _) _). | Notation | joinlexi | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"join",
"lexi_display"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"x `&^l` y" | := (meetlexi x y) : order_scope. | Notation | x `&^l` y | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"meetlexi"
] | https://github.com/math-comp/math-comp | 91d97df9cf3204b4dab84f4e24bc633e84b6473d | |
"x `|^l` y" | := (joinlexi x y) : order_scope. | Notation | x `|^l` y | order | order/order.v | [
"HB",
"structures",
"mathcomp",
"ssreflect",
"ssrfun",
"ssrbool",
"eqtype",
"ssrnat",
"choice",
"seq",
"path",
"fintype",
"tuple",
"bigop",
"finset",
"div",
"prime",
"finfun",
"preorder",
"Order",
"BPreorderTheory",
"PreCancelPartial",
"OrderMorphismTheory",
"NatOrder",... | [
"joinlexi"
] | 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.