 Home Intuitionistic Logic ExplorerTheorem List (p. 28 of 95) < Previous  Next > Bad symbols? Try the GIF version. Mirrors  >  Metamath Home Page  >  ILE Home Page  >  Theorem List Contents  >  Recent Proofs       This page: Page List

Theorem List for Intuitionistic Logic Explorer - 2701-2800   *Has distinct variable group(s)
TypeLabelDescription
Statement

Theoremrexab2 2701* Existential quantification over a class abstraction. (Contributed by Mario Carneiro, 3-Sep-2015.)
(x = y → (ψχ))       (x {yφ}ψy(φ χ))

Theoremrexrab2 2702* Existential quantification over a class abstraction. (Contributed by Mario Carneiro, 3-Sep-2015.)
(x = y → (ψχ))       (x {y Aφ}ψy A (φ χ))

Theoremabidnf 2703* Identity used to create closed-form versions of bound-variable hypothesis builders for class expressions. (Contributed by NM, 10-Nov-2005.) (Proof shortened by Mario Carneiro, 12-Oct-2016.)
(xA → {zx z A} = A)

Theoremdedhb 2704* A deduction theorem for converting the inference xA => φ into a closed theorem. Use nfa1 1431 and nfab 2179 to eliminate the hypothesis of the substitution instance ψ of the inference. For converting the inference form into a deduction form, abidnf 2703 is useful. (Contributed by NM, 8-Dec-2006.)
(A = {zx z A} → (φψ))    &   ψ       (xAφ)

Theoremeqeu 2705* A condition which implies existential uniqueness. (Contributed by Jeff Hankins, 8-Sep-2009.)
(x = A → (φψ))       ((A B ψ x(φx = A)) → ∃!xφ)

Theoremeueq 2706* Equality has existential uniqueness. (Contributed by NM, 25-Nov-1994.)
(A V ↔ ∃!x x = A)

Theoremeueq1 2707* Equality has existential uniqueness. (Contributed by NM, 5-Apr-1995.)
A V       ∃!x x = A

Theoremeueq2dc 2708* Equality has existential uniqueness (split into 2 cases). (Contributed by NM, 5-Apr-1995.)
A V    &   B V       (DECID φ∃!x((φ x = A) φ x = B)))

Theoremeueq3dc 2709* Equality has existential uniqueness (split into 3 cases). (Contributed by NM, 5-Apr-1995.) (Proof shortened by Mario Carneiro, 28-Sep-2015.)
A V    &   B V    &   𝐶 V    &    ¬ (φ ψ)       (DECID φ → (DECID ψ∃!x((φ x = A) (¬ (φ ψ) x = B) (ψ x = 𝐶))))

Theoremmoeq 2710* There is at most one set equal to a class. (Contributed by NM, 8-Mar-1995.)
∃*x x = A

Theoremmoeq3dc 2711* "At most one" property of equality (split into 3 cases). (Contributed by Jim Kingdon, 7-Jul-2018.)
A V    &   B V    &   𝐶 V    &    ¬ (φ ψ)       (DECID φ → (DECID ψ∃*x((φ x = A) (¬ (φ ψ) x = B) (ψ x = 𝐶))))

Theoremmosubt 2712* "At most one" remains true after substitution. (Contributed by Jim Kingdon, 18-Jan-2019.)
(y∃*xφ∃*xy(y = A φ))

Theoremmosub 2713* "At most one" remains true after substitution. (Contributed by NM, 9-Mar-1995.)
∃*xφ       ∃*xy(y = A φ)

Theoremmo2icl 2714* Theorem for inferring "at most one." (Contributed by NM, 17-Oct-1996.)
(x(φx = A) → ∃*xφ)

Theoremmob2 2715* Consequence of "at most one." (Contributed by NM, 2-Jan-2015.)
(x = A → (φψ))       ((A B ∃*xφ φ) → (x = Aψ))

Theoremmoi2 2716* Consequence of "at most one." (Contributed by NM, 29-Jun-2008.)
(x = A → (φψ))       (((A B ∃*xφ) (φ ψ)) → x = A)

Theoremmob 2717* Equality implied by "at most one." (Contributed by NM, 18-Feb-2006.)
(x = A → (φψ))    &   (x = B → (φχ))       (((A 𝐶 B 𝐷) ∃*xφ ψ) → (A = Bχ))

