HomeHome Intuitionistic Logic Explorer
Theorem List (p. 38 of 106)
< Previous  Next >
Browser slow? Try the
Unicode version.

Mirrors  >  Metamath Home Page  >  ILE Home Page  >  Theorem List Contents  >  Recent Proofs       This page: Page List

Theorem List for Intuitionistic Logic Explorer - 3701-3800   *Has distinct variable group(s)
TypeLabelDescription
Statement
 
Theoremiuneq2 3701 Equality theorem for indexed union. (Contributed by NM, 22-Oct-2003.)
 |-  ( A. x  e.  A  B  =  C  -> 
 U_ x  e.  A  B  =  U_ x  e.  A  C )
 
Theoremiineq2 3702 Equality theorem for indexed intersection. (Contributed by NM, 22-Oct-2003.) (Proof shortened by Andrew Salmon, 25-Jul-2011.)
 |-  ( A. x  e.  A  B  =  C  -> 
 |^|_ x  e.  A  B  =  |^|_ x  e.  A  C )
 
Theoremiuneq2i 3703 Equality inference for indexed union. (Contributed by NM, 22-Oct-2003.)
 |-  ( x  e.  A  ->  B  =  C )   =>    |-  U_ x  e.  A  B  =  U_ x  e.  A  C
 
Theoremiineq2i 3704 Equality inference for indexed intersection. (Contributed by NM, 22-Oct-2003.)
 |-  ( x  e.  A  ->  B  =  C )   =>    |-  |^|_
 x  e.  A  B  =  |^|_ x  e.  A  C
 
Theoremiineq2d 3705 Equality deduction for indexed intersection. (Contributed by NM, 7-Dec-2011.)
 |- 
 F/ x ph   &    |-  ( ( ph  /\  x  e.  A ) 
 ->  B  =  C )   =>    |-  ( ph  ->  |^|_ x  e.  A  B  =  |^|_ x  e.  A  C )
 
Theoremiuneq2dv 3706* Equality deduction for indexed union. (Contributed by NM, 3-Aug-2004.)
 |-  ( ( ph  /\  x  e.  A )  ->  B  =  C )   =>    |-  ( ph  ->  U_ x  e.  A  B  =  U_ x  e.  A  C )
 
Theoremiineq2dv 3707* Equality deduction for indexed intersection. (Contributed by NM, 3-Aug-2004.)
 |-  ( ( ph  /\  x  e.  A )  ->  B  =  C )   =>    |-  ( ph  ->  |^|_ x  e.  A  B  =  |^|_ x  e.  A  C )
 
Theoremiuneq1d 3708* Equality theorem for indexed union, deduction version. (Contributed by Drahflow, 22-Oct-2015.)
 |-  ( ph  ->  A  =  B )   =>    |-  ( ph  ->  U_ x  e.  A  C  =  U_ x  e.  B  C )
 
Theoremiuneq12d 3709* Equality deduction for indexed union, deduction version. (Contributed by Drahflow, 22-Oct-2015.)
 |-  ( ph  ->  A  =  B )   &    |-  ( ph  ->  C  =  D )   =>    |-  ( ph  ->  U_ x  e.  A  C  =  U_ x  e.  B  D )
 
Theoremiuneq2d 3710* Equality deduction for indexed union. (Contributed by Drahflow, 22-Oct-2015.)
 |-  ( ph  ->  B  =  C )   =>    |-  ( ph  ->  U_ x  e.  A  B  =  U_ x  e.  A  C )
 
Theoremnfiunxy 3711* Bound-variable hypothesis builder for indexed union. (Contributed by Mario Carneiro, 25-Jan-2014.)
 |-  F/_ y A   &    |-  F/_ y B   =>    |-  F/_ y U_ x  e.  A  B
 
Theoremnfiinxy 3712* Bound-variable hypothesis builder for indexed intersection. (Contributed by Mario Carneiro, 25-Jan-2014.)
 |-  F/_ y A   &    |-  F/_ y B   =>    |-  F/_ y |^|_ x  e.  A  B
 
Theoremnfiunya 3713* Bound-variable hypothesis builder for indexed union. (Contributed by Mario Carneiro, 25-Jan-2014.)
 |-  F/_ y A   &    |-  F/_ y B   =>    |-  F/_ y U_ x  e.  A  B
 
