HomeHome Intuitionistic Logic Explorer
Theorem List (p. 27 of 114)
< 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 - 2601-2700   *Has distinct variable group(s)
TypeLabelDescription
Statement
 
Theoremrabbii 2601 Equivalent wff's correspond to equal restricted class abstractions. Inference form of rabbidv 2604. (Contributed by Peter Mazsa, 1-Nov-2019.)
 |-  ( ph  <->  ps )   =>    |- 
 { x  e.  A  |  ph }  =  { x  e.  A  |  ps }
 
Theoremrabbidva2 2602* Equivalent wff's yield equal restricted class abstractions. (Contributed by Thierry Arnoux, 4-Feb-2017.)
 |-  ( ph  ->  (
 ( x  e.  A  /\  ps )  <->  ( x  e.  B  /\  ch )
 ) )   =>    |-  ( ph  ->  { x  e.  A  |  ps }  =  { x  e.  B  |  ch } )
 
Theoremrabbidva 2603* 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 2604* 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 2605 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 } )
 
Theoremrabeqif 2606 Equality theorem for restricted class abstractions. Inference form of rabeqf 2605. (Contributed by Glauco Siliprandi, 26-Jun-2021.)
 |-  F/_ x A   &    |-  F/_ x B   &    |-  A  =  B   =>    |- 
 { x  e.  A  |  ph }  =  { x  e.  B  |  ph
 }
 
Theoremrabeq 2607* Equality theorem for restricted class abstractions. (Contributed by NM, 15-Oct-2003.)
 |-  ( A  =  B  ->  { x  e.  A  |  ph }  =  { x  e.  B  |  ph
 } )
 
Theoremrabeqi 2608* Equality theorem for restricted class abstractions. Inference form of rabeq 2607. (Contributed by Glauco Siliprandi, 26-Jun-2021.)
 |-  A  =  B   =>    |-  { x  e.  A  |  ph }  =  { x  e.  B  |  ph }
 
Theoremrabeqdv 2609* Equality of restricted class abstractions. Deduction form of rabeq 2607. (Contributed by Glauco Siliprandi, 5-Apr-2020.)
 |-  ( ph  ->  A  =  B )   =>    |-  ( ph  ->  { x  e.  A  |  ps }  =  { x  e.  B  |  ps } )
 
Theoremrabeqbidv 2610* 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 2611* 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 2612 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 2613 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 2614* 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 2615 Extend class notation to include the universal class symbol.
 class  _V
 
Theoremvjust 2616 Soundness justification theorem for df-v 2617. (Contributed by Rodolfo Medina, 27-Apr-2010.)
 |- 
 { x  |  x  =  x }  =  {
 y  |  y  =  y }
 
Definitiondf-v 2617 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 2618 All setvar variables are sets (see isset 2619). Theorem 6.8 of [Quine] p. 43. (Contributed by NM, 5-Aug-1993.)
 |-  x  e.  _V
 
Theoremisset 2619* Two ways to say " A is a set": A class  A is a member of the universal class  _V (see df-v 2617) 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 4238. Note the when  A is not a set, it is called a proper class. In some theorems, such as uniexg 4239, 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 2081 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, 26-May-1993.)

 |-  ( A  e.  _V  <->  E. x  x  =  A )
 
Theoremissetf 2620 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 2621* A way to say " A is a set" (inference rule). (Contributed by NM, 5-Aug-1993.)
 |-  A  e.  _V   =>    |-  E. x  x  =  A
 
Theoremissetri 2622* A way to say " A is a set" (inference rule). (Contributed by NM, 5-Aug-1993.)
 |- 
 E. x  x  =  A   =>    |-  A  e.  _V
 
Theoremeqvisset 2623 A class equal to a variable is a set. Note the absence of dv condition, contrary to isset 2619 and issetri 2622. (Contributed by BJ, 27-Apr-2019.)
 |-  ( x  =  A  ->  A  e.  _V )
 
Theoremelex 2624 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 2625 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
 
Theoremelexd 2626 If a class is a member of another class, it is a set. (Contributed by Glauco Siliprandi, 11-Oct-2020.)
 |-  ( ph  ->  A  e.  V )   =>    |-  ( ph  ->  A  e.  _V )
 
Theoremelisset 2627* An element of a class exists. (Contributed by NM, 1-May-1995.)
 |-  ( A  e.  V  ->  E. x  x  =  A )
 
Theoremelex22 2628* If two classes each contain another class, then both contain some set. (Contributed by Alan Sare, 24-Oct-2011.)
 |-  ( ( A  e.  B  /\  A  e.  C )  ->  E. x ( x  e.  B  /\  x  e.  C ) )
 
