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.

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

fully qualify unimported ZArith lemmas (for coq/coq#19801) #132

Merged
merged 1 commit into from
Nov 3, 2024
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
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 implementations/QType_rationals.v
Original file line number Diff line number Diff line change
Expand Up @@ -159,7 +159,7 @@ Qed.
Next Obligation.
rewrite spec_compare in *.
destruct (Qcompare_spec (to_Q x) (to_Q y)); try discriminate; try intuition.
now apply Zeq_le.
now apply Zorder.Zeq_le.
now apply orders.lt_le.
Qed.

Expand Down
2 changes: 1 addition & 1 deletion implementations/fast_rationals.v
Original file line number Diff line number Diff line change
Expand Up @@ -58,7 +58,7 @@ Proof.
case_eq (BigN.eqb d BigN.zero); intros Ed2; [reflexivity |].
rewrite BigZ.spec_compare in Ed.
destruct (proj2 (not_true_iff_false _) Ed2).
apply BigN.eqb_eq. symmetry. now apply Zcompare_Eq_eq.
apply BigN.eqb_eq. symmetry. now apply Zcompare.Zcompare_Eq_eq.
unfold BigQ.mul. simpl. rewrite right_identity. reflexivity.
destruct (BigZ.compare_spec BigZ.zero (BigZ.Pos d)); try discriminate.
destruct (orders.lt_not_le_flip 0 ('d : bigZ)); trivial.
Expand Down
Loading