HomeHome Metamath Proof Explorer
Theorem List (p. 24 of 311)
< 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-21328)
  Hilbert Space Explorer  Hilbert Space Explorer
(21329-22851)
  Users' Mathboxes  Users' Mathboxes
(22852-31058)
 

Theorem List for Metamath Proof Explorer - 2301-2400   *Has distinct variable group(s)
TypeLabelDescription
Statement
 
Theoremsyl6eq 2301 An equality transitivity deduction. (Contributed by NM, 5-Aug-1993.)
 |-  ( ph  ->  A  =  B )   &    |-  B  =  C   =>    |-  ( ph  ->  A  =  C )
 
Theoremsyl6req 2302 An equality transitivity deduction. (Contributed by NM, 29-Mar-1998.)
 |-  ( ph  ->  A  =  B )   &    |-  B  =  C   =>    |-  ( ph  ->  C  =  A )
 
Theoremsyl6eqr 2303 An equality transitivity deduction. (Contributed by NM, 5-Aug-1993.)
 |-  ( ph  ->  A  =  B )   &    |-  C  =  B   =>    |-  ( ph  ->  A  =  C )
 
Theoremsyl6reqr 2304 An equality transitivity deduction. (Contributed by NM, 29-Mar-1998.)
 |-  ( ph  ->  A  =  B )   &    |-  C  =  B   =>    |-  ( ph  ->  C  =  A )
 
Theoremsylan9eq 2305 An equality transitivity deduction. (Contributed by NM, 8-May-1994.) (Proof shortened by Andrew Salmon, 25-May-2011.)
 |-  ( ph  ->  A  =  B )   &    |-  ( ps  ->  B  =  C )   =>    |-  ( ( ph  /\ 
 ps )  ->  A  =  C )
 
Theoremsylan9req 2306 An equality transitivity deduction. (Contributed by NM, 23-Jun-2007.)
 |-  ( ph  ->  B  =  A )   &    |-  ( ps  ->  B  =  C )   =>    |-  ( ( ph  /\ 
 ps )  ->  A  =  C )
 
Theoremsylan9eqr 2307 An equality transitivity deduction. (Contributed by NM, 8-May-1994.)
 |-  ( ph  ->  A  =  B )   &    |-  ( ps  ->  B  =  C )   =>    |-  ( ( ps 
 /\  ph )  ->  A  =  C )
 
Theorem3eqtr3g 2308 A chained equality inference, useful for converting from definitions. (Contributed by NM, 15-Nov-1994.)
 |-  ( ph  ->  A  =  B )   &    |-  A  =  C   &    |-  B  =  D   =>    |-  ( ph  ->  C  =  D )
 
Theorem3eqtr3a 2309 A chained equality inference, useful for converting from definitions. (Contributed by Mario Carneiro, 6-Nov-2015.)
 |-  A  =  B   &    |-  ( ph  ->  A  =  C )   &    |-  ( ph  ->  B  =  D )   =>    |-  ( ph  ->  C  =  D )
 
Theorem3eqtr4g 2310 A chained equality inference, useful for converting to definitions. (Contributed by NM, 5-Aug-1993.)
 |-  ( ph  ->  A  =  B )   &    |-  C  =  A   &    |-  D  =  B   =>    |-  ( ph  ->  C  =  D )
 
Theorem3eqtr4a 2311 A chained equality inference, useful for converting to definitions. (Contributed by NM, 2-Feb-2007.) (Proof shortened by Andrew Salmon, 25-May-2011.)
 |-  A  =  B   &    |-  ( ph  ->  C  =  A )   &    |-  ( ph  ->  D  =  B )   =>    |-  ( ph  ->  C  =  D )
 
Theoremeq2tri 2312 A compound transitive inference for class equality. (Contributed by NM, 22-Jan-2004.)
 |-  ( A  =  C  ->  D  =  F )   &    |-  ( B  =  D  ->  C  =  G )   =>    |-  ( ( A  =  C  /\  B  =  F ) 
 <->  ( B  =  D  /\  A  =  G ) )
 
