Home | Intuitionistic Logic Explorer Theorem List (p. 62 of 133) | < Previous Next > |
Browser slow? Try the
Unicode version. |
||
Mirrors > Metamath Home Page > ILE Home Page > Theorem List Contents > Recent Proofs This page: Page List |
Type | Label | Description |
---|---|---|
Statement | ||
Theorem | mpofvex 6101* | Sufficient condition for an operation maps-to notation to be set-like. (Contributed by Mario Carneiro, 3-Jul-2019.) |
Theorem | fnmpoi 6102* | Functionality and domain of a class given by the maps-to notation. (Contributed by FL, 17-May-2010.) |
Theorem | dmmpo 6103* | Domain of a class given by the maps-to notation. (Contributed by FL, 17-May-2010.) |
Theorem | mpofvexi 6104* | Sufficient condition for an operation maps-to notation to be set-like. (Contributed by Mario Carneiro, 3-Jul-2019.) |
Theorem | ovmpoelrn 6105* | An operation's value belongs to its range. (Contributed by AV, 27-Jan-2020.) |
Theorem | dmmpoga 6106* | Domain of an operation given by the maps-to notation, closed form of dmmpo 6103. (Contributed by Alexander van der Vekens, 10-Feb-2019.) |
Theorem | dmmpog 6107* | Domain of an operation given by the maps-to notation, closed form of dmmpo 6103. Caution: This theorem is only valid in the very special case where the value of the mapping is a constant! (Contributed by Alexander van der Vekens, 1-Jun-2017.) (Proof shortened by AV, 10-Feb-2019.) |
Theorem | mpoexxg 6108* | Existence of an operation class abstraction (version for dependent domains). (Contributed by Mario Carneiro, 30-Dec-2016.) |
Theorem | mpoexg 6109* | Existence of an operation class abstraction (special case). (Contributed by FL, 17-May-2010.) (Revised by Mario Carneiro, 1-Sep-2015.) |
Theorem | mpoexga 6110* | If the domain of an operation given by maps-to notation is a set, the operation is a set. (Contributed by NM, 12-Sep-2011.) |
Theorem | mpoex 6111* | If the domain of an operation given by maps-to notation is a set, the operation is a set. (Contributed by Mario Carneiro, 20-Dec-2013.) |
Theorem | fnmpoovd 6112* | A function with a Cartesian product as domain is a mapping with two arguments defined by its operation values. (Contributed by AV, 20-Feb-2019.) (Revised by AV, 3-Jul-2022.) |
Theorem | fmpoco 6113* | Composition of two functions. Variation of fmptco 5586 when the second function has two arguments. (Contributed by Mario Carneiro, 8-Feb-2015.) |
Theorem | oprabco 6114* | Composition of a function with an operator abstraction. (Contributed by Jeff Madsen, 2-Sep-2009.) (Proof shortened by Mario Carneiro, 26-Sep-2015.) |
Theorem | oprab2co 6115* | Composition of operator abstractions. (Contributed by Jeff Madsen, 2-Sep-2009.) (Revised by David Abernethy, 23-Apr-2013.) |
Theorem | df1st2 6116* | An alternate possible definition of the function. (Contributed by NM, 14-Oct-2004.) (Revised by Mario Carneiro, 31-Aug-2015.) |
Theorem | df2nd2 6117* | An alternate possible definition of the function. (Contributed by NM, 10-Aug-2006.) (Revised by Mario Carneiro, 31-Aug-2015.) |
Theorem | 1stconst 6118 | The mapping of a restriction of the function to a constant function. (Contributed by NM, 14-Dec-2008.) |
Theorem | 2ndconst 6119 | The mapping of a restriction of the function to a converse constant function. (Contributed by NM, 27-Mar-2008.) |
Theorem | dfmpo 6120* | Alternate definition for the maps-to notation df-mpo 5779 (although it requires that be a set). (Contributed by NM, 19-Dec-2008.) (Revised by Mario Carneiro, 31-Aug-2015.) |
Theorem | cnvf1olem 6121 | Lemma for cnvf1o 6122. (Contributed by Mario Carneiro, 27-Apr-2014.) |
Theorem | cnvf1o 6122* | Describe a function that maps the elements of a set to its converse bijectively. (Contributed by Mario Carneiro, 27-Apr-2014.) |
Theorem | f2ndf 6123 | The (second component of an ordered pair) function restricted to a function is a function from into the codomain of . (Contributed by Alexander van der Vekens, 4-Feb-2018.) |
Theorem | fo2ndf 6124 | The (second component of an ordered pair) function restricted to a function is a function from onto the range of . (Contributed by Alexander van der Vekens, 4-Feb-2018.) |
Theorem | f1o2ndf1 6125 | The (second component of an ordered pair) function restricted to a one-to-one function is a one-to-one function from onto the range of . (Contributed by Alexander van der Vekens, 4-Feb-2018.) |
Theorem | algrflem 6126 | Lemma for algrf and related theorems. (Contributed by Mario Carneiro, 28-May-2014.) (Revised by Mario Carneiro, 30-Apr-2015.) |
Theorem | algrflemg 6127 | Lemma for algrf 11726 and related theorems. (Contributed by Mario Carneiro, 28-May-2014.) (Revised by Jim Kingdon, 22-Jul-2021.) |
Theorem | xporderlem 6128* | Lemma for lexicographical ordering theorems. (Contributed by Scott Fenton, 16-Mar-2011.) |
Theorem | poxp 6129* | A lexicographical ordering of two posets. (Contributed by Scott Fenton, 16-Mar-2011.) (Revised by Mario Carneiro, 7-Mar-2013.) |
Theorem | spc2ed 6130* | Existential specialization with 2 quantifiers, using implicit substitution. (Contributed by Thierry Arnoux, 23-Aug-2017.) |
Theorem | cnvoprab 6131* | The converse of a class abstraction of nested ordered pairs. (Contributed by Thierry Arnoux, 17-Aug-2017.) |
Theorem | f1od2 6132* | Describe an implicit one-to-one onto function of two variables. (Contributed by Thierry Arnoux, 17-Aug-2017.) |
Theorem | disjxp1 6133* | The sets of a cartesian product are disjoint if the sets in the first argument are disjoint. (Contributed by Glauco Siliprandi, 11-Oct-2020.) |
Disj Disj | ||
Theorem | disjsnxp 6134* | The sets in the cartesian product of singletons with other sets, are disjoint. (Contributed by Glauco Siliprandi, 11-Oct-2020.) |
Disj | ||
The following theorems are about maps-to operations (see df-mpo 5779) where the domain of the second argument depends on the domain of the first argument, especially when the first argument is a pair and the base set of the second argument is the first component of the first argument, in short "x-maps-to operations". For labels, the abbreviations "mpox" are used (since "x" usually denotes the first argument). This is in line with the currently used conventions for such cases (see cbvmpox 5849, ovmpox 5899 and fmpox 6098). If the first argument is an ordered pair, as in the following, the abbreviation is extended to "mpoxop", and the maps-to operations are called "x-op maps-to operations" for short. | ||
Theorem | opeliunxp2f 6135* | Membership in a union of Cartesian products, using bound-variable hypothesis for instead of distinct variable conditions as in opeliunxp2 4679. (Contributed by AV, 25-Oct-2020.) |
Theorem | mpoxopn0yelv 6136* | If there is an element of the value of an operation given by a maps-to rule, where the first argument is a pair and the base set of the second argument is the first component of the first argument, then the second argument is an element of the first component of the first argument. (Contributed by Alexander van der Vekens, 10-Oct-2017.) |
Theorem | mpoxopoveq 6137* | Value of an operation given by a maps-to rule, where the first argument is a pair and the base set of the second argument is the first component of the first argument. (Contributed by Alexander van der Vekens, 11-Oct-2017.) |
Theorem | mpoxopovel 6138* | Element of the value of an operation given by a maps-to rule, where the first argument is a pair and the base set of the second argument is the first component of the first argument. (Contributed by Alexander van der Vekens and Mario Carneiro, 10-Oct-2017.) |
Theorem | rbropapd 6139* | Properties of a pair in an extended binary relation. (Contributed by Alexander van der Vekens, 30-Oct-2017.) |
Theorem | rbropap 6140* | Properties of a pair in a restricted binary relation expressed as an ordered-pair class abstraction: is the binary relation restricted by the condition . (Contributed by AV, 31-Jan-2021.) |
Syntax | ctpos 6141 | The transposition of a function. |
tpos | ||
Definition | df-tpos 6142* | Define the transposition of a function, which is a function tpos satisfying . (Contributed by Mario Carneiro, 10-Sep-2015.) |
tpos | ||
Theorem | tposss 6143 | Subset theorem for transposition. (Contributed by Mario Carneiro, 10-Sep-2015.) |
tpos tpos | ||
Theorem | tposeq 6144 | Equality theorem for transposition. (Contributed by Mario Carneiro, 10-Sep-2015.) |
tpos tpos | ||
Theorem | tposeqd 6145 | Equality theorem for transposition. (Contributed by Mario Carneiro, 7-Jan-2017.) |
tpos tpos | ||
Theorem | tposssxp 6146 | The transposition is a subset of a cross product. (Contributed by Mario Carneiro, 12-Jan-2017.) |
tpos | ||
Theorem | reltpos 6147 | The transposition is a relation. (Contributed by Mario Carneiro, 10-Sep-2015.) |
tpos | ||
Theorem | brtpos2 6148 | Value of the transposition at a pair . (Contributed by Mario Carneiro, 10-Sep-2015.) |
tpos | ||
Theorem | brtpos0 6149 | The behavior of tpos when the left argument is the empty set (which is not an ordered pair but is the "default" value of an ordered pair when the arguments are proper classes). (Contributed by Mario Carneiro, 10-Sep-2015.) |
tpos | ||
Theorem | reldmtpos 6150 | Necessary and sufficient condition for tpos to be a relation. (Contributed by Mario Carneiro, 10-Sep-2015.) |
tpos | ||
Theorem | brtposg 6151 | The transposition swaps arguments of a three-parameter relation. (Contributed by Jim Kingdon, 31-Jan-2019.) |
tpos | ||
Theorem | ottposg 6152 | The transposition swaps the first two elements in a collection of ordered triples. (Contributed by Mario Carneiro, 1-Dec-2014.) |
tpos | ||
Theorem | dmtpos 6153 | The domain of tpos when is a relation. (Contributed by Mario Carneiro, 10-Sep-2015.) |
tpos | ||
Theorem | rntpos 6154 | The range of tpos when is a relation. (Contributed by Mario Carneiro, 10-Sep-2015.) |
tpos | ||
Theorem | tposexg 6155 | The transposition of a set is a set. (Contributed by Mario Carneiro, 10-Sep-2015.) |
tpos | ||
Theorem | ovtposg 6156 | The transposition swaps the arguments in a two-argument function. When is a matrix, which is to say a function from ( 1 ... m ) ( 1 ... n ) to the reals or some ring, tpos is the transposition of , which is where the name comes from. (Contributed by Mario Carneiro, 10-Sep-2015.) |
tpos | ||
Theorem | tposfun 6157 | The transposition of a function is a function. (Contributed by Mario Carneiro, 10-Sep-2015.) |
tpos | ||
Theorem | dftpos2 6158* | Alternate definition of tpos when has relational domain. (Contributed by Mario Carneiro, 10-Sep-2015.) |
tpos | ||
Theorem | dftpos3 6159* | Alternate definition of tpos when has relational domain. Compare df-cnv 4547. (Contributed by Mario Carneiro, 10-Sep-2015.) |
tpos | ||
Theorem | dftpos4 6160* | Alternate definition of tpos. (Contributed by Mario Carneiro, 4-Oct-2015.) |
tpos | ||
Theorem | tpostpos 6161 | Value of the double transposition for a general class . (Contributed by Mario Carneiro, 16-Sep-2015.) |
tpos tpos | ||
Theorem | tpostpos2 6162 | Value of the double transposition for a relation on triples. (Contributed by Mario Carneiro, 16-Sep-2015.) |
tpos tpos | ||
Theorem | tposfn2 6163 | The domain of a transposition. (Contributed by NM, 10-Sep-2015.) |
tpos | ||
Theorem | tposfo2 6164 | Condition for a surjective transposition. (Contributed by NM, 10-Sep-2015.) |
tpos | ||
Theorem | tposf2 6165 | The domain and range of a transposition. (Contributed by NM, 10-Sep-2015.) |
tpos | ||
Theorem | tposf12 6166 | Condition for an injective transposition. (Contributed by NM, 10-Sep-2015.) |
tpos | ||
Theorem | tposf1o2 6167 | Condition of a bijective transposition. (Contributed by NM, 10-Sep-2015.) |
tpos | ||
Theorem | tposfo 6168 | The domain and range of a transposition. (Contributed by NM, 10-Sep-2015.) |
tpos | ||
Theorem | tposf 6169 | The domain and range of a transposition. (Contributed by NM, 10-Sep-2015.) |
tpos | ||
Theorem | tposfn 6170 | Functionality of a transposition. (Contributed by Mario Carneiro, 4-Oct-2015.) |
tpos | ||
Theorem | tpos0 6171 | Transposition of the empty set. (Contributed by NM, 10-Sep-2015.) |
tpos | ||
Theorem | tposco 6172 | Transposition of a composition. (Contributed by Mario Carneiro, 4-Oct-2015.) |
tpos tpos | ||
Theorem | tpossym 6173* | Two ways to say a function is symmetric. (Contributed by Mario Carneiro, 4-Oct-2015.) |
tpos | ||
Theorem | tposeqi 6174 | Equality theorem for transposition. (Contributed by Mario Carneiro, 10-Sep-2015.) |
tpos tpos | ||
Theorem | tposex 6175 | A transposition is a set. (Contributed by Mario Carneiro, 10-Sep-2015.) |
tpos | ||
Theorem | nftpos 6176 | Hypothesis builder for transposition. (Contributed by Mario Carneiro, 10-Sep-2015.) |
tpos | ||
Theorem | tposoprab 6177* | Transposition of a class of ordered triples. (Contributed by Mario Carneiro, 10-Sep-2015.) |
tpos | ||
Theorem | tposmpo 6178* | Transposition of a two-argument mapping. (Contributed by Mario Carneiro, 10-Sep-2015.) |
tpos | ||
Theorem | pwuninel2 6179 | The power set of the union of a set does not belong to the set. This theorem provides a way of constructing a new set that doesn't belong to a given set. (Contributed by Stefan O'Rear, 22-Feb-2015.) |
Theorem | 2pwuninelg 6180 | The power set of the power set of the union of a set does not belong to the set. This theorem provides a way of constructing a new set that doesn't belong to a given set. (Contributed by Jim Kingdon, 14-Jan-2020.) |
Theorem | iunon 6181* | The indexed union of a set of ordinal numbers is an ordinal number. (Contributed by NM, 13-Oct-2003.) (Revised by Mario Carneiro, 5-Dec-2016.) |
Syntax | wsmo 6182 | Introduce the strictly monotone ordinal function. A strictly monotone function is one that is constantly increasing across the ordinals. |
Definition | df-smo 6183* | Definition of a strictly monotone ordinal function. Definition 7.46 in [TakeutiZaring] p. 50. (Contributed by Andrew Salmon, 15-Nov-2011.) |
Theorem | dfsmo2 6184* | Alternate definition of a strictly monotone ordinal function. (Contributed by Mario Carneiro, 4-Mar-2013.) |
Theorem | issmo 6185* | Conditions for which is a strictly monotone ordinal function. (Contributed by Andrew Salmon, 15-Nov-2011.) |
Theorem | issmo2 6186* | Alternate definition of a strictly monotone ordinal function. (Contributed by Mario Carneiro, 12-Mar-2013.) |
Theorem | smoeq 6187 | Equality theorem for strictly monotone functions. (Contributed by Andrew Salmon, 16-Nov-2011.) |
Theorem | smodm 6188 | The domain of a strictly monotone function is an ordinal. (Contributed by Andrew Salmon, 16-Nov-2011.) |
Theorem | smores 6189 | A strictly monotone function restricted to an ordinal remains strictly monotone. (Contributed by Andrew Salmon, 16-Nov-2011.) (Proof shortened by Mario Carneiro, 5-Dec-2016.) |
Theorem | smores3 6190 | A strictly monotone function restricted to an ordinal remains strictly monotone. (Contributed by Andrew Salmon, 19-Nov-2011.) |
Theorem | smores2 6191 | A strictly monotone ordinal function restricted to an ordinal is still monotone. (Contributed by Mario Carneiro, 15-Mar-2013.) |
Theorem | smodm2 6192 | The domain of a strictly monotone ordinal function is an ordinal. (Contributed by Mario Carneiro, 12-Mar-2013.) |
Theorem | smofvon2dm 6193 | The function values of a strictly monotone ordinal function are ordinals. (Contributed by Mario Carneiro, 12-Mar-2013.) |
Theorem | iordsmo 6194 | The identity relation restricted to the ordinals is a strictly monotone function. (Contributed by Andrew Salmon, 16-Nov-2011.) |
Theorem | smo0 6195 | The null set is a strictly monotone ordinal function. (Contributed by Andrew Salmon, 20-Nov-2011.) |
Theorem | smofvon 6196 | If is a strictly monotone ordinal function, and is in the domain of , then the value of the function at is an ordinal. (Contributed by Andrew Salmon, 20-Nov-2011.) |
Theorem | smoel 6197 | If is less than then a strictly monotone function's value will be strictly less at than at . (Contributed by Andrew Salmon, 22-Nov-2011.) |
Theorem | smoiun 6198* | The value of a strictly monotone ordinal function contains its indexed union. (Contributed by Andrew Salmon, 22-Nov-2011.) |
Theorem | smoiso 6199 | If is an isomorphism from an ordinal onto , which is a subset of the ordinals, then is a strictly monotonic function. Exercise 3 in [TakeutiZaring] p. 50. (Contributed by Andrew Salmon, 24-Nov-2011.) |
Theorem | smoel2 6200 | A strictly monotone ordinal function preserves the epsilon relation. (Contributed by Mario Carneiro, 12-Mar-2013.) |
< Previous Next > |
Copyright terms: Public domain | < Previous Next > |