Theoremelex2 2629* If a class contains another class, then it contains some set. (Contributed by Alan Sare, 25-Sep-2011.)
 |-  ( A  e.  B  ->  E. x  x  e.  B )
 
Theoremralv 2630 A universal quantifier restricted to the universe is unrestricted. (Contributed by NM, 26-Mar-2004.)
 |-  ( A. x  e. 
 _V  ph  <->  A. x ph )
 
Theoremrexv 2631 An existential quantifier restricted to the universe is unrestricted. (Contributed by NM, 26-Mar-2004.)
 |-  ( E. x  e. 
 _V  ph  <->  E. x ph )
 
Theoremreuv 2632 A unique existential quantifier restricted to the universe is unrestricted. (Contributed by NM, 1-Nov-2010.)
 |-  ( E! x  e. 
 _V  ph  <->  E! x ph )
 
Theoremrmov 2633 An at-most-one quantifier restricted to the universe is unrestricted. (Contributed by Alexander van der Vekens, 17-Jun-2017.)
 |-  ( E* x  e. 
 _V  ph  <->  E* x ph )
 
Theoremrabab 2634 A class abstraction restricted to the universe is unrestricted. (Contributed by NM, 27-Dec-2004.) (Proof shortened by Andrew Salmon, 8-Jun-2011.)
 |- 
 { x  e.  _V  |  ph }  =  { x  |  ph }
 
Theoremralcom4 2635* Commutation of restricted and unrestricted universal quantifiers. (Contributed by NM, 26-Mar-2004.) (Proof shortened by Andrew Salmon, 8-Jun-2011.)
 |-  ( A. x  e.  A  A. y ph  <->  A. y A. x  e.  A  ph )
 
Theoremrexcom4 2636* Commutation of restricted and unrestricted existential quantifiers. (Contributed by NM, 12-Apr-2004.) (Proof shortened by Andrew Salmon, 8-Jun-2011.)
 |-  ( E. x  e.  A  E. y ph  <->  E. y E. x  e.  A  ph )
 
Theoremrexcom4a 2637* Specialized existential commutation lemma. (Contributed by Jeff Madsen, 1-Jun-2011.)
 |-  ( E. x E. y  e.  A  ( ph  /\  ps )  <->  E. y  e.  A  ( ph  /\  E. x ps ) )
 
Theoremrexcom4b 2638* Specialized existential commutation lemma. (Contributed by Jeff Madsen, 1-Jun-2011.)
 |-  B  e.  _V   =>    |-  ( E. x E. y  e.  A  ( ph  /\  x  =  B )  <->  E. y  e.  A  ph )
 
Theoremceqsalt 2639* Closed theorem version of ceqsalg 2641. (Contributed by NM, 28-Feb-2013.) (Revised by Mario Carneiro, 10-Oct-2016.)
 |-  ( ( F/ x ps  /\  A. x ( x  =  A  ->  (
 ph 
 <->  ps ) )  /\  A  e.  V )  ->  ( A. x ( x  =  A  ->  ph )  <->  ps ) )
 
Theoremceqsralt 2640* Restricted quantifier version of ceqsalt 2639. (Contributed by NM, 28-Feb-2013.) (Revised by Mario Carneiro, 10-Oct-2016.)
 |-  ( ( F/ x ps  /\  A. x ( x  =  A  ->  (
 ph 
 <->  ps ) )  /\  A  e.  B )  ->  ( A. x  e.  B  ( x  =  A  ->  ph )  <->  ps ) )
 
Theoremceqsalg 2641* A representation of explicit substitution of a class for a variable, inferred from an implicit substitution hypothesis. (Contributed by NM, 29-Oct-2003.) (Proof shortened by Andrew Salmon, 8-Jun-2011.)
 |- 
 F/ x ps   &    |-  ( x  =  A  ->  (
 ph 
 <->  ps ) )   =>    |-  ( A  e.  V  ->  ( A. x ( x  =  A  -> 
 ph )  <->  ps ) )
 
Theoremceqsal 2642* A representation of explicit substitution of a class for a variable, inferred from an implicit substitution hypothesis. (Contributed by NM, 18-Aug-1993.)
 |- 
 F/ x ps   &    |-  A  e.  _V   &    |-  ( x  =  A  ->  ( ph  <->  ps ) )   =>    |-  ( A. x ( x  =  A  ->  ph )  <->  ps )
 
Theoremceqsalv 2643* A representation of explicit substitution of a class for a variable, inferred from an implicit substitution hypothesis. (Contributed by NM, 18-Aug-1993.)
 |-  A  e.  _V   &    |-  ( x  =  A  ->  (
 ph 
 <->  ps ) )   =>    |-  ( A. x ( x  =  A  -> 
 ph )  <->  ps )
 
