We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent b96e757 commit f820715Copy full SHA for f820715
utils/theories/All_Forall.v
@@ -8,7 +8,7 @@ Derive Signature for Forall Forall2.
8
(** Combinators *)
9
10
(** Forall combinators in Type to allow building them by recursion *)
11
-Inductive All {A} (P : A -> Type) : list A -> Type :=
+Polymorphic Cumulative Inductive All {A} (P : A -> Type) : list A -> Type :=
12
All_nil : All P []
13
| All_cons : forall (x : A) (l : list A),
14
P x -> All P l -> All P (x :: l).
@@ -3563,6 +3563,7 @@ Proof.
3563
all: now apply In_All; constructor => //.
3564
Qed.
3565
3566
+Local Set Universe Polymorphism.
3567
Lemma All_eta3 {A B C P} ls
3568
: @All (A * B * C)%type (fun '(a, b, c) => P a b c) ls <~> All (fun abc => P abc.1.1 abc.1.2 abc.2) ls.
3569
Proof.
0 commit comments