Theoremeleq1 2313 Equality implies equivalence of membership. (Contributed by NM, 5-Aug-1993.)
 |-  ( A  =  B  ->  ( A  e.  C  <->  B  e.  C ) )
 
Theoremeleq2 2314 Equality implies equivalence of membership. (Contributed by NM, 5-Aug-1993.)
 |-  ( A  =  B  ->  ( C  e.  A  <->  C  e.  B ) )
 
Theoremeleq12 2315 Equality implies equivalence of membership. (Contributed by NM, 31-May-1999.)
 |-  ( ( A  =  B  /\  C  =  D )  ->  ( A  e.  C 
 <->  B  e.  D ) )
 
Theoremeleq1i 2316 Inference from equality to equivalence of membership. (Contributed by NM, 5-Aug-1993.)
 |-  A  =  B   =>    |-  ( A  e.  C 
 <->  B  e.  C )
 
Theoremeleq2i 2317 Inference from equality to equivalence of membership. (Contributed by NM, 5-Aug-1993.)
 |-  A  =  B   =>    |-  ( C  e.  A 
 <->  C  e.  B )
 
Theoremeleq12i 2318 Inference from equality to equivalence of membership. (Contributed by NM, 31-May-1994.)
 |-  A  =  B   &    |-  C  =  D   =>    |-  ( A  e.  C  <->  B  e.  D )
 
Theoremeleq1d 2319 Deduction from equality to equivalence of membership. (Contributed by NM, 5-Aug-1993.)
 |-  ( ph  ->  A  =  B )   =>    |-  ( ph  ->  ( A  e.  C  <->  B  e.  C ) )
 
Theoremeleq2d 2320 Deduction from equality to equivalence of membership. (Contributed by NM, 27-Dec-1993.)
 |-  ( ph  ->  A  =  B )   =>    |-  ( ph  ->  ( C  e.  A  <->  C  e.  B ) )
 
Theoremeleq12d 2321 Deduction from equality to equivalence of membership. (Contributed by NM, 31-May-1994.)
 |-  ( ph  ->  A  =  B )   &    |-  ( ph  ->  C  =  D )   =>    |-  ( ph  ->  ( A  e.  C  <->  B  e.  D ) )
 
Theoremeleq1a 2322 A transitive-type law relating membership and equality. (Contributed by NM, 9-Apr-1994.)
 |-  ( A  e.  B  ->  ( C  =  A  ->  C  e.  B ) )
 
Theoremeqeltri 2323 Substitution of equal classes into membership relation. (Contributed by NM, 5-Aug-1993.)
 |-  A  =  B   &    |-  B  e.  C   =>    |-  A  e.  C
 
Theoremeqeltrri 2324 Substitution of equal classes into membership relation. (Contributed by NM, 5-Aug-1993.)
 |-  A  =  B   &    |-  A  e.  C   =>    |-  B  e.  C
 
Theoremeleqtri 2325 Substitution of equal classes into membership relation. (Contributed by NM, 5-Aug-1993.)
 |-  A  e.  B   &    |-  B  =  C   =>    |-  A  e.  C
 
Theoremeleqtrri 2326 Substitution of equal classes into membership relation. (Contributed by NM, 5-Aug-1993.)
 |-  A  e.  B   &    |-  C  =  B   =>    |-  A  e.  C
 
Theoremeqeltrd 2327 Substitution of equal classes into membership relation, deduction form. (Contributed by Raph Levien, 10-Dec-2002.)
 |-  ( ph  ->  A  =  B )   &    |-  ( ph  ->  B  e.  C )   =>    |-  ( ph  ->  A  e.  C )
 
Theoremeqeltrrd 2328 Deduction that substitutes equal classes into membership. (Contributed by NM, 14-Dec-2004.)
 |-  ( ph  ->  A  =  B )   &    |-  ( ph  ->  A  e.  C )   =>    |-  ( ph  ->  B  e.  C )
 
Theoremeleqtrd 2329 Deduction that substitutes equal classes into membership. (Contributed by NM, 14-Dec-2004.)
 |-  ( ph  ->  A  e.  B )   &    |-  ( ph  ->  B  =  C )   =>    |-  ( ph  ->  A  e.  C )
 