Theoremmoi 2718* Equality implied by "at most one." (Contributed by NM, 18-Feb-2006.)
(x = A → (φψ))    &   (x = B → (φχ))       (((A 𝐶 B 𝐷) ∃*xφ (ψ χ)) → A = B)

Theoremmorex 2719* Derive membership from uniqueness. (Contributed by Jeff Madsen, 2-Sep-2009.)
B V    &   (x = B → (φψ))       ((x A φ ∃*xφ) → (ψB A))

Theoremeuxfr2dc 2720* Transfer existential uniqueness from a variable x to another variable y contained in expression A. (Contributed by NM, 14-Nov-2004.)
A V    &   ∃*y x = A       (DECID yx(x = A φ) → (∃!xy(x = A φ) ↔ ∃!yφ))

Theoremeuxfrdc 2721* Transfer existential uniqueness from a variable x to another variable y contained in expression A. (Contributed by NM, 14-Nov-2004.)
A V    &   ∃!y x = A    &   (x = A → (φψ))       (DECID yx(x = A ψ) → (∃!xφ∃!yψ))

Theoremeuind 2722* Existential uniqueness via an indirect equality. (Contributed by NM, 11-Oct-2010.)
B V    &   (x = y → (φψ))    &   (x = yA = B)       ((xy((φ ψ) → A = B) xφ) → ∃!zx(φz = A))

Theoremreu2 2723* A way to express restricted uniqueness. (Contributed by NM, 22-Nov-1994.)
(∃!x A φ ↔ (x A φ x A y A ((φ [y / x]φ) → x = y)))

Theoremreu6 2724* A way to express restricted uniqueness. (Contributed by NM, 20-Oct-2006.)
(∃!x A φy A x A (φx = y))

Theoremreu3 2725* A way to express restricted uniqueness. (Contributed by NM, 24-Oct-2006.)
(∃!x A φ ↔ (x A φ y A x A (φx = y)))

Theoremreu6i 2726* A condition which implies existential uniqueness. (Contributed by Mario Carneiro, 2-Oct-2015.)
((B A x A (φx = B)) → ∃!x A φ)

Theoremeqreu 2727* A condition which implies existential uniqueness. (Contributed by Mario Carneiro, 2-Oct-2015.)
(x = B → (φψ))       ((B A ψ x A (φx = B)) → ∃!x A φ)

Theoremrmo4 2728* Restricted "at most one" using implicit substitution. (Contributed by NM, 24-Oct-2006.) (Revised by NM, 16-Jun-2017.)
(x = y → (φψ))       (∃*x A φx A y A ((φ ψ) → x = y))

Theoremreu4 2729* Restricted uniqueness using implicit substitution. (Contributed by NM, 23-Nov-1994.)
(x = y → (φψ))       (∃!x A φ ↔ (x A φ x A y A ((φ ψ) → x = y)))

Theoremreu7 2730* Restricted uniqueness using implicit substitution. (Contributed by NM, 24-Oct-2006.)
(x = y → (φψ))       (∃!x A φ ↔ (x A φ x A y A (ψx = y)))

Theoremreu8 2731* Restricted uniqueness using implicit substitution. (Contributed by NM, 24-Oct-2006.)
(x = y → (φψ))       (∃!x A φx A (φ y A (ψx = y)))

Theoremreueq 2732* Equality has existential uniqueness. (Contributed by Mario Carneiro, 1-Sep-2015.)
(B A∃!x A x = B)

Theoremrmoan 2733 Restricted "at most one" still holds when a conjunct is added. (Contributed by NM, 16-Jun-2017.)
(∃*x A φ∃*x A (ψ φ))

Theoremrmoim 2734 Restricted "at most one" is preserved through implication (note wff reversal). (Contributed by Alexander van der Vekens, 17-Jun-2017.)
(x A (φψ) → (∃*x A ψ∃*x A φ))

Theoremrmoimia 2735 Restricted "at most one" is preserved through implication (note wff reversal). (Contributed by Alexander van der Vekens, 17-Jun-2017.)
(x A → (φψ))       (∃*x A ψ∃*x A φ)

