[build] Consolidate stdlib's .v files under a single directory.

Currently, `.v` under the `Coq.` prefix are found in both `theories`
and `plugins`. Usually these two directories are merged by special
loadpath code that allows double-binding of the prefix.

This adds some complexity to the build and loadpath system; and in
particular, it prevents from handling the `Coq.*` prefix in the
simple, `-R theories Coq` standard way.

We thus move all `.v` files to theories, leaving `plugins` as an
OCaml-only directory, and modify accordingly the loadpath / build
infrastructure.

Note that in general `plugins/foo/Foo.v` was not self-contained, in
the sense that it depended on files in `theories` and files in
`theories` depended on it; moreover, Coq saw all these files as
belonging to the same namespace so it didn't really care where they
lived.

This could also imply a performance gain as we now effectively
traverse less directories when locating a library.

See also discussion in #10003

1 files changed, 0 insertions, 75 deletions

diff --git a/plugins/ssr/ssrunder.v b/plugins/ssr/ssrunder.v
deleted file mode 100644
index 7c529a6133..0000000000
--- a/plugins/ssr/ssrunder.v
+++ /dev/null
@@ -1,75 +0,0 @@
-(************************************************************************)
-(*         *   The Coq Proof Assistant / The Coq Development Team       *)
-(*  v      *   INRIA, CNRS and contributors - Copyright 1999-2019       *)
-(* <O___,, *       (see CREDITS file for the list of authors)           *)
-(*   \VV/  **************************************************************)
-(*    //   *    This file is distributed under the terms of the         *)
-(*         *     GNU Lesser General Public License Version 2.1          *)
-(*         *     (see LICENSE file for the text of the license)         *)
-(************************************************************************)
-
-(** #<style> .doc { font-family: monospace; white-space: pre; } </style># **)
-
-(** Constants for under/over, to rewrite under binders using "context lemmas"
-
- Note: this file does not require [ssreflect]; it is both required by
- [ssrsetoid] and *exported* by [ssrunder].
-
- This preserves the following feature: we can use [Setoid] without
- requiring [ssreflect] and use [ssreflect] without requiring [Setoid].
-*)
-
-Require Import ssrclasses.
-
-Module Type UNDER_REL.
-Parameter Under_rel :
-  forall (A : Type) (eqA : A -> A -> Prop), A -> A -> Prop.
-Parameter Under_rel_from_rel :
-  forall (A : Type) (eqA : A -> A -> Prop) (x y : A),
-    @Under_rel A eqA x y -> eqA x y.
-Parameter Under_relE :
-  forall (A : Type) (eqA : A -> A -> Prop),
-    @Under_rel A eqA = eqA.
-
-(** [Over_rel, over_rel, over_rel_done]: for "by rewrite over_rel" *)
-Parameter Over_rel :
-  forall (A : Type) (eqA : A -> A -> Prop), A -> A -> Prop.
-Parameter over_rel :
-  forall (A : Type) (eqA : A -> A -> Prop) (x y : A),
-    @Under_rel A eqA x y = @Over_rel A eqA x y.
-Parameter over_rel_done :
-  forall (A : Type) (eqA : A -> A -> Prop) (EeqA : Reflexive eqA) (x : A),
-    @Over_rel A eqA x x.
-
-(** [under_rel_done]: for Ltac-style over *)
-Parameter under_rel_done :
-  forall (A : Type) (eqA : A -> A -> Prop) (EeqA : Reflexive eqA) (x : A),
-    @Under_rel A eqA x x.
-Notation "''Under[' x ]" := (@Under_rel _ _ x _)
-  (at level 8, format "''Under['  x  ]", only printing).
-End UNDER_REL.
-
-Module Export Under_rel : UNDER_REL.
-Definition Under_rel (A : Type) (eqA : A -> A -> Prop) :=
-  eqA.
-Lemma Under_rel_from_rel :
-  forall (A : Type) (eqA : A -> A -> Prop) (x y : A),
-    @Under_rel A eqA x y -> eqA x y.
-Proof. now trivial. Qed.
-Lemma Under_relE (A : Type) (eqA : A -> A -> Prop) :
-  @Under_rel A eqA = eqA.
-Proof. now trivial. Qed.
-Definition Over_rel := Under_rel.
-Lemma over_rel :
-  forall (A : Type) (eqA : A -> A -> Prop) (x y : A),
-    @Under_rel A eqA x y = @Over_rel A eqA x y.
-Proof. now trivial. Qed.
-Lemma over_rel_done :
-  forall (A : Type) (eqA : A -> A -> Prop) (EeqA : Reflexive eqA) (x : A),
-    @Over_rel A eqA x x.
-Proof. now unfold Over_rel. Qed.
-Lemma under_rel_done :
-  forall (A : Type) (eqA : A -> A -> Prop) (EeqA : Reflexive eqA) (x : A),
-    @Under_rel A eqA x x.
-Proof. now trivial. Qed.
-End Under_rel.