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

Revision of structure theorems (4) #4397

Merged
merged 10 commits into from
Nov 23, 2024
Merged

Conversation

avekens
Copy link
Contributor

@avekens avekens commented Nov 16, 2024

As discussed in issue #3235, the new usage of the theorems *ndx for the hard-coded indices of slots in extensible structures is discouraged now. It was possible to replace most of the former usages by new/existing theorems not depending on the hard-coded values for the indices. All proofs were shortened by these replacements.

For this, some additional new auxiliary theorems (*ndxn*, slots*) were provided. These new theorems are extracts of former proofs without exception, so there should be no objection to them. There are 46 of these auxiliary theorems in set.mm now, 35 of them are used more than once (and therefore surely pay off). This number is still far less then the maximum 190 (number of proper pairs of numbers 1 to 20, which are currently used as slot indices).

As a result, the usage of the theorems *ndx is restricted to the basic theorems *ndxnn (7), *ndxlt* (12), *ndxn* (58) and slots* (42), and the *str theorems showing that a structure is well formed (see also comments in #4377), except five deprecated theorems ~1strstr, ~2strstr, ~grpbasex, ~grpplusx, ~indistpsx.

By this PR, the main tasks of issue #3235 (discouragement of the df-* definitions of slots and *ndx theorems for extensible structures) is done. There are, however, some details to be clarified/adjusted (e.g., how to proceed with the *strtheorems, and how to adjust the comments provided with #4283), which I will descibe in #3235 in more detail (and solve them in a subsequent PR).

* auxiliary slots* and *ndxn* theorems extracted from proofs of ~rescabs, ~cnfldfun, ~ttgval: ~tsetndxnstarvndx,  ~slotsdifplendx, ~slotsdifdsndx, ~slotsdifunifndx, ~lngndxnitvndx
* proofs of ~rescabs, ~cnfldfun, ~ttgval shortened and independent of *ndx theorems.
* proofs of ~setsmsbas, ~setsmsds, ~zlmds, ~zlmtset shortend and independent of *ndx theorems by using already existing slot*/*ndxn* theorems.
* auxiliary *ndxn* theorems extracted from proofs of ~thlbas, ~thlle: ~basendxnocndx , ~plendxnocndx
* proofs of ~thlbas, ~thlle shortened and independent of *ndx theorems.
* auxiliary slotsdif* theorems extracted from proofs of ~srasca, ~sravsca, ~prstcleval, ~prstcocval: ~slotsdifipndx  , ~slotsdifplendx2, ~slotsdifocndx
* proofs of ~srasca, ~sravsca, ~prstcleval, ~prstcocval shortened and independent of *ndx theorems.
* proofs of ~odubas, ~setsmsds, ~matvsca shortend and independent of *ndx theorems by using already existing *ndxn* theorems.
* new theorem ~1strstr1
* use of ~1strstr discouraged
* proof of ~1strbas shortened
* ~baseltedgf  renamed ~basendxltedgfndx
@wlammen
Copy link
Contributor

wlammen commented Nov 22, 2024

@avekens Just in case you did not notice it: This PR has conflicts that need to be resolved (for some days now).

@avekens avekens merged commit 9761cdc into metamath:develop Nov 23, 2024
10 checks passed
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