Theoremnfiinya 3714* Bound-variable hypothesis builder for indexed intersection. (Contributed by Mario Carneiro, 25-Jan-2014.)
 |-  F/_ y A   &    |-  F/_ y B   =>    |-  F/_ y |^|_ x  e.  A  B
 
Theoremnfiu1 3715 Bound-variable hypothesis builder for indexed union. (Contributed by NM, 12-Oct-2003.)
 |-  F/_ x U_ x  e.  A  B
 
Theoremnfii1 3716 Bound-variable hypothesis builder for indexed intersection. (Contributed by NM, 15-Oct-2003.)
 |-  F/_ x |^|_ x  e.  A  B
 
Theoremdfiun2g 3717* Alternate definition of indexed union when  B is a set. Definition 15(a) of [Suppes] p. 44. (Contributed by NM, 23-Mar-2006.) (Proof shortened by Andrew Salmon, 25-Jul-2011.)
 |-  ( A. x  e.  A  B  e.  C  -> 
 U_ x  e.  A  B  =  U. { y  |  E. x  e.  A  y  =  B }
 )
 
Theoremdfiin2g 3718* Alternate definition of indexed intersection when  B is a set. (Contributed by Jeff Hankins, 27-Aug-2009.)
 |-  ( A. x  e.  A  B  e.  C  -> 
 |^|_ x  e.  A  B  =  |^| { y  |  E. x  e.  A  y  =  B }
 )
 
Theoremdfiun2 3719* Alternate definition of indexed union when  B is a set. Definition 15(a) of [Suppes] p. 44. (Contributed by NM, 27-Jun-1998.) (Revised by David Abernethy, 19-Jun-2012.)
 |-  B  e.  _V   =>    |-  U_ x  e.  A  B  =  U. { y  |  E. x  e.  A  y  =  B }
 
Theoremdfiin2 3720* Alternate definition of indexed intersection when  B is a set. Definition 15(b) of [Suppes] p. 44. (Contributed by NM, 28-Jun-1998.) (Proof shortened by Andrew Salmon, 25-Jul-2011.)
 |-  B  e.  _V   =>    |-  |^|_ x  e.  A  B  =  |^| { y  |  E. x  e.  A  y  =  B }
 
Theoremdfiunv2 3721* Define double indexed union. (Contributed by FL, 6-Nov-2013.)
 |-  U_ x  e.  A  U_ y  e.  B  C  =  { z  |  E. x  e.  A  E. y  e.  B  z  e.  C }
 
Theoremcbviun 3722* 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.)
 |-  F/_ y B   &    |-  F/_ x C   &    |-  ( x  =  y  ->  B  =  C )   =>    |-  U_ x  e.  A  B  =  U_ y  e.  A  C
 
Theoremcbviin 3723* Change bound variables in an indexed intersection. (Contributed by Jeff Hankins, 26-Aug-2009.) (Revised by Mario Carneiro, 14-Oct-2016.)
 |-  F/_ y B   &    |-  F/_ x C   &    |-  ( x  =  y  ->  B  =  C )   =>    |-  |^|_ x  e.  A  B  =  |^|_ y  e.  A  C
 
Theoremcbviunv 3724* 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.)
 |-  ( x  =  y 
 ->  B  =  C )   =>    |-  U_ x  e.  A  B  =  U_ y  e.  A  C
 
Theoremcbviinv 3725* Change bound variables in an indexed intersection. (Contributed by Jeff Hankins, 26-Aug-2009.)
 |-  ( x  =  y 
 ->  B  =  C )   =>    |-  |^|_
 x  e.  A  B  =  |^|_ y  e.  A  C
 
Theoremiunss 3726* Subset theorem for an indexed union. (Contributed by NM, 13-Sep-2003.) (Proof shortened by Andrew Salmon, 25-Jul-2011.)
 |-  ( U_ x  e.  A  B  C_  C  <->  A. x  e.  A  B  C_  C )
 
Theoremssiun 3727* Subset implication for an indexed union. (Contributed by NM, 3-Sep-2003.) (Proof shortened by Andrew Salmon, 25-Jul-2011.)
 |-  ( E. x  e.  A  C  C_  B  ->  C  C_  U_ x  e.  A  B )
 
Theoremssiun2 3728 Identity law for subset of an indexed union. (Contributed by NM, 12-Oct-2003.) (Proof shortened by Andrew Salmon, 25-Jul-2011.)
 |-  ( x  e.  A  ->  B  C_  U_ x  e.  A  B )
 
Theoremssiun2s 3729* Subset relationship for an indexed union. (Contributed by NM, 26-Oct-2003.)
 |-  ( x  =  C  ->  B  =  D )   =>    |-  ( C  e.  A  ->  D  C_  U_ x  e.  A  B )
 
Theoremiunss2 3730* A subclass condition on the members of two indexed classes  C
( x ) and  D ( y ) that implies a subclass relation on their indexed unions. Generalization of Proposition 8.6 of [TakeutiZaring] p. 59. Compare uniss2 3639. (Contributed by NM, 9-Dec-2004.)
 |-  ( A. x  e.  A  E. y  e.  B  C  C_  D  -> 
 U_ x  e.  A  C  C_  U_ y  e.  B  D )
 
Theoremiunab 3731* The indexed union of a class abstraction. (Contributed by NM, 27-Dec-2004.)
 |-  U_ x  e.  A  { y  |  ph }  =  { y  |  E. x  e.  A  ph }
 
Theoremiunrab 3732* The indexed union of a restricted class abstraction. (Contributed by NM, 3-Jan-2004.) (Proof shortened by Mario Carneiro, 14-Nov-2016.)
 |-  U_ x  e.  A  { y  e.  B  |  ph }  =  {
 y  e.  B  |  E. x  e.  A  ph
 }
 
Theoremiunxdif2 3733* Indexed union with a class difference as its index. (Contributed by NM, 10-Dec-2004.)
 |-  ( x  =  y 
 ->  C  =  D )   =>    |-  ( A. x  e.  A  E. y  e.  ( A  \  B ) C 
 C_  D  ->  U_ y  e.  ( A  \  B ) D  =  U_ x  e.  A  C )
 
Theoremssiinf 3734 Subset theorem for an indexed intersection. (Contributed by FL, 15-Oct-2012.) (Proof shortened by Mario Carneiro, 14-Oct-2016.)
 |-  F/_ x C   =>    |-  ( C  C_  |^|_ x  e.  A  B  <->  A. x  e.  A  C  C_  B )
 
Theoremssiin 3735* Subset theorem for an indexed intersection. (Contributed by NM, 15-Oct-2003.)
 |-  ( C  C_  |^|_ x  e.  A  B  <->  A. x  e.  A  C  C_  B )
 
Theoremiinss 3736* Subset implication for an indexed intersection. (Contributed by NM, 15-Oct-2003.) (Proof shortened by Andrew Salmon, 25-Jul-2011.)
 |-  ( E. x  e.  A  B  C_  C  -> 
 |^|_ x  e.  A  B  C_  C )
 
Theoremiinss2 3737 An indexed intersection is included in any of its members. (Contributed by FL, 15-Oct-2012.)
 |-  ( x  e.  A  -> 
 |^|_ x  e.  A  B  C_  B )
 
Theoremuniiun 3738* Class union in terms of indexed union. Definition in [Stoll] p. 43. (Contributed by NM, 28-Jun-1998.)
 |- 
 U. A  =  U_ x  e.  A  x
 
Theoremintiin 3739* Class intersection in terms of indexed intersection. Definition in [Stoll] p. 44. (Contributed by NM, 28-Jun-1998.)
 |- 
 |^| A  =  |^|_ x  e.  A  x
 
Theoremiunid 3740* An indexed union of singletons recovers the index set. (Contributed by NM, 6-Sep-2005.)
 |-  U_ x  e.  A  { x }  =  A
 
Theoremiun0 3741 An indexed union of the empty set is empty. (Contributed by NM, 26-Mar-2003.) (Proof shortened by Andrew Salmon, 25-Jul-2011.)
 |-  U_ x  e.  A  (/) 
 =  (/)
 
Theorem0iun 3742 An empty indexed union is empty. (Contributed by NM, 4-Dec-2004.) (Proof shortened by Andrew Salmon, 25-Jul-2011.)
 |-  U_ x  e.  (/)  A  =  (/)
 
Theorem0iin 3743 An empty indexed intersection is the universal class. (Contributed by NM, 20-Oct-2005.)
 |-  |^|_ x  e.  (/)  A  =  _V
 
Theoremviin 3744* Indexed intersection with a universal index class. (Contributed by NM, 11-Sep-2008.)
 |-  |^|_ x  e.  _V  A  =  { y  |  A. x  y  e.  A }
 
Theoremiunn0m 3745* There is an inhabited class in an indexed collection  B
( x ) iff the indexed union of them is inhabited. (Contributed by Jim Kingdon, 16-Aug-2018.)
 |-  ( E. x  e.  A  E. y  y  e.  B  <->  E. y  y  e.  U_ x  e.  A  B )
 
Theoremiinab 3746* Indexed intersection of a class builder. (Contributed by NM, 6-Dec-2011.)
 |-  |^|_ x  e.  A  {
 y  |  ph }  =  { y  |  A. x  e.  A  ph }
 
Theoremiinrabm 3747* Indexed intersection of a restricted class builder. (Contributed by Jim Kingdon, 16-Aug-2018.)
 |-  ( E. x  x  e.  A  ->  |^|_ x  e.  A  { y  e.  B  |  ph }  =  { y  e.  B  |  A. x  e.  A  ph
 } )
 
Theoremiunin2 3748* Indexed union of intersection. Generalization of half of theorem "Distributive laws" in [Enderton] p. 30. Use uniiun 3738 to recover Enderton's theorem. (Contributed by NM, 26-Mar-2004.)
 |-  U_ x  e.  A  ( B  i^i  C )  =  ( B  i^i  U_ x  e.  A  C )
 
Theoremiunin1 3749* Indexed union of intersection. Generalization of half of theorem "Distributive laws" in [Enderton] p. 30. Use uniiun 3738 to recover Enderton's theorem. (Contributed by Mario Carneiro, 30-Aug-2015.)
 |-  U_ x  e.  A  ( C  i^i  B )  =  ( U_ x  e.  A  C  i^i  B )
 
Theoremiundif2ss 3750* Indexed union of class difference. Compare to theorem "De Morgan's laws" in [Enderton] p. 31. (Contributed by Jim Kingdon, 17-Aug-2018.)
 |-  U_ x  e.  A  ( B  \  C ) 
 C_  ( B  \  |^|_
 x  e.  A  C )
 
Theorem2iunin 3751* Rearrange indexed unions over intersection. (Contributed by NM, 18-Dec-2008.)
 |-  U_ x  e.  A  U_ y  e.  B  ( C  i^i  D )  =  ( U_ x  e.  A  C  i^i  U_ y  e.  B  D )
 
Theoremiindif2m 3752* Indexed intersection of class difference. Compare to Theorem "De Morgan's laws" in [Enderton] p. 31. (Contributed by Jim Kingdon, 17-Aug-2018.)
 |-  ( E. x  x  e.  A  ->  |^|_ x  e.  A  ( B  \  C )  =  ( B  \  U_ x  e.  A  C ) )
 
Theoremiinin2m 3753* Indexed intersection of intersection. Compare to Theorem "Distributive laws" in [Enderton] p. 30. (Contributed by Jim Kingdon, 17-Aug-2018.)
 |-  ( E. x  x  e.  A  ->  |^|_ x  e.  A  ( B  i^i  C )  =  ( B  i^i  |^|_ x  e.  A  C ) )
 
Theoremiinin1m 3754* Indexed intersection of intersection. Compare to Theorem "Distributive laws" in [Enderton] p. 30. (Contributed by Jim Kingdon, 17-Aug-2018.)
 |-  ( E. x  x  e.  A  ->  |^|_ x  e.  A  ( C  i^i  B )  =  ( |^|_ x  e.  A  C  i^i  B ) )
 
Theoremelriin 3755* Elementhood in a relative intersection. (Contributed by Mario Carneiro, 30-Dec-2016.)
 |-  ( B  e.  ( A  i^i  |^|_ x  e.  X  S )  <->  ( B  e.  A  /\  A. x  e.  X  B  e.  S ) )
 
Theoremriin0 3756* Relative intersection of an empty family. (Contributed by Stefan O'Rear, 3-Apr-2015.)
 |-  ( X  =  (/)  ->  ( A  i^i  |^|_ x  e.  X  S )  =  A )
 
Theoremriinm 3757* Relative intersection of an inhabited family. (Contributed by Jim Kingdon, 19-Aug-2018.)
 |-  ( ( A. x  e.  X  S  C_  A  /\  E. x  x  e.  X )  ->  ( A  i^i  |^|_ x  e.  X  S )  =  |^|_ x  e.  X  S )
 
Theoremiinxsng 3758* 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.)
 |-  ( x  =  A  ->  B  =  C )   =>    |-  ( A  e.  V  -> 
 |^|_ x  e.  { A } B  =  C )
 