Theoremrmoimi2 2736 Restricted "at most one" is preserved through implication (note wff reversal). (Contributed by Alexander van der Vekens, 17-Jun-2017.)
x((x A φ) → (x B ψ))       (∃*x B ψ∃*x A φ)

Theorem2reuswapdc 2737* A condition allowing swap of uniqueness and existential quantifiers. (Contributed by Thierry Arnoux, 7-Apr-2017.) (Revised by NM, 16-Jun-2017.)
(DECID xy(x A (y B φ)) → (x A ∃*y B φ → (∃!x A y B φ∃!y B x A φ)))

Theoremreuind 2738* Existential uniqueness via an indirect equality. (Contributed by NM, 16-Oct-2010.)
(x = y → (φψ))    &   (x = yA = B)       ((xy(((A 𝐶 φ) (B 𝐶 ψ)) → A = B) x(A 𝐶 φ)) → ∃!z 𝐶 x((A 𝐶 φ) → z = A))

Theorem2rmorex 2739* Double restricted quantification with "at most one," analogous to 2moex 1983. (Contributed by Alexander van der Vekens, 17-Jun-2017.)
(∃*x A y B φy B ∃*x A φ)

Theoremnelrdva 2740* Deduce negative membership from an implication. (Contributed by Thierry Arnoux, 27-Nov-2017.)
((φ x A) → xB)       (φ → ¬ B A)

2.1.7  Conditional equality (experimental)

This is a very useless definition, which "abbreviates" (x = yφ) as CondEq(x = yφ). What this display hides, though, is that the first expression, even though it has a shorter constant string, is actually much more complicated in its parse tree: it is parsed as (wi (wceq (cv vx) (cv vy)) wph), while the CondEq version is parsed as (wcdeq vx vy wph). It also allows us to give a name to the specific 3-ary operation (x = yφ).

This is all used as part of a metatheorem: we want to say that (x = y → (φ(x) ↔ φ(y))) and (x = yA(x) = A(y)) are provable, for any expressions φ(x) or A(x) in the language. The proof is by induction, so the base case is each of the primitives, which is why you will see a theorem for each of the set.mm primitive operations.

The metatheorem comes with a disjoint variables assumption: every variable in φ(x) is assumed disjoint from x except x itself. For such a proof by induction, we must consider each of the possible forms of φ(x). If it is a variable other than x, then we have CondEq(x = yA = A) or CondEq(x = y → (φφ)), which is provable by cdeqth 2745 and reflexivity. Since we are only working with class and wff expressions, it can't be x itself in set.mm, but if it was we'd have to also prove CondEq(x = yx = y) (where set equality is being used on the right).

Otherwise, it is a primitive operation applied to smaller expressions. In these cases, for each setvar variable parameter to the operation, we must consider if it is equal to x or not, which yields 2^n proof obligations. Luckily, all primitive operations in set.mm have either zero or one set variable, so we only need to prove one statement for the non-set constructors (like implication) and two for the constructors taking a set (the forall and the class builder).

In each of the primitive proofs, we are allowed to assume that y is disjoint from φ(x) and vice versa, because this is maintained through the induction. This is how we satisfy the DV assumptions of cdeqab1 2750 and cdeqab 2748.

Syntaxwcdeq 2741 Extend wff notation to include conditional equality. This is a technical device used in the proof that is the not-free predicate, and that definitions are conservative as a result.
wff CondEq(x = yφ)

Definitiondf-cdeq 2742 Define conditional equality. All the notation to the left of the is fake; the parentheses and arrows are all part of the notation, which could equally well be written CondEqxyφ. On the right side is the actual implication arrow. The reason for this definition is to "flatten" the structure on the right side (whose tree structure is something like (wi (wceq (cv vx) (cv vy)) wph) ) into just (wcdeq vx vy wph). (Contributed by Mario Carneiro, 11-Aug-2016.)
(CondEq(x = yφ) ↔ (x = yφ))

Theoremcdeqi 2743 Deduce conditional equality. (Contributed by Mario Carneiro, 11-Aug-2016.)
(x = yφ)       CondEq(x = yφ)

Theoremcdeqri 2744 Property of conditional equality. (Contributed by Mario Carneiro, 11-Aug-2016.)
CondEq(x = yφ)       (x = yφ)

Theoremcdeqth 2745 Deduce conditional equality from a theorem. (Contributed by Mario Carneiro, 11-Aug-2016.)
φ       CondEq(x = yφ)