Theoremeleqtrrd 2330 Deduction that substitutes equal classes into membership. (Contributed by NM, 14-Dec-2004.)
 |-  ( ph  ->  A  e.  B )   &    |-  ( ph  ->  C  =  B )   =>    |-  ( ph  ->  A  e.  C )
 
Theorem3eltr3i 2331 Substitution of equal classes into membership relation. (Contributed by Mario Carneiro, 6-Jan-2017.)
 |-  A  e.  B   &    |-  A  =  C   &    |-  B  =  D   =>    |-  C  e.  D
 
Theorem3eltr4i 2332 Substitution of equal classes into membership relation. (Contributed by Mario Carneiro, 6-Jan-2017.)
 |-  A  e.  B   &    |-  C  =  A   &    |-  D  =  B   =>    |-  C  e.  D
 
Theorem3eltr3d 2333 Substitution of equal classes into membership relation. (Contributed by Mario Carneiro, 6-Jan-2017.)
 |-  ( ph  ->  A  e.  B )   &    |-  ( ph  ->  A  =  C )   &    |-  ( ph  ->  B  =  D )   =>    |-  ( ph  ->  C  e.  D )
 
Theorem3eltr4d 2334 Substitution of equal classes into membership relation. (Contributed by Mario Carneiro, 6-Jan-2017.)
 |-  ( ph  ->  A  e.  B )   &    |-  ( ph  ->  C  =  A )   &    |-  ( ph  ->  D  =  B )   =>    |-  ( ph  ->  C  e.  D )
 
Theorem3eltr3g 2335 Substitution of equal classes into membership relation. (Contributed by Mario Carneiro, 6-Jan-2017.)
 |-  ( ph  ->  A  e.  B )   &    |-  A  =  C   &    |-  B  =  D   =>    |-  ( ph  ->  C  e.  D )
 
Theorem3eltr4g 2336 Substitution of equal classes into membership relation. (Contributed by Mario Carneiro, 6-Jan-2017.)
 |-  ( ph  ->  A  e.  B )   &    |-  C  =  A   &    |-  D  =  B   =>    |-  ( ph  ->  C  e.  D )
 
Theoremsyl5eqel 2337 B membership and equality inference. (Contributed by NM, 4-Jan-2006.)
 |-  A  =  B   &    |-  ( ph  ->  B  e.  C )   =>    |-  ( ph  ->  A  e.  C )
 
Theoremsyl5eqelr 2338 B membership and equality inference. (Contributed by NM, 4-Jan-2006.)
 |-  B  =  A   &    |-  ( ph  ->  B  e.  C )   =>    |-  ( ph  ->  A  e.  C )
 
Theoremsyl5eleq 2339 B membership and equality inference. (Contributed by NM, 4-Jan-2006.)
 |-  A  e.  B   &    |-  ( ph  ->  B  =  C )   =>    |-  ( ph  ->  A  e.  C )
 
Theoremsyl5eleqr 2340 B membership and equality inference. (Contributed by NM, 4-Jan-2006.)
 |-  A  e.  B   &    |-  ( ph  ->  C  =  B )   =>    |-  ( ph  ->  A  e.  C )
 
Theoremsyl6eqel 2341 A membership and equality inference. (Contributed by NM, 4-Jan-2006.)
 |-  ( ph  ->  A  =  B )   &    |-  B  e.  C   =>    |-  ( ph  ->  A  e.  C )
 
Theoremsyl6eqelr 2342 A membership and equality inference. (Contributed by NM, 4-Jan-2006.)
 |-  ( ph  ->  B  =  A )   &    |-  B  e.  C   =>    |-  ( ph  ->  A  e.  C )
 
Theoremsyl6eleq 2343 A membership and equality inference. (Contributed by NM, 4-Jan-2006.)
 |-  ( ph  ->  A  e.  B )   &    |-  B  =  C   =>    |-  ( ph  ->  A  e.  C )
 
Theoremsyl6eleqr 2344 A membership and equality inference. (Contributed by NM, 24-Apr-2005.)
 |-  ( ph  ->  A  e.  B )   &    |-  C  =  B   =>    |-  ( ph  ->  A  e.  C )
 
