Combining two Coq hypotheses
So I have two hypotheses, one that is h : A -> B, and the other which is h2 : A. How can I get h3 : B to appear in my hypotheses?
pose proof (h h2) as h3. introduces h3 : B as a new hypothesis, specialize (h h2). modifies h : A -> B into h : B -- this can be useful if you won't need h later, and symmetrically, apply h in h2. converts h2 : A into h2 : B. Another (not very convenient) way would be to assert B as h3 by exact (h h2). That's what the pose proof variant is equivalent to. Also, in a simple case like the following, you can solve your goal without introducing a new hypothesis: Goal forall (A B : Prop), (A -> B) -> A -> B. intros A B h h2. apply (h h2). Qed.
Coq variable exists in list
What is required for Coq to generate an elimination combinator for an Inductive type?
How to capture parameters under universal quantification (using Modules? Sections?)
Proving for all elements of a list in coq
Coq adding a new variable instead of using the correct one
Simple identity in Coq
Unfold a notation within a scope
Error: Cannot coerce to an evaluable reference in coq
Proof in COQ that equality is reflexivity
How to express “there exists a unique X” in Coq?
Step by step simplification in coq?
Typeclass resolution and autorewrite
Need finding the right tactic over Int.lt
'else' in definitions - Coq
Solving equality / inequality in goal, coq code
Where did lt_index go?