Theoremcdeqnot 2746 Distribute conditional equality over negation. (Contributed by Mario Carneiro, 11-Aug-2016.)
CondEq(x = y → (φψ))       CondEq(x = y → (¬ φ ↔ ¬ ψ))

Theoremcdeqal 2747* Distribute conditional equality over quantification. (Contributed by Mario Carneiro, 11-Aug-2016.)
CondEq(x = y → (φψ))       CondEq(x = y → (zφzψ))

Theoremcdeqab 2748* Distribute conditional equality over abstraction. (Contributed by Mario Carneiro, 11-Aug-2016.)
CondEq(x = y → (φψ))       CondEq(x = y → {zφ} = {zψ})

Theoremcdeqal1 2749* Distribute conditional equality over quantification. (Contributed by Mario Carneiro, 11-Aug-2016.)
CondEq(x = y → (φψ))       CondEq(x = y → (xφyψ))

Theoremcdeqab1 2750* Distribute conditional equality over abstraction. (Contributed by Mario Carneiro, 11-Aug-2016.)
CondEq(x = y → (φψ))       CondEq(x = y → {xφ} = {yψ})

Theoremcdeqim 2751 Distribute conditional equality over implication. (Contributed by Mario Carneiro, 11-Aug-2016.)
CondEq(x = y → (φψ))    &   CondEq(x = y → (χθ))       CondEq(x = y → ((φχ) ↔ (ψθ)))

Theoremcdeqcv 2752 Conditional equality for set-to-class promotion. (Contributed by Mario Carneiro, 11-Aug-2016.)
CondEq(x = yx = y)

Theoremcdeqeq 2753 Distribute conditional equality over equality. (Contributed by Mario Carneiro, 11-Aug-2016.)
CondEq(x = yA = B)    &   CondEq(x = y𝐶 = 𝐷)       CondEq(x = y → (A = 𝐶B = 𝐷))

Theoremcdeqel 2754 Distribute conditional equality over elementhood. (Contributed by Mario Carneiro, 11-Aug-2016.)
CondEq(x = yA = B)    &   CondEq(x = y𝐶 = 𝐷)       CondEq(x = y → (A 𝐶B 𝐷))

Theoremnfcdeq 2755* If we have a conditional equality proof, where φ is φ(x) and ψ is φ(y), and φ(x) in fact does not have x free in it according to , then φ(x) ↔ φ(y) unconditionally. This proves that xφ is actually a not-free predicate. (Contributed by Mario Carneiro, 11-Aug-2016.)
xφ    &   CondEq(x = y → (φψ))       (φψ)

Theoremnfccdeq 2756* Variation of nfcdeq 2755 for classes. (Contributed by Mario Carneiro, 11-Aug-2016.)
xA    &   CondEq(x = yA = B)       A = B

Theoremru 2757 Russell's Paradox. Proposition 4.14 of [TakeutiZaring] p. 14.

In the late 1800s, Frege's Axiom of (unrestricted) Comprehension, expressed in our notation as A V, asserted that any collection of sets A is a set i.e. belongs to the universe V of all sets. In particular, by substituting {xxx} (the "Russell class") for A, it asserted {xxx} V, meaning that the "collection of all sets which are not members of themselves" is a set. However, here we prove {xxx} ∉ V. This contradiction was discovered by Russell in 1901 (published in 1903), invalidating the Comprehension Axiom and leading to the collapse of Frege's system.

In 1908, Zermelo rectified this fatal flaw by replacing Comprehension with a weaker Subset (or Separation) Axiom asserting that A is a set only when it is smaller than some other set B. The intuitionistic set theory IZF includes such a separation axiom, Axiom 6 of [Crosilla] p. "Axioms of CZF and IZF", which we include as ax-sep 3866. (Contributed by NM, 7-Aug-1994.)

{xxx} ∉ V

2.1.9  Proper substitution of classes for sets

Syntaxwsbc 2758 Extend wff notation to include the proper substitution of a class for a set. Read this notation as "the proper substitution of class A for setvar variable x in wff φ."
wff [A / x]φ

Definitiondf-sbc 2759 Define the proper substitution of a class for a set.