Theoremeleq2s 2345 Substitution of equal classes into a membership antecedent. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.)
 |-  ( A  e.  B  -> 
 ph )   &    |-  C  =  B   =>    |-  ( A  e.  C  ->  ph )
 
Theoremcleqh 2346* Establish equality between classes, using bound-variable hypotheses instead of distinct variable conditions. (Contributed by NM, 5-Aug-1993.)
 |-  ( y  e.  A  ->  A. x  y  e.  A )   &    |-  ( y  e.  B  ->  A. x  y  e.  B )   =>    |-  ( A  =  B 
 <-> 
 A. x ( x  e.  A  <->  x  e.  B ) )
 
Theoremnelneq 2347 A way of showing two classes are not equal. (Contributed by NM, 1-Apr-1997.)
 |-  ( ( A  e.  C  /\  -.  B  e.  C )  ->  -.  A  =  B )
 
Theoremnelneq2 2348 A way of showing two classes are not equal. (Contributed by NM, 12-Jan-2002.)
 |-  ( ( A  e.  B  /\  -.  A  e.  C )  ->  -.  B  =  C )
 
Theoremeqsb3lem 2349* Lemma for eqsb3 2350. (Contributed by Rodolfo Medina, 28-Apr-2010.) (Proof shortened by Andrew Salmon, 14-Jun-2011.)
 |-  ( [ x  /  y ] y  =  A  <->  x  =  A )
 
Theoremeqsb3 2350* Substitution applied to an atomic wff (class version of equsb3 2062). (Contributed by Rodolfo Medina, 28-Apr-2010.)
 |-  ( [ x  /  y ] y  =  A  <->  x  =  A )
 
Theoremclelsb3 2351* Substitution applied to an atomic wff (class version of elsb3 2063). (Contributed by Rodolfo Medina, 28-Apr-2010.) (Proof shortened by Andrew Salmon, 14-Jun-2011.)
 |-  ( [ x  /  y ] y  e.  A  <->  x  e.  A )
 
Theoremhbxfreq 2352 A utility lemma to transfer a bound-variable hypothesis builder into a definition. See hbxfrbi 1560 for equivalence version. (Contributed by NM, 21-Aug-2007.)
 |-  A  =  B   &    |-  (
 y  e.  B  ->  A. x  y  e.  B )   =>    |-  ( y  e.  A  ->  A. x  y  e.  A )
 
Theoremhblem 2353* Change the free variable of a hypothesis builder. Lemma for nfcrii 2378. (Contributed by NM, 5-Aug-1993.) (Revised by Andrew Salmon, 11-Jul-2011.)
 |-  ( y  e.  A  ->  A. x  y  e.  A )   =>    |-  ( z  e.  A  ->  A. x  z  e.  A )
 
Theoremabeq2 2354* Equality of a class variable and a class abstraction (also called a class builder). Theorem 5.1 of [Quine] p. 34. This theorem shows the relationship between expressions with class abstractions and expressions with class variables. Note that abbi 2359 and its relatives are among those useful for converting theorems with class variables to equivalent theorems with wff variables, by first substituting a class abstraction for each class variable.

Class variables can always be eliminated from a theorem to result in an equivalent theorem with wff variables, and vice-versa. The idea is roughly as follows. To convert a theorem with a wff variable  ph (that has a free variable  x) to a theorem with a class variable  A, we substitute  x  e.  A for  ph throughout and simplify, where  A is a new class variable not already in the wff. An example is the conversion of zfauscl 4040 to inex1 4052 (look at the instance of zfauscl 4040 that occurs in the proof of inex1 4052). Conversely, to convert a theorem with a class variable  A to one with 
ph, we substitute  { x  | 
ph } for  A throughout and simplify, where  x and  ph are new set and wff variables not already in the wff. An example is cp 7445, which derives a formula containing wff variables from substitution instances of the class variables in its equivalent formulation cplem2 7444. For more information on class variables, see Quine pp. 15-21 and/or Takeuti and Zaring pp. 10-13. (Contributed by NM, 5-Aug-1993.)

 |-  ( A  =  { x  |  ph }  <->  A. x ( x  e.  A  <->  ph ) )
 
