Questions tagged [coq-mathcomp]

Mathematical Components are libraries of formalized mathematics developed using the Coq proof assistant.

Filter by
Sorted by
Tagged with
2 votes
0 answers

Problem working with FMapWeakList and Parametrized Records

Consider the following definition of a record R, parametrized over an arbitrary eqType: ...
Felipe's user avatar
  • 63
2 votes
1 answer

Converting Lean formulations of Lemmas to Coq formulation

I want to contribute to the repository MiniF2F ( which has formal formulation of problems asked in Math Olympiads in different languages like Lean,...
amit9oct's user avatar
1 vote
1 answer

Coq ssreflect - rewrite inside \big

I'm trying to prove the following lemma : ...
op325's user avatar
  • 13
5 votes
2 answers

Basics of real numbers in mathcomp (Coq)

I'm trying to play around with the Mathematical Components library in Coq but am having trouble writing basic, concrete statements about real numbers. E.g., I'd like to define ...
BallBoy's user avatar
  • 153
3 votes
0 answers

SSReflect tuple constructor: why not use phantom?

I was reading the mathcomp book learning about canonical structures and following along with the mathcomp source to compare how things were done in practice. Specifically I was looking at sections 6....
wdeweijer's user avatar
8 votes
2 answers

Explanation of Coq math-comp repositories

How are the Coq math-comp account and repositories related? Details One of my side goals is to try to keep the tags on this site meaningful and useful. Today I ran into this question: How to prove ...
Guy Coder's user avatar
  • 2,836
4 votes
1 answer

How can I prove has_esp when using mathcomp.analysis?

How can I prove the following goal (which I believe to be true) using mathcomp.analysis? ...
lyfeng's user avatar
  • 157
5 votes
2 answers

How to provide a countType when using mathcomp?

The following snippet can't pass type checking. From mathcomp Require Import choice. Definition exfn (A:countType) := false. (* Fail *) Check exfn nat. Failed with ...
lyfeng's user avatar
  • 157
8 votes
2 answers

How to prove `forall m n : nat, m == n -> m = n`?

I am learning Coq with ssreflect. Just to understand things, I've proved forall a b : bool, a == b -> a = b but I can't figure out how to prove ...
CrabMan's user avatar
  • 317