Theoremiinxprg 3759* Indexed intersection with an unordered pair index. (Contributed by NM, 25-Jan-2012.)
 |-  ( x  =  A  ->  C  =  D )   &    |-  ( x  =  B  ->  C  =  E )   =>    |-  ( ( A  e.  V  /\  B  e.  W )  ->  |^|_ x  e.  { A ,  B } C  =  ( D  i^i  E ) )
 
Theoremiunxsng 3760* A singleton index picks out an instance of an indexed union's argument. (Contributed by Mario Carneiro, 25-Jun-2016.)
 |-  ( x  =  A  ->  B  =  C )   =>    |-  ( A  e.  V  -> 
 U_ x  e.  { A } B  =  C )
 
Theoremiunxsn 3761* 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.)
 |-  A  e.  _V   &    |-  ( x  =  A  ->  B  =  C )   =>    |-  U_ x  e.  { A } B  =  C
 
Theoremiunun 3762 Separate a union in an indexed union. (Contributed by NM, 27-Dec-2004.) (Proof shortened by Mario Carneiro, 17-Nov-2016.)
 |-  U_ x  e.  A  ( B  u.  C )  =  ( U_ x  e.  A  B  u.  U_ x  e.  A  C )
 
Theoremiunxun 3763 Separate a union in the index of an indexed union. (Contributed by NM, 26-Mar-2004.) (Proof shortened by Mario Carneiro, 17-Nov-2016.)
 |-  U_ x  e.  ( A  u.  B ) C  =  ( U_ x  e.  A  C  u.  U_ x  e.  B  C )
 
Theoremiunxiun 3764* Separate an indexed union in the index of an indexed union. (Contributed by Mario Carneiro, 5-Dec-2016.)
 |-  U_ x  e.  U_  y  e.  A  B C  =  U_ y  e.  A  U_ x  e.  B  C
 
Theoremiinuniss 3765* 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.)
 |-  ( A  u.  |^| B )  C_  |^|_ x  e.  B  ( A  u.  x )
 
Theoremiununir 3766* 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.)
 |-  ( ( A  u.  U. B )  =  U_ x  e.  B  ( A  u.  x )  ->  ( B  =  (/)  ->  A  =  (/) ) )
 
Theoremsspwuni 3767 Subclass relationship for power class and union. (Contributed by NM, 18-Jul-2006.)
 |-  ( A  C_  ~P B  <->  U. A  C_  B )
 
Theorempwssb 3768* Two ways to express a collection of subclasses. (Contributed by NM, 19-Jul-2006.)
 |-  ( A  C_  ~P B  <->  A. x  e.  A  x  C_  B )
 
Theoremelpwuni 3769 Relationship for power class and union. (Contributed by NM, 18-Jul-2006.)
 |-  ( B  e.  A  ->  ( A  C_  ~P B  <->  U. A  =  B ) )
 
Theoremiinpw 3770* The power class of an intersection in terms of indexed intersection. Exercise 24(a) of [Enderton] p. 33. (Contributed by NM, 29-Nov-2003.)
 |- 
 ~P |^| A  =  |^|_ x  e.  A  ~P x
 
Theoremiunpwss 3771* 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.)
 |-  U_ x  e.  A  ~P x  C_  ~P U. A
 
Theoremrintm 3772* Relative intersection of an inhabited class. (Contributed by Jim Kingdon, 19-Aug-2018.)
 |-  ( ( X  C_  ~P A  /\  E. x  x  e.  X )  ->  ( A  i^i  |^| X )  =  |^| X )
 
2.1.21  Disjointness
 
Syntaxwdisj 3773 Extend wff notation to include the statement that a family of classes  B (
x ), for  x  e.  A, is a disjoint family.
 wff Disj 
 x  e.  A  B
 
Definitiondf-disj 3774* A collection of classes  B ( x ) is disjoint when for each element  y, it is in  B ( x ) for at most one  x. (Contributed by Mario Carneiro, 14-Nov-2016.) (Revised by NM, 16-Jun-2017.)
 |-  (Disj  x  e.  A  B 
 <-> 
 A. y E* x  e.  A  y  e.  B )
 