Theoremabeq1 2355* Equality of a class variable and a class abstraction. (Contributed by NM, 20-Aug-1993.)
 |-  ( { x  |  ph
 }  =  A  <->  A. x ( ph  <->  x  e.  A ) )
 
Theoremabeq2i 2356 Equality of a class variable and a class abstraction (inference rule). (Contributed by NM, 3-Apr-1996.)
 |-  A  =  { x  |  ph }   =>    |-  ( x  e.  A  <->  ph )
 
Theoremabeq1i 2357 Equality of a class variable and a class abstraction (inference rule). (Contributed by NM, 31-Jul-1994.)
 |- 
 { x  |  ph }  =  A   =>    |-  ( ph  <->  x  e.  A )
 
Theoremabeq2d 2358 Equality of a class variable and a class abstraction (deduction). (Contributed by NM, 16-Nov-1995.)
 |-  ( ph  ->  A  =  { x  |  ps } )   =>    |-  ( ph  ->  ( x  e.  A  <->  ps ) )
 
Theoremabbi 2359 Equivalent wff's correspond to equal class abstractions. (Contributed by NM, 25-Nov-2013.) (Revised by Mario Carneiro, 11-Aug-2016.)
 |-  ( A. x (
 ph 
 <->  ps )  <->  { x  |  ph }  =  { x  |  ps } )
 
Theoremabbi2i 2360* Equality of a class variable and a class abstraction (inference rule). (Contributed by NM, 5-Aug-1993.)
 |-  ( x  e.  A  <->  ph )   =>    |-  A  =  { x  |  ph }
 
Theoremabbii 2361 Equivalent wff's yield equal class abstractions (inference rule). (Contributed by NM, 5-Aug-1993.)
 |-  ( ph  <->  ps )   =>    |- 
 { x  |  ph }  =  { x  |  ps }
 
Theoremabbid 2362 Equivalent wff's yield equal class abstractions (deduction rule). (Contributed by NM, 5-Aug-1993.) (Revised by Mario Carneiro, 7-Oct-2016.)
 |- 
 F/ x ph   &    |-  ( ph  ->  ( ps  <->  ch ) )   =>    |-  ( ph  ->  { x  |  ps }  =  { x  |  ch } )
 
Theoremabbidv 2363* Equivalent wff's yield equal class abstractions (deduction rule). (Contributed by NM, 10-Aug-1993.)
 |-  ( ph  ->  ( ps 
 <->  ch ) )   =>    |-  ( ph  ->  { x  |  ps }  =  { x  |  ch } )
 
Theoremabbi2dv 2364* Deduction from a wff to a class abstraction. (Contributed by NM, 9-Jul-1994.)
 |-  ( ph  ->  ( x  e.  A  <->  ps ) )   =>    |-  ( ph  ->  A  =  { x  |  ps } )
 
Theoremabbi1dv 2365* Deduction from a wff to a class abstraction. (Contributed by NM, 9-Jul-1994.)
 |-  ( ph  ->  ( ps 
 <->  x  e.  A ) )   =>    |-  ( ph  ->  { x  |  ps }  =  A )
 
Theoremabid2 2366* A simplification of class abstraction. Theorem 5.2 of [Quine] p. 35. (Contributed by NM, 26-Dec-1993.)
 |- 
 { x  |  x  e.  A }  =  A
 
Theoremcbvab 2367 Rule used to change bound variables, using implicit substitution. (Contributed by Andrew Salmon, 11-Jul-2011.)
 |- 
 F/ y ph   &    |-  F/ x ps   &    |-  ( x  =  y  ->  (
 ph 
 <->  ps ) )   =>    |-  { x  |  ph
 }  =  { y  |  ps }
 
Theoremcbvabv 2368* Rule used to change bound variables, using implicit substitution. (Contributed by NM, 26-May-1999.)
 |-  ( x  =  y 
 ->  ( ph  <->  ps ) )   =>    |-  { x  |  ph
 }  =  { y  |  ps }
 
