Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Idea: define extensionality lemmas for possible speedup? #90

Open
alxest opened this issue May 11, 2021 · 0 comments
Open

Idea: define extensionality lemmas for possible speedup? #90

alxest opened this issue May 11, 2021 · 0 comments
Labels
Difficulty: LOW Importance: LOW

Comments

@alxest
Copy link
Collaborator

alxest commented May 11, 2021 

Let eq_ext: forall X (x0 x1 ctx: X), x0 = x1 -> x1 = ctx -> x0 = ctx. Proof. intros. subst; eauto. Qed.
Goal 0 =1. Time do 1000 (erewrite f_equal; [|reflexivity]). Show Proof. Abort.
Goal 0 =1. Time do 1000 (eapply Red._einit; [Red._ctx 0|reflexivity]). Show Proof. Abort.
Goal 0 =1. Time do 1000 (eapply eq_ext; [reflexivity|]). Show Proof. Abort.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
Difficulty: LOW Importance: LOW
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@alxest