fact stringlengths 8 1.54k | type stringclasses 19 values | library stringclasses 8 values | imports listlengths 1 10 | filename stringclasses 98 values | symbolic_name stringlengths 1 42 | docstring stringclasses 1 value |
|---|---|---|---|---|---|---|
eqn_leP{m n} : reflect (forall k, (m <= k) = (n <= k)) (m == n).
Proof. by apply: (iffP idP) => [/eqP->//|/[dup]/[!eqn_leq]<- -> /[!leqnn]]. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | eqn_leP | |
eqn_gtP{m n} : reflect (forall k, (k < m) = (k < n)) (m == n).
Proof.
apply: (iffP eqn_leP) => + k => /(_ k);
by rewrite !ltnNge => /(congr1 negb); rewrite ?negbK.
Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | eqn_gtP | |
eqn_ltP{m n} : reflect (forall k, (m < k) = (n < k)) (m == n).
Proof.
apply: (iffP eqn_geP) => + k => /(_ k);
by rewrite !ltnNge => /(congr1 negb); rewrite ?negbK.
Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | eqn_ltP | |
ubnPm : {n | m < n}. Proof. by exists m.+1. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | ubnP | |
ltnSEm n : m < n.+1 -> m <= n. Proof. by []. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | ltnSE | |
ubn_leq_specm : nat -> Type := UbnLeq n of m <= n : ubn_leq_spec m n. | Variant | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | ubn_leq_spec | |
ubn_geq_specm : nat -> Type := UbnGeq n of m >= n : ubn_geq_spec m n. | Variant | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | ubn_geq_spec | |
ubn_eq_specm : nat -> Type := UbnEq n of m == n : ubn_eq_spec m n. | Variant | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | ubn_eq_spec | |
ubnPleqm : ubn_leq_spec m m. Proof. by []. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | ubnPleq | |
ubnPgeqm : ubn_geq_spec m m. Proof. by []. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | ubnPgeq | |
ubnPeqm : ubn_eq_spec m m. Proof. by []. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | ubnPeq | |
ltn_indP : (forall n, (forall m, m < n -> P m) -> P n) -> forall n, P n.
Proof.
move=> accP M; have [n leMn] := ubnP M; elim: n => // n IHn in M leMn *.
by apply/accP=> p /leq_trans/(_ leMn)/IHn.
Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | ltn_ind | |
lePm n : reflect (m <= n)%coq_nat (m <= n).
Proof.
apply: (iffP idP); last by elim: n / => // n _ /leq_trans->.
elim: n => [|n IHn]; first by case: m.
by rewrite leq_eqVlt ltnS => /predU1P[<- // | /IHn]; right.
Qed.
Arguments leP {m n}. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | leP | |
le_irrelevancem n le_mn1 le_mn2 : le_mn1 = le_mn2 :> (m <= n)%coq_nat.
Proof.
elim/ltn_ind: n => n IHn in le_mn1 le_mn2 *; set n1 := n in le_mn1 *.
pose def_n : n = n1 := erefl n; transitivity (eq_ind _ _ le_mn2 _ def_n) => //.
case: n1 / le_mn1 le_mn2 => [|n1 le_mn1] {n}[|n le_mn2] in (def_n) IHn *.
- by rewrite [def_n]eq_axiomK.
- by case/leP/idPn: (le_mn2); rewrite -def_n ltnn.
- by case/leP/idPn: (le_mn1); rewrite def_n ltnn.
case: def_n (def_n) => <-{n1} def_n in le_mn1 *.
by rewrite [def_n]eq_axiomK /=; congr le_S; apply: IHn.
Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | le_irrelevance | |
ltPm n : reflect (m < n)%coq_nat (m < n).
Proof. exact leP. Qed.
Arguments ltP {m n}. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | ltP | |
lt_irrelevancem n lt_mn1 lt_mn2 : lt_mn1 = lt_mn2 :> (m < n)%coq_nat.
Proof. exact: (@le_irrelevance m.+1). Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | lt_irrelevance | |
leq_add2lp m n : (p + m <= p + n) = (m <= n).
Proof. by elim: p. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | leq_add2l | |
ltn_add2lp m n : (p + m < p + n) = (m < n).
Proof. by rewrite -addnS; apply: leq_add2l. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | ltn_add2l | |
leq_add2rp m n : (m + p <= n + p) = (m <= n).
Proof. by rewrite -!(addnC p); apply: leq_add2l. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | leq_add2r | |
ltn_add2rp m n : (m + p < n + p) = (m < n).
Proof. exact: leq_add2r p m.+1 n. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | ltn_add2r | |
leq_addm1 m2 n1 n2 : m1 <= n1 -> m2 <= n2 -> m1 + m2 <= n1 + n2.
Proof.
by move=> le_mn1 le_mn2; rewrite (@leq_trans (m1 + n2)) ?leq_add2l ?leq_add2r.
Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | leq_add | |
leq_addlm n : n <= m + n. Proof. exact: (leq_add2r n 0). Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | leq_addl | |
leq_addrm n : n <= n + m. Proof. by rewrite addnC leq_addl. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | leq_addr | |
ltn_addlm n p : m < n -> m < p + n.
Proof. by move/leq_trans=> -> //; apply: leq_addl. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | ltn_addl | |
ltn_addrm n p : m < n -> m < n + p.
Proof. by move/leq_trans=> -> //; apply: leq_addr. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | ltn_addr | |
addn_gt0m n : (0 < m + n) = (0 < m) || (0 < n).
Proof. by rewrite !lt0n -negb_and addn_eq0. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | addn_gt0 | |
subn_gt0m n : (0 < n - m) = (m < n).
Proof. by elim: m n => [|m IHm] [|n] //; apply: IHm n. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | subn_gt0 | |
subn_eq0m n : (m - n == 0) = (m <= n).
Proof. by []. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | subn_eq0 | |
leq_subLRm n p : (m - n <= p) = (m <= n + p).
Proof. by rewrite -subn_eq0 -subnDA. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | leq_subLR | |
leq_subrm n : n - m <= n.
Proof. by rewrite leq_subLR leq_addl. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | leq_subr | |
ltn_subrRm n : (n < n - m) = false.
Proof. by rewrite ltnNge leq_subr. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | ltn_subrR | |
leq_subrRm n : (n <= n - m) = (m == 0) || (n == 0).
Proof. by case: m n => [|m] [|n]; rewrite ?subn0 ?leqnn ?ltn_subrR. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | leq_subrR | |
ltn_subrLm n : (n - m < n) = (0 < m) && (0 < n).
Proof. by rewrite ltnNge leq_subrR negb_or !lt0n. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | ltn_subrL | |
subnKCm n : m <= n -> m + (n - m) = n.
Proof. by elim: m n => [|m IHm] [|n] // /(IHm n) {2}<-. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | subnKC | |
addnBnm n : m + (n - m) = m - n + n.
Proof. by elim: m n => [|m IHm] [|n] //; rewrite addSn addnS IHm. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | addnBn | |
subnKm n : m <= n -> (n - m) + m = n.
Proof. by rewrite addnC; apply: subnKC. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | subnK | |
addnBAm n p : p <= n -> m + (n - p) = m + n - p.
Proof. by move=> le_pn; rewrite -[in RHS](subnK le_pn) addnA addnK. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | addnBA | |
addnBACm n p : n <= m -> m - n + p = m + p - n.
Proof. by move=> le_nm; rewrite addnC addnBA // addnC. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | addnBAC | |
addnBCAm n p : p <= m -> p <= n -> m + (n - p) = n + (m - p).
Proof. by move=> le_pm le_pn; rewrite !addnBA // addnC. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | addnBCA | |
addnABCm n p : p <= m -> p <= n -> m + (n - p) = m - p + n.
Proof. by move=> le_pm le_pn; rewrite addnBA // addnBAC. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | addnABC | |
subnBAm n p : p <= n -> m - (n - p) = m + p - n.
Proof. by move=> le_pn; rewrite -[in RHS](subnK le_pn) subnDr. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | subnBA | |
subnAm n p : p <= n -> n <= m -> m - (n - p) = m - n + p.
Proof. by move=> le_pn lr_nm; rewrite addnBAC // subnBA. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | subnA | |
subKnm n : m <= n -> n - (n - m) = m.
Proof. by move/subnBA->; rewrite addKn. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | subKn | |
subSnm n : m <= n -> n.+1 - m = (n - m).+1.
Proof. by rewrite -add1n => /addnBA <-. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | subSn | |
subnSKm n : m < n -> (n - m.+1).+1 = n - m. Proof. by move/subSn. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | subnSK | |
addnCBAm n p : p <= n -> m + (n - p) = n + m - p.
Proof. by move=> pn; rewrite (addnC n m) addnBA. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | addnCBA | |
addnBr_leqn p m : n <= p -> m + (n - p) = m.
Proof. by rewrite -subn_eq0 => /eqP->; rewrite addn0. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | addnBr_leq | |
addnBl_leqm n p : m <= n -> m - n + p = p.
Proof. by rewrite -subn_eq0; move/eqP => ->; rewrite add0n. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | addnBl_leq | |
subnDACm n p : m - (n + p) = m - p - n.
Proof. by rewrite addnC subnDA. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | subnDAC | |
subnCBAm n p : p <= n -> m - (n - p) = p + m - n.
Proof. by move=> pn; rewrite addnC subnBA. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | subnCBA | |
subnBr_leqn p m : n <= p -> m - (n - p) = m.
Proof. by rewrite -subn_eq0 => /eqP->; rewrite subn0. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | subnBr_leq | |
subnBl_leqm n p : m <= n -> (m - n) - p = 0.
Proof. by rewrite -subn_eq0 => /eqP->. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | subnBl_leq | |
subnBACm n p : p <= n -> n <= m -> m - (n - p) = p + (m - n).
Proof. by move=> pn nm; rewrite subnA // addnC. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | subnBAC | |
subDnACm n p : p <= n -> m + n - p = n - p + m.
Proof. by move=> pn; rewrite addnC -addnBAC. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | subDnAC | |
subDnCAm n p : p <= m -> m + n - p = n + (m - p).
Proof. by move=> pm; rewrite addnC -addnBA. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | subDnCA | |
subDnCACm n p : m <= p -> m + n - p = n - (p - m).
Proof. by move=> mp; rewrite addnC -subnBA. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | subDnCAC | |
addnBCm n : m - n + n = n - m + m.
Proof. by rewrite -[in RHS]addnBn addnC. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | addnBC | |
addnCBm n : m - n + n = m + (n - m).
Proof. by rewrite addnBC addnC. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | addnCB | |
addBnACm n p : n <= m -> m - n + p = p + m - n.
Proof. by move=> nm; rewrite [p + m]addnC addnBAC. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | addBnAC | |
addBnCACm n p : n <= m -> n <= p -> m - n + p = p - n + m.
Proof. by move=> nm np; rewrite addnC addnBA // subDnCA // addnC. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | addBnCAC | |
addBnAm n p : n <= m -> p <= n -> m - n + p = m - (n - p).
Proof. by move=> nm pn; rewrite subnBA // -subDnAC // addnC. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | addBnA | |
subBnACm n p : m - n - p = m - (p + n).
Proof. by rewrite addnC -subnDA. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | subBnAC | |
predn_subm n : (m - n).-1 = (m.-1 - n).
Proof. by case: m => // m; rewrite subSKn. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | predn_sub | |
leq_sub2rp m n : m <= n -> m - p <= n - p.
Proof. by move=> le_mn; rewrite leq_subLR (leq_trans le_mn) // -leq_subLR. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | leq_sub2r | |
leq_sub2lp m n : m <= n -> p - n <= p - m.
Proof.
rewrite -(leq_add2r (p - m)) leq_subLR.
by apply: leq_trans; rewrite -leq_subLR.
Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | leq_sub2l | |
leq_subm1 m2 n1 n2 : m1 <= m2 -> n2 <= n1 -> m1 - n1 <= m2 - n2.
Proof. by move/(leq_sub2r n1)=> le_m12 /(leq_sub2l m2); apply: leq_trans. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | leq_sub | |
ltn_sub2rp m n : p < n -> m < n -> m - p < n - p.
Proof. by move/subnSK <-; apply: (@leq_sub2r p.+1). Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | ltn_sub2r | |
ltn_sub2lp m n : m < p -> m < n -> p - n < p - m.
Proof. by move/subnSK <-; apply: leq_sub2l. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | ltn_sub2l | |
ltn_subRLm n p : (n < p - m) = (m + n < p).
Proof. by rewrite !ltnNge leq_subLR. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | ltn_subRL | |
leq_psubRLm n p : 0 < n -> (n <= p - m) = (m + n <= p).
Proof. by move=> /prednK<-; rewrite ltn_subRL addnS. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | leq_psubRL | |
ltn_psubLRm n p : 0 < p -> (m - n < p) = (m < n + p).
Proof. by move=> /prednK<-; rewrite ltnS leq_subLR addnS. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | ltn_psubLR | |
leq_subRLm n p : m <= p -> (n <= p - m) = (m + n <= p).
Proof. by move=> /subnKC{2}<-; rewrite leq_add2l. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | leq_subRL | |
ltn_subLRm n p : n <= m -> (m - n < p) = (m < n + p).
Proof. by move=> /subnKC{2}<-; rewrite ltn_add2l. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | ltn_subLR | |
leq_subClm n p : (m - n <= p) = (m - p <= n).
Proof. by rewrite !leq_subLR // addnC. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | leq_subCl | |
ltn_subCrm n p : (p < m - n) = (n < m - p).
Proof. by rewrite !ltn_subRL // addnC. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | ltn_subCr | |
leq_psubCrm n p : 0 < p -> 0 < n -> (p <= m - n) = (n <= m - p).
Proof. by move=> p_gt0 n_gt0; rewrite !leq_psubRL // addnC. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | leq_psubCr | |
ltn_psubClm n p : 0 < p -> 0 < n -> (m - n < p) = (m - p < n).
Proof. by move=> p_gt0 n_gt0; rewrite !ltn_psubLR // addnC. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | ltn_psubCl | |
leq_subCrm n p : n <= m -> p <= m -> (p <= m - n) = (n <= m - p).
Proof. by move=> np pm; rewrite !leq_subRL // addnC. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | leq_subCr | |
ltn_subClm n p : n <= m -> p <= m -> (m - n < p) = (m - p < n).
Proof. by move=> nm pm; rewrite !ltn_subLR // addnC. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | ltn_subCl | |
leq_sub2rEp m n : p <= n -> (m - p <= n - p) = (m <= n).
Proof. by move=> pn; rewrite leq_subLR subnKC. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | leq_sub2rE | |
leq_sub2lEm n p : n <= m -> (m - p <= m - n) = (n <= p).
Proof. by move=> nm; rewrite leq_subCl subKn. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | leq_sub2lE | |
ltn_sub2rEp m n : p <= m -> (m - p < n - p) = (m < n).
Proof. by move=> pn; rewrite ltn_subRL addnC subnK. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | ltn_sub2rE | |
ltn_sub2lEm n p : p <= m -> (m - p < m - n) = (n < p).
Proof. by move=> pm; rewrite ltn_subCr subKn. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | ltn_sub2lE | |
eqn_sub2rEp m n : p <= m -> p <= n -> (m - p == n - p) = (m == n).
Proof. by move=> pm pn; rewrite !eqn_leq !leq_sub2rE. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | eqn_sub2rE | |
eqn_sub2lEm n p : p <= m -> n <= m -> (m - p == m - n) = (p == n).
Proof. by move=> pm nm; rewrite !eqn_leq !leq_sub2lE // -!eqn_leq eq_sym. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | eqn_sub2lE | |
maxnm n := if m < n then n else m. | Definition | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | maxn | |
minnm n := if m < n then m else n. | Definition | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | minn | |
max0n: left_id 0 maxn. Proof. by case. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | max0n | |
maxn0: right_id 0 maxn. Proof. by []. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | maxn0 | |
maxnC: commutative maxn.
Proof. by rewrite /maxn; elim=> [|m ih] [] // n; rewrite !ltnS -!fun_if ih. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | maxnC | |
maxnEm n : maxn m n = m + (n - m).
Proof.
rewrite /maxn; elim: m n => [|m ih] [|n]; rewrite ?addn0 //.
by rewrite ltnS subSS addSn -ih; case: leq.
Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | maxnE | |
maxnAC: right_commutative maxn.
Proof. by move=> m n p; rewrite !maxnE -!addnA !subnDA -!maxnE maxnC. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | maxnAC | |
maxnA: associative maxn.
Proof. by move=> m n p; rewrite !(maxnC m) maxnAC. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | maxnA | |
maxnCA: left_commutative maxn.
Proof. by move=> m n p; rewrite !maxnA (maxnC m). Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | maxnCA | |
maxnACA: interchange maxn maxn.
Proof. by move=> m n p q; rewrite -!maxnA (maxnCA n). Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | maxnACA | |
maxn_idPl{m n} : reflect (maxn m n = m) (m >= n).
Proof. by rewrite -subn_eq0 -(eqn_add2l m) addn0 -maxnE; apply: eqP. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | maxn_idPl | |
maxn_idPr{m n} : reflect (maxn m n = n) (m <= n).
Proof. by rewrite maxnC; apply: maxn_idPl. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | maxn_idPr | |
maxnn: idempotent_op maxn.
Proof. by move=> n; apply/maxn_idPl. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | maxnn | |
leq_maxm n1 n2 : (m <= maxn n1 n2) = (m <= n1) || (m <= n2).
Proof.
without loss le_n21: n1 n2 / n2 <= n1.
by case/orP: (leq_total n2 n1) => le_n12; last rewrite maxnC orbC; apply.
by rewrite (maxn_idPl le_n21) orb_idr // => /leq_trans->.
Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | leq_max | |
leq_maxlm n : m <= maxn m n. Proof. by rewrite leq_max leqnn. Qed. | Lemma | boot | [
"From Corelib Require Import PosDef",
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrfun ssrbool eqtype"
] | boot/ssrnat.v | leq_maxl |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.