Theoremceqsralv 2644* Restricted quantifier version of ceqsalv 2643. (Contributed by NM, 21-Jun-2013.)
 |-  ( x  =  A  ->  ( ph  <->  ps ) )   =>    |-  ( A  e.  B  ->  ( A. x  e.  B  ( x  =  A  ->  ph )  <->  ps ) )
 
Theoremgencl 2645* Implicit substitution for class with embedded variable. (Contributed by NM, 17-May-1996.)
 |-  ( th  <->  E. x ( ch 
 /\  A  =  B ) )   &    |-  ( A  =  B  ->  ( ph  <->  ps ) )   &    |-  ( ch  ->  ph )   =>    |-  ( th  ->  ps )
 
Theorem2gencl 2646* Implicit substitution for class with embedded variable. (Contributed by NM, 17-May-1996.)
 |-  ( C  e.  S  <->  E. x  e.  R  A  =  C )   &    |-  ( D  e.  S 
 <-> 
 E. y  e.  R  B  =  D )   &    |-  ( A  =  C  ->  (
 ph 
 <->  ps ) )   &    |-  ( B  =  D  ->  ( ps  <->  ch ) )   &    |-  (
 ( x  e.  R  /\  y  e.  R )  ->  ph )   =>    |-  ( ( C  e.  S  /\  D  e.  S )  ->  ch )
 
Theorem3gencl 2647* Implicit substitution for class with embedded variable. (Contributed by NM, 17-May-1996.)
 |-  ( D  e.  S  <->  E. x  e.  R  A  =  D )   &    |-  ( F  e.  S 
 <-> 
 E. y  e.  R  B  =  F )   &    |-  ( G  e.  S  <->  E. z  e.  R  C  =  G )   &    |-  ( A  =  D  ->  (
 ph 
 <->  ps ) )   &    |-  ( B  =  F  ->  ( ps  <->  ch ) )   &    |-  ( C  =  G  ->  ( ch  <->  th ) )   &    |-  (
 ( x  e.  R  /\  y  e.  R  /\  z  e.  R )  ->  ph )   =>    |-  ( ( D  e.  S  /\  F  e.  S  /\  G  e.  S ) 
 ->  th )
 
Theoremcgsexg 2648* Implicit substitution inference for general classes. (Contributed by NM, 26-Aug-2007.)
 |-  ( x  =  A  ->  ch )   &    |-  ( ch  ->  (
 ph 
 <->  ps ) )   =>    |-  ( A  e.  V  ->  ( E. x ( ch  /\  ph )  <->  ps ) )
 
Theoremcgsex2g 2649* Implicit substitution inference for general classes. (Contributed by NM, 26-Jul-1995.)
 |-  ( ( x  =  A  /\  y  =  B )  ->  ch )   &    |-  ( ch  ->  ( ph  <->  ps ) )   =>    |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( E. x E. y ( ch  /\  ph )  <->  ps ) )
 
Theoremcgsex4g 2650* An implicit substitution inference for 4 general classes. (Contributed by NM, 5-Aug-1995.)
 |-  ( ( ( x  =  A  /\  y  =  B )  /\  (
 z  =  C  /\  w  =  D )
 )  ->  ch )   &    |-  ( ch  ->  ( ph  <->  ps ) )   =>    |-  ( ( ( A  e.  R  /\  B  e.  S )  /\  ( C  e.  R  /\  D  e.  S ) )  ->  ( E. x E. y E. z E. w ( ch  /\  ph )  <->  ps ) )
 
Theoremceqsex 2651* Elimination of an existential quantifier, using implicit substitution. (Contributed by NM, 2-Mar-1995.) (Revised by Mario Carneiro, 10-Oct-2016.)
 |- 
 F/ x ps   &    |-  A  e.  _V   &    |-  ( x  =  A  ->  ( ph  <->  ps ) )   =>    |-  ( E. x ( x  =  A  /\  ph )  <->  ps )
 
Theoremceqsexv 2652* Elimination of an existential quantifier, using implicit substitution. (Contributed by NM, 2-Mar-1995.)
 |-  A  e.  _V   &    |-  ( x  =  A  ->  (
 ph 
 <->  ps ) )   =>    |-  ( E. x ( x  =  A  /\  ph )  <->  ps )
 
