HomeHome Metamath Proof Explorer
Theorem List (p. 28 of 315)
< Previous  Next >
Browser slow? Try the
Unicode version.

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

Color key:    Metamath Proof Explorer  Metamath Proof Explorer
(1-21492)
  Hilbert Space Explorer  Hilbert Space Explorer
(21493-23015)
  Users' Mathboxes  Users' Mathboxes
(23016-31423)
 

Theorem List for Metamath Proof Explorer - 2701-2800   *Has distinct variable group(s)
TypeLabelDescription
Statement
 
Theoremralcomf 2701* Commutation of restricted quantifiers. (Contributed by Mario Carneiro, 14-Oct-2016.)
 |-  F/_ y A   &    |-  F/_ x B   =>    |-  ( A. x  e.  A  A. y  e.  B  ph  <->  A. y  e.  B  A. x  e.  A  ph )
 
Theoremrexcomf 2702* Commutation of restricted quantifiers. (Contributed by Mario Carneiro, 14-Oct-2016.)
 |-  F/_ y A   &    |-  F/_ x B   =>    |-  ( E. x  e.  A  E. y  e.  B  ph  <->  E. y  e.  B  E. x  e.  A  ph )
 
Theoremralcom 2703* Commutation of restricted quantifiers. (Contributed by NM, 13-Oct-1999.) (Revised by Mario Carneiro, 14-Oct-2016.)
 |-  ( A. x  e.  A  A. y  e.  B  ph  <->  A. y  e.  B  A. x  e.  A  ph )
 
Theoremrexcom 2704* Commutation of restricted quantifiers. (Contributed by NM, 19-Nov-1995.) (Revised by Mario Carneiro, 14-Oct-2016.)
 |-  ( E. x  e.  A  E. y  e.  B  ph  <->  E. y  e.  B  E. x  e.  A  ph )
 
Theoremrexcom13 2705* Swap 1st and 3rd restricted existential quantifiers. (Contributed by NM, 8-Apr-2015.)
 |-  ( E. x  e.  A  E. y  e.  B  E. z  e.  C  ph  <->  E. z  e.  C  E. y  e.  B  E. x  e.  A  ph )
 
Theoremrexrot4 2706* Rotate existential restricted quantifiers twice. (Contributed by NM, 8-Apr-2015.)
 |-  ( E. x  e.  A  E. y  e.  B  E. z  e.  C  E. w  e.  D  ph  <->  E. z  e.  C  E. w  e.  D  E. x  e.  A  E. y  e.  B  ph )
 
Theoremralcom2 2707* Commutation of restricted quantifiers. Note that  x and  y needn't be distinct (this makes the proof longer). (Contributed by NM, 24-Nov-1994.) (Proof shortened by Mario Carneiro, 17-Oct-2016.)
 |-  ( A. x  e.  A  A. y  e.  A  ph  ->  A. y  e.  A  A. x  e.  A  ph )
 
Theoremralcom3 2708 A commutative law for restricted quantifiers that swaps the domain of the restriction. (Contributed by NM, 22-Feb-2004.)
 |-  ( A. x  e.  A  ( x  e.  B  ->  ph )  <->  A. x  e.  B  ( x  e.  A  -> 
 ph ) )
 
Theoremreean 2709* Rearrange existential quantifiers. (Contributed by NM, 27-Oct-2010.) (Proof shortened by Andrew Salmon, 30-May-2011.)
 |- 
 F/ y ph   &    |-  F/ x ps   =>    |-  ( E. x  e.  A  E. y  e.  B  ( ph  /\  ps )  <->  ( E. x  e.  A  ph 
 /\  E. y  e.  B  ps ) )
 
Theoremreeanv 2710* Rearrange existential quantifiers. (Contributed by NM, 9-May-1999.)
 |-  ( E. x  e.  A  E. y  e.  B  ( ph  /\  ps ) 
 <->  ( E. x  e.  A  ph  /\  E. y  e.  B  ps ) )
 
Theorem3reeanv 2711* Rearrange three existential quantifiers. (Contributed by Jeff Madsen, 11-Jun-2010.)
 |-  ( E. x  e.  A  E. y  e.  B  E. z  e.  C  ( ph  /\  ps  /\ 
 ch )  <->  ( E. x  e.  A  ph  /\  E. y  e.  B  ps  /\  E. z  e.  C  ch ) )
 
Theorem2ralor 2712* Distribute quantification over "or". (Contributed by Jeff Madsen, 19-Jun-2010.)
 |-  ( A. x  e.  A  A. y  e.  B  ( ph  \/  ps )  <->  ( A. x  e.  A  ph  \/  A. y  e.  B  ps ) )
 
Theoremnfreu1 2713  x is not free in  E! x  e.  A ph. (Contributed by NM, 19-Mar-1997.)
 |- 
 F/ x E! x  e.  A  ph
 