When A is a proper class, our definition evaluates to false. This is somewhat arbitrary: we could have, instead, chosen the conclusion of sbc6 2783 for our definition, which always evaluates to true for proper classes.

Our definition also does not produce the same results as discussed in the proof of Theorem 6.6 of [Quine] p. 42 (although Theorem 6.6 itself does hold, as shown by dfsbcq 2760 below). Unfortunately, Quine's definition requires a recursive syntactical breakdown of φ, and it does not seem possible to express it with a single closed formula.

If we did not want to commit to any specific proper class behavior, we could use this definition only to prove theorem dfsbcq 2760, which holds for both our definition and Quine's, and from which we can derive a weaker version of df-sbc 2759 in the form of sbc8g 2765. However, the behavior of Quine's definition at proper classes is similarly arbitrary, and for practical reasons (to avoid having to prove sethood of A in every use of this definition) we allow direct reference to df-sbc 2759 and assert that [A / x]φ is always false when A is a proper class.

The related definition df-csb defines proper substitution into a class variable (as opposed to a wff variable). (Contributed by NM, 14-Apr-1995.) (Revised by NM, 25-Dec-2016.)

([A / x]φA {xφ})

Theoremdfsbcq 2760 This theorem, which is similar to Theorem 6.7 of [Quine] p. 42 and holds under both our definition and Quine's, provides us with a weak definition of the proper substitution of a class for a set. Since our df-sbc 2759 does not result in the same behavior as Quine's for proper classes, if we wished to avoid conflict with Quine's definition we could start with this theorem and dfsbcq2 2761 instead of df-sbc 2759. (dfsbcq2 2761 is needed because unlike Quine we do not overload the df-sb 1643 syntax.) As a consequence of these theorems, we can derive sbc8g 2765, which is a weaker version of df-sbc 2759 that leaves substitution undefined when A is a proper class.

However, it is often a nuisance to have to prove the sethood hypothesis of sbc8g 2765, so we will allow direct use of df-sbc 2759. Proper substiution with a proper class is rarely needed, and when it is, we can simply use the expansion of Quine's definition. (Contributed by NM, 14-Apr-1995.)

(A = B → ([A / x]φ[B / x]φ))

Theoremdfsbcq2 2761 This theorem, which is similar to Theorem 6.7 of [Quine] p. 42 and holds under both our definition and Quine's, relates logic substitution df-sb 1643 and substitution for class variables df-sbc 2759. Unlike Quine, we use a different syntax for each in order to avoid overloading it. See remarks in dfsbcq 2760. (Contributed by NM, 31-Dec-2016.)
(y = A → ([y / x]φ[A / x]φ))

Theoremsbsbc 2762 Show that df-sb 1643 and df-sbc 2759 are equivalent when the class term A in df-sbc 2759 is a setvar variable. This theorem lets us reuse theorems based on df-sb 1643 for proofs involving df-sbc 2759. (Contributed by NM, 31-Dec-2016.) (Proof modification is discouraged.)
([y / x]φ[y / x]φ)

Theoremsbceq1d 2763 Equality theorem for class substitution. (Contributed by Mario Carneiro, 9-Feb-2017.) (Revised by NM, 30-Jun-2018.)
(φA = B)       (φ → ([A / x]ψ[B / x]ψ))

Theoremsbceq1dd 2764 Equality theorem for class substitution. (Contributed by Mario Carneiro, 9-Feb-2017.) (Revised by NM, 30-Jun-2018.)
(φA = B)    &   (φ[A / x]ψ)       (φ[B / x]ψ)

Theoremsbc8g 2765 This is the closest we can get to df-sbc 2759 if we start from dfsbcq 2760 (see its comments) and dfsbcq2 2761. (Contributed by NM, 18-Nov-2008.) (Proof shortened by Andrew Salmon, 29-Jun-2011.) (Proof modification is discouraged.)
(A 𝑉 → ([A / x]φA {xφ}))

Theoremsbcex 2766 By our definition of proper substitution, it can only be true if the substituted expression is a set. (Contributed by Mario Carneiro, 13-Oct-2016.)
([A / x]φA V)

Theoremsbceq1a 2767 Equality theorem for class substitution. Class version of sbequ12 1651. (Contributed by NM, 26-Sep-2003.)
(x = A → (φ[A / x]φ))

