Home | Intuitionistic Logic Explorer Theorem List (p. 51 of 129) | < 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 | relrelss 5001 | Two ways to describe the structure of a two-place operation. (Contributed by NM, 17-Dec-2008.) |
Theorem | unielrel 5002 | The membership relation for a relation is inherited by class union. (Contributed by NM, 17-Sep-2006.) |
Theorem | relfld 5003 | The double union of a relation is its field. (Contributed by NM, 17-Sep-2006.) |
Theorem | relresfld 5004 | Restriction of a relation to its field. (Contributed by FL, 15-Apr-2012.) |
Theorem | relcoi2 5005 | Composition with the identity relation restricted to a relation's field. (Contributed by FL, 2-May-2011.) |
Theorem | relcoi1 5006 | Composition with the identity relation restricted to a relation's field. (Contributed by FL, 8-May-2011.) |
Theorem | unidmrn 5007 | The double union of the converse of a class is its field. (Contributed by NM, 4-Jun-2008.) |
Theorem | relcnvfld 5008 | if is a relation, its double union equals the double union of its converse. (Contributed by FL, 5-Jan-2009.) |
Theorem | dfdm2 5009 | Alternate definition of domain df-dm 4487 that doesn't require dummy variables. (Contributed by NM, 2-Aug-2010.) |
Theorem | unixpm 5010* | The double class union of an inhabited cross product is the union of its members. (Contributed by Jim Kingdon, 18-Dec-2018.) |
Theorem | unixp0im 5011 | The union of an empty cross product is empty. (Contributed by Jim Kingdon, 18-Dec-2018.) |
Theorem | cnvexg 5012 | The converse of a set is a set. Corollary 6.8(1) of [TakeutiZaring] p. 26. (Contributed by NM, 17-Mar-1998.) |
Theorem | cnvex 5013 | The converse of a set is a set. Corollary 6.8(1) of [TakeutiZaring] p. 26. (Contributed by NM, 19-Dec-2003.) |
Theorem | relcnvexb 5014 | A relation is a set iff its converse is a set. (Contributed by FL, 3-Mar-2007.) |
Theorem | ressn 5015 | Restriction of a class to a singleton. (Contributed by Mario Carneiro, 28-Dec-2014.) |
Theorem | cnviinm 5016* | The converse of an intersection is the intersection of the converse. (Contributed by Jim Kingdon, 18-Dec-2018.) |
Theorem | cnvpom 5017* | The converse of a partial order relation is a partial order relation. (Contributed by NM, 15-Jun-2005.) |
Theorem | cnvsom 5018* | The converse of a strict order relation is a strict order relation. (Contributed by Jim Kingdon, 19-Dec-2018.) |
Theorem | coexg 5019 | The composition of two sets is a set. (Contributed by NM, 19-Mar-1998.) |
Theorem | coex 5020 | The composition of two sets is a set. (Contributed by NM, 15-Dec-2003.) |
Theorem | xpcom 5021* | Composition of two cross products. (Contributed by Jim Kingdon, 20-Dec-2018.) |
Syntax | cio 5022 | Extend class notation with Russell's definition description binder (inverted iota). |
Theorem | iotajust 5023* | Soundness justification theorem for df-iota 5024. (Contributed by Andrew Salmon, 29-Jun-2011.) |
Definition | df-iota 5024* |
Define Russell's definition description binder, which can be read as
"the unique such that ," where ordinarily contains
as a free
variable. Our definition is meaningful only when there
is exactly one
such that is
true (see iotaval 5035);
otherwise, it evaluates to the empty set (see iotanul 5039). Russell used
the inverted iota symbol to represent the binder.
Sometimes proofs need to expand an iota-based definition. That is, given "X = the x for which ... x ... x ..." holds, the proof needs to get to "... X ... X ...". A general strategy to do this is to use iotacl 5047 (for unbounded iota). This can be easier than applying a version that applies an explicit substitution, because substituting an iota into its own property always has a bound variable clash which must be first renamed or else guarded with NF. (Contributed by Andrew Salmon, 30-Jun-2011.) |
Theorem | dfiota2 5025* | Alternate definition for descriptions. Definition 8.18 in [Quine] p. 56. (Contributed by Andrew Salmon, 30-Jun-2011.) |
Theorem | nfiota1 5026 | Bound-variable hypothesis builder for the class. (Contributed by Andrew Salmon, 11-Jul-2011.) (Revised by Mario Carneiro, 15-Oct-2016.) |
Theorem | nfiotadxy 5027* | Deduction version of nfiotaxy 5028. (Contributed by Jim Kingdon, 21-Dec-2018.) |
Theorem | nfiotaxy 5028* | Bound-variable hypothesis builder for the class. (Contributed by NM, 23-Aug-2011.) |
Theorem | cbviota 5029 | Change bound variables in a description binder. (Contributed by Andrew Salmon, 1-Aug-2011.) |
Theorem | cbviotav 5030* | Change bound variables in a description binder. (Contributed by Andrew Salmon, 1-Aug-2011.) |
Theorem | sb8iota 5031 | Variable substitution in description binder. Compare sb8eu 1973. (Contributed by NM, 18-Mar-2013.) |
Theorem | iotaeq 5032 | Equality theorem for descriptions. (Contributed by Andrew Salmon, 30-Jun-2011.) |
Theorem | iotabi 5033 | Equivalence theorem for descriptions. (Contributed by Andrew Salmon, 30-Jun-2011.) |
Theorem | uniabio 5034* | Part of Theorem 8.17 in [Quine] p. 56. This theorem serves as a lemma for the fundamental property of iota. (Contributed by Andrew Salmon, 11-Jul-2011.) |
Theorem | iotaval 5035* | Theorem 8.19 in [Quine] p. 57. This theorem is the fundamental property of iota. (Contributed by Andrew Salmon, 11-Jul-2011.) |
Theorem | iotauni 5036 | Equivalence between two different forms of . (Contributed by Andrew Salmon, 12-Jul-2011.) |
Theorem | iotaint 5037 | Equivalence between two different forms of . (Contributed by Mario Carneiro, 24-Dec-2016.) |
Theorem | iota1 5038 | Property of iota. (Contributed by NM, 23-Aug-2011.) (Revised by Mario Carneiro, 23-Dec-2016.) |
Theorem | iotanul 5039 | Theorem 8.22 in [Quine] p. 57. This theorem is the result if there isn't exactly one that satisfies . (Contributed by Andrew Salmon, 11-Jul-2011.) |
Theorem | euiotaex 5040 | Theorem 8.23 in [Quine] p. 58, with existential uniqueness condition added. This theorem proves the existence of the class under our definition. (Contributed by Jim Kingdon, 21-Dec-2018.) |
Theorem | iotass 5041* | Value of iota based on a proposition which holds only for values which are subsets of a given class. (Contributed by Mario Carneiro and Jim Kingdon, 21-Dec-2018.) |
Theorem | iota4 5042 | Theorem *14.22 in [WhiteheadRussell] p. 190. (Contributed by Andrew Salmon, 12-Jul-2011.) |
Theorem | iota4an 5043 | Theorem *14.23 in [WhiteheadRussell] p. 191. (Contributed by Andrew Salmon, 12-Jul-2011.) |
Theorem | iota5 5044* | A method for computing iota. (Contributed by NM, 17-Sep-2013.) |
Theorem | iotabidv 5045* | Formula-building deduction for iota. (Contributed by NM, 20-Aug-2011.) |
Theorem | iotabii 5046 | Formula-building deduction for iota. (Contributed by Mario Carneiro, 2-Oct-2015.) |
Theorem | iotacl 5047 |
Membership law for descriptions.
This can useful for expanding an unbounded iota-based definition (see df-iota 5024). (Contributed by Andrew Salmon, 1-Aug-2011.) |
Theorem | iota2df 5048 | A condition that allows us to represent "the unique element such that " with a class expression . (Contributed by NM, 30-Dec-2014.) |
Theorem | iota2d 5049* | A condition that allows us to represent "the unique element such that " with a class expression . (Contributed by NM, 30-Dec-2014.) |
Theorem | iota2 5050* | The unique element such that . (Contributed by Jeff Madsen, 1-Jun-2011.) (Revised by Mario Carneiro, 23-Dec-2016.) |
Theorem | sniota 5051 | A class abstraction with a unique member can be expressed as a singleton. (Contributed by Mario Carneiro, 23-Dec-2016.) |
Theorem | csbiotag 5052* | Class substitution within a description binder. (Contributed by Scott Fenton, 6-Oct-2017.) |
Syntax | wfun 5053 | Extend the definition of a wff to include the function predicate. (Read: is a function.) |
Syntax | wfn 5054 | Extend the definition of a wff to include the function predicate with a domain. (Read: is a function on .) |
Syntax | wf 5055 | Extend the definition of a wff to include the function predicate with domain and codomain. (Read: maps into .) |
Syntax | wf1 5056 | Extend the definition of a wff to include one-to-one functions. (Read: maps one-to-one into .) The notation ("1-1" above the arrow) is from Definition 6.15(5) of [TakeutiZaring] p. 27. |
Syntax | wfo 5057 | Extend the definition of a wff to include onto functions. (Read: maps onto .) The notation ("onto" below the arrow) is from Definition 6.15(4) of [TakeutiZaring] p. 27. |
Syntax | wf1o 5058 | Extend the definition of a wff to include one-to-one onto functions. (Read: maps one-to-one onto .) The notation ("1-1" above the arrow and "onto" below the arrow) is from Definition 6.15(6) of [TakeutiZaring] p. 27. |
Syntax | cfv 5059 | Extend the definition of a class to include the value of a function. (Read: The value of at , or " of .") |
Syntax | wiso 5060 | Extend the definition of a wff to include the isomorphism property. (Read: is an , isomorphism of onto .) |
Definition | df-fun 5061 | Define predicate that determines if some class is a function. Definition 10.1 of [Quine] p. 65. For example, the expression is true (funi 5091). This is not the same as defining a specific function's mapping, which is typically done using the format of cmpt 3929 with the maps-to notation (see df-mpt 3931). Contrast this predicate with the predicates to determine if some class is a function with a given domain (df-fn 5062), a function with a given domain and codomain (df-f 5063), a one-to-one function (df-f1 5064), an onto function (df-fo 5065), or a one-to-one onto function (df-f1o 5066). For alternate definitions, see dffun2 5069, dffun4 5070, dffun6 5073, dffun7 5086, dffun8 5087, and dffun9 5088. (Contributed by NM, 1-Aug-1994.) |
Definition | df-fn 5062 | Define a function with domain. Definition 6.15(1) of [TakeutiZaring] p. 27. (Contributed by NM, 1-Aug-1994.) |
Definition | df-f 5063 | Define a function (mapping) with domain and codomain. Definition 6.15(3) of [TakeutiZaring] p. 27. (Contributed by NM, 1-Aug-1994.) |
Definition | df-f1 5064 | Define a one-to-one function. Compare Definition 6.15(5) of [TakeutiZaring] p. 27. We use their notation ("1-1" above the arrow). (Contributed by NM, 1-Aug-1994.) |
Definition | df-fo 5065 | Define an onto function. Definition 6.15(4) of [TakeutiZaring] p. 27. We use their notation ("onto" under the arrow). (Contributed by NM, 1-Aug-1994.) |
Definition | df-f1o 5066 | Define a one-to-one onto function. Compare Definition 6.15(6) of [TakeutiZaring] p. 27. We use their notation ("1-1" above the arrow and "onto" below the arrow). (Contributed by NM, 1-Aug-1994.) |
Definition | df-fv 5067* | Define the value of a function, , also known as function application. For example, . Typically, function is defined using maps-to notation (see df-mpt 3931), but this is not required. For example, F = { 2 , 6 , 3 , 9 } -> ( F 3 ) = 9 . We will later define two-argument functions using ordered pairs as . This particular definition is quite convenient: it can be applied to any class and evaluates to the empty set when it is not meaningful. The left apostrophe notation originated with Peano and was adopted in Definition *30.01 of [WhiteheadRussell] p. 235, Definition 10.11 of [Quine] p. 68, and Definition 6.11 of [TakeutiZaring] p. 26. It means the same thing as the more familiar notation for a function's value at , i.e. " of ," but without context-dependent notational ambiguity. (Contributed by NM, 1-Aug-1994.) Revised to use . (Revised by Scott Fenton, 6-Oct-2017.) |
Definition | df-isom 5068* | Define the isomorphism predicate. We read this as " is an , isomorphism of onto ." Normally, and are ordering relations on and respectively. Definition 6.28 of [TakeutiZaring] p. 32, whose notation is the same as ours except that and are subscripts. (Contributed by NM, 4-Mar-1997.) |
Theorem | dffun2 5069* | Alternate definition of a function. (Contributed by NM, 29-Dec-1996.) |
Theorem | dffun4 5070* | Alternate definition of a function. Definition 6.4(4) of [TakeutiZaring] p. 24. (Contributed by NM, 29-Dec-1996.) |
Theorem | dffun5r 5071* | A way of proving a relation is a function, analogous to mo2r 2012. (Contributed by Jim Kingdon, 27-May-2020.) |
Theorem | dffun6f 5072* | Definition of function, using bound-variable hypotheses instead of distinct variable conditions. (Contributed by NM, 9-Mar-1995.) (Revised by Mario Carneiro, 15-Oct-2016.) |
Theorem | dffun6 5073* | Alternate definition of a function using "at most one" notation. (Contributed by NM, 9-Mar-1995.) |
Theorem | funmo 5074* | A function has at most one value for each argument. (Contributed by NM, 24-May-1998.) |
Theorem | dffun4f 5075* | Definition of function like dffun4 5070 but using bound-variable hypotheses instead of distinct variable conditions. (Contributed by Jim Kingdon, 17-Mar-2019.) |
Theorem | funrel 5076 | A function is a relation. (Contributed by NM, 1-Aug-1994.) |
Theorem | 0nelfun 5077 | A function does not contain the empty set. (Contributed by BJ, 26-Nov-2021.) |
Theorem | funss 5078 | Subclass theorem for function predicate. (Contributed by NM, 16-Aug-1994.) (Proof shortened by Mario Carneiro, 24-Jun-2014.) |
Theorem | funeq 5079 | Equality theorem for function predicate. (Contributed by NM, 16-Aug-1994.) |
Theorem | funeqi 5080 | Equality inference for the function predicate. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) |
Theorem | funeqd 5081 | Equality deduction for the function predicate. (Contributed by NM, 23-Feb-2013.) |
Theorem | nffun 5082 | Bound-variable hypothesis builder for a function. (Contributed by NM, 30-Jan-2004.) |
Theorem | sbcfung 5083 | Distribute proper substitution through the function predicate. (Contributed by Alexander van der Vekens, 23-Jul-2017.) |
Theorem | funeu 5084* | There is exactly one value of a function. (Contributed by NM, 22-Apr-2004.) (Proof shortened by Andrew Salmon, 17-Sep-2011.) |
Theorem | funeu2 5085* | There is exactly one value of a function. (Contributed by NM, 3-Aug-1994.) |
Theorem | dffun7 5086* | Alternate definition of a function. One possibility for the definition of a function in [Enderton] p. 42. (Enderton's definition is ambiguous because "there is only one" could mean either "there is at most one" or "there is exactly one." However, dffun8 5087 shows that it doesn't matter which meaning we pick.) (Contributed by NM, 4-Nov-2002.) |
Theorem | dffun8 5087* | Alternate definition of a function. One possibility for the definition of a function in [Enderton] p. 42. Compare dffun7 5086. (Contributed by NM, 4-Nov-2002.) (Proof shortened by Andrew Salmon, 17-Sep-2011.) |
Theorem | dffun9 5088* | Alternate definition of a function. (Contributed by NM, 28-Mar-2007.) (Revised by NM, 16-Jun-2017.) |
Theorem | funfn 5089 | An equivalence for the function predicate. (Contributed by NM, 13-Aug-2004.) |
Theorem | funfnd 5090 | A function is a function over its domain. (Contributed by Glauco Siliprandi, 23-Oct-2021.) |
Theorem | funi 5091 | The identity relation is a function. Part of Theorem 10.4 of [Quine] p. 65. (Contributed by NM, 30-Apr-1998.) |
Theorem | nfunv 5092 | The universe is not a function. (Contributed by Raph Levien, 27-Jan-2004.) |
Theorem | funopg 5093 | A Kuratowski ordered pair is a function only if its components are equal. (Contributed by NM, 5-Jun-2008.) (Revised by Mario Carneiro, 26-Apr-2015.) |
Theorem | funopab 5094* | A class of ordered pairs is a function when there is at most one second member for each pair. (Contributed by NM, 16-May-1995.) |
Theorem | funopabeq 5095* | A class of ordered pairs of values is a function. (Contributed by NM, 14-Nov-1995.) |
Theorem | funopab4 5096* | A class of ordered pairs of values in the form used by df-mpt 3931 is a function. (Contributed by NM, 17-Feb-2013.) |
Theorem | funmpt 5097 | A function in maps-to notation is a function. (Contributed by Mario Carneiro, 13-Jan-2013.) |
Theorem | funmpt2 5098 | Functionality of a class given by a maps-to notation. (Contributed by FL, 17-Feb-2008.) (Revised by Mario Carneiro, 31-May-2014.) |
Theorem | funco 5099 | The composition of two functions is a function. Exercise 29 of [TakeutiZaring] p. 25. (Contributed by NM, 26-Jan-1997.) (Proof shortened by Andrew Salmon, 17-Sep-2011.) |
Theorem | funres 5100 | A restriction of a function is a function. Compare Exercise 18 of [TakeutiZaring] p. 25. (Contributed by NM, 16-Aug-1994.) |
< Previous Next > |
Copyright terms: Public domain | < Previous Next > |