Theoremclelab 2369* Membership of a class variable in a class abstraction. (Contributed by NM, 23-Dec-1993.)
 |-  ( A  e.  { x  |  ph }  <->  E. x ( x  =  A  /\  ph )
 )
 
Theoremclabel 2370* Membership of a class abstraction in another class. (Contributed by NM, 17-Jan-2006.)
 |-  ( { x  |  ph
 }  e.  A  <->  E. y ( y  e.  A  /\  A. x ( x  e.  y  <->  ph ) ) )
 
Theoremsbab 2371* The right-hand side of the second equality is a way of representing proper substitution of  y for  x into a class variable. (Contributed by NM, 14-Sep-2003.)
 |-  ( x  =  y 
 ->  A  =  { z  |  [ y  /  x ] z  e.  A } )
 
2.1.3  Class form not-free predicate
 
Syntaxwnfc 2372 Extend wff definition to include the not-free predicate for classes.
 wff  F/_ x A
 
Theoremnfcjust 2373* Justification theorem for df-nfc 2374. (Contributed by Mario Carneiro, 13-Oct-2016.)
 |-  ( A. y F/ x  y  e.  A  <->  A. z F/ x  z  e.  A )
 
Definitiondf-nfc 2374* Define the not-free predicate for classes. This is read " x is not free in  A". Not-free means that the value of  x cannot affect the value of  A, e.g., any occurrence of  x in  A is effectively bound by a "for all" or something that expands to one (such as "there exists"). It is defined in terms of the not-free predicate df-nf 1540 for wffs; see that definition for more information. (Contributed by Mario Carneiro, 11-Aug-2016.)
 |-  ( F/_ x A  <->  A. y F/ x  y  e.  A )
 
Theoremnfci 2375* Deduce that a class  A does not have  x free in it. (Contributed by Mario Carneiro, 11-Aug-2016.)
 |- 
 F/ x  y  e.  A   =>    |-  F/_ x A
 
Theoremnfcii 2376* Deduce that a class  A does not have  x free in it. (Contributed by Mario Carneiro, 11-Aug-2016.)
 |-  ( y  e.  A  ->  A. x  y  e.  A )   =>    |-  F/_ x A
 
Theoremnfcr 2377* Consequence of the not-free predicate. (Contributed by Mario Carneiro, 11-Aug-2016.)
 |-  ( F/_ x A  ->  F/ x  y  e.  A )
 
Theoremnfcrii 2378* Consequence of the not-free predicate. (Contributed by Mario Carneiro, 11-Aug-2016.)
 |-  F/_ x A   =>    |-  ( y  e.  A  ->  A. x  y  e.  A )
 
Theoremnfcri 2379* Consequence of the not-free predicate. (Note that unlike nfcr 2377, this does not require  y and  A to be disjoint.) (Contributed by Mario Carneiro, 11-Aug-2016.)
 |-  F/_ x A   =>    |- 
 F/ x  y  e.  A
 
Theoremnfcd 2380* Deduce that a class  A does not have  x free in it. (Contributed by Mario Carneiro, 11-Aug-2016.)
 |- 
 F/ y ph   &    |-  ( ph  ->  F/ x  y  e.  A )   =>    |-  ( ph  ->  F/_ x A )
 
Theoremnfceqi 2381 Equality theorem for class not-free. (Contributed by Mario Carneiro, 11-Aug-2016.)
 |-  A  =  B   =>    |-  ( F/_ x A 
 <-> 
 F/_ x B )
 
Theoremnfcxfr 2382 A utility lemma to transfer a bound-variable hypothesis builder into a definition. (Contributed by Mario Carneiro, 11-Aug-2016.)
 |-  A  =  B   &    |-  F/_ x B   =>    |-  F/_ x A
 
Theoremnfcxfrd 2383 A utility lemma to transfer a bound-variable hypothesis builder into a definition. (Contributed by Mario Carneiro, 11-Aug-2016.)
 |-  A  =  B   &    |-  ( ph  ->  F/_ x B )   =>    |-  ( ph  ->  F/_ x A )
 
