turns out this breaks closed proofs with Let

38abc449 · Ralf Jung · a848ac3b · 38abc449
Commit 38abc449 authored Mar 05, 2019 by Ralf Jung
Hide whitespace changes
Inline Side-by-side

Showing with 0 additions and 1 deletion

theories/base_logic/lib/iprop.v theories/base_logic/lib/iprop.v +0 -1

No files found.
--- a/theories/base_logic/lib/iprop.v
+++ b/theories/base_logic/lib/iprop.v
@@ -63,7 +63,6 @@ Module gFunctors.
  Definition app (Σ1 Σ2 : gFunctors) : gFunctors :=
    existT (projT1 Σ1 + projT1 Σ2) (fin_plus_inv _ (projT2 Σ1) (projT2 Σ2)).
 End gFunctors.
-Typeclasses Opaque gFunctors.singleton gFunctors.app.

 Coercion gFunctors.singleton : gFunctor >-> gFunctors.
 Notation "#[ ]" := gFunctors.nil (format "#[ ]").