Theoremceqsex2 2653* Elimination of two existential quantifiers, using implicit substitution. (Contributed by Scott Fenton, 7-Jun-2006.)
 |- 
 F/ x ps   &    |-  F/ y ch   &    |-  A  e.  _V   &    |-  B  e.  _V   &    |-  ( x  =  A  ->  ( ph  <->  ps ) )   &    |-  ( y  =  B  ->  ( ps  <->  ch ) )   =>    |-  ( E. x E. y ( x  =  A  /\  y  =  B  /\  ph )  <->  ch )
 
Theoremceqsex2v 2654* Elimination of two existential quantifiers, using implicit substitution. (Contributed by Scott Fenton, 7-Jun-2006.)
 |-  A  e.  _V   &    |-  B  e.  _V   &    |-  ( x  =  A  ->  ( ph  <->  ps ) )   &    |-  ( y  =  B  ->  ( ps  <->  ch ) )   =>    |-  ( E. x E. y ( x  =  A  /\  y  =  B  /\  ph )  <->  ch )
 
Theoremceqsex3v 2655* Elimination of three existential quantifiers, using implicit substitution. (Contributed by NM, 16-Aug-2011.)
 |-  A  e.  _V   &    |-  B  e.  _V   &    |-  C  e.  _V   &    |-  ( x  =  A  ->  (
 ph 
 <->  ps ) )   &    |-  (
 y  =  B  ->  ( ps  <->  ch ) )   &    |-  (
 z  =  C  ->  ( ch  <->  th ) )   =>    |-  ( E. x E. y E. z ( ( x  =  A  /\  y  =  B  /\  z  =  C )  /\  ph )  <->  th )
 
Theoremceqsex4v 2656* Elimination of four existential quantifiers, using implicit substitution. (Contributed by NM, 23-Sep-2011.)
 |-  A  e.  _V   &    |-  B  e.  _V   &    |-  C  e.  _V   &    |-  D  e.  _V   &    |-  ( x  =  A  ->  ( ph  <->  ps ) )   &    |-  ( y  =  B  ->  ( ps  <->  ch ) )   &    |-  ( z  =  C  ->  ( ch  <->  th ) )   &    |-  ( w  =  D  ->  ( th  <->  ta ) )   =>    |-  ( E. x E. y E. z E. w ( ( x  =  A  /\  y  =  B )  /\  (
 z  =  C  /\  w  =  D )  /\  ph )  <->  ta )
 
Theoremceqsex6v 2657* Elimination of six existential quantifiers, using implicit substitution. (Contributed by NM, 21-Sep-2011.)
 |-  A  e.  _V   &    |-  B  e.  _V   &    |-  C  e.  _V   &    |-  D  e.  _V   &    |-  E  e.  _V   &    |-  F  e.  _V   &    |-  ( x  =  A  ->  ( ph  <->  ps ) )   &    |-  ( y  =  B  ->  ( ps  <->  ch ) )   &    |-  ( z  =  C  ->  ( ch  <->  th ) )   &    |-  ( w  =  D  ->  ( th  <->  ta ) )   &    |-  ( v  =  E  ->  ( ta  <->  et ) )   &    |-  ( u  =  F  ->  ( et  <->  ze ) )   =>    |-  ( E. x E. y E. z E. w E. v E. u ( ( x  =  A  /\  y  =  B  /\  z  =  C )  /\  ( w  =  D  /\  v  =  E  /\  u  =  F )  /\  ph )  <->  ze )
 
Theoremceqsex8v 2658* Elimination of eight existential quantifiers, using implicit substitution. (Contributed by NM, 23-Sep-2011.)
 |-  A  e.  _V   &    |-  B  e.  _V   &    |-  C  e.  _V   &    |-  D  e.  _V   &    |-  E  e.  _V   &    |-  F  e.  _V   &    |-  G  e.  _V   &    |-  H  e.  _V   &    |-  ( x  =  A  ->  ( ph  <->  ps ) )   &    |-  ( y  =  B  ->  ( ps  <->  ch ) )   &    |-  ( z  =  C  ->  ( ch  <->  th ) )   &    |-  ( w  =  D  ->  ( th  <->  ta ) )   &    |-  ( v  =  E  ->  ( ta  <->  et ) )   &    |-  ( u  =  F  ->  ( et  <->  ze ) )   &    |-  ( t  =  G  ->  ( ze  <->  si ) )   &    |-  ( s  =  H  ->  ( si  <->  rh ) )   =>    |-  ( E. x E. y E. z E. w E. v E. u E. t E. s ( ( ( x  =  A  /\  y  =  B )  /\  ( z  =  C  /\  w  =  D ) )  /\  ( ( v  =  E  /\  u  =  F )  /\  (
 t  =  G  /\  s  =  H )
 )  /\  ph )  <->  rh )
 