Theoremsbceq2a 2768 Equality theorem for class substitution. Class version of sbequ12r 1652. (Contributed by NM, 4-Jan-2017.)
(A = x → ([A / x]φφ))

Theoremspsbc 2769 Specialization: if a formula is true for all sets, it is true for any class which is a set. Similar to Theorem 6.11 of [Quine] p. 44. See also stdpc4 1655 and rspsbc 2834. (Contributed by NM, 16-Jan-2004.)
(A 𝑉 → (xφ[A / x]φ))

Theoremspsbcd 2770 Specialization: if a formula is true for all sets, it is true for any class which is a set. Similar to Theorem 6.11 of [Quine] p. 44. See also stdpc4 1655 and rspsbc 2834. (Contributed by Mario Carneiro, 9-Feb-2017.)
(φA 𝑉)    &   (φxψ)       (φ[A / x]ψ)

Theoremsbcth 2771 A substitution into a theorem remains true (when A is a set). (Contributed by NM, 5-Nov-2005.)
φ       (A 𝑉[A / x]φ)

Theoremsbcthdv 2772* Deduction version of sbcth 2771. (Contributed by NM, 30-Nov-2005.) (Proof shortened by Andrew Salmon, 8-Jun-2011.)
(φψ)       ((φ A 𝑉) → [A / x]ψ)

Theoremsbcid 2773 An identity theorem for substitution. See sbid 1654. (Contributed by Mario Carneiro, 18-Feb-2017.)
([x / x]φφ)

Theoremnfsbc1d 2774 Deduction version of nfsbc1 2775. (Contributed by NM, 23-May-2006.) (Revised by Mario Carneiro, 12-Oct-2016.)
(φxA)       (φ → Ⅎx[A / x]ψ)

Theoremnfsbc1 2775 Bound-variable hypothesis builder for class substitution. (Contributed by Mario Carneiro, 12-Oct-2016.)
xA       x[A / x]φ

Theoremnfsbc1v 2776* Bound-variable hypothesis builder for class substitution. (Contributed by Mario Carneiro, 12-Oct-2016.)
x[A / x]φ

Theoremnfsbcd 2777 Deduction version of nfsbc 2778. (Contributed by NM, 23-Nov-2005.) (Revised by Mario Carneiro, 12-Oct-2016.)
yφ    &   (φxA)    &   (φ → Ⅎxψ)       (φ → Ⅎx[A / y]ψ)

Theoremnfsbc 2778 Bound-variable hypothesis builder for class substitution. (Contributed by NM, 7-Sep-2014.) (Revised by Mario Carneiro, 12-Oct-2016.)
xA    &   xφ       x[A / y]φ

Theoremsbcco 2779* A composition law for class substitution. (Contributed by NM, 26-Sep-2003.) (Revised by Mario Carneiro, 13-Oct-2016.)
([A / y][y / x]φ[A / x]φ)

Theoremsbcco2 2780* A composition law for class substitution. Importantly, x may occur free in the class expression substituted for A. (Contributed by NM, 5-Sep-2004.) (Proof shortened by Andrew Salmon, 8-Jun-2011.)
(x = yA = B)       ([x / y][B / x]φ[A / x]φ)

Theoremsbc5 2781* An equivalence for class substitution. (Contributed by NM, 23-Aug-1993.) (Revised by Mario Carneiro, 12-Oct-2016.)
([A / x]φx(x = A φ))

Theoremsbc6g 2782* An equivalence for class substitution. (Contributed by NM, 11-Oct-2004.) (Proof shortened by Andrew Salmon, 8-Jun-2011.)
(A 𝑉 → ([A / x]φx(x = Aφ)))

Theoremsbc6 2783* An equivalence for class substitution. (Contributed by NM, 23-Aug-1993.) (Proof shortened by Eric Schmidt, 17-Jan-2007.)
A V       ([A / x]φx(x = Aφ))

Theoremsbc7 2784* An equivalence for class substitution in the spirit of df-clab 2024. Note that x and A don't have to be distinct. (Contributed by NM, 18-Nov-2008.) (Revised by Mario Carneiro, 13-Oct-2016.)
([A / x]φy(y = A [y / x]φ))

Theoremcbvsbc 2785 Change bound variables in a wff substitution. (Contributed by Jeff Hankins, 19-Sep-2009.) (Proof shortened by Andrew Salmon, 8-Jun-2011.)
yφ    &   xψ    &   (x = y → (φψ))       ([A / x]φ[A / y]ψ)

Theoremcbvsbcv 2786* Change the bound variable of a class substitution using implicit substitution. (Contributed by NM, 30-Sep-2008.) (Revised by Mario Carneiro, 13-Oct-2016.)
(x = y → (φψ))       ([A / x]φ[A / y]ψ)

Theoremsbciegft 2787* Conversion of implicit substitution to explicit class substitution, using a bound-variable hypothesis instead of distinct variables. (Closed theorem version of sbciegf 2788.) (Contributed by NM, 10-Nov-2005.) (Revised by Mario Carneiro, 13-Oct-2016.)
((A 𝑉 xψ x(x = A → (φψ))) → ([A / x]φψ))

Theoremsbciegf 2788* Conversion of implicit substitution to explicit class substitution. (Contributed by NM, 14-Dec-2005.) (Revised by Mario Carneiro, 13-Oct-2016.)
xψ    &   (x = A → (φψ))       (A 𝑉 → ([A / x]φψ))

Theoremsbcieg 2789* Conversion of implicit substitution to explicit class substitution. (Contributed by NM, 10-Nov-2005.)
(x = A → (φψ))       (A 𝑉 → ([A / x]φψ))

Theoremsbcie2g 2790* Conversion of implicit substitution to explicit class substitution. This version of sbcie 2791 avoids a disjointness condition on x and A by substituting twice. (Contributed by Mario Carneiro, 15-Oct-2016.)
(x = y → (φψ))    &   (y = A → (ψχ))       (A 𝑉 → ([A / x]φχ))

Theoremsbcie 2791* Conversion of implicit substitution to explicit class substitution. (Contributed by NM, 4-Sep-2004.)
A V    &   (x = A → (φψ))       ([A / x]φψ)

Theoremsbciedf 2792* Conversion of implicit substitution to explicit class substitution, deduction form. (Contributed by NM, 29-Dec-2014.)
(φA 𝑉)    &   ((φ x = A) → (ψχ))    &   xφ    &   (φ → Ⅎxχ)       (φ → ([A / x]ψχ))

Theoremsbcied 2793* Conversion of implicit substitution to explicit class substitution, deduction form. (Contributed by NM, 13-Dec-2014.)
(φA 𝑉)    &   ((φ x = A) → (ψχ))       (φ → ([A / x]ψχ))

Theoremsbcied2 2794* Conversion of implicit substitution to explicit class substitution, deduction form. (Contributed by NM, 13-Dec-2014.)
(φA 𝑉)    &   (φA = B)    &   ((φ x = B) → (ψχ))       (φ → ([A / x]ψχ))

Theoremelrabsf 2795 Membership in a restricted class abstraction, expressed with explicit class substitution. (The variation elrabf 2690 has implicit substitution). The hypothesis specifies that x must not be a free variable in B. (Contributed by NM, 30-Sep-2003.) (Proof shortened by Mario Carneiro, 13-Oct-2016.)
xB       (A {x Bφ} ↔ (A B [A / x]φ))

Theoremeqsbc3 2796* Substitution applied to an atomic wff. Set theory version of eqsb3 2138. (Contributed by Andrew Salmon, 29-Jun-2011.)
(A 𝑉 → ([A / x]x = BA = B))

Theoremsbcng 2797 Move negation in and out of class substitution. (Contributed by NM, 16-Jan-2004.)
(A 𝑉 → ([A / x] ¬ φ ↔ ¬ [A / x]φ))

Theoremsbcimg 2798 Distribution of class substitution over implication. (Contributed by NM, 16-Jan-2004.)
(A 𝑉 → ([A / x](φψ) ↔ ([A / x]φ[A / x]ψ)))

Theoremsbcan 2799 Distribution of class substitution over conjunction. (Contributed by NM, 31-Dec-2016.)
([A / x](φ ψ) ↔ ([A / x]φ [A / x]ψ))

Theoremsbcang 2800 Distribution of class substitution over conjunction. (Contributed by NM, 21-May-2004.)
(A 𝑉 → ([A / x](φ ψ) ↔ ([A / x]φ [A / x]ψ)))

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-9457
 Copyright terms: Public domain < Previous  Next >