Home | Intuitionistic Logic Explorer Theorem List (p. 62 of 137) | < 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 | ot1stg 6101 | Extract the first member of an ordered triple. (Due to infrequent usage, it isn't worthwhile at this point to define special extractors for triples, so we reuse the ordered pair extractors for ot1stg 6101, ot2ndg 6102, ot3rdgg 6103.) (Contributed by NM, 3-Apr-2015.) (Revised by Mario Carneiro, 2-May-2015.) |
Theorem | ot2ndg 6102 | Extract the second member of an ordered triple. (See ot1stg 6101 comment.) (Contributed by NM, 3-Apr-2015.) (Revised by Mario Carneiro, 2-May-2015.) |
Theorem | ot3rdgg 6103 | Extract the third member of an ordered triple. (See ot1stg 6101 comment.) (Contributed by NM, 3-Apr-2015.) |
Theorem | 1stval2 6104 | Alternate value of the function that extracts the first member of an ordered pair. Definition 5.13 (i) of [Monk1] p. 52. (Contributed by NM, 18-Aug-2006.) |
Theorem | 2ndval2 6105 | Alternate value of the function that extracts the second member of an ordered pair. Definition 5.13 (ii) of [Monk1] p. 52. (Contributed by NM, 18-Aug-2006.) |
Theorem | fo1st 6106 | The function maps the universe onto the universe. (Contributed by NM, 14-Oct-2004.) (Revised by Mario Carneiro, 8-Sep-2013.) |
Theorem | fo2nd 6107 | The function maps the universe onto the universe. (Contributed by NM, 14-Oct-2004.) (Revised by Mario Carneiro, 8-Sep-2013.) |
Theorem | f1stres 6108 | Mapping of a restriction of the (first member of an ordered pair) function. (Contributed by NM, 11-Oct-2004.) (Revised by Mario Carneiro, 8-Sep-2013.) |
Theorem | f2ndres 6109 | Mapping of a restriction of the (second member of an ordered pair) function. (Contributed by NM, 7-Aug-2006.) (Revised by Mario Carneiro, 8-Sep-2013.) |
Theorem | fo1stresm 6110* | Onto mapping of a restriction of the (first member of an ordered pair) function. (Contributed by Jim Kingdon, 24-Jan-2019.) |
Theorem | fo2ndresm 6111* | Onto mapping of a restriction of the (second member of an ordered pair) function. (Contributed by Jim Kingdon, 24-Jan-2019.) |
Theorem | 1stcof 6112 | Composition of the first member function with another function. (Contributed by NM, 12-Oct-2007.) |
Theorem | 2ndcof 6113 | Composition of the second member function with another function. (Contributed by FL, 15-Oct-2012.) |
Theorem | xp1st 6114 | Location of the first element of a Cartesian product. (Contributed by Jeff Madsen, 2-Sep-2009.) |
Theorem | xp2nd 6115 | Location of the second element of a Cartesian product. (Contributed by Jeff Madsen, 2-Sep-2009.) |
Theorem | 1stexg 6116 | Existence of the first member of a set. (Contributed by Jim Kingdon, 26-Jan-2019.) |
Theorem | 2ndexg 6117 | Existence of the first member of a set. (Contributed by Jim Kingdon, 26-Jan-2019.) |
Theorem | elxp6 6118 | Membership in a cross product. This version requires no quantifiers or dummy variables. See also elxp4 5074. (Contributed by NM, 9-Oct-2004.) |
Theorem | elxp7 6119 | Membership in a cross product. This version requires no quantifiers or dummy variables. See also elxp4 5074. (Contributed by NM, 19-Aug-2006.) |
Theorem | oprssdmm 6120* | Domain of closure of an operation. (Contributed by Jim Kingdon, 23-Oct-2023.) |
Theorem | eqopi 6121 | Equality with an ordered pair. (Contributed by NM, 15-Dec-2008.) (Revised by Mario Carneiro, 23-Feb-2014.) |
Theorem | xp2 6122* | Representation of cross product based on ordered pair component functions. (Contributed by NM, 16-Sep-2006.) |
Theorem | unielxp 6123 | The membership relation for a cross product is inherited by union. (Contributed by NM, 16-Sep-2006.) |
Theorem | 1st2nd2 6124 | Reconstruction of a member of a cross product in terms of its ordered pair components. (Contributed by NM, 20-Oct-2013.) |
Theorem | xpopth 6125 | An ordered pair theorem for members of cross products. (Contributed by NM, 20-Jun-2007.) |
Theorem | eqop 6126 | Two ways to express equality with an ordered pair. (Contributed by NM, 3-Sep-2007.) (Proof shortened by Mario Carneiro, 26-Apr-2015.) |
Theorem | eqop2 6127 | Two ways to express equality with an ordered pair. (Contributed by NM, 25-Feb-2014.) |
Theorem | op1steq 6128* | Two ways of expressing that an element is the first member of an ordered pair. (Contributed by NM, 22-Sep-2013.) (Revised by Mario Carneiro, 23-Feb-2014.) |
Theorem | 2nd1st 6129 | Swap the members of an ordered pair. (Contributed by NM, 31-Dec-2014.) |
Theorem | 1st2nd 6130 | Reconstruction of a member of a relation in terms of its ordered pair components. (Contributed by NM, 29-Aug-2006.) |
Theorem | 1stdm 6131 | The first ordered pair component of a member of a relation belongs to the domain of the relation. (Contributed by NM, 17-Sep-2006.) |
Theorem | 2ndrn 6132 | The second ordered pair component of a member of a relation belongs to the range of the relation. (Contributed by NM, 17-Sep-2006.) |
Theorem | 1st2ndbr 6133 | Express an element of a relation as a relationship between first and second components. (Contributed by Mario Carneiro, 22-Jun-2016.) |
Theorem | releldm2 6134* | Two ways of expressing membership in the domain of a relation. (Contributed by NM, 22-Sep-2013.) |
Theorem | reldm 6135* | An expression for the domain of a relation. (Contributed by NM, 22-Sep-2013.) |
Theorem | sbcopeq1a 6136 | Equality theorem for substitution of a class for an ordered pair (analog of sbceq1a 2946 that avoids the existential quantifiers of copsexg 4205). (Contributed by NM, 19-Aug-2006.) (Revised by Mario Carneiro, 31-Aug-2015.) |
Theorem | csbopeq1a 6137 | Equality theorem for substitution of a class for an ordered pair in (analog of csbeq1a 3040). (Contributed by NM, 19-Aug-2006.) (Revised by Mario Carneiro, 31-Aug-2015.) |
Theorem | dfopab2 6138* | A way to define an ordered-pair class abstraction without using existential quantifiers. (Contributed by NM, 18-Aug-2006.) (Revised by Mario Carneiro, 31-Aug-2015.) |
Theorem | dfoprab3s 6139* | A way to define an operation class abstraction without using existential quantifiers. (Contributed by NM, 18-Aug-2006.) (Revised by Mario Carneiro, 31-Aug-2015.) |
Theorem | dfoprab3 6140* | Operation class abstraction expressed without existential quantifiers. (Contributed by NM, 16-Dec-2008.) |
Theorem | dfoprab4 6141* | Operation class abstraction expressed without existential quantifiers. (Contributed by NM, 3-Sep-2007.) (Revised by Mario Carneiro, 31-Aug-2015.) |
Theorem | dfoprab4f 6142* | Operation class abstraction expressed without existential quantifiers. (Unnecessary distinct variable restrictions were removed by David Abernethy, 19-Jun-2012.) (Contributed by NM, 20-Dec-2008.) (Revised by Mario Carneiro, 31-Aug-2015.) |
Theorem | dfxp3 6143* | Define the cross product of three classes. Compare df-xp 4593. (Contributed by FL, 6-Nov-2013.) (Proof shortened by Mario Carneiro, 3-Nov-2015.) |
Theorem | elopabi 6144* | A consequence of membership in an ordered-pair class abstraction, using ordered pair extractors. (Contributed by NM, 29-Aug-2006.) |
Theorem | eloprabi 6145* | A consequence of membership in an operation class abstraction, using ordered pair extractors. (Contributed by NM, 6-Nov-2006.) (Revised by David Abernethy, 19-Jun-2012.) |
Theorem | mpomptsx 6146* | Express a two-argument function as a one-argument function, or vice-versa. (Contributed by Mario Carneiro, 24-Dec-2016.) |
Theorem | mpompts 6147* | Express a two-argument function as a one-argument function, or vice-versa. (Contributed by Mario Carneiro, 24-Sep-2015.) |
Theorem | dmmpossx 6148* | The domain of a mapping is a subset of its base class. (Contributed by Mario Carneiro, 9-Feb-2015.) |
Theorem | fmpox 6149* | Functionality, domain and codomain of a class given by the maps-to notation, where is not constant but depends on . (Contributed by NM, 29-Dec-2014.) |
Theorem | fmpo 6150* | Functionality, domain and range of a class given by the maps-to notation. (Contributed by FL, 17-May-2010.) |
Theorem | fnmpo 6151* | Functionality and domain of a class given by the maps-to notation. (Contributed by FL, 17-May-2010.) |
Theorem | mpofvex 6152* | Sufficient condition for an operation maps-to notation to be set-like. (Contributed by Mario Carneiro, 3-Jul-2019.) |
Theorem | fnmpoi 6153* | Functionality and domain of a class given by the maps-to notation. (Contributed by FL, 17-May-2010.) |
Theorem | dmmpo 6154* | Domain of a class given by the maps-to notation. (Contributed by FL, 17-May-2010.) |
Theorem | mpofvexi 6155* | Sufficient condition for an operation maps-to notation to be set-like. (Contributed by Mario Carneiro, 3-Jul-2019.) |
Theorem | ovmpoelrn 6156* | An operation's value belongs to its range. (Contributed by AV, 27-Jan-2020.) |
Theorem | dmmpoga 6157* | Domain of an operation given by the maps-to notation, closed form of dmmpo 6154. (Contributed by Alexander van der Vekens, 10-Feb-2019.) |
Theorem | dmmpog 6158* | Domain of an operation given by the maps-to notation, closed form of dmmpo 6154. 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 6159* | Existence of an operation class abstraction (version for dependent domains). (Contributed by Mario Carneiro, 30-Dec-2016.) |
Theorem | mpoexg 6160* | Existence of an operation class abstraction (special case). (Contributed by FL, 17-May-2010.) (Revised by Mario Carneiro, 1-Sep-2015.) |
Theorem | mpoexga 6161* | 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 6162* | 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 6163* | 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 6164* | Composition of two functions. Variation of fmptco 5634 when the second function has two arguments. (Contributed by Mario Carneiro, 8-Feb-2015.) |
Theorem | oprabco 6165* | 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 6166* | Composition of operator abstractions. (Contributed by Jeff Madsen, 2-Sep-2009.) (Revised by David Abernethy, 23-Apr-2013.) |
Theorem | df1st2 6167* | An alternate possible definition of the function. (Contributed by NM, 14-Oct-2004.) (Revised by Mario Carneiro, 31-Aug-2015.) |
Theorem | df2nd2 6168* | An alternate possible definition of the function. (Contributed by NM, 10-Aug-2006.) (Revised by Mario Carneiro, 31-Aug-2015.) |
Theorem | 1stconst 6169 | The mapping of a restriction of the function to a constant function. (Contributed by NM, 14-Dec-2008.) |
Theorem | 2ndconst 6170 | The mapping of a restriction of the function to a converse constant function. (Contributed by NM, 27-Mar-2008.) |
Theorem | dfmpo 6171* | Alternate definition for the maps-to notation df-mpo 5830 (although it requires that be a set). (Contributed by NM, 19-Dec-2008.) (Revised by Mario Carneiro, 31-Aug-2015.) |
Theorem | cnvf1olem 6172 | Lemma for cnvf1o 6173. (Contributed by Mario Carneiro, 27-Apr-2014.) |
Theorem | cnvf1o 6173* | Describe a function that maps the elements of a set to its converse bijectively. (Contributed by Mario Carneiro, 27-Apr-2014.) |
Theorem | f2ndf 6174 | 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 6175 | 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 6176 | 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 6177 | Lemma for algrf and related theorems. (Contributed by Mario Carneiro, 28-May-2014.) (Revised by Mario Carneiro, 30-Apr-2015.) |
Theorem | algrflemg 6178 | Lemma for algrf 11926 and related theorems. (Contributed by Mario Carneiro, 28-May-2014.) (Revised by Jim Kingdon, 22-Jul-2021.) |
Theorem | xporderlem 6179* | Lemma for lexicographical ordering theorems. (Contributed by Scott Fenton, 16-Mar-2011.) |
Theorem | poxp 6180* | A lexicographical ordering of two posets. (Contributed by Scott Fenton, 16-Mar-2011.) (Revised by Mario Carneiro, 7-Mar-2013.) |
Theorem | spc2ed 6181* | Existential specialization with 2 quantifiers, using implicit substitution. (Contributed by Thierry Arnoux, 23-Aug-2017.) |
Theorem | cnvoprab 6182* | The converse of a class abstraction of nested ordered pairs. (Contributed by Thierry Arnoux, 17-Aug-2017.) |
Theorem | f1od2 6183* | Describe an implicit one-to-one onto function of two variables. (Contributed by Thierry Arnoux, 17-Aug-2017.) |
Theorem | disjxp1 6184* | 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 6185* | 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 5830) 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 5900, ovmpox 5950 and fmpox 6149). 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 6186* | Membership in a union of Cartesian products, using bound-variable hypothesis for instead of distinct variable conditions as in opeliunxp2 4727. (Contributed by AV, 25-Oct-2020.) |
Theorem | mpoxopn0yelv 6187* | 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 6188* | 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 6189* | 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 6190* | Properties of a pair in an extended binary relation. (Contributed by Alexander van der Vekens, 30-Oct-2017.) |
Theorem | rbropap 6191* | 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 6192 | The transposition of a function. |
tpos | ||
Definition | df-tpos 6193* | Define the transposition of a function, which is a function tpos satisfying . (Contributed by Mario Carneiro, 10-Sep-2015.) |
tpos | ||
Theorem | tposss 6194 | Subset theorem for transposition. (Contributed by Mario Carneiro, 10-Sep-2015.) |
tpos tpos | ||
Theorem | tposeq 6195 | Equality theorem for transposition. (Contributed by Mario Carneiro, 10-Sep-2015.) |
tpos tpos | ||
Theorem | tposeqd 6196 | Equality theorem for transposition. (Contributed by Mario Carneiro, 7-Jan-2017.) |
tpos tpos | ||
Theorem | tposssxp 6197 | The transposition is a subset of a cross product. (Contributed by Mario Carneiro, 12-Jan-2017.) |
tpos | ||
Theorem | reltpos 6198 | The transposition is a relation. (Contributed by Mario Carneiro, 10-Sep-2015.) |
tpos | ||
Theorem | brtpos2 6199 | Value of the transposition at a pair . (Contributed by Mario Carneiro, 10-Sep-2015.) |
tpos | ||
Theorem | brtpos0 6200 | 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 |
< Previous Next > |
Copyright terms: Public domain | < Previous Next > |