Theoremgencbvex 2659* Change of bound variable using implicit substitution. (Contributed by NM, 17-May-1996.) (Proof shortened by Andrew Salmon, 8-Jun-2011.)
 |-  A  e.  _V   &    |-  ( A  =  y  ->  (
 ph 
 <->  ps ) )   &    |-  ( A  =  y  ->  ( ch  <->  th ) )   &    |-  ( th 
 <-> 
 E. x ( ch 
 /\  A  =  y ) )   =>    |-  ( E. x ( ch  /\  ph )  <->  E. y ( th  /\  ps ) )
 
Theoremgencbvex2 2660* Restatement of gencbvex 2659 with weaker hypotheses. (Contributed by Jeff Hankins, 6-Dec-2006.)
 |-  A  e.  _V   &    |-  ( A  =  y  ->  (
 ph 
 <->  ps ) )   &    |-  ( A  =  y  ->  ( ch  <->  th ) )   &    |-  ( th  ->  E. x ( ch 
 /\  A  =  y ) )   =>    |-  ( E. x ( ch  /\  ph )  <->  E. y ( th  /\  ps ) )
 
Theoremgencbval 2661* Change of bound variable using implicit substitution. (Contributed by NM, 17-May-1996.) (Proof rewritten by Jim Kingdon, 20-Jun-2018.)
 |-  A  e.  _V   &    |-  ( A  =  y  ->  (
 ph 
 <->  ps ) )   &    |-  ( A  =  y  ->  ( ch  <->  th ) )   &    |-  ( th 
 <-> 
 E. x ( ch 
 /\  A  =  y ) )   =>    |-  ( A. x ( ch  ->  ph )  <->  A. y ( th  ->  ps ) )
 
Theoremsbhypf 2662* Introduce an explicit substitution into an implicit substitution hypothesis. See also csbhypf . (Contributed by Raph Levien, 10-Apr-2004.)
 |- 
 F/ x ps   &    |-  ( x  =  A  ->  (
 ph 
 <->  ps ) )   =>    |-  ( y  =  A  ->  ( [
 y  /  x ] ph 
 <->  ps ) )
 
Theoremvtoclgft 2663 Closed theorem form of vtoclgf 2671. (Contributed by NM, 17-Feb-2013.) (Revised by Mario Carneiro, 12-Oct-2016.)
 |-  ( ( ( F/_ x A  /\  F/ x ps )  /\  ( A. x ( x  =  A  ->  ( ph  <->  ps ) )  /\  A. x ph )  /\  A  e.  V )  ->  ps )
 
Theoremvtocldf 2664 Implicit substitution of a class for a setvar variable. (Contributed by Mario Carneiro, 15-Oct-2016.)
 |-  ( ph  ->  A  e.  V )   &    |-  ( ( ph  /\  x  =  A ) 
 ->  ( ps  <->  ch ) )   &    |-  ( ph  ->  ps )   &    |-  F/ x ph   &    |-  ( ph  ->  F/_ x A )   &    |-  ( ph  ->  F/ x ch )   =>    |-  ( ph  ->  ch )
 
Theoremvtocld 2665* Implicit substitution of a class for a setvar variable. (Contributed by Mario Carneiro, 15-Oct-2016.)
 |-  ( ph  ->  A  e.  V )   &    |-  ( ( ph  /\  x  =  A ) 
 ->  ( ps  <->  ch ) )   &    |-  ( ph  ->  ps )   =>    |-  ( ph  ->  ch )
 
Theoremvtoclf 2666* Implicit substitution of a class for a setvar variable. This is a generalization of chvar 1684. (Contributed by NM, 30-Aug-1993.)
 |- 
 F/ x ps   &    |-  A  e.  _V   &    |-  ( x  =  A  ->  ( ph  <->  ps ) )   &    |-  ph   =>    |- 
 ps
 
Theoremvtocl 2667* Implicit substitution of a class for a setvar variable. (Contributed by NM, 30-Aug-1993.)
 |-  A  e.  _V   &    |-  ( x  =  A  ->  (
 ph 
 <->  ps ) )   &    |-  ph   =>    |- 
 ps
 
Theoremvtocl2 2668* Implicit substitution of classes for setvar variables. (Contributed by NM, 26-Jul-1995.) (Proof shortened by Andrew Salmon, 8-Jun-2011.)
 |-  A  e.  _V   &    |-  B  e.  _V   &    |-  ( ( x  =  A  /\  y  =  B )  ->  ( ph 
 <->  ps ) )   &    |-  ph   =>    |- 
 ps
 