Theoremdfdisj2 3775* Alternate definition for disjoint classes. (Contributed by NM, 17-Jun-2017.)
 |-  (Disj  x  e.  A  B 
 <-> 
 A. y E* x ( x  e.  A  /\  y  e.  B ) )
 
Theoremdisjss2 3776 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.)
 |-  ( A. x  e.  A  B  C_  C  ->  (Disj  x  e.  A  C  -> Disj  x  e.  A  B ) )
 
Theoremdisjeq2 3777 Equality theorem for disjoint collection. (Contributed by Mario Carneiro, 14-Nov-2016.)
 |-  ( A. x  e.  A  B  =  C  ->  (Disj  x  e.  A  B 
 <-> Disj  x  e.  A  C ) )
 
Theoremdisjeq2dv 3778* Equality deduction for disjoint collection. (Contributed by Mario Carneiro, 14-Nov-2016.)
 |-  ( ( ph  /\  x  e.  A )  ->  B  =  C )   =>    |-  ( ph  ->  (Disj  x  e.  A  B  <-> Disj  x  e.  A  C ) )
 
Theoremdisjss1 3779* A subset of a disjoint collection is disjoint. (Contributed by Mario Carneiro, 14-Nov-2016.)
 |-  ( A  C_  B  ->  (Disj  x  e.  B  C  -> Disj  x  e.  A  C ) )
 
Theoremdisjeq1 3780* Equality theorem for disjoint collection. (Contributed by Mario Carneiro, 14-Nov-2016.)
 |-  ( A  =  B  ->  (Disj  x  e.  A  C 
 <-> Disj  x  e.  B  C ) )
 
Theoremdisjeq1d 3781* Equality theorem for disjoint collection. (Contributed by Mario Carneiro, 14-Nov-2016.)
 |-  ( ph  ->  A  =  B )   =>    |-  ( ph  ->  (Disj  x  e.  A  C  <-> Disj  x  e.  B  C ) )
 
Theoremdisjeq12d 3782* Equality theorem for disjoint collection. (Contributed by Mario Carneiro, 14-Nov-2016.)
 |-  ( ph  ->  A  =  B )   &    |-  ( ph  ->  C  =  D )   =>    |-  ( ph  ->  (Disj  x  e.  A  C  <-> Disj  x  e.  B  D ) )
 
Theoremcbvdisj 3783* Change bound variables in a disjoint collection. (Contributed by Mario Carneiro, 14-Nov-2016.)
 |-  F/_ y B   &    |-  F/_ x C   &    |-  ( x  =  y  ->  B  =  C )   =>    |-  (Disj  x  e.  A  B  <-> Disj  y  e.  A  C )
 
Theoremcbvdisjv 3784* Change bound variables in a disjoint collection. (Contributed by Mario Carneiro, 11-Dec-2016.)
 |-  ( x  =  y 
 ->  B  =  C )   =>    |-  (Disj  x  e.  A  B  <-> Disj  y  e.  A  C )
 
Theoremnfdisjv 3785* Bound-variable hypothesis builder for disjoint collection. (Contributed by Jim Kingdon, 19-Aug-2018.)
 |-  F/_ y A   &    |-  F/_ y B   =>    |-  F/ yDisj  x  e.  A  B
 
Theoremnfdisj1 3786 Bound-variable hypothesis builder for disjoint collection. (Contributed by Mario Carneiro, 14-Nov-2016.)
 |- 
 F/ xDisj  x  e.  A  B
 
Theoreminvdisj 3787* If there is a function  C ( y ) such that  C ( y )  =  x for all  y  e.  B
( x ), then the sets  B ( x ) for distinct  x  e.  A are disjoint. (Contributed by Mario Carneiro, 10-Dec-2016.)
 |-  ( A. x  e.  A  A. y  e.  B  C  =  x 
 -> Disj 
 x  e.  A  B )
 
Theoremsndisj 3788 Any collection of singletons is disjoint. (Contributed by Mario Carneiro, 14-Nov-2016.)
 |- Disj  x  e.  A  { x }
 
Theorem0disj 3789 Any collection of empty sets is disjoint. (Contributed by Mario Carneiro, 14-Nov-2016.)
 |- Disj  x  e.  A  (/)
 
