File: binder.v

package info (click to toggle)
coq 8.20.1%2Bdfsg-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 44,116 kB
  • sloc: ml: 234,160; sh: 4,301; python: 3,270; ansic: 2,644; makefile: 882; lisp: 172; javascript: 63; xml: 24; sed: 2
file content (37 lines) | stat: -rw-r--r-- 688 bytes parent folder | download | duplicates (5)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
Require Import Ltac2.Ltac2.

Ltac2 check () :=
let t := Control.goal () in
match Constr.Unsafe.kind t with
| Constr.Unsafe.Prod b t =>
  let na := Constr.Binder.name b in
  let u := Constr.Binder.type b in
  let b := Constr.Binder.make na u in
  let c := Constr.Unsafe.make (Constr.Unsafe.Prod b t) in
  pose (v := $c);
  refine '(_ : &v);
  unfold &v
| _ => fail
end.

Goal forall x : nat, x = x.
Proof.
check (); intros; reflexivity.
Qed.

Goal forall x : Type, x = x.
Proof.
check (); intros; reflexivity.
Qed.

Goal forall x : Set, x = x.
Proof.
check (); intros; reflexivity.
Qed.

Inductive True : SProp := I.

Goal forall x : True, True.
Proof.
check (); intros; constructor.
Qed.