Theoremvtocl3 2669* Implicit substitution of classes for setvar variables. (Contributed by NM, 3-Jun-1995.) (Proof shortened by Andrew Salmon, 8-Jun-2011.)
 |-  A  e.  _V   &    |-  B  e.  _V   &    |-  C  e.  _V   &    |-  (
 ( x  =  A  /\  y  =  B  /\  z  =  C )  ->  ( ph  <->  ps ) )   &    |-  ph   =>    |- 
 ps
 
Theoremvtoclb 2670* Implicit substitution of a class for a setvar variable. (Contributed by NM, 23-Dec-1993.)
 |-  A  e.  _V   &    |-  ( x  =  A  ->  (
 ph 
 <->  ch ) )   &    |-  ( x  =  A  ->  ( ps  <->  th ) )   &    |-  ( ph 
 <->  ps )   =>    |-  ( ch  <->  th )
 
Theoremvtoclgf 2671 Implicit substitution of a class for a setvar variable, with bound-variable hypotheses in place of distinct variable restrictions. (Contributed by NM, 21-Sep-2003.) (Proof shortened by Mario Carneiro, 10-Oct-2016.)
 |-  F/_ x A   &    |-  F/ x ps   &    |-  ( x  =  A  ->  (
 ph 
 <->  ps ) )   &    |-  ph   =>    |-  ( A  e.  V  ->  ps )
 
Theoremvtoclg 2672* Implicit substitution of a class expression for a setvar variable. (Contributed by NM, 17-Apr-1995.)
 |-  ( x  =  A  ->  ( ph  <->  ps ) )   &    |-  ph   =>    |-  ( A  e.  V  ->  ps )
 
Theoremvtoclbg 2673* Implicit substitution of a class for a setvar variable. (Contributed by NM, 29-Apr-1994.)
 |-  ( x  =  A  ->  ( ph  <->  ch ) )   &    |-  ( x  =  A  ->  ( ps  <->  th ) )   &    |-  ( ph 
 <->  ps )   =>    |-  ( A  e.  V  ->  ( ch  <->  th ) )
 
Theoremvtocl2gf 2674 Implicit substitution of a class for a setvar variable. (Contributed by NM, 25-Apr-1995.)
 |-  F/_ x A   &    |-  F/_ y A   &    |-  F/_ y B   &    |- 
 F/ x ps   &    |-  F/ y ch   &    |-  ( x  =  A  ->  ( ph  <->  ps ) )   &    |-  ( y  =  B  ->  ( ps  <->  ch ) )   &    |-  ph   =>    |-  ( ( A  e.  V  /\  B  e.  W )  ->  ch )
 
Theoremvtocl3gf 2675 Implicit substitution of a class for a setvar variable. (Contributed by NM, 10-Aug-2013.) (Revised by Mario Carneiro, 10-Oct-2016.)
 |-  F/_ x A   &    |-  F/_ y A   &    |-  F/_ z A   &    |-  F/_ y B   &    |-  F/_ z B   &    |-  F/_ z C   &    |- 
 F/ x ps   &    |-  F/ y ch   &    |-  F/ z th   &    |-  ( x  =  A  ->  (
 ph 
 <->  ps ) )   &    |-  (
 y  =  B  ->  ( ps  <->  ch ) )   &    |-  (
 z  =  C  ->  ( ch  <->  th ) )   &    |-  ph   =>    |-  ( ( A  e.  V  /\  B  e.  W  /\  C  e.  X ) 
 ->  th )
 
Theoremvtocl2g 2676* Implicit substitution of 2 classes for 2 setvar variables. (Contributed by NM, 25-Apr-1995.)
 |-  ( x  =  A  ->  ( ph  <->  ps ) )   &    |-  (
 y  =  B  ->  ( ps  <->  ch ) )   &    |-  ph   =>    |-  ( ( A  e.  V  /\  B  e.  W )  ->  ch )
 
Theoremvtoclgaf 2677* Implicit substitution of a class for a setvar variable. (Contributed by NM, 17-Feb-2006.) (Revised by Mario Carneiro, 10-Oct-2016.)
 |-  F/_ x A   &    |-  F/ x ps   &    |-  ( x  =  A  ->  (
 ph 
 <->  ps ) )   &    |-  ( x  e.  B  ->  ph )   =>    |-  ( A  e.  B  ->  ps )
 
Theoremvtoclga 2678* Implicit substitution of a class for a setvar variable. (Contributed by NM, 20-Aug-1995.)
 |-  ( x  =  A  ->  ( ph  <->  ps ) )   &    |-  ( x  e.  B  ->  ph )   =>    |-  ( A  e.  B  ->  ps )
 