Theoremnfrmo1 2714  x is not free in  E* x  e.  A ph. (Contributed by NM, 16-Jun-2017.)
 |- 
 F/ x E* x  e.  A ph
 
Theoremnfreud 2715 Deduction version of nfreu 2717. (Contributed by NM, 15-Feb-2013.) (Revised by Mario Carneiro, 8-Oct-2016.)
 |- 
 F/ y ph   &    |-  ( ph  ->  F/_ x A )   &    |-  ( ph  ->  F/ x ps )   =>    |-  ( ph  ->  F/ x E! y  e.  A  ps )
 
Theoremnfrmod 2716 Deduction version of nfrmo 2718. (Contributed by NM, 17-Jun-2017.)
 |- 
 F/ y ph   &    |-  ( ph  ->  F/_ x A )   &    |-  ( ph  ->  F/ x ps )   =>    |-  ( ph  ->  F/ x E* y  e.  A ps )
 
Theoremnfreu 2717 Bound-variable hypothesis builder for restricted uniqueness. (Contributed by NM, 30-Oct-2010.) (Revised by Mario Carneiro, 8-Oct-2016.)
 |-  F/_ x A   &    |-  F/ x ph   =>    |-  F/ x E! y  e.  A  ph
 
Theoremnfrmo 2718 Bound-variable hypothesis builder for restricted uniqueness. (Contributed by NM, 16-Jun-2017.)
 |-  F/_ x A   &    |-  F/ x ph   =>    |-  F/ x E* y  e.  A ph
 
Theoremrabid 2719 An "identity" law of concretion for restricted abstraction. Special case of Definition 2.1 of [Quine] p. 16. (Contributed by NM, 9-Oct-2003.)
 |-  ( x  e.  { x  e.  A  |  ph
 } 
 <->  ( x  e.  A  /\  ph ) )
 
Theoremrabid2 2720* An "identity" law for restricted class abstraction. (Contributed by NM, 9-Oct-2003.) (Proof shortened by Andrew Salmon, 30-May-2011.)
 |-  ( A  =  { x  e.  A  |  ph
 } 
 <-> 
 A. x  e.  A  ph )
 
Theoremrabbi 2721 Equivalent wff's correspond to equal restricted class abstractions. Closed theorem form of rabbidva 2782. (Contributed by NM, 25-Nov-2013.)
 |-  ( A. x  e.  A  ( ps  <->  ch )  <->  { x  e.  A  |  ps }  =  { x  e.  A  |  ch } )
 
Theoremrabswap 2722 Swap with a membership relation in a restricted class abstraction. (Contributed by NM, 4-Jul-2005.)
 |- 
 { x  e.  A  |  x  e.  B }  =  { x  e.  B  |  x  e.  A }
 
Theoremnfrab1 2723 The abstraction variable in a restricted class abstraction isn't free. (Contributed by NM, 19-Mar-1997.)
 |-  F/_ x { x  e.  A  |  ph }
 
Theoremnfrab 2724 A variable not free in a wff remains so in a restricted class abstraction. (Contributed by NM, 13-Oct-2003.) (Revised by Mario Carneiro, 9-Oct-2016.)
 |- 
 F/ x ph   &    |-  F/_ x A   =>    |-  F/_ x { y  e.  A  |  ph }
 
Theoremreubida 2725 Formula-building rule for restricted existential quantifier (deduction rule). (Contributed by Mario Carneiro, 19-Nov-2016.)
 |- 
 F/ x ph   &    |-  ( ( ph  /\  x  e.  A ) 
 ->  ( ps  <->  ch ) )   =>    |-  ( ph  ->  ( E! x  e.  A  ps 
 <->  E! x  e.  A  ch ) )
 
Theoremreubidva 2726* Formula-building rule for restricted existential quantifier (deduction rule). (Contributed by NM, 13-Nov-2004.)
 |-  ( ( ph  /\  x  e.  A )  ->  ( ps 
 <->  ch ) )   =>    |-  ( ph  ->  ( E! x  e.  A  ps 
 <->  E! x  e.  A  ch ) )
 
Theoremreubidv 2727* Formula-building rule for restricted existential quantifier (deduction rule). (Contributed by NM, 17-Oct-1996.)
 |-  ( ph  ->  ( ps 
 <->  ch ) )   =>    |-  ( ph  ->  ( E! x  e.  A  ps 
 <->  E! x  e.  A  ch ) )
 
Theoremreubiia 2728 Formula-building rule for restricted existential quantifier (inference rule). (Contributed by NM, 14-Nov-2004.)
 |-  ( x  e.  A  ->  ( ph  <->  ps ) )   =>    |-  ( E! x  e.  A  ph  <->  E! x  e.  A  ps )
 
Theoremreubii 2729 Formula-building rule for restricted existential quantifier (inference rule). (Contributed by NM, 22-Oct-1999.)
 |-  ( ph  <->  ps )   =>    |-  ( E! x  e.  A  ph  <->  E! x  e.  A  ps )
 
