Commit 4219b955 authored by Robbert Krebbers's avatar Robbert Krebbers
Browse files

Make `Forall_true` transparent.

This is needed so that it can be used be used as a combinator for defining
induction schemes for mutually inductive types.
parent 67f3b316
......@@ -2175,7 +2175,7 @@ Section Forall_Exists.
intros [??]; auto using Forall_app_2.
Lemma Forall_true l : (∀ x, P x) → Forall P l.
Proof. induction l; auto. Qed.
Proof. intros ?. induction l; auto. Defined.
Lemma Forall_impl (Q : A → Prop) l :
Forall P l → (∀ x, P x → Q x) → Forall Q l.
Proof. intros H ?. induction H; auto. Defined.
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment