HomeHome Metamath Proof Explorer
Theorem List (p. 33 of 429)
< Previous  Next >
Bad symbols? Try the
GIF 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-27903)
  Hilbert Space Explorer  Hilbert Space Explorer
(27904-29428)
  Users' Mathboxes  Users' Mathboxes
(29429-42879)
 

Theorem List for Metamath Proof Explorer - 3201-3300   *Has distinct variable group(s)
TypeLabelDescription
Statement
 
Theoremcbvralv 3201* Change the bound variable of a restricted universal quantifier using implicit substitution. (Contributed by NM, 28-Jan-1997.)
(𝑥 = 𝑦 → (𝜑𝜓))       (∀𝑥𝐴 𝜑 ↔ ∀𝑦𝐴 𝜓)
 
Theoremcbvrexv 3202* Change the bound variable of a restricted existential quantifier using implicit substitution. (Contributed by NM, 2-Jun-1998.)
(𝑥 = 𝑦 → (𝜑𝜓))       (∃𝑥𝐴 𝜑 ↔ ∃𝑦𝐴 𝜓)
 
Theoremcbvreuv 3203* 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.)
(𝑥 = 𝑦 → (𝜑𝜓))       (∃!𝑥𝐴 𝜑 ↔ ∃!𝑦𝐴 𝜓)
 
Theoremcbvrmov 3204* Change the bound variable of a restricted uniqueness quantifier using implicit substitution. (Contributed by Alexander van der Vekens, 17-Jun-2017.)
(𝑥 = 𝑦 → (𝜑𝜓))       (∃*𝑥𝐴 𝜑 ↔ ∃*𝑦𝐴 𝜓)
 
Theoremcbvraldva2 3205* 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.)
((𝜑𝑥 = 𝑦) → (𝜓𝜒))    &   ((𝜑𝑥 = 𝑦) → 𝐴 = 𝐵)       (𝜑 → (∀𝑥𝐴 𝜓 ↔ ∀𝑦𝐵 𝜒))
 
Theoremcbvrexdva2 3206* 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.)
((𝜑𝑥 = 𝑦) → (𝜓𝜒))    &   ((𝜑𝑥 = 𝑦) → 𝐴 = 𝐵)       (𝜑 → (∃𝑥𝐴 𝜓 ↔ ∃𝑦𝐵 𝜒))
 
Theoremcbvraldva 3207* Rule used to change the bound variable in a restricted universal quantifier with implicit substitution. Deduction form. (Contributed by David Moews, 1-May-2017.)
((𝜑𝑥 = 𝑦) → (𝜓𝜒))       (𝜑 → (∀𝑥𝐴 𝜓 ↔ ∀𝑦𝐴 𝜒))
 
Theoremcbvrexdva 3208* Rule used to change the bound variable in a restricted existential quantifier with implicit substitution. Deduction form. (Contributed by David Moews, 1-May-2017.)
((𝜑𝑥 = 𝑦) → (𝜓𝜒))       (𝜑 → (∃𝑥𝐴 𝜓 ↔ ∃𝑦𝐴 𝜒))
 
Theoremcbvral2v 3209* Change bound variables of double restricted universal quantification, using implicit substitution. (Contributed by NM, 10-Aug-2004.)
(𝑥 = 𝑧 → (𝜑𝜒))    &   (𝑦 = 𝑤 → (𝜒𝜓))       (∀𝑥𝐴𝑦𝐵 𝜑 ↔ ∀𝑧𝐴𝑤𝐵 𝜓)
 
Theoremcbvrex2v 3210* Change bound variables of double restricted universal quantification, using implicit substitution. (Contributed by FL, 2-Jul-2012.)
(𝑥 = 𝑧 → (𝜑𝜒))    &   (𝑦 = 𝑤 → (𝜒𝜓))       (∃𝑥𝐴𝑦𝐵 𝜑 ↔ ∃𝑧𝐴𝑤𝐵 𝜓)
 
Theoremcbvral3v 3211* Change bound variables of triple restricted universal quantification, using implicit substitution. (Contributed by NM, 10-May-2005.)
(𝑥 = 𝑤 → (𝜑𝜒))    &   (𝑦 = 𝑣 → (𝜒𝜃))    &   (𝑧 = 𝑢 → (𝜃𝜓))       (∀𝑥𝐴𝑦𝐵𝑧𝐶 𝜑 ↔ ∀𝑤𝐴𝑣𝐵𝑢𝐶 𝜓)
 
Theoremcbvralsv 3212* Change bound variable by using a substitution. (Contributed by NM, 20-Nov-2005.) (Revised by Andrew Salmon, 11-Jul-2011.)
(∀𝑥𝐴 𝜑 ↔ ∀𝑦𝐴 [𝑦 / 𝑥]𝜑)
 
Theoremcbvrexsv 3213* Change bound variable by using a substitution. (Contributed by NM, 2-Mar-2008.) (Revised by Andrew Salmon, 11-Jul-2011.)
(∃𝑥𝐴 𝜑 ↔ ∃𝑦𝐴 [𝑦 / 𝑥]𝜑)
 
Theoremsbralie 3214* Implicit to explicit substitution that swaps variables in a quantified expression. (Contributed by NM, 5-Sep-2004.)
(𝑥 = 𝑦 → (𝜑𝜓))       ([𝑥 / 𝑦]∀𝑥𝑦 𝜑 ↔ ∀𝑦𝑥 𝜓)
 
Theoremrabbiia 3215 Equivalent wff's yield equal restricted class abstractions (inference rule). (Contributed by NM, 22-May-1999.)
(𝑥𝐴 → (𝜑𝜓))       {𝑥𝐴𝜑} = {𝑥𝐴𝜓}
 
Theoremrabbii 3216 Equivalent wff's correspond to equal restricted class abstractions. Inference form of rabbidv 3220. (Contributed by Peter Mazsa, 1-Nov-2019.)
(𝜑𝜓)       {𝑥𝐴𝜑} = {𝑥𝐴𝜓}
 
Theoremrabbidva2 3217* Equivalent wff's yield equal restricted class abstractions. (Contributed by Thierry Arnoux, 4-Feb-2017.)
(𝜑 → ((𝑥𝐴𝜓) ↔ (𝑥𝐵𝜒)))       (𝜑 → {𝑥𝐴𝜓} = {𝑥𝐵𝜒})
 
Theoremrabbia2 3218 Equivalent wff's yield equal restricted class abstractions. (Contributed by Glauco Siliprandi, 26-Jun-2021.)
((𝑥𝐴𝜓) ↔ (𝑥𝐵𝜒))       {𝑥𝐴𝜓} = {𝑥𝐵𝜒}
 
Theoremrabbidva 3219* Equivalent wff's yield equal restricted class abstractions (deduction rule). (Contributed by NM, 28-Nov-2003.)
((𝜑𝑥𝐴) → (𝜓𝜒))       (𝜑 → {𝑥𝐴𝜓} = {𝑥𝐴𝜒})
 
Theoremrabbidv 3220* Equivalent wff's yield equal restricted class abstractions (deduction rule). (Contributed by NM, 10-Feb-1995.)
(𝜑 → (𝜓𝜒))       (𝜑 → {𝑥𝐴𝜓} = {𝑥𝐴𝜒})
 
Theoremrabeqf 3221 Equality theorem for restricted class abstractions, with bound-variable hypotheses instead of distinct variable restrictions. (Contributed by NM, 7-Mar-2004.)
𝑥𝐴    &   𝑥𝐵       (𝐴 = 𝐵 → {𝑥𝐴𝜑} = {𝑥𝐵𝜑})
 
Theoremrabeqif 3222 Equality theorem for restricted class abstractions. Inference form of rabeqf 3221. (Contributed by Glauco Siliprandi, 26-Jun-2021.)
𝑥𝐴    &   𝑥𝐵    &   𝐴 = 𝐵       {𝑥𝐴𝜑} = {𝑥𝐵𝜑}
 
Theoremrabeq 3223* Equality theorem for restricted class abstractions. (Contributed by NM, 15-Oct-2003.)
(𝐴 = 𝐵 → {𝑥𝐴𝜑} = {𝑥𝐵𝜑})
 
Theoremrabeqi 3224* Equality theorem for restricted class abstractions. Inference form of rabeq 3223. (Contributed by Glauco Siliprandi, 26-Jun-2021.)
𝐴 = 𝐵       {𝑥𝐴𝜑} = {𝑥𝐵𝜑}
 
Theoremrabeqdv 3225* Equality of restricted class abstractions. Deduction form of rabeq 3223. (Contributed by Glauco Siliprandi, 5-Apr-2020.)
(𝜑𝐴 = 𝐵)       (𝜑 → {𝑥𝐴𝜓} = {𝑥𝐵𝜓})
 
Theoremrabeqbidv 3226* Equality of restricted class abstractions. (Contributed by Jeff Madsen, 1-Dec-2009.)
(𝜑𝐴 = 𝐵)    &   (𝜑 → (𝜓𝜒))       (𝜑 → {𝑥𝐴𝜓} = {𝑥𝐵𝜒})
 
Theoremrabeqbidva 3227* Equality of restricted class abstractions. (Contributed by Mario Carneiro, 26-Jan-2017.)
(𝜑𝐴 = 𝐵)    &   ((𝜑𝑥𝐴) → (𝜓𝜒))       (𝜑 → {𝑥𝐴𝜓} = {𝑥𝐵𝜒})
 
Theoremrabeq2i 3228 Inference rule from equality of a class variable and a restricted class abstraction. (Contributed by NM, 16-Feb-2004.)
𝐴 = {𝑥𝐵𝜑}       (𝑥𝐴 ↔ (𝑥𝐵𝜑))
 
Theoremcbvrab 3229 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.)
𝑥𝐴    &   𝑦𝐴    &   𝑦𝜑    &   𝑥𝜓    &   (𝑥 = 𝑦 → (𝜑𝜓))       {𝑥𝐴𝜑} = {𝑦𝐴𝜓}
 
Theoremcbvrabv 3230* Rule to change the bound variable in a restricted class abstraction, using implicit substitution. (Contributed by NM, 26-May-1999.)
(𝑥 = 𝑦 → (𝜑𝜓))       {𝑥𝐴𝜑} = {𝑦𝐴𝜓}
 
2.1.6  The universal class
 
Syntaxcvv 3231 Extend class notation to include the universal class symbol.
class V
 
Theoremvjust 3232 Soundness justification theorem for df-v 3233. (Contributed by Rodolfo Medina, 27-Apr-2010.)
{𝑥𝑥 = 𝑥} = {𝑦𝑦 = 𝑦}
 
Definitiondf-v 3233 Define the universal class. Definition 5.20 of [TakeutiZaring] p. 21. Also Definition 2.9 of [Quine] p. 19. The class V can be described as the "class of all sets"; vprc 4829 proves that V is not itself a set in ZFC. We will frequently use the expression 𝐴 ∈ V as a short way to say "𝐴 is a set", and isset 3238 proves that this expression has the same meaning as 𝑥𝑥 = 𝐴. The class V is called the "von Neumann universe", however, the letter "V" is not a tribute to the name of von Neumann. The letter "V" was used earlier by Peano in 1889 for the universe of sets, where the letter V is derived from the word "Verum". Peano's notation V was adopted by Whitehead and Russell in Principia Mathematica for the class of all sets in 1910. For a general discussion of the theory of classes, see mmset.html#class. (Contributed by NM, 26-May-1993.)
V = {𝑥𝑥 = 𝑥}
 
Theoremvex 3234 All setvar variables are sets (see isset 3238). Theorem 6.8 of [Quine] p. 43. (Contributed by NM, 26-May-1993.)
𝑥 ∈ V
 
Theoremeqvf 3235 The universe contains every set. (Contributed by BJ, 15-Jul-2021.)
𝑥𝐴       (𝐴 = V ↔ ∀𝑥 𝑥𝐴)
 
Theoremeqv 3236* The universe contains every set. (Contributed by NM, 11-Sep-2006.)
(𝐴 = V ↔ ∀𝑥 𝑥𝐴)
 
Theoremabv 3237 The class of sets verifying a property is the universal class if and only if that property is a tautology. (Contributed by BJ, 19-Mar-2021.)
({𝑥𝜑} = V ↔ ∀𝑥𝜑)
 
Theoremisset 3238* Two ways to say "𝐴 is a set": A class 𝐴 is a member of the universal class V (see df-v 3233) if and only if the class 𝐴 exists (i.e. there exists some set 𝑥 equal to class 𝐴). Theorem 6.9 of [Quine] p. 43. Notational convention: We will use the notational device "𝐴 ∈ V " to mean "𝐴 is a set" very frequently, for example in uniex 6995. Note that a class 𝐴 which is not a set is called a proper class. In some theorems, such as uniexg 6997, in order to shorten certain proofs we use the more general antecedent 𝐴𝑉 instead of 𝐴 ∈ V to mean "𝐴 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 2647 requires that the expression substituted for 𝐵 not contain 𝑥. (Also, the Metamath spec does not allow constants in the distinct variable list.) (Contributed by NM, 26-May-1993.)

(𝐴 ∈ V ↔ ∃𝑥 𝑥 = 𝐴)
 
Theoremissetf 3239 A version of isset 3238 that does not require 𝑥 and 𝐴 to be distinct. (Contributed by Andrew Salmon, 6-Jun-2011.) (Revised by Mario Carneiro, 10-Oct-2016.)
𝑥𝐴       (𝐴 ∈ V ↔ ∃𝑥 𝑥 = 𝐴)
 
Theoremisseti 3240* A way to say "𝐴 is a set" (inference rule). (Contributed by NM, 24-Jun-1993.)
𝐴 ∈ V       𝑥 𝑥 = 𝐴
 
Theoremissetri 3241* A way to say "𝐴 is a set" (inference rule). (Contributed by NM, 21-Jun-1993.)
𝑥 𝑥 = 𝐴       𝐴 ∈ V
 
Theoremeqvisset 3242 A class equal to a variable is a set. Note the absence of dv condition, contrary to isset 3238 and issetri 3241. (Contributed by BJ, 27-Apr-2019.)
(𝑥 = 𝐴𝐴 ∈ V)
 
Theoremelex 3243 If a class is a member of another class, it is a set. Theorem 6.12 of [Quine] p. 44. (Contributed by NM, 26-May-1993.) (Proof shortened by Andrew Salmon, 8-Jun-2011.)
(𝐴𝐵𝐴 ∈ V)
 
Theoremelexi 3244 If a class is a member of another class, it is a set. (Contributed by NM, 11-Jun-1994.)
𝐴𝐵       𝐴 ∈ V
 
Theoremelexd 3245 If a class is a member of another class, it is a set. (Contributed by Glauco Siliprandi, 11-Oct-2020.)
(𝜑𝐴𝑉)       (𝜑𝐴 ∈ V)
 
Theoremelisset 3246* An element of a class exists. (Contributed by NM, 1-May-1995.)
(𝐴𝑉 → ∃𝑥 𝑥 = 𝐴)
 
Theoremelex2 3247* If a class contains another class, then it contains some set. (Contributed by Alan Sare, 25-Sep-2011.)
(𝐴𝐵 → ∃𝑥 𝑥𝐵)
 
Theoremelex22 3248* If two classes each contain another class, then both contain some set. (Contributed by Alan Sare, 24-Oct-2011.)
((𝐴𝐵𝐴𝐶) → ∃𝑥(𝑥𝐵𝑥𝐶))
 
Theoremprcnel 3249 A proper class doesn't belong to any class. (Contributed by Glauco Siliprandi, 17-Aug-2020.) (Proof shortened by AV, 14-Nov-2020.)
𝐴 ∈ V → ¬ 𝐴𝑉)
 
Theoremralv 3250 A universal quantifier restricted to the universe is unrestricted. (Contributed by NM, 26-Mar-2004.)
(∀𝑥 ∈ V 𝜑 ↔ ∀𝑥𝜑)
 
Theoremrexv 3251 An existential quantifier restricted to the universe is unrestricted. (Contributed by NM, 26-Mar-2004.)
(∃𝑥 ∈ V 𝜑 ↔ ∃𝑥𝜑)
 
Theoremreuv 3252 A uniqueness quantifier restricted to the universe is unrestricted. (Contributed by NM, 1-Nov-2010.)
(∃!𝑥 ∈ V 𝜑 ↔ ∃!𝑥𝜑)
 
Theoremrmov 3253 A uniqueness quantifier restricted to the universe is unrestricted. (Contributed by Alexander van der Vekens, 17-Jun-2017.)
(∃*𝑥 ∈ V 𝜑 ↔ ∃*𝑥𝜑)
 
Theoremrabab 3254 A class abstraction restricted to the universe is unrestricted. (Contributed by NM, 27-Dec-2004.) (Proof shortened by Andrew Salmon, 8-Jun-2011.)
{𝑥 ∈ V ∣ 𝜑} = {𝑥𝜑}
 
Theoremralcom4 3255* Commutation of restricted and unrestricted universal quantifiers. (Contributed by NM, 26-Mar-2004.) (Proof shortened by Andrew Salmon, 8-Jun-2011.)
(∀𝑥𝐴𝑦𝜑 ↔ ∀𝑦𝑥𝐴 𝜑)
 
Theoremrexcom4 3256* Commutation of restricted and unrestricted existential quantifiers. (Contributed by NM, 12-Apr-2004.) (Proof shortened by Andrew Salmon, 8-Jun-2011.)
(∃𝑥𝐴𝑦𝜑 ↔ ∃𝑦𝑥𝐴 𝜑)
 
Theoremrexcom4a 3257* Specialized existential commutation lemma. (Contributed by Jeff Madsen, 1-Jun-2011.)
(∃𝑥𝑦𝐴 (𝜑𝜓) ↔ ∃𝑦𝐴 (𝜑 ∧ ∃𝑥𝜓))
 
Theoremrexcom4b 3258* Specialized existential commutation lemma. (Contributed by Jeff Madsen, 1-Jun-2011.)
𝐵 ∈ V       (∃𝑥𝑦𝐴 (𝜑𝑥 = 𝐵) ↔ ∃𝑦𝐴 𝜑)
 
Theoremceqsalt 3259* Closed theorem version of ceqsalg 3261. (Contributed by NM, 28-Feb-2013.) (Revised by Mario Carneiro, 10-Oct-2016.)
((Ⅎ𝑥𝜓 ∧ ∀𝑥(𝑥 = 𝐴 → (𝜑𝜓)) ∧ 𝐴𝑉) → (∀𝑥(𝑥 = 𝐴𝜑) ↔ 𝜓))
 
Theoremceqsralt 3260* Restricted quantifier version of ceqsalt 3259. (Contributed by NM, 28-Feb-2013.) (Revised by Mario Carneiro, 10-Oct-2016.)
((Ⅎ𝑥𝜓 ∧ ∀𝑥(𝑥 = 𝐴 → (𝜑𝜓)) ∧ 𝐴𝐵) → (∀𝑥𝐵 (𝑥 = 𝐴𝜑) ↔ 𝜓))
 
Theoremceqsalg 3261* A representation of explicit substitution of a class for a variable, inferred from an implicit substitution hypothesis. For an alternate proof, see ceqsalgALT 3262. (Contributed by NM, 29-Oct-2003.) (Proof shortened by BJ, 29-Sep-2019.)
𝑥𝜓    &   (𝑥 = 𝐴 → (𝜑𝜓))       (𝐴𝑉 → (∀𝑥(𝑥 = 𝐴𝜑) ↔ 𝜓))
 
TheoremceqsalgALT 3262* Alternate proof of ceqsalg 3261, not using ceqsalt 3259. (Contributed by NM, 29-Oct-2003.) (Proof shortened by Andrew Salmon, 8-Jun-2011.) (Revised by BJ, 29-Sep-2019.) (Proof modification is discouraged.) (New usage is discouraged.)
𝑥𝜓    &   (𝑥 = 𝐴 → (𝜑𝜓))       (𝐴𝑉 → (∀𝑥(𝑥 = 𝐴𝜑) ↔ 𝜓))
 
Theoremceqsal 3263* A representation of explicit substitution of a class for a variable, inferred from an implicit substitution hypothesis. (Contributed by NM, 18-Aug-1993.)
𝑥𝜓    &   𝐴 ∈ V    &   (𝑥 = 𝐴 → (𝜑𝜓))       (∀𝑥(𝑥 = 𝐴𝜑) ↔ 𝜓)
 
Theoremceqsalv 3264* A representation of explicit substitution of a class for a variable, inferred from an implicit substitution hypothesis. (Contributed by NM, 18-Aug-1993.)
𝐴 ∈ V    &   (𝑥 = 𝐴 → (𝜑𝜓))       (∀𝑥(𝑥 = 𝐴𝜑) ↔ 𝜓)
 
Theoremceqsralv 3265* Restricted quantifier version of ceqsalv 3264. (Contributed by NM, 21-Jun-2013.)
(𝑥 = 𝐴 → (𝜑𝜓))       (𝐴𝐵 → (∀𝑥𝐵 (𝑥 = 𝐴𝜑) ↔ 𝜓))
 
Theoremgencl 3266* Implicit substitution for class with embedded variable. (Contributed by NM, 17-May-1996.)
(𝜃 ↔ ∃𝑥(𝜒𝐴 = 𝐵))    &   (𝐴 = 𝐵 → (𝜑𝜓))    &   (𝜒𝜑)       (𝜃𝜓)
 
Theorem2gencl 3267* Implicit substitution for class with embedded variable. (Contributed by NM, 17-May-1996.)
(𝐶𝑆 ↔ ∃𝑥𝑅 𝐴 = 𝐶)    &   (𝐷𝑆 ↔ ∃𝑦𝑅 𝐵 = 𝐷)    &   (𝐴 = 𝐶 → (𝜑𝜓))    &   (𝐵 = 𝐷 → (𝜓𝜒))    &   ((𝑥𝑅𝑦𝑅) → 𝜑)       ((𝐶𝑆𝐷𝑆) → 𝜒)
 
Theorem3gencl 3268* Implicit substitution for class with embedded variable. (Contributed by NM, 17-May-1996.)
(𝐷𝑆 ↔ ∃𝑥𝑅 𝐴 = 𝐷)    &   (𝐹𝑆 ↔ ∃𝑦𝑅 𝐵 = 𝐹)    &   (𝐺𝑆 ↔ ∃𝑧𝑅 𝐶 = 𝐺)    &   (𝐴 = 𝐷 → (𝜑𝜓))    &   (𝐵 = 𝐹 → (𝜓𝜒))    &   (𝐶 = 𝐺 → (𝜒𝜃))    &   ((𝑥𝑅𝑦𝑅𝑧𝑅) → 𝜑)       ((𝐷𝑆𝐹𝑆𝐺𝑆) → 𝜃)
 
Theoremcgsexg 3269* Implicit substitution inference for general classes. (Contributed by NM, 26-Aug-2007.)
(𝑥 = 𝐴𝜒)    &   (𝜒 → (𝜑𝜓))       (𝐴𝑉 → (∃𝑥(𝜒𝜑) ↔ 𝜓))
 
Theoremcgsex2g 3270* Implicit substitution inference for general classes. (Contributed by NM, 26-Jul-1995.)
((𝑥 = 𝐴𝑦 = 𝐵) → 𝜒)    &   (𝜒 → (𝜑𝜓))       ((𝐴𝑉𝐵𝑊) → (∃𝑥𝑦(𝜒𝜑) ↔ 𝜓))
 
Theoremcgsex4g 3271* An implicit substitution inference for 4 general classes. (Contributed by NM, 5-Aug-1995.)
(((𝑥 = 𝐴𝑦 = 𝐵) ∧ (𝑧 = 𝐶𝑤 = 𝐷)) → 𝜒)    &   (𝜒 → (𝜑𝜓))       (((𝐴𝑅𝐵𝑆) ∧ (𝐶𝑅𝐷𝑆)) → (∃𝑥𝑦𝑧𝑤(𝜒𝜑) ↔ 𝜓))
 
Theoremceqsex 3272* Elimination of an existential quantifier, using implicit substitution. (Contributed by NM, 2-Mar-1995.) (Revised by Mario Carneiro, 10-Oct-2016.)
𝑥𝜓    &   𝐴 ∈ V    &   (𝑥 = 𝐴 → (𝜑𝜓))       (∃𝑥(𝑥 = 𝐴𝜑) ↔ 𝜓)
 
Theoremceqsexv 3273* Elimination of an existential quantifier, using implicit substitution. (Contributed by NM, 2-Mar-1995.)
𝐴 ∈ V    &   (𝑥 = 𝐴 → (𝜑𝜓))       (∃𝑥(𝑥 = 𝐴𝜑) ↔ 𝜓)
 
Theoremceqsexv2d 3274* Elimination of an existential quantifier, using implicit substitution. (Contributed by Thierry Arnoux, 10-Sep-2016.)
𝐴 ∈ V    &   (𝑥 = 𝐴 → (𝜑𝜓))    &   𝜓       𝑥𝜑
 
Theoremceqsex2 3275* Elimination of two existential quantifiers, using implicit substitution. (Contributed by Scott Fenton, 7-Jun-2006.)
𝑥𝜓    &   𝑦𝜒    &   𝐴 ∈ V    &   𝐵 ∈ V    &   (𝑥 = 𝐴 → (𝜑𝜓))    &   (𝑦 = 𝐵 → (𝜓𝜒))       (∃𝑥𝑦(𝑥 = 𝐴𝑦 = 𝐵𝜑) ↔ 𝜒)
 
Theoremceqsex2v 3276* Elimination of two existential quantifiers, using implicit substitution. (Contributed by Scott Fenton, 7-Jun-2006.)
𝐴 ∈ V    &   𝐵 ∈ V    &   (𝑥 = 𝐴 → (𝜑𝜓))    &   (𝑦 = 𝐵 → (𝜓𝜒))       (∃𝑥𝑦(𝑥 = 𝐴𝑦 = 𝐵𝜑) ↔ 𝜒)
 
Theoremceqsex3v 3277* Elimination of three existential quantifiers, using implicit substitution. (Contributed by NM, 16-Aug-2011.)
𝐴 ∈ V    &   𝐵 ∈ V    &   𝐶 ∈ V    &   (𝑥 = 𝐴 → (𝜑𝜓))    &   (𝑦 = 𝐵 → (𝜓𝜒))    &   (𝑧 = 𝐶 → (𝜒𝜃))       (∃𝑥𝑦𝑧((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) ∧ 𝜑) ↔ 𝜃)
 
Theoremceqsex4v 3278* Elimination of four existential quantifiers, using implicit substitution. (Contributed by NM, 23-Sep-2011.)
𝐴 ∈ V    &   𝐵 ∈ V    &   𝐶 ∈ V    &   𝐷 ∈ V    &   (𝑥 = 𝐴 → (𝜑𝜓))    &   (𝑦 = 𝐵 → (𝜓𝜒))    &   (𝑧 = 𝐶 → (𝜒𝜃))    &   (𝑤 = 𝐷 → (𝜃𝜏))       (∃𝑥𝑦𝑧𝑤((𝑥 = 𝐴𝑦 = 𝐵) ∧ (𝑧 = 𝐶𝑤 = 𝐷) ∧ 𝜑) ↔ 𝜏)
 
Theoremceqsex6v 3279* Elimination of six existential quantifiers, using implicit substitution. (Contributed by NM, 21-Sep-2011.)
𝐴 ∈ V    &   𝐵 ∈ V    &   𝐶 ∈ V    &   𝐷 ∈ V    &   𝐸 ∈ V    &   𝐹 ∈ V    &   (𝑥 = 𝐴 → (𝜑𝜓))    &   (𝑦 = 𝐵 → (𝜓𝜒))    &   (𝑧 = 𝐶 → (𝜒𝜃))    &   (𝑤 = 𝐷 → (𝜃𝜏))    &   (𝑣 = 𝐸 → (𝜏𝜂))    &   (𝑢 = 𝐹 → (𝜂𝜁))       (∃𝑥𝑦𝑧𝑤𝑣𝑢((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) ∧ (𝑤 = 𝐷𝑣 = 𝐸𝑢 = 𝐹) ∧ 𝜑) ↔ 𝜁)
 
Theoremceqsex8v 3280* Elimination of eight existential quantifiers, using implicit substitution. (Contributed by NM, 23-Sep-2011.)
𝐴 ∈ V    &   𝐵 ∈ V    &   𝐶 ∈ V    &   𝐷 ∈ V    &   𝐸 ∈ V    &   𝐹 ∈ V    &   𝐺 ∈ V    &   𝐻 ∈ V    &   (𝑥 = 𝐴 → (𝜑𝜓))    &   (𝑦 = 𝐵 → (𝜓𝜒))    &   (𝑧 = 𝐶 → (𝜒𝜃))    &   (𝑤 = 𝐷 → (𝜃𝜏))    &   (𝑣 = 𝐸 → (𝜏𝜂))    &   (𝑢 = 𝐹 → (𝜂𝜁))    &   (𝑡 = 𝐺 → (𝜁𝜎))    &   (𝑠 = 𝐻 → (𝜎𝜌))       (∃𝑥𝑦𝑧𝑤𝑣𝑢𝑡𝑠(((𝑥 = 𝐴𝑦 = 𝐵) ∧ (𝑧 = 𝐶𝑤 = 𝐷)) ∧ ((𝑣 = 𝐸𝑢 = 𝐹) ∧ (𝑡 = 𝐺𝑠 = 𝐻)) ∧ 𝜑) ↔ 𝜌)
 
Theoremgencbvex 3281* Change of bound variable using implicit substitution. (Contributed by NM, 17-May-1996.) (Proof shortened by Andrew Salmon, 8-Jun-2011.)
𝐴 ∈ V    &   (𝐴 = 𝑦 → (𝜑𝜓))    &   (𝐴 = 𝑦 → (𝜒𝜃))    &   (𝜃 ↔ ∃𝑥(𝜒𝐴 = 𝑦))       (∃𝑥(𝜒𝜑) ↔ ∃𝑦(𝜃𝜓))
 
Theoremgencbvex2 3282* Restatement of gencbvex 3281 with weaker hypotheses. (Contributed by Jeff Hankins, 6-Dec-2006.)
𝐴 ∈ V    &   (𝐴 = 𝑦 → (𝜑𝜓))    &   (𝐴 = 𝑦 → (𝜒𝜃))    &   (𝜃 → ∃𝑥(𝜒𝐴 = 𝑦))       (∃𝑥(𝜒𝜑) ↔ ∃𝑦(𝜃𝜓))
 
Theoremgencbval 3283* Change of bound variable using implicit substitution. (Contributed by NM, 17-May-1996.)
𝐴 ∈ V    &   (𝐴 = 𝑦 → (𝜑𝜓))    &   (𝐴 = 𝑦 → (𝜒𝜃))    &   (𝜃 ↔ ∃𝑥(𝜒𝐴 = 𝑦))       (∀𝑥(𝜒𝜑) ↔ ∀𝑦(𝜃𝜓))
 
Theoremsbhypf 3284* Introduce an explicit substitution into an implicit substitution hypothesis. See also csbhypf 3585. (Contributed by Raph Levien, 10-Apr-2004.)
𝑥𝜓    &   (𝑥 = 𝐴 → (𝜑𝜓))       (𝑦 = 𝐴 → ([𝑦 / 𝑥]𝜑𝜓))
 
Theoremvtoclgft 3285 Closed theorem form of vtoclgf 3295. (Contributed by NM, 17-Feb-2013.) (Revised by Mario Carneiro, 12-Oct-2016.) (Proof shortened by JJ, 11-Aug-2021.)
(((𝑥𝐴 ∧ Ⅎ𝑥𝜓) ∧ (∀𝑥(𝑥 = 𝐴 → (𝜑𝜓)) ∧ ∀𝑥𝜑) ∧ 𝐴𝑉) → 𝜓)
 
TheoremvtoclgftOLD 3286 Obsolete proof of vtoclgft 3285 as of 11-Aug-2021. (Contributed by NM, 17-Feb-2013.) (Revised by Mario Carneiro, 12-Oct-2016.) (New usage is discouraged.) (Proof modification is discouraged.)
(((𝑥𝐴 ∧ Ⅎ𝑥𝜓) ∧ (∀𝑥(𝑥 = 𝐴 → (𝜑𝜓)) ∧ ∀𝑥𝜑) ∧ 𝐴𝑉) → 𝜓)
 
Theoremvtocldf 3287 Implicit substitution of a class for a setvar variable. (Contributed by Mario Carneiro, 15-Oct-2016.)
(𝜑𝐴𝑉)    &   ((𝜑𝑥 = 𝐴) → (𝜓𝜒))    &   (𝜑𝜓)    &   𝑥𝜑    &   (𝜑𝑥𝐴)    &   (𝜑 → Ⅎ𝑥𝜒)       (𝜑𝜒)
 
Theoremvtocld 3288* Implicit substitution of a class for a setvar variable. (Contributed by Mario Carneiro, 15-Oct-2016.)
(𝜑𝐴𝑉)    &   ((𝜑𝑥 = 𝐴) → (𝜓𝜒))    &   (𝜑𝜓)       (𝜑𝜒)
 
Theoremvtoclf 3289* Implicit substitution of a class for a setvar variable. This is a generalization of chvar 2298. (Contributed by NM, 30-Aug-1993.)
𝑥𝜓    &   𝐴 ∈ V    &   (𝑥 = 𝐴 → (𝜑𝜓))    &   𝜑       𝜓
 
Theoremvtocl 3290* Implicit substitution of a class for a setvar variable. See also vtoclALT 3291. (Contributed by NM, 30-Aug-1993.) Removed dependency on ax-10 2059. (Revised by BJ, 29-Nov-2020.)
𝐴 ∈ V    &   (𝑥 = 𝐴 → (𝜑𝜓))    &   𝜑       𝜓
 
TheoremvtoclALT 3291* Alternate proof of vtocl 3290. Shorter but requires more axioms. (Contributed by NM, 30-Aug-1993.) (Proof modification is discouraged.) (New usage is discouraged.)
𝐴 ∈ V    &   (𝑥 = 𝐴 → (𝜑𝜓))    &   𝜑       𝜓
 
Theoremvtocl2 3292* Implicit substitution of classes for setvar variables. (Contributed by NM, 26-Jul-1995.) (Proof shortened by Andrew Salmon, 8-Jun-2011.)
𝐴 ∈ V    &   𝐵 ∈ V    &   ((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓))    &   𝜑       𝜓
 
Theoremvtocl3 3293* Implicit substitution of classes for setvar variables. (Contributed by NM, 3-Jun-1995.) (Proof shortened by Andrew Salmon, 8-Jun-2011.)
𝐴 ∈ V    &   𝐵 ∈ V    &   𝐶 ∈ V    &   ((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) → (𝜑𝜓))    &   𝜑       𝜓
 
Theoremvtoclb 3294* Implicit substitution of a class for a setvar variable. (Contributed by NM, 23-Dec-1993.)
𝐴 ∈ V    &   (𝑥 = 𝐴 → (𝜑𝜒))    &   (𝑥 = 𝐴 → (𝜓𝜃))    &   (𝜑𝜓)       (𝜒𝜃)
 
Theoremvtoclgf 3295 Implicit substitution of a class for a setvar variable, with bound-variable hypotheses in place of disjoint variable restrictions. (Contributed by NM, 21-Sep-2003.) (Proof shortened by Mario Carneiro, 10-Oct-2016.)
𝑥𝐴    &   𝑥𝜓    &   (𝑥 = 𝐴 → (𝜑𝜓))    &   𝜑       (𝐴𝑉𝜓)
 
Theoremvtoclg1f 3296* Version of vtoclgf 3295 with one non-freeness hypothesis replaced with a dv condition, thus avoiding dependency on ax-11 2074 and ax-13 2282. (Contributed by BJ, 1-May-2019.)
𝑥𝜓    &   (𝑥 = 𝐴 → (𝜑𝜓))    &   𝜑       (𝐴𝑉𝜓)
 
Theoremvtoclg 3297* Implicit substitution of a class expression for a setvar variable. (Contributed by NM, 17-Apr-1995.)
(𝑥 = 𝐴 → (𝜑𝜓))    &   𝜑       (𝐴𝑉𝜓)
 
Theoremvtoclbg 3298* Implicit substitution of a class for a setvar variable. (Contributed by NM, 29-Apr-1994.)
(𝑥 = 𝐴 → (𝜑𝜒))    &   (𝑥 = 𝐴 → (𝜓𝜃))    &   (𝜑𝜓)       (𝐴𝑉 → (𝜒𝜃))
 
Theoremvtocl2gf 3299 Implicit substitution of a class for a setvar variable. (Contributed by NM, 25-Apr-1995.)
𝑥𝐴    &   𝑦𝐴    &   𝑦𝐵    &   𝑥𝜓    &   𝑦𝜒    &   (𝑥 = 𝐴 → (𝜑𝜓))    &   (𝑦 = 𝐵 → (𝜓𝜒))    &   𝜑       ((𝐴𝑉𝐵𝑊) → 𝜒)
 
Theoremvtocl3gf 3300 Implicit substitution of a class for a setvar variable. (Contributed by NM, 10-Aug-2013.) (Revised by Mario Carneiro, 10-Oct-2016.)
𝑥𝐴    &   𝑦𝐴    &   𝑧𝐴    &   𝑦𝐵    &   𝑧𝐵    &   𝑧𝐶    &   𝑥𝜓    &   𝑦𝜒    &   𝑧𝜃    &   (𝑥 = 𝐴 → (𝜑𝜓))    &   (𝑦 = 𝐵 → (𝜓𝜒))    &   (𝑧 = 𝐶 → (𝜒𝜃))    &   𝜑       ((𝐴𝑉𝐵𝑊𝐶𝑋) → 𝜃)
    < 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-31500 316 31501-31600 317 31601-31700 318 31701-31800 319 31801-31900 320 31901-32000 321 32001-32100 322 32101-32200 323 32201-32300 324 32301-32400 325 32401-32500 326 32501-32600 327 32601-32700 328 32701-32800 329 32801-32900 330 32901-33000 331 33001-33100 332 33101-33200 333 33201-33300 334 33301-33400 335 33401-33500 336 33501-33600 337 33601-33700 338 33701-33800 339 33801-33900 340 33901-34000 341 34001-34100 342 34101-34200 343 34201-34300 344 34301-34400 345 34401-34500 346 34501-34600 347 34601-34700 348 34701-34800 349 34801-34900 350 34901-35000 351 35001-35100 352 35101-35200 353 35201-35300 354 35301-35400 355 35401-35500 356 35501-35600 357 35601-35700 358 35701-35800 359 35801-35900 360 35901-36000 361 36001-36100 362 36101-36200 363 36201-36300 364 36301-36400 365 36401-36500 366 36501-36600 367 36601-36700 368 36701-36800 369 36801-36900 370 36901-37000 371 37001-37100 372 37101-37200 373 37201-37300 374 37301-37400 375 37401-37500 376 37501-37600 377 37601-37700 378 37701-37800 379 37801-37900 380 37901-38000 381 38001-38100 382 38101-38200 383 38201-38300 384 38301-38400 385 38401-38500 386 38501-38600 387 38601-38700 388 38701-38800 389 38801-38900 390 38901-39000 391 39001-39100 392 39101-39200 393 39201-39300 394 39301-39400 395 39401-39500 396 39501-39600 397 39601-39700 398 39701-39800 399 39801-39900 400 39901-40000 401 40001-40100 402 40101-40200 403 40201-40300 404 40301-40400 405 40401-40500 406 40501-40600 407 40601-40700 408 40701-40800 409 40801-40900 410 40901-41000 411 41001-41100 412 41101-41200 413 41201-41300 414 41301-41400 415 41401-41500 416 41501-41600 417 41601-41700 418 41701-41800 419 41801-41900 420 41901-42000 421 42001-42100 422 42101-42200 423 42201-42300 424 42301-42400 425 42401-42500 426 42501-42600 427 42601-42700 428 42701-42800 429 42801-42879
  Copyright terms: Public domain < Previous  Next >