You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The pattern a ^^^ (-1#w) = (-1#w) - a arises several times in AliveStatements. Proofing it will in certain cases enable ring to close goals, but it also breaks certain extensionality proofs. We may want to use it carefully (meaning, only after the ext proof in alive_auto has been executed).
This should resolve four theorems.
The text was updated successfully, but these errors were encountered:
Right. This is the type of thing that wants us to write an ad-hoc proof procedure, which tries multiple styles of proof, since there’s no good “normal form” for all cases we want to cover.
Hi, I was just checking through and I see this was assigned to me and looks like it remains open (if so, I can try to complete it if it would still be useful?)
The pattern
a ^^^ (-1#w) = (-1#w) - a
arises several times in AliveStatements. Proofing it will in certain cases enable ring to close goals, but it also breaks certain extensionality proofs. We may want to use it carefully (meaning, only after the ext proof in alive_auto has been executed).This should resolve four theorems.
The text was updated successfully, but these errors were encountered: