HomeHome Intuitionistic Logic Explorer
Theorem List (p. 46 of 102)
< 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 - 4501-4600   *Has distinct variable group(s)
TypeLabelDescription
Statement
 
Theoremnfco 4501 Bound-variable hypothesis builder for function value. (Contributed by NM, 1-Sep-1999.)
 |-  F/_ x A   &    |-  F/_ x B   =>    |-  F/_ x ( A  o.  B )
 
Theorembrcog 4502* Ordered pair membership in a composition. (Contributed by NM, 24-Feb-2015.)
 |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( A ( C  o.  D ) B  <->  E. x ( A D x  /\  x C B ) ) )
 
Theoremopelco2g 4503* Ordered pair membership in a composition. (Contributed by NM, 27-Jan-1997.) (Revised by Mario Carneiro, 24-Feb-2015.)
 |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( <. A ,  B >.  e.  ( C  o.  D )  <->  E. x ( <. A ,  x >.  e.  D  /\  <. x ,  B >.  e.  C ) ) )
 
Theorembrcogw 4504 Ordered pair membership in a composition. (Contributed by Thierry Arnoux, 14-Jan-2018.)
 |-  ( ( ( A  e.  V  /\  B  e.  W  /\  X  e.  Z )  /\  ( A D X  /\  X C B ) )  ->  A ( C  o.  D ) B )
 
Theoremeqbrrdva 4505* Deduction from extensionality principle for relations, given an equivalence only on the relation's domain and range. (Contributed by Thierry Arnoux, 28-Nov-2017.)
 |-  ( ph  ->  A  C_  ( C  X.  D ) )   &    |-  ( ph  ->  B 
 C_  ( C  X.  D ) )   &    |-  (
 ( ph  /\  x  e.  C  /\  y  e.  D )  ->  ( x A y  <->  x B y ) )   =>    |-  ( ph  ->  A  =  B )
 
Theorembrco 4506* Binary relation on a composition. (Contributed by NM, 21-Sep-2004.) (Revised by Mario Carneiro, 24-Feb-2015.)
 |-  A  e.  _V   &    |-  B  e.  _V   =>    |-  ( A ( C  o.  D ) B  <->  E. x ( A D x  /\  x C B ) )
 
Theoremopelco 4507* Ordered pair membership in a composition. (Contributed by NM, 27-Dec-1996.) (Revised by Mario Carneiro, 24-Feb-2015.)
 |-  A  e.  _V   &    |-  B  e.  _V   =>    |-  ( <. A ,  B >.  e.  ( C  o.  D )  <->  E. x ( A D x  /\  x C B ) )
 
Theoremcnvss 4508 Subset theorem for converse. (Contributed by NM, 22-Mar-1998.)
 |-  ( A  C_  B  ->  `' A  C_  `' B )
 
Theoremcnveq 4509 Equality theorem for converse. (Contributed by NM, 13-Aug-1995.)
 |-  ( A  =  B  ->  `' A  =  `' B )
 
Theoremcnveqi 4510 Equality inference for converse. (Contributed by NM, 23-Dec-2008.)
 |-  A  =  B   =>    |-  `' A  =  `' B
 
Theoremcnveqd 4511 Equality deduction for converse. (Contributed by NM, 6-Dec-2013.)
 |-  ( ph  ->  A  =  B )   =>    |-  ( ph  ->  `' A  =  `' B )
 
Theoremelcnv 4512* Membership in a converse. Equation 5 of [Suppes] p. 62. (Contributed by NM, 24-Mar-1998.)
 |-  ( A  e.  `' R 
 <-> 
 E. x E. y
 ( A  =  <. x ,  y >.  /\  y R x ) )
 
Theoremelcnv2 4513* Membership in a converse. Equation 5 of [Suppes] p. 62. (Contributed by NM, 11-Aug-2004.)
 |-  ( A  e.  `' R 
 <-> 
 E. x E. y
 ( A  =  <. x ,  y >.  /\  <. y ,  x >.  e.  R ) )
 
Theoremnfcnv 4514 Bound-variable hypothesis builder for converse. (Contributed by NM, 31-Jan-2004.) (Revised by Mario Carneiro, 15-Oct-2016.)
 |-  F/_ x A   =>    |-  F/_ x `' A
 
Theoremopelcnvg 4515 Ordered-pair membership in converse. (Contributed by NM, 13-May-1999.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
 |-  ( ( A  e.  C  /\  B  e.  D )  ->  ( <. A ,  B >.  e.  `' R  <->  <. B ,  A >.  e.  R ) )
 
Theorembrcnvg 4516 The converse of a binary relation swaps arguments. Theorem 11 of [Suppes] p. 61. (Contributed by NM, 10-Oct-2005.)
 |-  ( ( A  e.  C  /\  B  e.  D )  ->  ( A `' R B  <->  B R A ) )
 
Theoremopelcnv 4517 Ordered-pair membership in converse. (Contributed by NM, 13-Aug-1995.)
 |-  A  e.  _V   &    |-  B  e.  _V   =>    |-  ( <. A ,  B >.  e.  `' R  <->  <. B ,  A >.  e.  R )
 
Theorembrcnv 4518 The converse of a binary relation swaps arguments. Theorem 11 of [Suppes] p. 61. (Contributed by NM, 13-Aug-1995.)
 |-  A  e.  _V   &    |-  B  e.  _V   =>    |-  ( A `' R B 
 <->  B R A )
 
Theoremcsbcnvg 4519 Move class substitution in and out of the converse of a function. (Contributed by Thierry Arnoux, 8-Feb-2017.)
 |-  ( A  e.  V  ->  `' [_ A  /  x ]_ F  =  [_ A  /  x ]_ `' F )
 
Theoremcnvco 4520 Distributive law of converse over class composition. Theorem 26 of [Suppes] p. 64. (Contributed by NM, 19-Mar-1998.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
 |-  `' ( A  o.  B )  =  ( `' B  o.  `' A )
 
Theoremcnvuni 4521* The converse of a class union is the (indexed) union of the converses of its members. (Contributed by NM, 11-Aug-2004.)
 |-  `' U. A  =  U_ x  e.  A  `' x
 
Theoremdfdm3 4522* Alternate definition of domain. Definition 6.5(1) of [TakeutiZaring] p. 24. (Contributed by NM, 28-Dec-1996.)
 |- 
 dom  A  =  { x  |  E. y <. x ,  y >.  e.  A }
 
Theoremdfrn2 4523* Alternate definition of range. Definition 4 of [Suppes] p. 60. (Contributed by NM, 27-Dec-1996.)
 |- 
 ran  A  =  {
 y  |  E. x  x A y }
 
Theoremdfrn3 4524* Alternate definition of range. Definition 6.5(2) of [TakeutiZaring] p. 24. (Contributed by NM, 28-Dec-1996.)
 |- 
 ran  A  =  {
 y  |  E. x <. x ,  y >.  e.  A }
 
Theoremelrn2g 4525* Membership in a range. (Contributed by Scott Fenton, 2-Feb-2011.)
 |-  ( A  e.  V  ->  ( A  e.  ran  B  <->  E. x <. x ,  A >.  e.  B ) )
 
Theoremelrng 4526* Membership in a range. (Contributed by Scott Fenton, 2-Feb-2011.)
 |-  ( A  e.  V  ->  ( A  e.  ran  B  <->  E. x  x B A ) )
 
Theoremdfdm4 4527 Alternate definition of domain. (Contributed by NM, 28-Dec-1996.)
 |- 
 dom  A  =  ran  `' A
 
Theoremdfdmf 4528* Definition of domain, using bound-variable hypotheses instead of distinct variable conditions. (Contributed by NM, 8-Mar-1995.) (Revised by Mario Carneiro, 15-Oct-2016.)
 |-  F/_ x A   &    |-  F/_ y A   =>    |-  dom  A  =  { x  |  E. y  x A y }
 
Theoremcsbdmg 4529 Distribute proper substitution through the domain of a class. (Contributed by Jim Kingdon, 8-Dec-2018.)
 |-  ( A  e.  V  -> 
 [_ A  /  x ]_
 dom  B  =  dom  [_ A  /  x ]_ B )
 
Theoremeldmg 4530* Domain membership. Theorem 4 of [Suppes] p. 59. (Contributed by Mario Carneiro, 9-Jul-2014.)
 |-  ( A  e.  V  ->  ( A  e.  dom  B  <->  E. y  A B y ) )
 
Theoremeldm2g 4531* Domain membership. Theorem 4 of [Suppes] p. 59. (Contributed by NM, 27-Jan-1997.) (Revised by Mario Carneiro, 9-Jul-2014.)
 |-  ( A  e.  V  ->  ( A  e.  dom  B  <->  E. y <. A ,  y >.  e.  B ) )
 
Theoremeldm 4532* Membership in a domain. Theorem 4 of [Suppes] p. 59. (Contributed by NM, 2-Apr-2004.)
 |-  A  e.  _V   =>    |-  ( A  e.  dom 
 B 
 <-> 
 E. y  A B y )
 
Theoremeldm2 4533* Membership in a domain. Theorem 4 of [Suppes] p. 59. (Contributed by NM, 1-Aug-1994.)
 |-  A  e.  _V   =>    |-  ( A  e.  dom 
 B 
 <-> 
 E. y <. A ,  y >.  e.  B )
 
Theoremdmss 4534 Subset theorem for domain. (Contributed by NM, 11-Aug-1994.)
 |-  ( A  C_  B  ->  dom  A  C_  dom  B )
 
Theoremdmeq 4535 Equality theorem for domain. (Contributed by NM, 11-Aug-1994.)
 |-  ( A  =  B  ->  dom  A  =  dom  B )
 
Theoremdmeqi 4536 Equality inference for domain. (Contributed by NM, 4-Mar-2004.)
 |-  A  =  B   =>    |-  dom  A  =  dom  B
 
Theoremdmeqd 4537 Equality deduction for domain. (Contributed by NM, 4-Mar-2004.)
 |-  ( ph  ->  A  =  B )   =>    |-  ( ph  ->  dom  A  =  dom  B )
 
Theoremopeldm 4538 Membership of first of an ordered pair in a domain. (Contributed by NM, 30-Jul-1995.)
 |-  A  e.  _V   &    |-  B  e.  _V   =>    |-  ( <. A ,  B >.  e.  C  ->  A  e.  dom  C )
 
Theorembreldm 4539 Membership of first of a binary relation in a domain. (Contributed by NM, 30-Jul-1995.)
 |-  A  e.  _V   &    |-  B  e.  _V   =>    |-  ( A R B  ->  A  e.  dom  R )
 
Theoremopeldmg 4540 Membership of first of an ordered pair in a domain. (Contributed by Jim Kingdon, 9-Jul-2019.)
 |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( <. A ,  B >.  e.  C  ->  A  e.  dom  C )
 )
 
Theorembreldmg 4541 Membership of first of a binary relation in a domain. (Contributed by NM, 21-Mar-2007.)
 |-  ( ( A  e.  C  /\  B  e.  D  /\  A R B ) 
 ->  A  e.  dom  R )
 
Theoremdmun 4542 The domain of a union is the union of domains. Exercise 56(a) of [Enderton] p. 65. (Contributed by NM, 12-Aug-1994.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
 |- 
 dom  ( A  u.  B )  =  ( dom  A  u.  dom  B )
 
Theoremdmin 4543 The domain of an intersection belong to the intersection of domains. Theorem 6 of [Suppes] p. 60. (Contributed by NM, 15-Sep-2004.)
 |- 
 dom  ( A  i^i  B )  C_  ( dom  A  i^i  dom  B )
 
Theoremdmiun 4544 The domain of an indexed union. (Contributed by Mario Carneiro, 26-Apr-2016.)
 |- 
 dom  U_ x  e.  A  B  =  U_ x  e.  A  dom  B
 
Theoremdmuni 4545* The domain of a union. Part of Exercise 8 of [Enderton] p. 41. (Contributed by NM, 3-Feb-2004.)
 |- 
 dom  U. A  =  U_ x  e.  A  dom  x
 
Theoremdmopab 4546* The domain of a class of ordered pairs. (Contributed by NM, 16-May-1995.) (Revised by Mario Carneiro, 4-Dec-2016.)
 |- 
 dom  { <. x ,  y >.  |  ph }  =  { x  |  E. y ph }
 
Theoremdmopabss 4547* Upper bound for the domain of a restricted class of ordered pairs. (Contributed by NM, 31-Jan-2004.)
 |- 
 dom  { <. x ,  y >.  |  ( x  e.  A  /\  ph ) }  C_  A
 
Theoremdmopab3 4548* The domain of a restricted class of ordered pairs. (Contributed by NM, 31-Jan-2004.)
 |-  ( A. x  e.  A  E. y ph  <->  dom  {
 <. x ,  y >.  |  ( x  e.  A  /\  ph ) }  =  A )
 
Theoremdm0 4549 The domain of the empty set is empty. Part of Theorem 3.8(v) of [Monk1] p. 36. (Contributed by NM, 4-Jul-1994.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
 |- 
 dom  (/)  =  (/)
 
Theoremdmi 4550 The domain of the identity relation is the universe. (Contributed by NM, 30-Apr-1998.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
 |- 
 dom  _I  =  _V
 
Theoremdmv 4551 The domain of the universe is the universe. (Contributed by NM, 8-Aug-2003.)
 |- 
 dom  _V  =  _V
 
Theoremdm0rn0 4552 An empty domain implies an empty range. (Contributed by NM, 21-May-1998.)
 |-  ( dom  A  =  (/)  <->  ran 
 A  =  (/) )
 
Theoremreldm0 4553 A relation is empty iff its domain is empty. (Contributed by NM, 15-Sep-2004.)
 |-  ( Rel  A  ->  ( A  =  (/)  <->  dom  A  =  (/) ) )
 
Theoremdmmrnm 4554* A domain is inhabited if and only if the range is inhabited. (Contributed by Jim Kingdon, 15-Dec-2018.)
 |-  ( E. x  x  e.  dom  A  <->  E. y  y  e. 
 ran  A )
 
Theoremdmxpm 4555* The domain of a cross product. Part of Theorem 3.13(x) of [Monk1] p. 37. (Contributed by NM, 28-Jul-1995.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
 |-  ( E. x  x  e.  B  ->  dom  ( A  X.  B )  =  A )
 
Theoremdmxpinm 4556* The domain of the intersection of two square cross products. Unlike dmin 4543, equality holds. (Contributed by NM, 29-Jan-2008.)
 |-  ( E. x  x  e.  ( A  i^i  B )  ->  dom  ( ( A  X.  A )  i^i  ( B  X.  B ) )  =  ( A  i^i  B ) )
 
Theoremxpid11m 4557* The cross product of a class with itself is one-to-one. (Contributed by Jim Kingdon, 8-Dec-2018.)
 |-  ( ( E. x  x  e.  A  /\  E. x  x  e.  B )  ->  ( ( A  X.  A )  =  ( B  X.  B ) 
 <->  A  =  B ) )
 
Theoremdmcnvcnv 4558 The domain of the double converse of a class (which doesn't have to be a relation as in dfrel2 4771). (Contributed by NM, 8-Apr-2007.)
 |- 
 dom  `' `' A  =  dom  A
 
Theoremrncnvcnv 4559 The range of the double converse of a class. (Contributed by NM, 8-Apr-2007.)
 |- 
 ran  `' `' A  =  ran  A
 
Theoremelreldm 4560 The first member of an ordered pair in a relation belongs to the domain of the relation. (Contributed by NM, 28-Jul-2004.)
 |-  ( ( Rel  A  /\  B  e.  A ) 
 ->  |^| |^| B  e.  dom  A )
 
Theoremrneq 4561 Equality theorem for range. (Contributed by NM, 29-Dec-1996.)
 |-  ( A  =  B  ->  ran  A  =  ran  B )
 
Theoremrneqi 4562 Equality inference for range. (Contributed by NM, 4-Mar-2004.)
 |-  A  =  B   =>    |-  ran  A  =  ran  B
 
Theoremrneqd 4563 Equality deduction for range. (Contributed by NM, 4-Mar-2004.)
 |-  ( ph  ->  A  =  B )   =>    |-  ( ph  ->  ran  A  =  ran  B )
 
Theoremrnss 4564 Subset theorem for range. (Contributed by NM, 22-Mar-1998.)
 |-  ( A  C_  B  ->  ran  A  C_  ran  B )
 
Theorembrelrng 4565 The second argument of a binary relation belongs to its range. (Contributed by NM, 29-Jun-2008.)
 |-  ( ( A  e.  F  /\  B  e.  G  /\  A C B ) 
 ->  B  e.  ran  C )
 
Theoremopelrng 4566 Membership of second member of an ordered pair in a range. (Contributed by Jim Kingdon, 26-Jan-2019.)
 |-  ( ( A  e.  F  /\  B  e.  G  /\  <. A ,  B >.  e.  C )  ->  B  e.  ran  C )
 
Theorembrelrn 4567 The second argument of a binary relation belongs to its range. (Contributed by NM, 13-Aug-2004.)
 |-  A  e.  _V   &    |-  B  e.  _V   =>    |-  ( A C B  ->  B  e.  ran  C )
 
Theoremopelrn 4568 Membership of second member of an ordered pair in a range. (Contributed by NM, 23-Feb-1997.)
 |-  A  e.  _V   &    |-  B  e.  _V   =>    |-  ( <. A ,  B >.  e.  C  ->  B  e.  ran  C )
 
Theoremreleldm 4569 The first argument of a binary relation belongs to its domain. (Contributed by NM, 2-Jul-2008.)
 |-  ( ( Rel  R  /\  A R B ) 
 ->  A  e.  dom  R )
 
Theoremrelelrn 4570 The second argument of a binary relation belongs to its range. (Contributed by NM, 2-Jul-2008.)
 |-  ( ( Rel  R  /\  A R B ) 
 ->  B  e.  ran  R )
 
Theoremreleldmb 4571* Membership in a domain. (Contributed by Mario Carneiro, 5-Nov-2015.)
 |-  ( Rel  R  ->  ( A  e.  dom  R  <->  E. x  A R x ) )
 
Theoremrelelrnb 4572* Membership in a range. (Contributed by Mario Carneiro, 5-Nov-2015.)
 |-  ( Rel  R  ->  ( A  e.  ran  R  <->  E. x  x R A ) )
 
Theoremreleldmi 4573 The first argument of a binary relation belongs to its domain. (Contributed by NM, 28-Apr-2015.)
 |- 
 Rel  R   =>    |-  ( A R B  ->  A  e.  dom  R )
 
Theoremrelelrni 4574 The second argument of a binary relation belongs to its range. (Contributed by NM, 28-Apr-2015.)
 |- 
 Rel  R   =>    |-  ( A R B  ->  B  e.  ran  R )
 
Theoremdfrnf 4575* Definition of range, using bound-variable hypotheses instead of distinct variable conditions. (Contributed by NM, 14-Aug-1995.) (Revised by Mario Carneiro, 15-Oct-2016.)
 |-  F/_ x A   &    |-  F/_ y A   =>    |-  ran  A  =  { y  |  E. x  x A y }
 
Theoremelrn2 4576* Membership in a range. (Contributed by NM, 10-Jul-1994.)
 |-  A  e.  _V   =>    |-  ( A  e.  ran 
 B 
 <-> 
 E. x <. x ,  A >.  e.  B )
 
Theoremelrn 4577* Membership in a range. (Contributed by NM, 2-Apr-2004.)
 |-  A  e.  _V   =>    |-  ( A  e.  ran 
 B 
 <-> 
 E. x  x B A )
 
Theoremnfdm 4578 Bound-variable hypothesis builder for domain. (Contributed by NM, 30-Jan-2004.) (Revised by Mario Carneiro, 15-Oct-2016.)
 |-  F/_ x A   =>    |-  F/_ x dom  A
 
Theoremnfrn 4579 Bound-variable hypothesis builder for range. (Contributed by NM, 1-Sep-1999.) (Revised by Mario Carneiro, 15-Oct-2016.)
 |-  F/_ x A   =>    |-  F/_ x ran  A
 
Theoremdmiin 4580 Domain of an intersection. (Contributed by FL, 15-Oct-2012.)
 |- 
 dom  |^|_ x  e.  A  B  C_  |^|_ x  e.  A  dom  B
 
Theoremrnopab 4581* The range of a class of ordered pairs. (Contributed by NM, 14-Aug-1995.) (Revised by Mario Carneiro, 4-Dec-2016.)
 |- 
 ran  { <. x ,  y >.  |  ph }  =  { y  |  E. x ph
 }
 
Theoremrnmpt 4582* The range of a function in maps-to notation. (Contributed by Scott Fenton, 21-Mar-2011.) (Revised by Mario Carneiro, 31-Aug-2015.)
 |-  F  =  ( x  e.  A  |->  B )   =>    |-  ran 
 F  =  { y  |  E. x  e.  A  y  =  B }
 
Theoremelrnmpt 4583* The range of a function in maps-to notation. (Contributed by Mario Carneiro, 20-Feb-2015.)
 |-  F  =  ( x  e.  A  |->  B )   =>    |-  ( C  e.  V  ->  ( C  e.  ran  F  <->  E. x  e.  A  C  =  B )
 )
 
Theoremelrnmpt1s 4584* Elementhood in an image set. (Contributed by Mario Carneiro, 12-Sep-2015.)
 |-  F  =  ( x  e.  A  |->  B )   &    |-  ( x  =  D  ->  B  =  C )   =>    |-  ( ( D  e.  A  /\  C  e.  V )  ->  C  e.  ran  F )
 
Theoremelrnmpt1 4585 Elementhood in an image set. (Contributed by Mario Carneiro, 31-Aug-2015.)
 |-  F  =  ( x  e.  A  |->  B )   =>    |-  ( ( x  e.  A  /\  B  e.  V )  ->  B  e.  ran 
 F )
 
Theoremelrnmptg 4586* Membership in the range of a function. (Contributed by NM, 27-Aug-2007.) (Revised by Mario Carneiro, 31-Aug-2015.)
 |-  F  =  ( x  e.  A  |->  B )   =>    |-  ( A. x  e.  A  B  e.  V  ->  ( C  e.  ran  F  <->  E. x  e.  A  C  =  B ) )
 
Theoremelrnmpti 4587* Membership in the range of a function. (Contributed by NM, 30-Aug-2004.) (Revised by Mario Carneiro, 31-Aug-2015.)
 |-  F  =  ( x  e.  A  |->  B )   &    |-  B  e.  _V   =>    |-  ( C  e.  ran  F  <->  E. x  e.  A  C  =  B )
 
Theoremrn0 4588 The range of the empty set is empty. Part of Theorem 3.8(v) of [Monk1] p. 36. (Contributed by NM, 4-Jul-1994.)
 |- 
 ran  (/)  =  (/)
 
Theoremdfiun3g 4589 Alternate definition of indexed union when  B is a set. (Contributed by Mario Carneiro, 31-Aug-2015.)
 |-  ( A. x  e.  A  B  e.  C  -> 
 U_ x  e.  A  B  =  U. ran  ( x  e.  A  |->  B ) )
 
Theoremdfiin3g 4590 Alternate definition of indexed intersection when  B is a set. (Contributed by Mario Carneiro, 31-Aug-2015.)
 |-  ( A. x  e.  A  B  e.  C  -> 
 |^|_ x  e.  A  B  =  |^| ran  ( x  e.  A  |->  B ) )
 
Theoremdfiun3 4591 Alternate definition of indexed union when  B is a set. (Contributed by Mario Carneiro, 31-Aug-2015.)
 |-  B  e.  _V   =>    |-  U_ x  e.  A  B  =  U. ran  ( x  e.  A  |->  B )
 
Theoremdfiin3 4592 Alternate definition of indexed intersection when  B is a set. (Contributed by Mario Carneiro, 31-Aug-2015.)
 |-  B  e.  _V   =>    |-  |^|_ x  e.  A  B  =  |^| ran  ( x  e.  A  |->  B )
 
Theoremriinint 4593* Express a relative indexed intersection as an intersection. (Contributed by Stefan O'Rear, 22-Feb-2015.)
 |-  ( ( X  e.  V  /\  A. k  e.  I  S  C_  X )  ->  ( X  i^i  |^|_
 k  e.  I  S )  =  |^| ( { X }  u.  ran  (
 k  e.  I  |->  S ) ) )
 
Theoremrelrn0 4594 A relation is empty iff its range is empty. (Contributed by NM, 15-Sep-2004.)
 |-  ( Rel  A  ->  ( A  =  (/)  <->  ran  A  =  (/) ) )
 
Theoremdmrnssfld 4595 The domain and range of a class are included in its double union. (Contributed by NM, 13-May-2008.)
 |-  ( dom  A  u.  ran 
 A )  C_  U. U. A
 
Theoremdmexg 4596 The domain of a set is a set. Corollary 6.8(2) of [TakeutiZaring] p. 26. (Contributed by NM, 7-Apr-1995.)
 |-  ( A  e.  V  ->  dom  A  e.  _V )
 
Theoremrnexg 4597 The range of a set is a set. Corollary 6.8(3) of [TakeutiZaring] p. 26. Similar to Lemma 3D of [Enderton] p. 41. (Contributed by NM, 31-Mar-1995.)
 |-  ( A  e.  V  ->  ran  A  e.  _V )
 
Theoremdmex 4598 The domain of a set is a set. Corollary 6.8(2) of [TakeutiZaring] p. 26. (Contributed by NM, 7-Jul-2008.)
 |-  A  e.  _V   =>    |-  dom  A  e.  _V
 
Theoremrnex 4599 The range of a set is a set. Corollary 6.8(3) of [TakeutiZaring] p. 26. Similar to Lemma 3D of [Enderton] p. 41. (Contributed by NM, 7-Jul-2008.)
 |-  A  e.  _V   =>    |-  ran  A  e.  _V
 
Theoremiprc 4600 The identity function is a proper class. This means, for example, that we cannot use it as a member of the class of continuous functions unless it is restricted to a set. (Contributed by NM, 1-Jan-2007.)
 |- 
 -.  _I  e.  _V
    < 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-10124
  Copyright terms: Public domain < Previous  Next >