Theorem List for Intuitionistic Logic Explorer - 3901-4000 *Has distinct variable
group(s)
Type | Label | Description |
Statement |
|
Theorem | nfiunya 3901* |
Bound-variable hypothesis builder for indexed union. (Contributed by
Mario Carneiro, 25-Jan-2014.)
|
|
|
Theorem | nfiinya 3902* |
Bound-variable hypothesis builder for indexed intersection.
(Contributed by Mario Carneiro, 25-Jan-2014.)
|
|
|
Theorem | nfiu1 3903 |
Bound-variable hypothesis builder for indexed union. (Contributed by
NM, 12-Oct-2003.)
|
|
|
Theorem | nfii1 3904 |
Bound-variable hypothesis builder for indexed intersection.
(Contributed by NM, 15-Oct-2003.)
|
|
|
Theorem | dfiun2g 3905* |
Alternate definition of indexed union when is a set. Definition
15(a) of [Suppes] p. 44. (Contributed by
NM, 23-Mar-2006.) (Proof
shortened by Andrew Salmon, 25-Jul-2011.)
|
|
|
Theorem | dfiin2g 3906* |
Alternate definition of indexed intersection when is a set.
(Contributed by Jeff Hankins, 27-Aug-2009.)
|
|
|
Theorem | dfiun2 3907* |
Alternate definition of indexed union when is a set. Definition
15(a) of [Suppes] p. 44. (Contributed by
NM, 27-Jun-1998.) (Revised by
David Abernethy, 19-Jun-2012.)
|
|
|
Theorem | dfiin2 3908* |
Alternate definition of indexed intersection when is a set.
Definition 15(b) of [Suppes] p. 44.
(Contributed by NM, 28-Jun-1998.)
(Proof shortened by Andrew Salmon, 25-Jul-2011.)
|
|
|
Theorem | dfiunv2 3909* |
Define double indexed union. (Contributed by FL, 6-Nov-2013.)
|
|
|
Theorem | cbviun 3910* |
Rule used to change the bound variables in an indexed union, with the
substitution specified implicitly by the hypothesis. (Contributed by
NM, 26-Mar-2006.) (Revised by Andrew Salmon, 25-Jul-2011.)
|
|
|
Theorem | cbviin 3911* |
Change bound variables in an indexed intersection. (Contributed by Jeff
Hankins, 26-Aug-2009.) (Revised by Mario Carneiro, 14-Oct-2016.)
|
|
|
Theorem | cbviunv 3912* |
Rule used to change the bound variables in an indexed union, with the
substitution specified implicitly by the hypothesis. (Contributed by
NM, 15-Sep-2003.)
|
|
|
Theorem | cbviinv 3913* |
Change bound variables in an indexed intersection. (Contributed by Jeff
Hankins, 26-Aug-2009.)
|
|
|
Theorem | iunss 3914* |
Subset theorem for an indexed union. (Contributed by NM, 13-Sep-2003.)
(Proof shortened by Andrew Salmon, 25-Jul-2011.)
|
|
|
Theorem | ssiun 3915* |
Subset implication for an indexed union. (Contributed by NM,
3-Sep-2003.) (Proof shortened by Andrew Salmon, 25-Jul-2011.)
|
|
|
Theorem | ssiun2 3916 |
Identity law for subset of an indexed union. (Contributed by NM,
12-Oct-2003.) (Proof shortened by Andrew Salmon, 25-Jul-2011.)
|
|
|
Theorem | ssiun2s 3917* |
Subset relationship for an indexed union. (Contributed by NM,
26-Oct-2003.)
|
|
|
Theorem | iunss2 3918* |
A subclass condition on the members of two indexed classes
and that implies a subclass relation on their indexed
unions. Generalization of Proposition 8.6 of [TakeutiZaring] p. 59.
Compare uniss2 3827. (Contributed by NM, 9-Dec-2004.)
|
|
|
Theorem | iunab 3919* |
The indexed union of a class abstraction. (Contributed by NM,
27-Dec-2004.)
|
|
|
Theorem | iunrab 3920* |
The indexed union of a restricted class abstraction. (Contributed by
NM, 3-Jan-2004.) (Proof shortened by Mario Carneiro, 14-Nov-2016.)
|
|
|
Theorem | iunxdif2 3921* |
Indexed union with a class difference as its index. (Contributed by NM,
10-Dec-2004.)
|
|
|
Theorem | ssiinf 3922 |
Subset theorem for an indexed intersection. (Contributed by FL,
15-Oct-2012.) (Proof shortened by Mario Carneiro, 14-Oct-2016.)
|
|
|
Theorem | ssiin 3923* |
Subset theorem for an indexed intersection. (Contributed by NM,
15-Oct-2003.)
|
|
|
Theorem | iinss 3924* |
Subset implication for an indexed intersection. (Contributed by NM,
15-Oct-2003.) (Proof shortened by Andrew Salmon, 25-Jul-2011.)
|
|
|
Theorem | iinss2 3925 |
An indexed intersection is included in any of its members. (Contributed
by FL, 15-Oct-2012.)
|
|
|
Theorem | uniiun 3926* |
Class union in terms of indexed union. Definition in [Stoll] p. 43.
(Contributed by NM, 28-Jun-1998.)
|
|
|
Theorem | intiin 3927* |
Class intersection in terms of indexed intersection. Definition in
[Stoll] p. 44. (Contributed by NM,
28-Jun-1998.)
|
|
|
Theorem | iunid 3928* |
An indexed union of singletons recovers the index set. (Contributed by
NM, 6-Sep-2005.)
|
|
|
Theorem | iun0 3929 |
An indexed union of the empty set is empty. (Contributed by NM,
26-Mar-2003.) (Proof shortened by Andrew Salmon, 25-Jul-2011.)
|
|
|
Theorem | 0iun 3930 |
An empty indexed union is empty. (Contributed by NM, 4-Dec-2004.)
(Proof shortened by Andrew Salmon, 25-Jul-2011.)
|
|
|
Theorem | 0iin 3931 |
An empty indexed intersection is the universal class. (Contributed by
NM, 20-Oct-2005.)
|
|
|
Theorem | viin 3932* |
Indexed intersection with a universal index class. (Contributed by NM,
11-Sep-2008.)
|
|
|
Theorem | iunn0m 3933* |
There is an inhabited class in an indexed collection iff the
indexed union of them is inhabited. (Contributed by Jim Kingdon,
16-Aug-2018.)
|
|
|
Theorem | iinab 3934* |
Indexed intersection of a class builder. (Contributed by NM,
6-Dec-2011.)
|
|
|
Theorem | iinrabm 3935* |
Indexed intersection of a restricted class builder. (Contributed by Jim
Kingdon, 16-Aug-2018.)
|
|
|
Theorem | iunin2 3936* |
Indexed union of intersection. Generalization of half of theorem
"Distributive laws" in [Enderton] p. 30. Use uniiun 3926 to recover
Enderton's theorem. (Contributed by NM, 26-Mar-2004.)
|
|
|
Theorem | iunin1 3937* |
Indexed union of intersection. Generalization of half of theorem
"Distributive laws" in [Enderton] p. 30. Use uniiun 3926 to recover
Enderton's theorem. (Contributed by Mario Carneiro, 30-Aug-2015.)
|
|
|
Theorem | iundif2ss 3938* |
Indexed union of class difference. Compare to theorem "De Morgan's
laws" in [Enderton] p. 31.
(Contributed by Jim Kingdon,
17-Aug-2018.)
|
|
|
Theorem | 2iunin 3939* |
Rearrange indexed unions over intersection. (Contributed by NM,
18-Dec-2008.)
|
|
|
Theorem | iindif2m 3940* |
Indexed intersection of class difference. Compare to Theorem "De
Morgan's laws" in [Enderton] p.
31. (Contributed by Jim Kingdon,
17-Aug-2018.)
|
|
|
Theorem | iinin2m 3941* |
Indexed intersection of intersection. Compare to Theorem "Distributive
laws" in [Enderton] p. 30.
(Contributed by Jim Kingdon,
17-Aug-2018.)
|
|
|
Theorem | iinin1m 3942* |
Indexed intersection of intersection. Compare to Theorem "Distributive
laws" in [Enderton] p. 30.
(Contributed by Jim Kingdon,
17-Aug-2018.)
|
|
|
Theorem | elriin 3943* |
Elementhood in a relative intersection. (Contributed by Mario Carneiro,
30-Dec-2016.)
|
|
|
Theorem | riin0 3944* |
Relative intersection of an empty family. (Contributed by Stefan
O'Rear, 3-Apr-2015.)
|
|
|
Theorem | riinm 3945* |
Relative intersection of an inhabited family. (Contributed by Jim
Kingdon, 19-Aug-2018.)
|
|
|
Theorem | iinxsng 3946* |
A singleton index picks out an instance of an indexed intersection's
argument. (Contributed by NM, 15-Jan-2012.) (Proof shortened by Mario
Carneiro, 17-Nov-2016.)
|
|
|
Theorem | iinxprg 3947* |
Indexed intersection with an unordered pair index. (Contributed by NM,
25-Jan-2012.)
|
|
|
Theorem | iunxsng 3948* |
A singleton index picks out an instance of an indexed union's argument.
(Contributed by Mario Carneiro, 25-Jun-2016.)
|
|
|
Theorem | iunxsn 3949* |
A singleton index picks out an instance of an indexed union's argument.
(Contributed by NM, 26-Mar-2004.) (Proof shortened by Mario Carneiro,
25-Jun-2016.)
|
|
|
Theorem | iunxsngf 3950* |
A singleton index picks out an instance of an indexed union's argument.
(Contributed by Mario Carneiro, 25-Jun-2016.) (Revised by Thierry
Arnoux, 2-May-2020.)
|
|
|
Theorem | iunun 3951 |
Separate a union in an indexed union. (Contributed by NM, 27-Dec-2004.)
(Proof shortened by Mario Carneiro, 17-Nov-2016.)
|
|
|
Theorem | iunxun 3952 |
Separate a union in the index of an indexed union. (Contributed by NM,
26-Mar-2004.) (Proof shortened by Mario Carneiro, 17-Nov-2016.)
|
|
|
Theorem | iunxprg 3953* |
A pair index picks out two instances of an indexed union's argument.
(Contributed by Alexander van der Vekens, 2-Feb-2018.)
|
|
|
Theorem | iunxiun 3954* |
Separate an indexed union in the index of an indexed union.
(Contributed by Mario Carneiro, 5-Dec-2016.)
|
|
|
Theorem | iinuniss 3955* |
A relationship involving union and indexed intersection. Exercise 23 of
[Enderton] p. 33 but with equality
changed to subset. (Contributed by
Jim Kingdon, 19-Aug-2018.)
|
|
|
Theorem | iununir 3956* |
A relationship involving union and indexed union. Exercise 25 of
[Enderton] p. 33 but with biconditional
changed to implication.
(Contributed by Jim Kingdon, 19-Aug-2018.)
|
|
|
Theorem | sspwuni 3957 |
Subclass relationship for power class and union. (Contributed by NM,
18-Jul-2006.)
|
|
|
Theorem | pwssb 3958* |
Two ways to express a collection of subclasses. (Contributed by NM,
19-Jul-2006.)
|
|
|
Theorem | elpwpw 3959 |
Characterization of the elements of a double power class: they are exactly
the sets whose union is included in that class. (Contributed by BJ,
29-Apr-2021.)
|
|
|
Theorem | pwpwab 3960* |
The double power class written as a class abstraction: the class of sets
whose union is included in the given class. (Contributed by BJ,
29-Apr-2021.)
|
|
|
Theorem | pwpwssunieq 3961* |
The class of sets whose union is equal to a given class is included in
the double power class of that class. (Contributed by BJ,
29-Apr-2021.)
|
|
|
Theorem | elpwuni 3962 |
Relationship for power class and union. (Contributed by NM,
18-Jul-2006.)
|
|
|
Theorem | iinpw 3963* |
The power class of an intersection in terms of indexed intersection.
Exercise 24(a) of [Enderton] p. 33.
(Contributed by NM,
29-Nov-2003.)
|
|
|
Theorem | iunpwss 3964* |
Inclusion of an indexed union of a power class in the power class of the
union of its index. Part of Exercise 24(b) of [Enderton] p. 33.
(Contributed by NM, 25-Nov-2003.)
|
|
|
Theorem | rintm 3965* |
Relative intersection of an inhabited class. (Contributed by Jim
Kingdon, 19-Aug-2018.)
|
|
|
2.1.21 Disjointness
|
|
Syntax | wdisj 3966 |
Extend wff notation to include the statement that a family of classes
, for , is a disjoint family.
|
Disj |
|
Definition | df-disj 3967* |
A collection of classes is disjoint when for each element
, it is in for at most
one . (Contributed by
Mario Carneiro, 14-Nov-2016.) (Revised by NM, 16-Jun-2017.)
|
Disj
|
|
Theorem | dfdisj2 3968* |
Alternate definition for disjoint classes. (Contributed by NM,
17-Jun-2017.)
|
Disj
|
|
Theorem | disjss2 3969 |
If each element of a collection is contained in a disjoint collection,
the original collection is also disjoint. (Contributed by Mario
Carneiro, 14-Nov-2016.)
|
Disj
Disj |
|
Theorem | disjeq2 3970 |
Equality theorem for disjoint collection. (Contributed by Mario Carneiro,
14-Nov-2016.)
|
Disj
Disj
|
|
Theorem | disjeq2dv 3971* |
Equality deduction for disjoint collection. (Contributed by Mario
Carneiro, 14-Nov-2016.)
|
Disj Disj |
|
Theorem | disjss1 3972* |
A subset of a disjoint collection is disjoint. (Contributed by Mario
Carneiro, 14-Nov-2016.)
|
Disj
Disj |
|
Theorem | disjeq1 3973* |
Equality theorem for disjoint collection. (Contributed by Mario
Carneiro, 14-Nov-2016.)
|
Disj
Disj
|
|
Theorem | disjeq1d 3974* |
Equality theorem for disjoint collection. (Contributed by Mario
Carneiro, 14-Nov-2016.)
|
Disj Disj |
|
Theorem | disjeq12d 3975* |
Equality theorem for disjoint collection. (Contributed by Mario
Carneiro, 14-Nov-2016.)
|
Disj
Disj |
|
Theorem | cbvdisj 3976* |
Change bound variables in a disjoint collection. (Contributed by Mario
Carneiro, 14-Nov-2016.)
|
Disj
Disj |
|
Theorem | cbvdisjv 3977* |
Change bound variables in a disjoint collection. (Contributed by Mario
Carneiro, 11-Dec-2016.)
|
Disj Disj |
|
Theorem | nfdisjv 3978* |
Bound-variable hypothesis builder for disjoint collection. (Contributed
by Jim Kingdon, 19-Aug-2018.)
|
Disj |
|
Theorem | nfdisj1 3979 |
Bound-variable hypothesis builder for disjoint collection. (Contributed
by Mario Carneiro, 14-Nov-2016.)
|
Disj
|
|
Theorem | disjnim 3980* |
If a collection for is disjoint, then pairs are
disjoint. (Contributed by Mario Carneiro, 26-Mar-2015.) (Revised by
Jim Kingdon, 6-Oct-2022.)
|
Disj
|
|
Theorem | disjnims 3981* |
If a collection for is disjoint, then pairs are
disjoint. (Contributed by Mario Carneiro, 14-Nov-2016.) (Revised by
Jim Kingdon, 7-Oct-2022.)
|
Disj
|
|
Theorem | disji2 3982* |
Property of a disjoint collection: if and
, and , then and
are disjoint.
(Contributed by Mario Carneiro, 14-Nov-2016.)
|
Disj
|
|
Theorem | invdisj 3983* |
If there is a function such that for all
, then the sets for distinct
are
disjoint. (Contributed by Mario Carneiro, 10-Dec-2016.)
|
Disj |
|
Theorem | disjiun 3984* |
A disjoint collection yields disjoint indexed unions for disjoint index
sets. (Contributed by Mario Carneiro, 26-Mar-2015.) (Revised by Mario
Carneiro, 14-Nov-2016.)
|
Disj
|
|
Theorem | sndisj 3985 |
Any collection of singletons is disjoint. (Contributed by Mario
Carneiro, 14-Nov-2016.)
|
Disj |
|
Theorem | 0disj 3986 |
Any collection of empty sets is disjoint. (Contributed by Mario Carneiro,
14-Nov-2016.)
|
Disj |
|
Theorem | disjxsn 3987* |
A singleton collection is disjoint. (Contributed by Mario Carneiro,
14-Nov-2016.)
|
Disj |
|
Theorem | disjx0 3988 |
An empty collection is disjoint. (Contributed by Mario Carneiro,
14-Nov-2016.)
|
Disj |
|
2.1.22 Binary relations
|
|
Syntax | wbr 3989 |
Extend wff notation to include the general binary relation predicate.
Note that the syntax is simply three class symbols in a row. Since binary
relations are the only possible wff expressions consisting of three class
expressions in a row, the syntax is unambiguous.
|
|
|
Definition | df-br 3990 |
Define a general binary relation. Note that the syntax is simply three
class symbols in a row. Definition 6.18 of [TakeutiZaring] p. 29
generalized to arbitrary classes. This definition of relations is
well-defined, although not very meaningful, when classes and/or
are proper
classes (i.e. are not sets). On the other hand, we often
find uses for this definition when is a proper class (see for
example iprc 4879). (Contributed by NM, 31-Dec-1993.)
|
|
|
Theorem | breq 3991 |
Equality theorem for binary relations. (Contributed by NM,
4-Jun-1995.)
|
|
|
Theorem | breq1 3992 |
Equality theorem for a binary relation. (Contributed by NM,
31-Dec-1993.)
|
|
|
Theorem | breq2 3993 |
Equality theorem for a binary relation. (Contributed by NM,
31-Dec-1993.)
|
|
|
Theorem | breq12 3994 |
Equality theorem for a binary relation. (Contributed by NM,
8-Feb-1996.)
|
|
|
Theorem | breqi 3995 |
Equality inference for binary relations. (Contributed by NM,
19-Feb-2005.)
|
|
|
Theorem | breq1i 3996 |
Equality inference for a binary relation. (Contributed by NM,
8-Feb-1996.)
|
|
|
Theorem | breq2i 3997 |
Equality inference for a binary relation. (Contributed by NM,
8-Feb-1996.)
|
|
|
Theorem | breq12i 3998 |
Equality inference for a binary relation. (Contributed by NM,
8-Feb-1996.) (Proof shortened by Eric Schmidt, 4-Apr-2007.)
|
|
|
Theorem | breq1d 3999 |
Equality deduction for a binary relation. (Contributed by NM,
8-Feb-1996.)
|
|
|
Theorem | breqd 4000 |
Equality deduction for a binary relation. (Contributed by NM,
29-Oct-2011.)
|
|