Theoremdisjxsn 3790* A singleton collection is disjoint. (Contributed by Mario Carneiro, 14-Nov-2016.)
 |- Disj  x  e.  { A } B
 
Theoremdisjx0 3791 An empty collection is disjoint. (Contributed by Mario Carneiro, 14-Nov-2016.)
 |- Disj  x  e.  (/)  B
 
2.1.22  Binary relations
 
Syntaxwbr 3792 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.
 wff  A R B
 
Definitiondf-br 3793 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  A and/or  B are proper classes (i.e. are not sets). On the other hand, we often find uses for this definition when  R is a proper class (see for example iprc 4628). (Contributed by NM, 31-Dec-1993.)
 |-  ( A R B  <->  <. A ,  B >.  e.  R )
 
Theorembreq 3794 Equality theorem for binary relations. (Contributed by NM, 4-Jun-1995.)
 |-  ( R  =  S  ->  ( A R B  <->  A S B ) )
 
Theorembreq1 3795 Equality theorem for a binary relation. (Contributed by NM, 31-Dec-1993.)
 |-  ( A  =  B  ->  ( A R C  <->  B R C ) )
 
Theorembreq2 3796 Equality theorem for a binary relation. (Contributed by NM, 31-Dec-1993.)
 |-  ( A  =  B  ->  ( C R A  <->  C R B ) )
 
Theorembreq12 3797 Equality theorem for a binary relation. (Contributed by NM, 8-Feb-1996.)
 |-  ( ( A  =  B  /\  C  =  D )  ->  ( A R C 
 <->  B R D ) )
 
Theorembreqi 3798 Equality inference for binary relations. (Contributed by NM, 19-Feb-2005.)
 |-  R  =  S   =>    |-  ( A R B 
 <->  A S B )
 
Theorembreq1i 3799 Equality inference for a binary relation. (Contributed by NM, 8-Feb-1996.)
 |-  A  =  B   =>    |-  ( A R C 
 <->  B R C )
 
Theorembreq2i 3800 Equality inference for a binary relation. (Contributed by NM, 8-Feb-1996.)
 |-  A  =  B   =>    |-  ( C R A 
 <->  C R B )
    < Previous  Next >

Page List
Jump to page: Contents  1 1-100 2 101-200 3 201-300 4 301-400 5 401-500 6 501-600 7 601-700 8 701-800 9 801-900 10 901-1000 11 1001-1100 12 1101-1200 13 1201-1300 14 1301-1400 15 1401-1500 16 1501-1600 17 1601-1700 18 1701-1800 19 1801-1900 20 1901-2000 21 2001-2100 22 2101-2200 23 2201-2300 24 2301-2400 25 2401-2500 26 2501-2600 27 2601-2700 28 2701-2800 29 2801-2900 30 2901-3000 31 3001-3100 32 3101-3200 33 3201-3300 34 3301-3400 35 3401-3500 36 3501-3600 37 3601-3700 38 3701-3800 39 3801-3900 40 3901-4000 41 4001-4100 42 4101-4200 43 4201-4300 44 4301-4400 45 4401-4500 46 4501-4600 47 4601-4700 48 4701-4800 49 4801-4900 50 4901-5000 51 5001-5100 52 5101-5200 53 5201-5300 54 5301-5400 55 5401-5500 56 5501-5600 57 5601-5700 58 5701-5800 59 5801-5900 60 5901-6000 61 6001-6100 62 6101-6200 63 6201-6300 64 6301-6400 65 6401-6500 66 6501-6600 67 6601-6700 68 6701-6800 69 6801-6900 70 6901-7000 71 7001-7100 72 7101-7200 73 7201-7300 74 7301-7400 75 7401-7500 76 7501-7600 77 7601-7700 78 7701-7800 79 7801-7900 80 7901-8000 81 8001-8100 82 8101-8200 83 8201-8300 84 8301-8400 85 8401-8500 86 8501-8600 87 8601-8700 88 8701-8800 89 8801-8900 90 8901-9000 91 9001-9100 92 9101-9200 93 9201-9300 94 9301-9400 95 9401-9500 96 9501-9600 97 9601-9700 98 9701-9800 99 9801-9900 100 9901-10000 101 10001-10100 102 10101-10200 103 10201-10300 104 10301-10400 105 10401-10500 106 10501-10511
  Copyright terms: Public domain < Previous  Next >