-
Notifications
You must be signed in to change notification settings - Fork 89
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
Shorten well-ordered recursion #4403
Conversation
What version of metamath-exe are we using for PRs? I'm on the latest branch from git and it's not doing a rewrap for me. |
https://github.com/metamath/set.mm/actions/runs/11896165033/job/33147444740#step:8:7 says |
${ | ||
$d A f x y z $. $d R f x y z $. $d G f x y z $. $d X f x y z $. | ||
$d F y z $. | ||
frrrel.1 $e |- F = frecs ( R , A , G ) $. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Isn't there one too many "r" in that label ?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I don't think so - founded-relationship (fr) recursion (r) relationship (rel)
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I was thinking of "well-founded recursion gives a relation".
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
This usage matches frr1, frr2, and frr3 though
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Thanks a lot for this simplification and unification !
This PR brings in the new definition of wrecs that BJ proved in his mathbox. It's now the official definition and the old one is marked discouraged. All the well-ordered recursion theorems are reproved using the new definition, the lemmas are obsoleted, and a new family of frecs theorems that avoid ax-rep are brought in.