Skip to content

Conversation

@mdgeorge4153
Copy link
Contributor

I created a group_simplify tactic that simplifies group expressions by first pushing group morphisms and negations all the way down to the leaves, and then cancels out multiple negations, inverses, and mon_unit. I used this tactic to simplify and automate the proofs of several lemmas in groups.v.

This is my first serious attempt at writing new proof automation, so feedback would be appreciated.

@spitters
Copy link
Collaborator

spitters commented Jun 5, 2021

Thanks. Looks good.

@mdgeorge4153
Copy link
Contributor Author

I updated the group tactic to use easy instead of firstorder, and updated the proofs as necessary.

@spitters
Copy link
Collaborator

LGTM. Shall I merge?

@mdgeorge4153
Copy link
Contributor Author

mdgeorge4153 commented Jun 10, 2021 via email

@spitters spitters merged commit b94b24a into rocq-community:master Jun 10, 2021
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants