Line 2,922: |
Line 2,922: |
| A condition is ''amenable'' to a rule if any of its conceivable expressions formally match any of the expressions that are enumerated by the rule. Further, it requires the relegation of the other expressions to the production of a result. Thus, there is the choice of an initial expression that needs to be checked on input for whether it fits the antecedent condition and there are several types of output that are generated as a consequence, only a few of which are usually needed at any given time. | | A condition is ''amenable'' to a rule if any of its conceivable expressions formally match any of the expressions that are enumerated by the rule. Further, it requires the relegation of the other expressions to the production of a result. Thus, there is the choice of an initial expression that needs to be checked on input for whether it fits the antecedent condition and there are several types of output that are generated as a consequence, only a few of which are usually needed at any given time. |
| | | |
− | '''Editing Note.''' Need a transition here. Give a brief description of the Tables of Translation rules that have now been moved to the Appendices, and then move on to the rest of the Definitions and Proof Schemata. | + | '''Editing Note.''' Need a transition here. Give a brief description of the Tables of Translation Rules that have now been moved to the Appendices, and then move on to the rest of the Definitions and Proof Schemata. |
| + | |
| + | <br> |
| | | |
| <pre> | | <pre> |
Line 2,957: |
Line 2,959: |
| V1c. (( v , w )). | | V1c. (( v , w )). |
| </pre> | | </pre> |
| + | |
| + | <br> |
| | | |
| <pre> | | <pre> |
Line 2,976: |
Line 2,980: |
| | | |
| V1c. (( v , w )) | | V1c. (( v , w )) |
| + | </pre> |
| | | |
| + | <br> |
| + | |
| + | <pre> |
| Value Rule 1 | | Value Rule 1 |
| | | |
Line 2,990: |
Line 2,998: |
| | | |
| V1c. (( f(u) , g(u) )) | | V1c. (( f(u) , g(u) )) |
| + | </pre> |
| | | |
| + | <br> |
| + | |
| + | <pre> |
| Value Rule 1 | | Value Rule 1 |
| | | |
Line 3,002: |
Line 3,014: |
| | | |
| V1c. (( f , g ))$ | | V1c. (( f , g ))$ |
| + | </pre> |
| + | |
| + | <br> |
| | | |
| + | <pre> |
| Evaluation Rule 1 | | Evaluation Rule 1 |
| | | |
Line 3,019: |
Line 3,035: |
| :: | | :: |
| E1d. (( f , g ))$(u). :$1b | | E1d. (( f , g ))$(u). :$1b |
| + | </pre> |
| + | |
| + | <br> |
| | | |
| + | <pre> |
| Evaluation Rule 1 | | Evaluation Rule 1 |
| | | |
Line 3,039: |
Line 3,059: |
| :: | | :: |
| E1d. (( f , g ))$(u). :$1b | | E1d. (( f , g ))$(u). :$1b |
| + | </pre> |
| | | |
| + | <br> |
| | | |
| + | <pre> |
| Definition 2 | | Definition 2 |
| | | |
Line 3,050: |
Line 3,073: |
| | | |
| D2b. u C X <=> u C Y, for all u C U. | | D2b. u C X <=> u C Y, for all u C U. |
| + | </pre> |
| + | |
| + | <br> |
| | | |
| + | <pre> |
| Definition 3 | | Definition 3 |
| | | |
Line 3,060: |
Line 3,087: |
| | | |
| D3b. f(u) = g(u), for all u C U. | | D3b. f(u) = g(u), for all u C U. |
| + | </pre> |
| + | |
| + | <br> |
| | | |
| + | <pre> |
| Definition 4 | | Definition 4 |
| | | |
Line 3,070: |
Line 3,101: |
| | | |
| D4b. {<u, v> C UxB : v = [u C X]} | | D4b. {<u, v> C UxB : v = [u C X]} |
| + | </pre> |
| + | |
| + | <br> |
| | | |
| + | <pre> |
| Definition 5 | | Definition 5 |
| | | |
Line 3,082: |
Line 3,117: |
| | | |
| : f(u) = [u C X], for all u C U. | | : f(u) = [u C X], for all u C U. |
| + | </pre> |
| | | |
− | Given an indexed set of sentences, Sj for j C J, it is possible to consider the logical conjunction of the corresponding propositions. Various notations for this concept are be useful in various contexts, a sufficient sample of which are recorded in Definition 6. | + | Given an indexed set of sentences, <math>s_j\!</math> for <math>j \in J,</math> it is possible to consider the logical conjunction of the corresponding propositions. Various notations for this concept are be useful in various contexts, a sufficient sample of which are recorded in Definition 6. |
| | | |
| + | <pre> |
| Definition 6 | | Definition 6 |
| | | |
Line 3,102: |
Line 3,139: |
| | | |
| D6e. ConjJj Sj. | | D6e. ConjJj Sj. |
| + | </pre> |
| | | |
| + | <br> |
| + | |
| + | <pre> |
| Definition 7 | | Definition 7 |
| | | |
Line 3,133: |
Line 3,174: |
| :: | | :: |
| R5e. {X} = {Y}. :D5a | | R5e. {X} = {Y}. :D5a |
| + | </pre> |
| | | |
| + | <br> |
| + | |
| + | <pre> |
| Rule 6 | | Rule 6 |
| | | |
Line 3,146: |
Line 3,191: |
| :: | | :: |
| R6c. ConjUu (f(u) = g(u)). :D6e | | R6c. ConjUu (f(u) = g(u)). :D6e |
| + | </pre> |
| + | |
| + | <br> |
| | | |
| + | <pre> |
| Rule 7 | | Rule 7 |
| | | |
Line 3,166: |
Line 3,215: |
| :: | | :: |
| R7f. ConjUu (( P , Q ))$(u). :$1b | | R7f. ConjUu (( P , Q ))$(u). :$1b |
| + | </pre> |
| | | |
| + | <br> |
| | | |
| + | <pre> |
| Rule 8 | | Rule 8 |
| | | |
Line 3,191: |
Line 3,243: |
| | | |
| For instance, the observation that expresses the equality of sets in terms of their indicator functions can be formalized according to the pattern in Rule 9, namely, at lines (a, b, c), and these components of Rule 9 can be cited in future uses as "R9a", "R9b", "R9c", respectively. Using Rule 7, annotated as "R7", to adduce a few properties of indicator functions to the account, it is possible to extend Rule 9 by another few steps, referenced as "R9d", "R9e", "R9f", "R9g". | | For instance, the observation that expresses the equality of sets in terms of their indicator functions can be formalized according to the pattern in Rule 9, namely, at lines (a, b, c), and these components of Rule 9 can be cited in future uses as "R9a", "R9b", "R9c", respectively. Using Rule 7, annotated as "R7", to adduce a few properties of indicator functions to the account, it is possible to extend Rule 9 by another few steps, referenced as "R9d", "R9e", "R9f", "R9g". |
| + | </pre> |
| | | |
| + | <br> |
| + | |
| + | <pre> |
| Rule 9 | | Rule 9 |
| | | |
Line 3,212: |
Line 3,268: |
| :: | | :: |
| R9g. ConjUu (( {X} , {Y} ))$(u). :R7f | | R9g. ConjUu (( {X} , {Y} ))$(u). :R7f |
| + | </pre> |
| + | |
| + | <br> |
| | | |
| + | <pre> |
| Rule 10 | | Rule 10 |
| | | |
Line 3,236: |
Line 3,296: |
| :: | | :: |
| R10h. ConjUu (( [u C X] , [u C Y] ))$(u). :R8g | | R10h. ConjUu (( [u C X] , [u C Y] ))$(u). :R8g |
| + | </pre> |
| + | |
| + | <br> |
| | | |
| + | <pre> |
| Rule 11 | | Rule 11 |
| | | |
Line 3,268: |
Line 3,332: |
| | | |
| Applying Rule 9, Rule 8, and the Logical Rules to the special case where S <=> (X = Y), one obtains the following general fact. | | Applying Rule 9, Rule 8, and the Logical Rules to the special case where S <=> (X = Y), one obtains the following general fact. |
| + | </pre> |
| + | |
| + | <br> |
| | | |
| + | <pre> |
| Fact 1 | | Fact 1 |
| | | |