Theoremnfceqdf 2384 An equality theorem for effectively not free. (Contributed by Mario Carneiro, 14-Oct-2016.)
 |- 
 F/ x ph   &    |-  ( ph  ->  A  =  B )   =>    |-  ( ph  ->  (
 F/_ x A  <->  F/_ x B ) )
 
Theoremnfcv 2385* If  x is disjoint from  A, then  x is not free in  A. (Contributed by Mario Carneiro, 11-Aug-2016.)
 |-  F/_ x A
 
Theoremnfcvd 2386* If  x is disjoint from  A, then  x is not free in  A. (Contributed by Mario Carneiro, 7-Oct-2016.)
 |-  ( ph  ->  F/_ x A )
 
Theoremnfab1 2387 Bound-variable hypothesis builder for a class abstraction. (Contributed by Mario Carneiro, 11-Aug-2016.)
 |-  F/_ x { x  |  ph
 }
 
Theoremnfnfc1 2388  x is bound in  F/_ x A. (Contributed by Mario Carneiro, 11-Aug-2016.)
 |- 
 F/ x F/_ x A
 
Theoremnfab 2389 Bound-variable hypothesis builder for a class abstraction. (Contributed by Mario Carneiro, 11-Aug-2016.)
 |- 
 F/ x ph   =>    |-  F/_ x { y  | 
 ph }
 
Theoremnfaba1 2390 Bound-variable hypothesis builder for a class abstraction. (Contributed by Mario Carneiro, 14-Oct-2016.)
 |-  F/_ x { y  | 
 A. x ph }
 
Theoremnfnfc 2391 Hypothesis builder for  F/_ y A. (Contributed by Mario Carneiro, 11-Aug-2016.)
 |-  F/_ x A   =>    |- 
 F/ x F/_ y A
 
Theoremnfeq 2392 Hypothesis builder for equality. (Contributed by Mario Carneiro, 11-Aug-2016.)
 |-  F/_ x A   &    |-  F/_ x B   =>    |-  F/ x  A  =  B
 
Theoremnfel 2393 Hypothesis builder for elementhood. (Contributed by Mario Carneiro, 11-Aug-2016.)
 |-  F/_ x A   &    |-  F/_ x B   =>    |-  F/ x  A  e.  B
 
Theoremnfeq1 2394* Hypothesis builder for equality, special case. (Contributed by Mario Carneiro, 10-Oct-2016.)
 |-  F/_ x A   =>    |- 
 F/ x  A  =  B
 
Theoremnfel1 2395* Hypothesis builder for elementhood, special case. (Contributed by Mario Carneiro, 10-Oct-2016.)
 |-  F/_ x A   =>    |- 
 F/ x  A  e.  B
 
Theoremnfeq2 2396* Hypothesis builder for equality, special case. (Contributed by Mario Carneiro, 10-Oct-2016.)
 |-  F/_ x B   =>    |- 
 F/ x  A  =  B
 
Theoremnfel2 2397* Hypothesis builder for elementhood, special case. (Contributed by Mario Carneiro, 10-Oct-2016.)
 |-  F/_ x B   =>    |- 
 F/ x  A  e.  B
 
Theoremnfcrd 2398* Consequence of the not-free predicate. (Contributed by Mario Carneiro, 11-Aug-2016.)
 |-  ( ph  ->  F/_ x A )   =>    |-  ( ph  ->  F/ x  y  e.  A )
 
Theoremnfeqd 2399 Hypothesis builder for equality. (Contributed by Mario Carneiro, 7-Oct-2016.)
 |-  ( ph  ->  F/_ x A )   &    |-  ( ph  ->  F/_ x B )   =>    |-  ( ph  ->  F/ x  A  =  B )
 
Theoremnfeld 2400 Hypothesis builder for elementhood. (Contributed by Mario Carneiro, 7-Oct-2016.)
 |-  ( ph  ->  F/_ x A )   &    |-  ( ph  ->  F/_ x B )   =>    |-  ( ph  ->  F/ x  A  e.  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-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-31058
  Copyright terms: Public domain < Previous  Next >