-
Notifications
You must be signed in to change notification settings - Fork 174
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
issue 1576 implemented differently #1582
Conversation
rmatthes
commented
Oct 26, 2022
- Require Export UniMath.Tactics.EnsureStructuredProofs. should appear in the files that are root of a dependency tree
- modifies the previous treatment of SubstitutionSystems and Bicategories
- applies the treatment to package PAdics
- the PAdics files were partly in DOS encoding, now in sync with the rest - can irritate diff tools (the tool meld copes with this well)
Require Export UniMath.Tactics.EnsureStructuredProofs. should appear in the files that are root of a dependency tree modifies the previous treatment of SubstitutionSystems and Bicategories applies the treatment to package PAdics
I'm surprised by these errors. For the remainder the PR looks good. |
The error seems to come from the fact that the package tactics comes after both Bicategories and PAdics. This means that either this file must be put in some other package or Tactics need to be put in front (different way of generating CONTENTS.md). I think the solution is that this part of
More precisely, The alternative solution is that the relevant gets put in |
follows a suggestion by Niels van der Weide anyway, this is a preliminary placement for EnsureStructuredProofs.v
Sorry for not having checked this - I had only compiled the library before the commit. |
It seems like we also need to implement this change in the relevant subrepositories, because now the error is at The relevant file (https://github.com/UniMath/TypeTheory/blob/master/TypeTheory/Initiality/SyntacticCategory.v) contains I do think it's good to merge this PR soon.
Lemma setquotprpathsandR { X : UU } ( R : eqrel X ) :
forall x y : X, setquotpr R x = setquotpr R y -> R x y.
Proof.
intros.
assert ( pr1 ( setquotpr R x ) y ) as i.
{ assert ( pr1 ( setquotpr R y ) y ) as i0.
{ unfold setquotpr. simpl. apply (pr2 (pr1 (pr2 R))). }
destruct X0. assumption.
}
apply i.
Defined. When looking further, it seems that UniMath/UniMath/Foundations/Sets.v Line 1711 in f358cf5
|
issue 1576 implemented differently
issue 1576 implemented differently