Theoremvtocl2gaf 2679* Implicit substitution of 2 classes for 2 setvar variables. (Contributed by NM, 10-Aug-2013.)
 |-  F/_ x A   &    |-  F/_ y A   &    |-  F/_ y B   &    |- 
 F/ x ps   &    |-  F/ y ch   &    |-  ( x  =  A  ->  ( ph  <->  ps ) )   &    |-  ( y  =  B  ->  ( ps  <->  ch ) )   &    |-  ( ( x  e.  C  /\  y  e.  D )  ->  ph )   =>    |-  (
 ( A  e.  C  /\  B  e.  D ) 
 ->  ch )
 
Theoremvtocl2ga 2680* Implicit substitution of 2 classes for 2 setvar variables. (Contributed by NM, 20-Aug-1995.)
 |-  ( x  =  A  ->  ( ph  <->  ps ) )   &    |-  (
 y  =  B  ->  ( ps  <->  ch ) )   &    |-  (
 ( x  e.  C  /\  y  e.  D )  ->  ph )   =>    |-  ( ( A  e.  C  /\  B  e.  D )  ->  ch )
 
Theoremvtocl3gaf 2681* Implicit substitution of 3 classes for 3 setvar variables. (Contributed by NM, 10-Aug-2013.) (Revised by Mario Carneiro, 11-Oct-2016.)
 |-  F/_ x A   &    |-  F/_ y A   &    |-  F/_ z A   &    |-  F/_ y B   &    |-  F/_ z B   &    |-  F/_ z C   &    |- 
 F/ x ps   &    |-  F/ y ch   &    |-  F/ z th   &    |-  ( x  =  A  ->  (
 ph 
 <->  ps ) )   &    |-  (
 y  =  B  ->  ( ps  <->  ch ) )   &    |-  (
 z  =  C  ->  ( ch  <->  th ) )   &    |-  (
 ( x  e.  R  /\  y  e.  S  /\  z  e.  T )  ->  ph )   =>    |-  ( ( A  e.  R  /\  B  e.  S  /\  C  e.  T ) 
 ->  th )
 
Theoremvtocl3ga 2682* Implicit substitution of 3 classes for 3 setvar variables. (Contributed by NM, 20-Aug-1995.)
 |-  ( x  =  A  ->  ( ph  <->  ps ) )   &    |-  (
 y  =  B  ->  ( ps  <->  ch ) )   &    |-  (
 z  =  C  ->  ( ch  <->  th ) )   &    |-  (
 ( x  e.  D  /\  y  e.  R  /\  z  e.  S )  ->  ph )   =>    |-  ( ( A  e.  D  /\  B  e.  R  /\  C  e.  S ) 
 ->  th )
 
Theoremvtocleg 2683* Implicit substitution of a class for a setvar variable. (Contributed by NM, 10-Jan-2004.)
 |-  ( x  =  A  -> 
 ph )   =>    |-  ( A  e.  V  -> 
 ph )
 
Theoremvtoclegft 2684* Implicit substitution of a class for a setvar variable. (Closed theorem version of vtoclef 2685.) (Contributed by NM, 7-Nov-2005.) (Revised by Mario Carneiro, 11-Oct-2016.)
 |-  ( ( A  e.  B  /\  F/ x ph  /\ 
 A. x ( x  =  A  ->  ph )
 )  ->  ph )
 
Theoremvtoclef 2685* Implicit substitution of a class for a setvar variable. (Contributed by NM, 18-Aug-1993.)
 |- 
 F/ x ph   &    |-  A  e.  _V   &    |-  ( x  =  A  ->  ph )   =>    |-  ph
 
Theoremvtocle 2686* Implicit substitution of a class for a setvar variable. (Contributed by NM, 9-Sep-1993.)
 |-  A  e.  _V   &    |-  ( x  =  A  ->  ph )   =>    |-  ph
 
Theoremvtoclri 2687* Implicit substitution of a class for a setvar variable. (Contributed by NM, 21-Nov-1994.)
 |-  ( x  =  A  ->  ( ph  <->  ps ) )   &    |-  A. x  e.  B  ph   =>    |-  ( A  e.  B  ->  ps )
 
Theoremspcimgft 2688 A closed version of spcimgf 2692. (Contributed by Mario Carneiro, 4-Jan-2017.)
 |- 
 F/ x ps   &    |-  F/_ x A   =>    |-  ( A. x ( x  =  A  ->  (
 ph  ->  ps ) )  ->  ( A  e.  B  ->  ( A. x ph  ->  ps ) ) )
 
