blob: 390133162f2eae1f6d99ffccc0b57f57b4eed03e (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
|
Axiom proof_admitted : False.
Tactic Notation "admit" := abstract case proof_admitted.
Goal forall (T : Type) (p : prod (prod T T) bool) (Fm : Set) (f : Fm) (k :
forall _ : T, Fm),
@eq Fm
(k
match p return T with
| pair p0 swap => fst p0
end) f.
intros.
(* next statement failed in Bug 5486 *)
match goal with
| [ |- ?f (let (a, b) := ?d in @?e a b) = ?rhs ]
=> pose (let (a, b) := d in e a b) as t0
end.
|
