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

Decidability of equality for NN+oo is equivalent to WLPO #4476

Merged
merged 4 commits into from
Dec 14, 2024

Conversation

jkingdon
Copy link
Contributor

The new part here is the forward implication which follows the proof at #4151 (comment)

Fixes #4151

This is ifor from set.mm with a decidability condition added.  The proof
is similar to the set.mm proof with excluded middle replaced by the
decidability condition.
Includes lemmas nninfwlpoimlemg , nninfwlpoimlemginf , and
nninfwlpoimlemdc .
Biconditionalized form of nninfwlpor and nninfwlpoim .
@jkingdon jkingdon merged commit f94f037 into metamath:develop Dec 14, 2024
10 checks passed
@jkingdon jkingdon deleted the nninfwlpo branch December 14, 2024 04:35
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.

The type ℕ∞ has decidable equality iff WLPO holds
2 participants