Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Adapt w.r.t. coq/coq#17564. #180

Merged
merged 1 commit into from
May 5, 2023
Merged

Adapt w.r.t. coq/coq#17564. #180

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion reals/stdlib/CMTPositivity.v
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -196,7 +196,7 @@ Lemma IcontinuousClassic
-> ElemIntegralContinuous I.
Proof.
intros E I Ihomogeneous Iadd cont f fn fL fnL nonneg intMaj.
specialize (cont f) as [[Z [ZL Zpos]] cont].
rename cont into cont0; specialize (cont0 f); edestruct cont0 as [[Z [ZL Zpos]] cont]; clear cont0.
destruct intMaj as [l [lcv lmaj]].
destruct (Rmult_continuous_zero (I Z ZL + 1) (I f fL - l))
as [alpha [alphapos alphamaj]].
Expand Down
8 changes: 4 additions & 4 deletions util/Qdlog.v
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -170,7 +170,7 @@ Lemma Qdlog_bounded_nonneg (b : nat) (n : Z) (x : Q) :
0 ≤ Qdlog_bounded b n x.
Proof.
revert x. induction b; unfold Qdlog_bounded; [reflexivity |].
intros. case (decide_rel _); intros; [reflexivity |].
intros. case (decide_rel); intros; [reflexivity |].
apply semirings.nonneg_plus_compat ; [easy | apply IHb].
Qed.

Expand All @@ -180,7 +180,7 @@ Proof.
intros En Ex. unfold Qdlog.
generalize (Z.abs_nat (Qdlog2 x)).
intros b. induction b; simpl; [reflexivity |].
case (decide_rel _); intros E; [reflexivity |].
case (decide_rel); intros E; [reflexivity |].
destruct E.
apply orders.le_lt_trans with 1; try assumption.
apply orders.lt_le_trans with 2.
Expand All @@ -195,7 +195,7 @@ Proof.
change (b1 ≡ b2) in Eb. change (n1 ≡ n2) in En. subst.
revert x1 x2 Ex. induction b2; simpl; [reflexivity |].
intros x1 x2 Ex.
case (decide_rel _); case (decide_rel _); intros E1 E2.
case (decide_rel); case (decide_rel); intros E1 E2.
reflexivity.
destruct E1. now rewrite <-Ex.
destruct E2. now rewrite Ex.
Expand Down Expand Up @@ -223,7 +223,7 @@ Proof.
apply (antisymmetry (≤)); try assumption.
now apply Qdlog2_nonneg.
intros x Eb Ex.
unfold Qdlog_bounded. case (decide_rel _); [intuition |]; intros E.
unfold Qdlog_bounded. case (decide_rel); [intuition |]; intros E.
apply orders.not_lt_le_flip in E.
assert (x = 'n * (x / 'n)) as Ex2.
rewrite (commutativity x), associativity.
Expand Down