Theorem List for Intuitionistic Logic Explorer - 6601-6700 *Has distinct variable
group(s)
Type | Label | Description |
Statement |
|
Theorem | erovlem 6601* |
Lemma for eroprf 6602. (Contributed by Jeff Madsen, 10-Jun-2010.)
(Revised by Mario Carneiro, 30-Dec-2014.)
|
|
|
Theorem | eroprf 6602* |
Functionality of an operation defined on equivalence classes.
(Contributed by Jeff Madsen, 10-Jun-2010.) (Revised by Mario Carneiro,
30-Dec-2014.)
|
|
|
Theorem | eroprf2 6603* |
Functionality of an operation defined on equivalence classes.
(Contributed by Jeff Madsen, 10-Jun-2010.)
|
|
|
Theorem | ecopoveq 6604* |
This is the first of several theorems about equivalence relations of
the kind used in construction of fractions and signed reals, involving
operations on equivalent classes of ordered pairs. This theorem
expresses the relation (specified by the hypothesis) in terms
of its operation . (Contributed by NM, 16-Aug-1995.)
|
|
|
Theorem | ecopovsym 6605* |
Assuming the operation is commutative, show that the relation
,
specified by the first hypothesis, is symmetric.
(Contributed by NM, 27-Aug-1995.) (Revised by Mario Carneiro,
26-Apr-2015.)
|
|
|
Theorem | ecopovtrn 6606* |
Assuming that operation is commutative (second hypothesis),
closed (third hypothesis), associative (fourth hypothesis), and has
the cancellation property (fifth hypothesis), show that the relation
,
specified by the first hypothesis, is transitive.
(Contributed by NM, 11-Feb-1996.) (Revised by Mario Carneiro,
26-Apr-2015.)
|
|
|
Theorem | ecopover 6607* |
Assuming that operation is commutative (second hypothesis),
closed (third hypothesis), associative (fourth hypothesis), and has
the cancellation property (fifth hypothesis), show that the relation
,
specified by the first hypothesis, is an equivalence
relation. (Contributed by NM, 16-Feb-1996.) (Revised by Mario
Carneiro, 12-Aug-2015.)
|
|
|
Theorem | ecopovsymg 6608* |
Assuming the operation is commutative, show that the relation
,
specified by the first hypothesis, is symmetric.
(Contributed by Jim Kingdon, 1-Sep-2019.)
|
|
|
Theorem | ecopovtrng 6609* |
Assuming that operation is commutative (second hypothesis),
closed (third hypothesis), associative (fourth hypothesis), and has
the cancellation property (fifth hypothesis), show that the relation
,
specified by the first hypothesis, is transitive.
(Contributed by Jim Kingdon, 1-Sep-2019.)
|
|
|
Theorem | ecopoverg 6610* |
Assuming that operation is commutative (second hypothesis),
closed (third hypothesis), associative (fourth hypothesis), and has
the cancellation property (fifth hypothesis), show that the relation
,
specified by the first hypothesis, is an equivalence
relation. (Contributed by Jim Kingdon, 1-Sep-2019.)
|
|
|
Theorem | th3qlem1 6611* |
Lemma for Exercise 44 version of Theorem 3Q of [Enderton] p. 60. The
third hypothesis is the compatibility assumption. (Contributed by NM,
3-Aug-1995.) (Revised by Mario Carneiro, 9-Jul-2014.)
|
|
|
Theorem | th3qlem2 6612* |
Lemma for Exercise 44 version of Theorem 3Q of [Enderton] p. 60,
extended to operations on ordered pairs. The fourth hypothesis is the
compatibility assumption. (Contributed by NM, 4-Aug-1995.) (Revised by
Mario Carneiro, 12-Aug-2015.)
|
|
|
Theorem | th3qcor 6613* |
Corollary of Theorem 3Q of [Enderton] p. 60.
(Contributed by NM,
12-Nov-1995.) (Revised by David Abernethy, 4-Jun-2013.)
|
|
|
Theorem | th3q 6614* |
Theorem 3Q of [Enderton] p. 60, extended to
operations on ordered
pairs. (Contributed by NM, 4-Aug-1995.) (Revised by Mario Carneiro,
19-Dec-2013.)
|
|
|
Theorem | oviec 6615* |
Express an operation on equivalence classes of ordered pairs in terms of
equivalence class of operations on ordered pairs. See iset.mm for
additional comments describing the hypotheses. (Unnecessary distinct
variable restrictions were removed by David Abernethy, 4-Jun-2013.)
(Contributed by NM, 6-Aug-1995.) (Revised by Mario Carneiro,
4-Jun-2013.)
|
|
|
Theorem | ecovcom 6616* |
Lemma used to transfer a commutative law via an equivalence relation.
Most uses will want ecovicom 6617 instead. (Contributed by NM,
29-Aug-1995.) (Revised by David Abernethy, 4-Jun-2013.)
|
|
|
Theorem | ecovicom 6617* |
Lemma used to transfer a commutative law via an equivalence relation.
(Contributed by Jim Kingdon, 15-Sep-2019.)
|
|
|
Theorem | ecovass 6618* |
Lemma used to transfer an associative law via an equivalence relation.
In most cases ecoviass 6619 will be more useful. (Contributed by NM,
31-Aug-1995.) (Revised by David Abernethy, 4-Jun-2013.)
|
|
|
Theorem | ecoviass 6619* |
Lemma used to transfer an associative law via an equivalence relation.
(Contributed by Jim Kingdon, 16-Sep-2019.)
|
|
|
Theorem | ecovdi 6620* |
Lemma used to transfer a distributive law via an equivalence relation.
Most likely ecovidi 6621 will be more helpful. (Contributed by NM,
2-Sep-1995.) (Revised by David Abernethy, 4-Jun-2013.)
|
|
|
Theorem | ecovidi 6621* |
Lemma used to transfer a distributive law via an equivalence relation.
(Contributed by Jim Kingdon, 17-Sep-2019.)
|
|
|
2.6.26 The mapping operation
|
|
Syntax | cmap 6622 |
Extend the definition of a class to include the mapping operation. (Read
for , "the set of all functions that map
from to
.)
|
|
|
Syntax | cpm 6623 |
Extend the definition of a class to include the partial mapping operation.
(Read for , "the set of all partial functions
that map from
to .)
|
|
|
Definition | df-map 6624* |
Define the mapping operation or set exponentiation. The set of all
functions that map from to is
written (see
mapval 6634). Many authors write followed by as a superscript
for this operation and rely on context to avoid confusion other
exponentiation operations (e.g., Definition 10.42 of [TakeutiZaring]
p. 95). Other authors show as a prefixed superscript, which is
read " pre
" (e.g.,
definition of [Enderton] p. 52).
Definition 8.21 of [Eisenberg] p. 125
uses the notation Map(,
) for our . The up-arrow is used by
Donald Knuth
for iterated exponentiation (Science 194, 1235-1242, 1976). We
adopt
the first case of his notation (simple exponentiation) and subscript it
with m to distinguish it from other kinds of exponentiation.
(Contributed by NM, 8-Dec-2003.)
|
|
|
Definition | df-pm 6625* |
Define the partial mapping operation. A partial function from to
is a function
from a subset of to
. The set of all
partial functions from to is
written (see
pmvalg 6633). A notation for this operation apparently
does not appear in
the literature. We use to distinguish it from the less general
set exponentiation operation (df-map 6624) . See mapsspm 6656 for
its relationship to set exponentiation. (Contributed by NM,
15-Nov-2007.)
|
|
|
Theorem | mapprc 6626* |
When is a proper
class, the class of all functions mapping
to is empty.
Exercise 4.41 of [Mendelson] p. 255.
(Contributed
by NM, 8-Dec-2003.)
|
|
|
Theorem | pmex 6627* |
The class of all partial functions from one set to another is a set.
(Contributed by NM, 15-Nov-2007.)
|
|
|
Theorem | mapex 6628* |
The class of all functions mapping one set to another is a set. Remark
after Definition 10.24 of [Kunen] p. 31.
(Contributed by Raph Levien,
4-Dec-2003.)
|
|
|
Theorem | fnmap 6629 |
Set exponentiation has a universal domain. (Contributed by NM,
8-Dec-2003.) (Revised by Mario Carneiro, 8-Sep-2013.)
|
|
|
Theorem | fnpm 6630 |
Partial function exponentiation has a universal domain. (Contributed by
Mario Carneiro, 14-Nov-2013.)
|
|
|
Theorem | reldmmap 6631 |
Set exponentiation is a well-behaved binary operator. (Contributed by
Stefan O'Rear, 27-Feb-2015.)
|
|
|
Theorem | mapvalg 6632* |
The value of set exponentiation. is the set of all
functions that map from to .
Definition 10.24 of [Kunen]
p. 24. (Contributed by NM, 8-Dec-2003.) (Revised by Mario Carneiro,
8-Sep-2013.)
|
|
|
Theorem | pmvalg 6633* |
The value of the partial mapping operation.
is the set
of all partial functions that map from to . (Contributed by
NM, 15-Nov-2007.) (Revised by Mario Carneiro, 8-Sep-2013.)
|
|
|
Theorem | mapval 6634* |
The value of set exponentiation (inference version). is
the set of all functions that map from to . Definition
10.24 of [Kunen] p. 24. (Contributed by
NM, 8-Dec-2003.)
|
|
|
Theorem | elmapg 6635 |
Membership relation for set exponentiation. (Contributed by NM,
17-Oct-2006.) (Revised by Mario Carneiro, 15-Nov-2014.)
|
|
|
Theorem | elmapd 6636 |
Deduction form of elmapg 6635. (Contributed by BJ, 11-Apr-2020.)
|
|
|
Theorem | mapdm0 6637 |
The empty set is the only map with empty domain. (Contributed by Glauco
Siliprandi, 11-Oct-2020.) (Proof shortened by Thierry Arnoux,
3-Dec-2021.)
|
|
|
Theorem | elpmg 6638 |
The predicate "is a partial function". (Contributed by Mario
Carneiro,
14-Nov-2013.)
|
|
|
Theorem | elpm2g 6639 |
The predicate "is a partial function". (Contributed by NM,
31-Dec-2013.)
|
|
|
Theorem | elpm2r 6640 |
Sufficient condition for being a partial function. (Contributed by NM,
31-Dec-2013.)
|
|
|
Theorem | elpmi 6641 |
A partial function is a function. (Contributed by Mario Carneiro,
15-Sep-2015.)
|
|
|
Theorem | pmfun 6642 |
A partial function is a function. (Contributed by Mario Carneiro,
30-Jan-2014.) (Revised by Mario Carneiro, 26-Apr-2015.)
|
|
|
Theorem | elmapex 6643 |
Eliminate antecedent for mapping theorems: domain can be taken to be a
set. (Contributed by Stefan O'Rear, 8-Oct-2014.)
|
|
|
Theorem | elmapi 6644 |
A mapping is a function, forward direction only with superfluous
antecedent removed. (Contributed by Stefan O'Rear, 10-Oct-2014.)
|
|
|
Theorem | elmapfn 6645 |
A mapping is a function with the appropriate domain. (Contributed by AV,
6-Apr-2019.)
|
|
|
Theorem | elmapfun 6646 |
A mapping is always a function. (Contributed by Stefan O'Rear,
9-Oct-2014.) (Revised by Stefan O'Rear, 5-May-2015.)
|
|
|
Theorem | elmapssres 6647 |
A restricted mapping is a mapping. (Contributed by Stefan O'Rear,
9-Oct-2014.) (Revised by Mario Carneiro, 5-May-2015.)
|
|
|
Theorem | fpmg 6648 |
A total function is a partial function. (Contributed by Mario Carneiro,
31-Dec-2013.)
|
|
|
Theorem | pmss12g 6649 |
Subset relation for the set of partial functions. (Contributed by Mario
Carneiro, 31-Dec-2013.)
|
|
|
Theorem | pmresg 6650 |
Elementhood of a restricted function in the set of partial functions.
(Contributed by Mario Carneiro, 31-Dec-2013.)
|
|
|
Theorem | elmap 6651 |
Membership relation for set exponentiation. (Contributed by NM,
8-Dec-2003.)
|
|
|
Theorem | mapval2 6652* |
Alternate expression for the value of set exponentiation. (Contributed
by NM, 3-Nov-2007.)
|
|
|
Theorem | elpm 6653 |
The predicate "is a partial function". (Contributed by NM,
15-Nov-2007.) (Revised by Mario Carneiro, 14-Nov-2013.)
|
|
|
Theorem | elpm2 6654 |
The predicate "is a partial function". (Contributed by NM,
15-Nov-2007.) (Revised by Mario Carneiro, 31-Dec-2013.)
|
|
|
Theorem | fpm 6655 |
A total function is a partial function. (Contributed by NM,
15-Nov-2007.) (Revised by Mario Carneiro, 31-Dec-2013.)
|
|
|
Theorem | mapsspm 6656 |
Set exponentiation is a subset of partial maps. (Contributed by NM,
15-Nov-2007.) (Revised by Mario Carneiro, 27-Feb-2016.)
|
|
|
Theorem | pmsspw 6657 |
Partial maps are a subset of the power set of the Cartesian product of
its arguments. (Contributed by Mario Carneiro, 2-Jan-2017.)
|
|
|
Theorem | mapsspw 6658 |
Set exponentiation is a subset of the power set of the Cartesian product
of its arguments. (Contributed by NM, 8-Dec-2006.) (Revised by Mario
Carneiro, 26-Apr-2015.)
|
|
|
Theorem | fvmptmap 6659* |
Special case of fvmpt 5571 for operator theorems. (Contributed by NM,
27-Nov-2007.)
|
|
|
Theorem | map0e 6660 |
Set exponentiation with an empty exponent (ordinal number 0) is ordinal
number 1. Exercise 4.42(a) of [Mendelson] p. 255. (Contributed by NM,
10-Dec-2003.) (Revised by Mario Carneiro, 30-Apr-2015.)
|
|
|
Theorem | map0b 6661 |
Set exponentiation with an empty base is the empty set, provided the
exponent is nonempty. Theorem 96 of [Suppes] p. 89. (Contributed by
NM, 10-Dec-2003.) (Revised by Mario Carneiro, 26-Apr-2015.)
|
|
|
Theorem | map0g 6662 |
Set exponentiation is empty iff the base is empty and the exponent is
not empty. Theorem 97 of [Suppes] p. 89.
(Contributed by Mario
Carneiro, 30-Apr-2015.)
|
|
|
Theorem | map0 6663 |
Set exponentiation is empty iff the base is empty and the exponent is
not empty. Theorem 97 of [Suppes] p. 89.
(Contributed by NM,
10-Dec-2003.)
|
|
|
Theorem | mapsn 6664* |
The value of set exponentiation with a singleton exponent. Theorem 98
of [Suppes] p. 89. (Contributed by NM,
10-Dec-2003.)
|
|
|
Theorem | mapss 6665 |
Subset inheritance for set exponentiation. Theorem 99 of [Suppes]
p. 89. (Contributed by NM, 10-Dec-2003.) (Revised by Mario Carneiro,
26-Apr-2015.)
|
|
|
Theorem | fdiagfn 6666* |
Functionality of the diagonal map. (Contributed by Stefan O'Rear,
24-Jan-2015.)
|
|
|
Theorem | fvdiagfn 6667* |
Functionality of the diagonal map. (Contributed by Stefan O'Rear,
24-Jan-2015.)
|
|
|
Theorem | mapsnconst 6668 |
Every singleton map is a constant function. (Contributed by Stefan
O'Rear, 25-Mar-2015.)
|
|
|
Theorem | mapsncnv 6669* |
Expression for the inverse of the canonical map between a set and its
set of singleton functions. (Contributed by Stefan O'Rear,
21-Mar-2015.)
|
|
|
Theorem | mapsnf1o2 6670* |
Explicit bijection between a set and its singleton functions.
(Contributed by Stefan O'Rear, 21-Mar-2015.)
|
|
|
Theorem | mapsnf1o3 6671* |
Explicit bijection in the reverse of mapsnf1o2 6670. (Contributed by
Stefan O'Rear, 24-Mar-2015.)
|
|
|
2.6.27 Infinite Cartesian products
|
|
Syntax | cixp 6672 |
Extend class notation to include infinite Cartesian products.
|
|
|
Definition | df-ixp 6673* |
Definition of infinite Cartesian product of [Enderton] p. 54. Enderton
uses a bold "X" with
written underneath or
as a subscript, as
does Stoll p. 47. Some books use a capital pi, but we will reserve that
notation for products of numbers. Usually represents a class
expression containing free and thus can be thought of as
. Normally,
is not free in ,
although this is
not a requirement of the definition. (Contributed by NM,
28-Sep-2006.)
|
|
|
Theorem | dfixp 6674* |
Eliminate the expression in df-ixp 6673, under the
assumption that and are
disjoint. This way, we can say that
is bound in
even if it
appears free in .
(Contributed by Mario Carneiro, 12-Aug-2016.)
|
|
|
Theorem | ixpsnval 6675* |
The value of an infinite Cartesian product with a singleton.
(Contributed by AV, 3-Dec-2018.)
|
|
|
Theorem | elixp2 6676* |
Membership in an infinite Cartesian product. See df-ixp 6673 for
discussion of the notation. (Contributed by NM, 28-Sep-2006.)
|
|
|
Theorem | fvixp 6677* |
Projection of a factor of an indexed Cartesian product. (Contributed by
Mario Carneiro, 11-Jun-2016.)
|
|
|
Theorem | ixpfn 6678* |
A nuple is a function. (Contributed by FL, 6-Jun-2011.) (Revised by
Mario Carneiro, 31-May-2014.)
|
|
|
Theorem | elixp 6679* |
Membership in an infinite Cartesian product. (Contributed by NM,
28-Sep-2006.)
|
|
|
Theorem | elixpconst 6680* |
Membership in an infinite Cartesian product of a constant .
(Contributed by NM, 12-Apr-2008.)
|
|
|
Theorem | ixpconstg 6681* |
Infinite Cartesian product of a constant . (Contributed by Mario
Carneiro, 11-Jan-2015.)
|
|
|
Theorem | ixpconst 6682* |
Infinite Cartesian product of a constant . (Contributed by NM,
28-Sep-2006.)
|
|
|
Theorem | ixpeq1 6683* |
Equality theorem for infinite Cartesian product. (Contributed by NM,
29-Sep-2006.)
|
|
|
Theorem | ixpeq1d 6684* |
Equality theorem for infinite Cartesian product. (Contributed by Mario
Carneiro, 11-Jun-2016.)
|
|
|
Theorem | ss2ixp 6685 |
Subclass theorem for infinite Cartesian product. (Contributed by NM,
29-Sep-2006.) (Revised by Mario Carneiro, 12-Aug-2016.)
|
|
|
Theorem | ixpeq2 6686 |
Equality theorem for infinite Cartesian product. (Contributed by NM,
29-Sep-2006.)
|
|
|
Theorem | ixpeq2dva 6687* |
Equality theorem for infinite Cartesian product. (Contributed by Mario
Carneiro, 11-Jun-2016.)
|
|
|
Theorem | ixpeq2dv 6688* |
Equality theorem for infinite Cartesian product. (Contributed by Mario
Carneiro, 11-Jun-2016.)
|
|
|
Theorem | cbvixp 6689* |
Change bound variable in an indexed Cartesian product. (Contributed by
Jeff Madsen, 20-Jun-2011.)
|
|
|
Theorem | cbvixpv 6690* |
Change bound variable in an indexed Cartesian product. (Contributed by
Jeff Madsen, 2-Sep-2009.)
|
|
|
Theorem | nfixpxy 6691* |
Bound-variable hypothesis builder for indexed Cartesian product.
(Contributed by Mario Carneiro, 15-Oct-2016.) (Revised by Jim Kingdon,
15-Feb-2023.)
|
|
|
Theorem | nfixp1 6692 |
The index variable in an indexed Cartesian product is not free.
(Contributed by Jeff Madsen, 19-Jun-2011.) (Revised by Mario Carneiro,
15-Oct-2016.)
|
|
|
Theorem | ixpprc 6693* |
A cartesian product of proper-class many sets is empty, because any
function in the cartesian product has to be a set with domain ,
which is not possible for a proper class domain. (Contributed by Mario
Carneiro, 25-Jan-2015.)
|
|
|
Theorem | ixpf 6694* |
A member of an infinite Cartesian product maps to the indexed union of
the product argument. Remark in [Enderton] p. 54. (Contributed by NM,
28-Sep-2006.)
|
|
|
Theorem | uniixp 6695* |
The union of an infinite Cartesian product is included in a Cartesian
product. (Contributed by NM, 28-Sep-2006.) (Revised by Mario Carneiro,
24-Jun-2015.)
|
|
|
Theorem | ixpexgg 6696* |
The existence of an infinite Cartesian product. is normally a
free-variable parameter in . Remark in Enderton p. 54.
(Contributed by NM, 28-Sep-2006.) (Revised by Jim Kingdon,
15-Feb-2023.)
|
|
|
Theorem | ixpin 6697* |
The intersection of two infinite Cartesian products. (Contributed by
Mario Carneiro, 3-Feb-2015.)
|
|
|
Theorem | ixpiinm 6698* |
The indexed intersection of a collection of infinite Cartesian products.
(Contributed by Mario Carneiro, 6-Feb-2015.) (Revised by Jim Kingdon,
15-Feb-2023.)
|
|
|
Theorem | ixpintm 6699* |
The intersection of a collection of infinite Cartesian products.
(Contributed by Mario Carneiro, 3-Feb-2015.) (Revised by Jim Kingdon,
15-Feb-2023.)
|
|
|
Theorem | ixp0x 6700 |
An infinite Cartesian product with an empty index set. (Contributed by
NM, 21-Sep-2007.)
|
|