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.

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

Fix a shadowed lemma name #1143

Merged
merged 1 commit into from
Sep 5, 2023
Merged

Fix a shadowed lemma name #1143

merged 1 commit into from
Sep 5, 2023

Conversation

IlmariReissumies
Copy link
Contributor

No description provided.

@mn200 mn200 merged commit 398e682 into develop Sep 5, 2023
2 checks passed
@mn200
Copy link
Member

mn200 commented Sep 5, 2023

Thanks! (I have a follow up to prove elimination of Tau and make it an automatic rewrite.)

@mn200
Copy link
Member

mn200 commented Sep 5, 2023

Follow up is cff397e

@IlmariReissumies IlmariReissumies deleted the itree-shadow branch September 5, 2023 09:27
@IlmariReissumies
Copy link
Contributor Author

There's already the following, which is equivalent to your itree_wbisim_tau_eqn0:

  !t t'. itree_wbisim (Tau t) t' ==> itree_wbisim t t'
Proof
  ho_match_mp_tac itree_wbisim_strong_coind \\ rw[] \\
  qhdtm_x_assum ‘itree_wbisim’
                (strip_assume_tac o ONCE_REWRITE_RULE[itree_wbisim_cases]) \\
  gvs[] \\
  metis_tac[itree_wbisim_cases]
QED```

...that said, automated rewrites seem reasonable to me.

@mn200
Copy link
Member

mn200 commented Sep 6, 2023

That is the theorem in the other direction: I need it and my new result to get the iff.

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