Theoremspcgft 2689 A closed version of spcgf 2694. (Contributed by Andrew Salmon, 6-Jun-2011.) (Revised by Mario Carneiro, 4-Jan-2017.)
 |- 
 F/ x ps   &    |-  F/_ x A   =>    |-  ( A. x ( x  =  A  ->  (
 ph 
 <->  ps ) )  ->  ( A  e.  B  ->  ( A. x ph  ->  ps ) ) )
 
Theoremspcimegft 2690 A closed version of spcimegf 2693. (Contributed by Mario Carneiro, 4-Jan-2017.)
 |- 
 F/ x ps   &    |-  F/_ x A   =>    |-  ( A. x ( x  =  A  ->  ( ps  ->  ph ) ) 
 ->  ( A  e.  B  ->  ( ps  ->  E. x ph ) ) )
 
Theoremspcegft 2691 A closed version of spcegf 2695. (Contributed by Jim Kingdon, 22-Jun-2018.)
 |- 
 F/ x ps   &    |-  F/_ x A   =>    |-  ( A. x ( x  =  A  ->  (
 ph 
 <->  ps ) )  ->  ( A  e.  B  ->  ( ps  ->  E. x ph ) ) )
 
Theoremspcimgf 2692 Rule of specialization, using implicit substitution. Compare Theorem 7.3 of [Quine] p. 44. (Contributed by Mario Carneiro, 4-Jan-2017.)
 |-  F/_ x A   &    |-  F/ x ps   &    |-  ( x  =  A  ->  (
 ph  ->  ps ) )   =>    |-  ( A  e.  V  ->  ( A. x ph 
 ->  ps ) )
 
Theoremspcimegf 2693 Existential specialization, using implicit substitution. (Contributed by Mario Carneiro, 4-Jan-2017.)
 |-  F/_ x A   &    |-  F/ x ps   &    |-  ( x  =  A  ->  ( ps  ->  ph ) )   =>    |-  ( A  e.  V  ->  ( ps  ->  E. x ph ) )
 
Theoremspcgf 2694 Rule of specialization, using implicit substitution. Compare Theorem 7.3 of [Quine] p. 44. (Contributed by NM, 2-Feb-1997.) (Revised by Andrew Salmon, 12-Aug-2011.)
 |-  F/_ x A   &    |-  F/ x ps   &    |-  ( x  =  A  ->  (
 ph 
 <->  ps ) )   =>    |-  ( A  e.  V  ->  ( A. x ph 
 ->  ps ) )
 
Theoremspcegf 2695 Existential specialization, using implicit substitution. (Contributed by NM, 2-Feb-1997.)
 |-  F/_ x A   &    |-  F/ x ps   &    |-  ( x  =  A  ->  (
 ph 
 <->  ps ) )   =>    |-  ( A  e.  V  ->  ( ps  ->  E. x ph ) )
 
Theoremspcimdv 2696* Restricted specialization, using implicit substitution. (Contributed by Mario Carneiro, 4-Jan-2017.)
 |-  ( ph  ->  A  e.  B )   &    |-  ( ( ph  /\  x  =  A ) 
 ->  ( ps  ->  ch )
 )   =>    |-  ( ph  ->  ( A. x ps  ->  ch )
 )
 
Theoremspcdv 2697* Rule of specialization, using implicit substitution. Analogous to rspcdv 2718. (Contributed by David Moews, 1-May-2017.)
 |-  ( ph  ->  A  e.  B )   &    |-  ( ( ph  /\  x  =  A ) 
 ->  ( ps  <->  ch ) )   =>    |-  ( ph  ->  (
 A. x ps  ->  ch ) )
 
Theoremspcimedv 2698* Restricted existential specialization, using implicit substitution. (Contributed by Mario Carneiro, 4-Jan-2017.)
 |-  ( ph  ->  A  e.  B )   &    |-  ( ( ph  /\  x  =  A ) 
 ->  ( ch  ->  ps )
 )   =>    |-  ( ph  ->  ( ch  ->  E. x ps )
 )
 
Theoremspcgv 2699* Rule of specialization, using implicit substitution. Compare Theorem 7.3 of [Quine] p. 44. (Contributed by NM, 22-Jun-1994.)
 |-  ( x  =  A  ->  ( ph  <->  ps ) )   =>    |-  ( A  e.  V  ->  ( A. x ph 
 ->  ps ) )
 
Theoremspcegv 2700* Existential specialization, using implicit substitution. (Contributed by NM, 14-Aug-1994.)
 |-  ( x  =  A  ->  ( ph  <->  ps ) )   =>    |-  ( A  e.  V  ->  ( ps  ->  E. x ph ) )
    < 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-11370
  Copyright terms: Public domain < Previous  Next >