Theoremrmobida 2730 Formula-building rule for restricted existential quantifier (deduction rule). (Contributed by NM, 16-Jun-2017.)
 |- 
 F/ x ph   &    |-  ( ( ph  /\  x  e.  A ) 
 ->  ( ps  <->  ch ) )   =>    |-  ( ph  ->  ( E* x  e.  A ps 
 <->  E* x  e.  A ch ) )
 
Theoremrmobidva 2731* Formula-building rule for restricted existential quantifier (deduction rule). (Contributed by NM, 16-Jun-2017.)
 |-  ( ( ph  /\  x  e.  A )  ->  ( ps 
 <->  ch ) )   =>    |-  ( ph  ->  ( E* x  e.  A ps 
 <->  E* x  e.  A ch ) )
 
Theoremrmobidv 2732* Formula-building rule for restricted existential quantifier (deduction rule). (Contributed by NM, 16-Jun-2017.)
 |-  ( ph  ->  ( ps 
 <->  ch ) )   =>    |-  ( ph  ->  ( E* x  e.  A ps 
 <->  E* x  e.  A ch ) )
 
Theoremrmobiia 2733 Formula-building rule for restricted existential quantifier (inference rule). (Contributed by NM, 16-Jun-2017.)
 |-  ( x  e.  A  ->  ( ph  <->  ps ) )   =>    |-  ( E* x  e.  A ph  <->  E* x  e.  A ps )
 
Theoremrmobii 2734 Formula-building rule for restricted existential quantifier (inference rule). (Contributed by NM, 16-Jun-2017.)
 |-  ( ph  <->  ps )   =>    |-  ( E* x  e.  A ph  <->  E* x  e.  A ps )
 
Theoremraleqf 2735 Equality theorem for restricted universal quantifier, with bound-variable hypotheses instead of distinct variable restrictions. (Contributed by NM, 7-Mar-2004.) (Revised by Andrew Salmon, 11-Jul-2011.)
 |-  F/_ x A   &    |-  F/_ x B   =>    |-  ( A  =  B  ->  ( A. x  e.  A  ph  <->  A. x  e.  B  ph ) )
 
Theoremrexeqf 2736 Equality theorem for restricted existential quantifier, with bound-variable hypotheses instead of distinct variable restrictions. (Contributed by NM, 9-Oct-2003.) (Revised by Andrew Salmon, 11-Jul-2011.)
 |-  F/_ x A   &    |-  F/_ x B   =>    |-  ( A  =  B  ->  ( E. x  e.  A  ph  <->  E. x  e.  B  ph ) )
 
Theoremreueq1f 2737 Equality theorem for restricted uniqueness quantifier, with bound-variable hypotheses instead of distinct variable restrictions. (Contributed by NM, 5-Apr-2004.) (Revised by Andrew Salmon, 11-Jul-2011.)
 |-  F/_ x A   &    |-  F/_ x B   =>    |-  ( A  =  B  ->  ( E! x  e.  A  ph  <->  E! x  e.  B  ph ) )
 
Theoremrmoeq1f 2738 Equality theorem for restricted uniqueness quantifier, with bound-variable hypotheses instead of distinct variable restrictions. (Contributed by Alexander van der Vekens, 17-Jun-2017.)
 |-  F/_ x A   &    |-  F/_ x B   =>    |-  ( A  =  B  ->  ( E* x  e.  A ph  <->  E* x  e.  B ph ) )
 
Theoremraleq 2739* Equality theorem for restricted universal quantifier. (Contributed by NM, 16-Nov-1995.)
 |-  ( A  =  B  ->  ( A. x  e.  A  ph  <->  A. x  e.  B  ph ) )
 
Theoremrexeq 2740* Equality theorem for restricted existential quantifier. (Contributed by NM, 29-Oct-1995.)
 |-  ( A  =  B  ->  ( E. x  e.  A  ph  <->  E. x  e.  B  ph ) )
 
Theoremreueq1 2741* Equality theorem for restricted uniqueness quantifier. (Contributed by NM, 5-Apr-2004.)
 |-  ( A  =  B  ->  ( E! x  e.  A  ph  <->  E! x  e.  B  ph ) )
 
Theoremrmoeq1 2742* Equality theorem for restricted uniqueness quantifier. (Contributed by Alexander van der Vekens, 17-Jun-2017.)
 |-  ( A  =  B  ->  ( E* x  e.  A ph  <->  E* x  e.  B ph ) )
 
Theoremraleqi 2743* Equality inference for restricted universal qualifier. (Contributed by Paul Chapman, 22-Jun-2011.)
 |-  A  =  B   =>    |-  ( A. x  e.  A  ph  <->  A. x  e.  B  ph )
 
Theoremrexeqi 2744* Equality inference for restricted existential qualifier. (Contributed by Mario Carneiro, 23-Apr-2015.)
 |-  A  =  B   =>    |-  ( E. x  e.  A  ph  <->  E. x  e.  B  ph )
 
Theoremraleqdv 2745* Equality deduction for restricted universal quantifier. (Contributed by NM, 13-Nov-2005.)
 |-  ( ph  ->  A  =  B )   =>    |-  ( ph  ->  ( A. x  e.  A  ps 
 <-> 
 A. x  e.  B  ps ) )
 
Theoremrexeqdv 2746* Equality deduction for restricted existential quantifier. (Contributed by NM, 14-Jan-2007.)
 |-  ( ph  ->  A  =  B )   =>    |-  ( ph  ->  ( E. x  e.  A  ps 
 <-> 
 E. x  e.  B  ps ) )
 
Theoremraleqbi1dv 2747* Equality deduction for restricted universal quantifier. (Contributed by NM, 16-Nov-1995.)
 |-  ( A  =  B  ->  ( ph  <->  ps ) )   =>    |-  ( A  =  B  ->  ( A. x  e.  A  ph  <->  A. x  e.  B  ps ) )
 
Theoremrexeqbi1dv 2748* Equality deduction for restricted existential quantifier. (Contributed by NM, 18-Mar-1997.)
 |-  ( A  =  B  ->  ( ph  <->  ps ) )   =>    |-  ( A  =  B  ->  ( E. x  e.  A  ph  <->  E. x  e.  B  ps ) )
 
Theoremreueqd 2749* Equality deduction for restricted uniqueness quantifier. (Contributed by NM, 5-Apr-2004.)
 |-  ( A  =  B  ->  ( ph  <->  ps ) )   =>    |-  ( A  =  B  ->  ( E! x  e.  A  ph  <->  E! x  e.  B  ps ) )
 
Theoremrmoeqd 2750* Equality deduction for restricted uniqueness quantifier. (Contributed by Alexander van der Vekens, 17-Jun-2017.)
 |-  ( A  =  B  ->  ( ph  <->  ps ) )   =>    |-  ( A  =  B  ->  ( E* x  e.  A ph  <->  E* x  e.  B ps ) )
 
Theoremraleqbidv 2751* Equality deduction for restricted universal quantifier. (Contributed by NM, 6-Nov-2007.)
 |-  ( ph  ->  A  =  B )   &    |-  ( ph  ->  ( ps  <->  ch ) )   =>    |-  ( ph  ->  (
 A. x  e.  A  ps 
 <-> 
 A. x  e.  B  ch ) )
 
Theoremrexeqbidv 2752* Equality deduction for restricted universal quantifier. (Contributed by NM, 6-Nov-2007.)
 |-  ( ph  ->  A  =  B )   &    |-  ( ph  ->  ( ps  <->  ch ) )   =>    |-  ( ph  ->  ( E. x  e.  A  ps 
 <-> 
 E. x  e.  B  ch ) )
 
Theoremraleqbidva 2753* Equality deduction for restricted universal quantifier. (Contributed by Mario Carneiro, 5-Jan-2017.)
 |-  ( ph  ->  A  =  B )   &    |-  ( ( ph  /\  x  e.  A ) 
 ->  ( ps  <->  ch ) )   =>    |-  ( ph  ->  (
 A. x  e.  A  ps 
 <-> 
 A. x  e.  B  ch ) )
 
Theoremrexeqbidva 2754* Equality deduction for restricted universal quantifier. (Contributed by Mario Carneiro, 5-Jan-2017.)
 |-  ( ph  ->  A  =  B )   &    |-  ( ( ph  /\  x  e.  A ) 
 ->  ( ps  <->  ch ) )   =>    |-  ( ph  ->  ( E. x  e.  A  ps 
 <-> 
 E. x  e.  B  ch ) )
 
Theoremmormo 2755 Unrestricted "at most one" implies restricted "at most one". (Contributed by NM, 16-Jun-2017.)
 |-  ( E* x ph  ->  E* x  e.  A ph )
 
Theoremreu5 2756 Restricted uniqueness in terms of "at most one." (Contributed by NM, 23-May-1999.) (Revised by NM, 16-Jun-2017.)
 |-  ( E! x  e.  A  ph  <->  ( E. x  e.  A  ph  /\  E* x  e.  A ph ) )
 
Theoremreurex 2757 Restricted unique existence implies restricted existence. (Contributed by NM, 19-Aug-1999.)
 |-  ( E! x  e.  A  ph  ->  E. x  e.  A  ph )
 
Theoremreurmo 2758 Restricted existential uniqueness implies restricted "at most one." (Contributed by NM, 16-Jun-2017.)
 |-  ( E! x  e.  A  ph  ->  E* x  e.  A ph )
 
Theoremrmo5 2759 Restricted "at most one" in term of uniqueness. (Contributed by NM, 16-Jun-2017.)
 |-  ( E* x  e.  A ph  <->  ( E. x  e.  A  ph  ->  E! x  e.  A  ph ) )
 
Theoremnrexrmo 2760 Nonexistence implies restricted "at most one". (Contributed by NM, 17-Jun-2017.)
 |-  ( -.  E. x  e.  A  ph  ->  E* x  e.  A ph )
 
Theoremcbvralf 2761 Rule used to change bound variables, using implicit substitution. (Contributed by NM, 7-Mar-2004.) (Revised by Mario Carneiro, 9-Oct-2016.)
 |-  F/_ x A   &    |-  F/_ y A   &    |-  F/ y ph   &    |-  F/ x ps   &    |-  ( x  =  y  ->  (
 ph 
 <->  ps ) )   =>    |-  ( A. x  e.  A  ph  <->  A. y  e.  A  ps )
 
Theoremcbvrexf 2762 Rule used to change bound variables, using implicit substitution. (Contributed by FL, 27-Apr-2008.) (Revised by Mario Carneiro, 9-Oct-2016.)
 |-  F/_ x A   &    |-  F/_ y A   &    |-  F/ y ph   &    |-  F/ x ps   &    |-  ( x  =  y  ->  (
 ph 
 <->  ps ) )   =>    |-  ( E. x  e.  A  ph  <->  E. y  e.  A  ps )
 
Theoremcbvral 2763* Rule used to change bound variables, using implicit substitution. (Contributed by NM, 31-Jul-2003.)
 |- 
 F/ y ph   &    |-  F/ x ps   &    |-  ( x  =  y  ->  (
 ph 
 <->  ps ) )   =>    |-  ( A. x  e.  A  ph  <->  A. y  e.  A  ps )
 
Theoremcbvrex 2764* Rule used to change bound variables, using implicit substitution. (Contributed by NM, 31-Jul-2003.) (Proof shortened by Andrew Salmon, 8-Jun-2011.)
 |- 
 F/ y ph   &    |-  F/ x ps   &    |-  ( x  =  y  ->  (
 ph 
 <->  ps ) )   =>    |-  ( E. x  e.  A  ph  <->  E. y  e.  A  ps )
 
Theoremcbvreu 2765* Change the bound variable of a restricted uniqueness quantifier using implicit substitution. (Contributed by Mario Carneiro, 15-Oct-2016.)
 |- 
 F/ y ph   &    |-  F/ x ps   &    |-  ( x  =  y  ->  (
 ph 
 <->  ps ) )   =>    |-  ( E! x  e.  A  ph  <->  E! y  e.  A  ps )
 
Theoremcbvrmo 2766* Change the bound variable of restricted "at most one" using implicit substitution. (Contributed by NM, 16-Jun-2017.)
 |- 
 F/ y ph   &    |-  F/ x ps   &    |-  ( x  =  y  ->  (
 ph 
 <->  ps ) )   =>    |-  ( E* x  e.  A ph  <->  E* y  e.  A ps )
 
Theoremcbvralv 2767* Change the bound variable of a restricted universal quantifier using implicit substitution. (Contributed by NM, 28-Jan-1997.)
 |-  ( x  =  y 
 ->  ( ph  <->  ps ) )   =>    |-  ( A. x  e.  A  ph  <->  A. y  e.  A  ps )
 
Theoremcbvrexv 2768* Change the bound variable of a restricted existential quantifier using implicit substitution. (Contributed by NM, 2-Jun-1998.)
 |-  ( x  =  y 
 ->  ( ph  <->  ps ) )   =>    |-  ( E. x  e.  A  ph  <->  E. y  e.  A  ps )
 
Theoremcbvreuv 2769* Change the bound variable of a restricted uniqueness quantifier using implicit substitution. (Contributed by NM, 5-Apr-2004.) (Revised by Mario Carneiro, 15-Oct-2016.)
 |-  ( x  =  y 
 ->  ( ph  <->  ps ) )   =>    |-  ( E! x  e.  A  ph  <->  E! y  e.  A  ps )
 
Theoremcbvrmov 2770* Change the bound variable of a restricted uniqueness quantifier using implicit substitution. (Contributed by Alexander van der Vekens, 17-Jun-2017.)
 |-  ( x  =  y 
 ->  ( ph  <->  ps ) )   =>    |-  ( E* x  e.  A ph  <->  E* y  e.  A ps )
 
Theoremcbvraldva2 2771* Rule used to change the bound variable in a restricted universal quantifier with implicit substitution which also changes the quantifier domain. Deduction form. (Contributed by David Moews, 1-May-2017.)
 |-  ( ( ph  /\  x  =  y )  ->  ( ps 
 <->  ch ) )   &    |-  (
 ( ph  /\  x  =  y )  ->  A  =  B )   =>    |-  ( ph  ->  ( A. x  e.  A  ps 
 <-> 
 A. y  e.  B  ch ) )
 
Theoremcbvrexdva2 2772* Rule used to change the bound variable in a restricted existential quantifier with implicit substitution which also changes the quantifier domain. Deduction form. (Contributed by David Moews, 1-May-2017.)
 |-  ( ( ph  /\  x  =  y )  ->  ( ps 
 <->  ch ) )   &    |-  (
 ( ph  /\  x  =  y )  ->  A  =  B )   =>    |-  ( ph  ->  ( E. x  e.  A  ps 
 <-> 
 E. y  e.  B  ch ) )
 
Theoremcbvraldva 2773* Rule used to change the bound variable in a restricted universal quantifier with implicit substitution. Deduction form. (Contributed by David Moews, 1-May-2017.)
 |-  ( ( ph  /\  x  =  y )  ->  ( ps 
 <->  ch ) )   =>    |-  ( ph  ->  (
 A. x  e.  A  ps 
 <-> 
 A. y  e.  A  ch ) )
 
Theoremcbvrexdva 2774* Rule used to change the bound variable in a restricted existential quantifier with implicit substitution. Deduction form. (Contributed by David Moews, 1-May-2017.)
 |-  ( ( ph  /\  x  =  y )  ->  ( ps 
 <->  ch ) )   =>    |-  ( ph  ->  ( E. x  e.  A  ps 
 <-> 
 E. y  e.  A  ch ) )
 
Theoremcbvral2v 2775* Change bound variables of double restricted universal quantification, using implicit substitution. (Contributed by NM, 10-Aug-2004.)
 |-  ( x  =  z 
 ->  ( ph  <->  ch ) )   &    |-  (
 y  =  w  ->  ( ch  <->  ps ) )   =>    |-  ( A. x  e.  A  A. y  e.  B  ph  <->  A. z  e.  A  A. w  e.  B  ps )
 
Theoremcbvrex2v 2776* Change bound variables of double restricted universal quantification, using implicit substitution. (Contributed by FL, 2-Jul-2012.)
 |-  ( x  =  z 
 ->  ( ph  <->  ch ) )   &    |-  (
 y  =  w  ->  ( ch  <->  ps ) )   =>    |-  ( E. x  e.  A  E. y  e.  B  ph  <->  E. z  e.  A  E. w  e.  B  ps )
 
Theoremcbvral3v 2777* Change bound variables of triple restricted universal quantification, using implicit substitution. (Contributed by NM, 10-May-2005.)
 |-  ( x  =  w 
 ->  ( ph  <->  ch ) )   &    |-  (
 y  =  v  ->  ( ch  <->  th ) )   &    |-  (
 z  =  u  ->  ( th  <->  ps ) )   =>    |-  ( A. x  e.  A  A. y  e.  B  A. z  e.  C  ph  <->  A. w  e.  A  A. v  e.  B  A. u  e.  C  ps )
 
Theoremcbvralsv 2778* Change bound variable by using a substitution. (Contributed by NM, 20-Nov-2005.) (Revised by Andrew Salmon, 11-Jul-2011.)
 |-  ( A. x  e.  A  ph  <->  A. y  e.  A  [ y  /  x ] ph )
 
Theoremcbvrexsv 2779* Change bound variable by using a substitution. (Contributed by NM, 2-Mar-2008.) (Revised by Andrew Salmon, 11-Jul-2011.)
 |-  ( E. x  e.  A  ph  <->  E. y  e.  A  [ y  /  x ] ph )
 
Theoremsbralie 2780* Implicit to explicit substitution that swaps variables in a quantified expression. (Contributed by NM, 5-Sep-2004.)
 |-  ( x  =  y 
 ->  ( ph  <->  ps ) )   =>    |-  ( [ x  /  y ] A. x  e.  y  ph  <->  A. y  e.  x  ps )
 
Theoremrabbiia 2781 Equivalent wff's yield equal restricted class abstractions (inference rule). (Contributed by NM, 22-May-1999.)
 |-  ( x  e.  A  ->  ( ph  <->  ps ) )   =>    |-  { x  e.  A  |  ph }  =  { x  e.  A  |  ps }
 
Theoremrabbidva 2782* Equivalent wff's yield equal restricted class abstractions (deduction rule). (Contributed by NM, 28-Nov-2003.)
 |-  ( ( ph  /\  x  e.  A )  ->  ( ps 
 <->  ch ) )   =>    |-  ( ph  ->  { x  e.  A  |  ps }  =  { x  e.  A  |  ch }
 )
 
Theoremrabbidv 2783* Equivalent wff's yield equal restricted class abstractions (deduction rule). (Contributed by NM, 10-Feb-1995.)
 |-  ( ph  ->  ( ps 
 <->  ch ) )   =>    |-  ( ph  ->  { x  e.  A  |  ps }  =  { x  e.  A  |  ch }
 )
 
Theoremrabeqf 2784 Equality theorem for restricted class abstractions, with bound-variable hypotheses instead of distinct variable restrictions. (Contributed by NM, 7-Mar-2004.)
 |-  F/_ x A   &    |-  F/_ x B   =>    |-  ( A  =  B  ->  { x  e.  A  |  ph }  =  { x  e.  B  |  ph } )
 
Theoremrabeq 2785* Equality theorem for restricted class abstractions. (Contributed by NM, 15-Oct-2003.)
 |-  ( A  =  B  ->  { x  e.  A  |  ph }  =  { x  e.  B  |  ph
 } )
 
Theoremrabeqbidv 2786* Equality of restricted class abstractions. (Contributed by Jeff Madsen, 1-Dec-2009.)
 |-  ( ph  ->  A  =  B )   &    |-  ( ph  ->  ( ps  <->  ch ) )   =>    |-  ( ph  ->  { x  e.  A  |  ps }  =  { x  e.  B  |  ch }
 )
 
Theoremrabeqbidva 2787* Equality of restricted class abstractions. (Contributed by Mario Carneiro, 26-Jan-2017.)
 |-  ( ph  ->  A  =  B )   &    |-  ( ( ph  /\  x  e.  A ) 
 ->  ( ps  <->  ch ) )   =>    |-  ( ph  ->  { x  e.  A  |  ps }  =  { x  e.  B  |  ch }
 )
 
Theoremrabeq2i 2788 Inference rule from equality of a class variable and a restricted class abstraction. (Contributed by NM, 16-Feb-2004.)
 |-  A  =  { x  e.  B  |  ph }   =>    |-  ( x  e.  A  <->  ( x  e.  B  /\  ph )
 )
 
Theoremcbvrab 2789 Rule to change the bound variable in a restricted class abstraction, using implicit substitution. This version has bound-variable hypotheses in place of distinct variable conditions. (Contributed by Andrew Salmon, 11-Jul-2011.) (Revised by Mario Carneiro, 9-Oct-2016.)
 |-  F/_ x A   &    |-  F/_ y A   &    |-  F/ y ph   &    |-  F/ x ps   &    |-  ( x  =  y  ->  (
 ph 
 <->  ps ) )   =>    |-  { x  e.  A  |  ph }  =  { y  e.  A  |  ps }
 
Theoremcbvrabv 2790* Rule to change the bound variable in a restricted class abstraction, using implicit substitution. (Contributed by NM, 26-May-1999.)
 |-  ( x  =  y 
 ->  ( ph  <->  ps ) )   =>    |-  { x  e.  A  |  ph }  =  { y  e.  A  |  ps }
 
2.1.6  The universal class
 
Syntaxcvv 2791 Extend class notation to include the universal class symbol.
 class  _V
 
Theoremvjust 2792 Soundness justification theorem for df-v 2793. (Contributed by Rodolfo Medina, 27-Apr-2010.)
 |- 
 { x  |  x  =  x }  =  {
 y  |  y  =  y }
 
Definitiondf-v 2793 Define the universal class. Definition 5.20 of [TakeutiZaring] p. 21. Also Definition 2.9 of [Quine] p. 19. (Contributed by NM, 5-Aug-1993.)
 |- 
 _V  =  { x  |  x  =  x }
 
Theoremvex 2794 All set variables are sets (see isset 2795). Theorem 6.8 of [Quine] p. 43. (Contributed by NM, 5-Aug-1993.)
 |-  x  e.  _V
 
Theoremisset 2795* Two ways to say " A is a set": A class  A is a member of the universal class  _V (see df-v 2793) if and only if the class  A exists (i.e. there exists some set  x equal to class 
A). Theorem 6.9 of [Quine] p. 43. Notational convention: We will use the notational device " A  e.  _V " to mean " A is a set" very frequently, for example in uniex 4517. Note the when  A is not a set, it is called a proper class. In some theorems, such as uniexg 4518, in order to shorten certain proofs we use the more general antecedent  A  e.  V instead of  A  e.  _V to mean " A is a set."

Note that a constant is implicitly considered distinct from all variables. This is why  _V is not included in the distinct variable list, even though df-clel 2282 requires that the expression substituted for  B not contain  x. (Also, the Metamath spec does not allow constants in the distinct variable list.) (Contributed by NM, 5-Aug-1993.)

 |-  ( A  e.  _V  <->  E. x  x  =  A )
 
Theoremissetf 2796 A version of isset that does not require x and A to be distinct. (Contributed by Andrew Salmon, 6-Jun-2011.) (Revised by Mario Carneiro, 10-Oct-2016.)
 |-  F/_ x A   =>    |-  ( A  e.  _V  <->  E. x  x  =  A )
 
Theoremisseti 2797* A way to say " A is a set" (inference rule). (Contributed by NM, 5-Aug-1993.)
 |-  A  e.  _V   =>    |-  E. x  x  =  A
 
Theoremissetri 2798* A way to say " A is a set" (inference rule). (Contributed by NM, 5-Aug-1993.)
 |- 
 E. x  x  =  A   =>    |-  A  e.  _V
 
Theoremelex 2799 If a class is a member of another class, it is a set. Theorem 6.12 of [Quine] p. 44. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Andrew Salmon, 8-Jun-2011.)
 |-  ( A  e.  B  ->  A  e.  _V )
 
Theoremelexi 2800 If a class is a member of another class, it is a set. (Contributed by NM, 11-Jun-1994.)
 |-  A  e.  B   =>    |-  A  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-10200 103 10201-10300 104 10301-10400 105 10401-10500 106 10501-10600 107 10601-10700 108 10701-10800 109 10801-10900 110 10901-11000 111 11001-11100 112 11101-11200 113 11201-11300 114 11301-11400 115 11401-11500 116 11501-11600 117 11601-11700 118 11701-11800 119 11801-11900 120 11901-12000 121 12001-12100 122 12101-12200 123 12201-12300 124 12301-12400 125 12401-12500 126 12501-12600 127 12601-12700 128 12701-12800 129 12801-12900 130 12901-13000 131 13001-13100 132 13101-13200 133 13201-13300 134 13301-13400 135 13401-13500 136 13501-13600 137 13601-13700 138 13701-13800 139 13801-13900 140 13901-14000 141 14001-14100 142 14101-14200 143 14201-14300 144 14301-14400 145 14401-14500 146 14501-14600 147 14601-14700 148 14701-14800 149 14801-14900 150 14901-15000 151 15001-15100 152 15101-15200 153 15201-15300 154 15301-15400 155 15401-15500 156 15501-15600 157 15601-15700 158 15701-15800 159 15801-15900 160 15901-16000 161 16001-16100 162 16101-16200 163 16201-16300 164 16301-16400 165 16401-16500 166 16501-16600 167 16601-16700 168 16701-16800 169 16801-16900 170 16901-17000 171 17001-17100 172 17101-17200 173 17201-17300 174 17301-17400 175 17401-17500 176 17501-17600 177 17601-17700 178 17701-17800 179 17801-17900 180 17901-18000 181 18001-18100 182 18101-18200 183 18201-18300 184 18301-18400 185 18401-18500 186 18501-18600 187 18601-18700 188 18701-18800 189 18801-18900 190 18901-19000 191 19001-19100 192 19101-19200 193 19201-19300 194 19301-19400 195 19401-19500 196 19501-19600 197 19601-19700 198 19701-19800 199 19801-19900 200 19901-20000 201 20001-20100 202 20101-20200 203 20201-20300 204 20301-20400 205 20401-20500 206 20501-20600 207 20601-20700 208 20701-20800 209 20801-20900 210 20901-21000 211 21001-21100 212 21101-21200 213 21201-21300 214 21301-21400 215 21401-21500 216 21501-21600 217 21601-21700 218 21701-21800 219 21801-21900 220 21901-22000 221 22001-22100 222 22101-22200 223 22201-22300 224 22301-22400 225 22401-22500 226 22501-22600 227 22601-22700 228 22701-22800 229 22801-22900 230 22901-23000 231 23001-23100 232 23101-23200 233 23201-23300 234 23301-23400 235 23401-23500 236 23501-23600 237 23601-23700 238 23701-23800 239 23801-23900 240 23901-24000 241 24001-24100 242 24101-24200 243 24201-24300 244 24301-24400 245 24401-24500 246 24501-24600 247 24601-24700 248 24701-24800 249 24801-24900 250 24901-25000 251 25001-25100 252 25101-25200 253 25201-25300 254 25301-25400 255 25401-25500 256 25501-25600 257 25601-25700 258 25701-25800 259 25801-25900 260 25901-26000 261 26001-26100 262 26101-26200 263 26201-26300 264 26301-26400 265 26401-26500 266 26501-26600 267 26601-26700 268 26701-26800 269 26801-26900 270 26901-27000 271 27001-27100 272 27101-27200 273 27201-27300 274 27301-27400 275 27401-27500 276 27501-27600 277 27601-27700 278 27701-27800 279 27801-27900 280 27901-28000 281 28001-28100 282 28101-28200 283 28201-28300 284 28301-28400 285 28401-28500 286 28501-28600 287 28601-28700 288 28701-28800 289 28801-28900 290 28901-29000 291 29001-29100 292 29101-29200 293 29201-29300 294 29301-29400 295 29401-29500 296 29501-29600 297 29601-29700 298 29701-29800 299 29801-29900 300 29901-30000 301 30001-30100 302 30101-30200 303 30201-30300 304 30301-30400 305 30401-30500 306 30501-30600 307 30601-30700 308 30701-30800 309 30801-30900 310 30901-31000 311 31001-31100 312 31101-31200 313 31201-31300 314 31301-31400 315 31401-31423
  Copyright terms: Public domain < Previous  Next >