P. 25 of Theorem List - Intuitionistic Logic Explorer

Theorem List for Intuitionistic Logic Explorer - 2401-2500   *Has distinct variable group(s)

Type	Label	Description
Statement
Theorem	rexlimivw 2401*	Weaker version of rexlimiv 2399. (Contributed by FL, 19-Sep-2011.)
⊢ (φ → ψ)    ⇒   ⊢ (∃x ∈ A φ → ψ)
Theorem	rexlimd 2402	Deduction from Theorem 19.23 of [Margaris] p. 90 (restricted quantifier version). (Contributed by NM, 27-May-1998.) (Proof shortened by Andrew Salmon, 30-May-2011.)
⊢ Ⅎxφ    &   ⊢ Ⅎxχ    &   ⊢ (φ → (x ∈ A → (ψ → χ)))    ⇒   ⊢ (φ → (∃x ∈ A ψ → χ))
Theorem	rexlimd2 2403	Version of rexlimd 2402 with deduction version of second hypothesis. (Contributed by NM, 21-Jul-2013.) (Revised by Mario Carneiro, 8-Oct-2016.)
⊢ Ⅎxφ    &   ⊢ (φ → Ⅎxχ)    &   ⊢ (φ → (x ∈ A → (ψ → χ)))    ⇒   ⊢ (φ → (∃x ∈ A ψ → χ))
Theorem	rexlimdv 2404*	Inference from Theorem 19.23 of [Margaris] p. 90 (restricted quantifier version). (Contributed by NM, 14-Nov-2002.) (Proof shortened by Eric Schmidt, 22-Dec-2006.)
⊢ (φ → (x ∈ A → (ψ → χ)))    ⇒   ⊢ (φ → (∃x ∈ A ψ → χ))
Theorem	rexlimdva 2405*	Inference from Theorem 19.23 of [Margaris] p. 90 (restricted quantifier version). (Contributed by NM, 20-Jan-2007.)
⊢ ((φ ∧ x ∈ A) → (ψ → χ))    ⇒   ⊢ (φ → (∃x ∈ A ψ → χ))
Theorem	rexlimdvaa 2406*	Inference from Theorem 19.23 of [Margaris] p. 90 (restricted quantifier version). (Contributed by Mario Carneiro, 15-Jun-2016.)
⊢ ((φ ∧ (x ∈ A ∧ ψ)) → χ)    ⇒   ⊢ (φ → (∃x ∈ A ψ → χ))
Theorem	rexlimdv3a 2407*	Inference from Theorem 19.23 of [Margaris] p. 90 (restricted quantifier version). Frequently-used variant of rexlimdv 2404. (Contributed by NM, 7-Jun-2015.)
⊢ ((φ ∧ x ∈ A ∧ ψ) → χ)    ⇒   ⊢ (φ → (∃x ∈ A ψ → χ))
Theorem	rexlimdvw 2408*	Inference from Theorem 19.23 of [Margaris] p. 90 (restricted quantifier version). (Contributed by NM, 18-Jun-2014.)
⊢ (φ → (ψ → χ))    ⇒   ⊢ (φ → (∃x ∈ A ψ → χ))
Theorem	rexlimddv 2409*	Restricted existential elimination rule of natural deduction. (Contributed by Mario Carneiro, 15-Jun-2016.)
⊢ (φ → ∃x ∈ A ψ)    &   ⊢ ((φ ∧ (x ∈ A ∧ ψ)) → χ)    ⇒   ⊢ (φ → χ)
Theorem	rexlimivv 2410*	Inference from Theorem 19.23 of [Margaris] p. 90 (restricted quantifier version). (Contributed by NM, 17-Feb-2004.)
⊢ ((x ∈ A ∧ y ∈ B) → (φ → ψ))    ⇒   ⊢ (∃x ∈ A ∃y ∈ B φ → ψ)
Theorem	rexlimdvv 2411*	Inference from Theorem 19.23 of [Margaris] p. 90. (Restricted quantifier version.) (Contributed by NM, 22-Jul-2004.)
⊢ (φ → ((x ∈ A ∧ y ∈ B) → (ψ → χ)))    ⇒   ⊢ (φ → (∃x ∈ A ∃y ∈ B ψ → χ))
Theorem	rexlimdvva 2412*	Inference from Theorem 19.23 of [Margaris] p. 90. (Restricted quantifier version.) (Contributed by NM, 18-Jun-2014.)
⊢ ((φ ∧ (x ∈ A ∧ y ∈ B)) → (ψ → χ))    ⇒   ⊢ (φ → (∃x ∈ A ∃y ∈ B ψ → χ))
Theorem	r19.26 2413	Theorem 19.26 of [Margaris] p. 90 with restricted quantifiers. (Contributed by NM, 28-Jan-1997.) (Proof shortened by Andrew Salmon, 30-May-2011.)
⊢ (∀x ∈ A (φ ∧ ψ) ↔ (∀x ∈ A φ ∧ ∀x ∈ A ψ))
Theorem	r19.26-2 2414	Theorem 19.26 of [Margaris] p. 90 with 2 restricted quantifiers. (Contributed by NM, 10-Aug-2004.)
⊢ (∀x ∈ A ∀y ∈ B (φ ∧ ψ) ↔ (∀x ∈ A ∀y ∈ B φ ∧ ∀x ∈ A ∀y ∈ B ψ))
Theorem	r19.26-3 2415	Theorem 19.26 of [Margaris] p. 90 with 3 restricted quantifiers. (Contributed by FL, 22-Nov-2010.)
⊢ (∀x ∈ A (φ ∧ ψ ∧ χ) ↔ (∀x ∈ A φ ∧ ∀x ∈ A ψ ∧ ∀x ∈ A χ))
Theorem	r19.26m 2416	Theorem 19.26 of [Margaris] p. 90 with mixed quantifiers. (Contributed by NM, 22-Feb-2004.)
⊢ (∀x((x ∈ A → φ) ∧ (x ∈ B → ψ)) ↔ (∀x ∈ A φ ∧ ∀x ∈ B ψ))
Theorem	ralbi 2417	Distribute a restricted universal quantifier over a biconditional. Theorem 19.15 of [Margaris] p. 90 with restricted quantification. (Contributed by NM, 6-Oct-2003.)
⊢ (∀x ∈ A (φ ↔ ψ) → (∀x ∈ A φ ↔ ∀x ∈ A ψ))
Theorem	rexbi 2418	Distribute a restricted existential quantifier over a biconditional. Theorem 19.18 of [Margaris] p. 90 with restricted quantification. (Contributed by Jim Kingdon, 21-Jan-2019.)
⊢ (∀x ∈ A (φ ↔ ψ) → (∃x ∈ A φ ↔ ∃x ∈ A ψ))
Theorem	ralbiim 2419	Split a biconditional and distribute quantifier. (Contributed by NM, 3-Jun-2012.)
⊢ (∀x ∈ A (φ ↔ ψ) ↔ (∀x ∈ A (φ → ψ) ∧ ∀x ∈ A (ψ → φ)))
Theorem	r19.27av 2420*	Restricted version of one direction of Theorem 19.27 of [Margaris] p. 90. (The other direction doesn't hold when A is empty.) (Contributed by NM, 3-Jun-2004.) (Proof shortened by Andrew Salmon, 30-May-2011.)
⊢ ((∀x ∈ A φ ∧ ψ) → ∀x ∈ A (φ ∧ ψ))
Theorem	r19.28av 2421*	Restricted version of one direction of Theorem 19.28 of [Margaris] p. 90. (The other direction doesn't hold when A is empty.) (Contributed by NM, 2-Apr-2004.)
⊢ ((φ ∧ ∀x ∈ A ψ) → ∀x ∈ A (φ ∧ ψ))
Theorem	r19.29 2422	Theorem 19.29 of [Margaris] p. 90 with restricted quantifiers. (Contributed by NM, 31-Aug-1999.) (Proof shortened by Andrew Salmon, 30-May-2011.)
⊢ ((∀x ∈ A φ ∧ ∃x ∈ A ψ) → ∃x ∈ A (φ ∧ ψ))
Theorem	r19.29r 2423	Variation of Theorem 19.29 of [Margaris] p. 90 with restricted quantifiers. (Contributed by NM, 31-Aug-1999.)
⊢ ((∃x ∈ A φ ∧ ∀x ∈ A ψ) → ∃x ∈ A (φ ∧ ψ))
Theorem	r19.29af2 2424	A commonly used pattern based on r19.29 2422 (Contributed by Thierry Arnoux, 17-Dec-2017.)
⊢ Ⅎxφ    &   ⊢ Ⅎxχ    &   ⊢ (((φ ∧ x ∈ A) ∧ ψ) → χ)    &   ⊢ (φ → ∃x ∈ A ψ)    ⇒   ⊢ (φ → χ)
Theorem	r19.29af 2425*	A commonly used pattern based on r19.29 2422 (Contributed by Thierry Arnoux, 29-Nov-2017.)
⊢ Ⅎxφ    &   ⊢ (((φ ∧ x ∈ A) ∧ ψ) → χ)    &   ⊢ (φ → ∃x ∈ A ψ)    ⇒   ⊢ (φ → χ)
Theorem	r19.29a 2426*	A commonly used pattern based on r19.29 2422 (Contributed by Thierry Arnoux, 22-Nov-2017.)
⊢ (((φ ∧ x ∈ A) ∧ ψ) → χ)    &   ⊢ (φ → ∃x ∈ A ψ)    ⇒   ⊢ (φ → χ)
Theorem	r19.29d2r 2427	Theorem 19.29 of [Margaris] p. 90 with two restricted quantifiers, deduction version (Contributed by Thierry Arnoux, 30-Jan-2017.)
⊢ (φ → ∀x ∈ A ∀y ∈ B ψ)    &   ⊢ (φ → ∃x ∈ A ∃y ∈ B χ)    ⇒   ⊢ (φ → ∃x ∈ A ∃y ∈ B (ψ ∧ χ))
Theorem	r19.29_2a 2428*	A commonly used pattern based on r19.29 2422, version with two restricted quantifiers (Contributed by Thierry Arnoux, 26-Nov-2017.)
⊢ ((((φ ∧ x ∈ A) ∧ y ∈ B) ∧ ψ) → χ)    &   ⊢ (φ → ∃x ∈ A ∃y ∈ B ψ)    ⇒   ⊢ (φ → χ)
Theorem	r19.32r 2429	One direction of Theorem 19.32 of [Margaris] p. 90 with restricted quantifiers. For decidable propositions this is an equivalence. (Contributed by Jim Kingdon, 19-Aug-2018.)
⊢ Ⅎxφ    ⇒   ⊢ ((φ ∨ ∀x ∈ A ψ) → ∀x ∈ A (φ ∨ ψ))
Theorem	r19.32vr 2430*	One direction of Theorem 19.32 of [Margaris] p. 90 with restricted quantifiers. For decidable propositions this is an equivalence, as seen at r19.32vdc 2431. (Contributed by Jim Kingdon, 19-Aug-2018.)
⊢ ((φ ∨ ∀x ∈ A ψ) → ∀x ∈ A (φ ∨ ψ))
Theorem	r19.32vdc 2431*	Theorem 19.32 of [Margaris] p. 90 with restricted quantifiers, where φ is decidable. (Contributed by Jim Kingdon, 4-Jun-2018.)
⊢ (DECID φ → (∀x ∈ A (φ ∨ ψ) ↔ (φ ∨ ∀x ∈ A ψ)))
Theorem	r19.35-1 2432	Restricted quantifier version of 19.35-1 1491. (Contributed by Jim Kingdon, 4-Jun-2018.)
⊢ (∃x ∈ A (φ → ψ) → (∀x ∈ A φ → ∃x ∈ A ψ))
Theorem	r19.36av 2433*	One direction of a restricted quantifier version of Theorem 19.36 of [Margaris] p. 90. In classical logic, the converse would hold if A has at least one element, but in intuitionistic logic, that is not a sufficient condition. (Contributed by NM, 22-Oct-2003.)
⊢ (∃x ∈ A (φ → ψ) → (∀x ∈ A φ → ψ))
Theorem	r19.37 2434	Restricted version of one direction of Theorem 19.37 of [Margaris] p. 90. In classical logic the converse would hold if A has at least one element, but that is not sufficient in intuitionistic logic. (Contributed by FL, 13-May-2012.) (Revised by Mario Carneiro, 11-Dec-2016.)
⊢ Ⅎxφ    ⇒   ⊢ (∃x ∈ A (φ → ψ) → (φ → ∃x ∈ A ψ))
Theorem	r19.37av 2435*	Restricted version of one direction of Theorem 19.37 of [Margaris] p. 90. (Contributed by NM, 2-Apr-2004.)
⊢ (∃x ∈ A (φ → ψ) → (φ → ∃x ∈ A ψ))
Theorem	r19.40 2436	Restricted quantifier version of Theorem 19.40 of [Margaris] p. 90. (Contributed by NM, 2-Apr-2004.)
⊢ (∃x ∈ A (φ ∧ ψ) → (∃x ∈ A φ ∧ ∃x ∈ A ψ))
Theorem	r19.41 2437	Restricted quantifier version of Theorem 19.41 of [Margaris] p. 90. (Contributed by NM, 1-Nov-2010.)
⊢ Ⅎxψ    ⇒   ⊢ (∃x ∈ A (φ ∧ ψ) ↔ (∃x ∈ A φ ∧ ψ))
Theorem	r19.41v 2438*	Restricted quantifier version of Theorem 19.41 of [Margaris] p. 90. (Contributed by NM, 17-Dec-2003.)
⊢ (∃x ∈ A (φ ∧ ψ) ↔ (∃x ∈ A φ ∧ ψ))
Theorem	r19.42v 2439*	Restricted version of Theorem 19.42 of [Margaris] p. 90. (Contributed by NM, 27-May-1998.)
⊢ (∃x ∈ A (φ ∧ ψ) ↔ (φ ∧ ∃x ∈ A ψ))
Theorem	r19.43 2440	Restricted version of Theorem 19.43 of [Margaris] p. 90. (Contributed by NM, 27-May-1998.) (Proof rewritten by Jim Kingdon, 5-Jun-2018.)
⊢ (∃x ∈ A (φ ∨ ψ) ↔ (∃x ∈ A φ ∨ ∃x ∈ A ψ))
Theorem	r19.44av 2441*	One direction of a restricted quantifier version of Theorem 19.44 of [Margaris] p. 90. The other direction doesn't hold when A is empty. (Contributed by NM, 2-Apr-2004.)
⊢ (∃x ∈ A (φ ∨ ψ) → (∃x ∈ A φ ∨ ψ))
Theorem	r19.45av 2442*	Restricted version of one direction of Theorem 19.45 of [Margaris] p. 90. (The other direction doesn't hold when A is empty.) (Contributed by NM, 2-Apr-2004.)
⊢ (∃x ∈ A (φ ∨ ψ) → (φ ∨ ∃x ∈ A ψ))
Theorem	ralcomf 2443*	Commutation of restricted quantifiers. (Contributed by Mario Carneiro, 14-Oct-2016.)
⊢ ℲyA    &   ⊢ ℲxB    ⇒   ⊢ (∀x ∈ A ∀y ∈ B φ ↔ ∀y ∈ B ∀x ∈ A φ)
Theorem	rexcomf 2444*	Commutation of restricted quantifiers. (Contributed by Mario Carneiro, 14-Oct-2016.)
⊢ ℲyA    &   ⊢ ℲxB    ⇒   ⊢ (∃x ∈ A ∃y ∈ B φ ↔ ∃y ∈ B ∃x ∈ A φ)
Theorem	ralcom 2445*	Commutation of restricted quantifiers. (Contributed by NM, 13-Oct-1999.) (Revised by Mario Carneiro, 14-Oct-2016.)
⊢ (∀x ∈ A ∀y ∈ B φ ↔ ∀y ∈ B ∀x ∈ A φ)
Theorem	rexcom 2446*	Commutation of restricted quantifiers. (Contributed by NM, 19-Nov-1995.) (Revised by Mario Carneiro, 14-Oct-2016.)
⊢ (∃x ∈ A ∃y ∈ B φ ↔ ∃y ∈ B ∃x ∈ A φ)
Theorem	rexcom13 2447*	Swap 1st and 3rd restricted existential quantifiers. (Contributed by NM, 8-Apr-2015.)
⊢ (∃x ∈ A ∃y ∈ B ∃z ∈ 𝐶 φ ↔ ∃z ∈ 𝐶 ∃y ∈ B ∃x ∈ A φ)
Theorem	rexrot4 2448*	Rotate existential restricted quantifiers twice. (Contributed by NM, 8-Apr-2015.)
⊢ (∃x ∈ A ∃y ∈ B ∃z ∈ 𝐶 ∃w ∈ 𝐷 φ ↔ ∃z ∈ 𝐶 ∃w ∈ 𝐷 ∃x ∈ A ∃y ∈ B φ)
Theorem	ralcom3 2449	A commutative law for restricted quantifiers that swaps the domain of the restriction. (Contributed by NM, 22-Feb-2004.)
⊢ (∀x ∈ A (x ∈ B → φ) ↔ ∀x ∈ B (x ∈ A → φ))
Theorem	reean 2450*	Rearrange existential quantifiers. (Contributed by NM, 27-Oct-2010.) (Proof shortened by Andrew Salmon, 30-May-2011.)
⊢ Ⅎyφ    &   ⊢ Ⅎxψ    ⇒   ⊢ (∃x ∈ A ∃y ∈ B (φ ∧ ψ) ↔ (∃x ∈ A φ ∧ ∃y ∈ B ψ))
Theorem	reeanv 2451*	Rearrange existential quantifiers. (Contributed by NM, 9-May-1999.)
⊢ (∃x ∈ A ∃y ∈ B (φ ∧ ψ) ↔ (∃x ∈ A φ ∧ ∃y ∈ B ψ))
Theorem	3reeanv 2452*	Rearrange three existential quantifiers. (Contributed by Jeff Madsen, 11-Jun-2010.)
⊢ (∃x ∈ A ∃y ∈ B ∃z ∈ 𝐶 (φ ∧ ψ ∧ χ) ↔ (∃x ∈ A φ ∧ ∃y ∈ B ψ ∧ ∃z ∈ 𝐶 χ))
Theorem	nfreu1 2453	x is not free in ∃!x ∈ Aφ. (Contributed by NM, 19-Mar-1997.)
⊢ Ⅎx∃!x ∈ A φ
Theorem	nfrmo1 2454	x is not free in ∃*x ∈ Aφ. (Contributed by NM, 16-Jun-2017.)
⊢ Ⅎx∃*x ∈ A φ
Theorem	nfreudxy 2455*	Not-free deduction for restricted uniqueness. This is a version where x and y are distinct. (Contributed by Jim Kingdon, 6-Jun-2018.)
⊢ Ⅎyφ    &   ⊢ (φ → ℲxA)    &   ⊢ (φ → Ⅎxψ)    ⇒   ⊢ (φ → Ⅎx∃!y ∈ A ψ)
Theorem	nfreuxy 2456*	Not-free for restricted uniqueness. This is a version where x and y are distinct. (Contributed by Jim Kingdon, 6-Jun-2018.)
⊢ ℲxA    &   ⊢ Ⅎxφ    ⇒   ⊢ Ⅎx∃!y ∈ A φ
Theorem	rabid 2457	An "identity" law of concretion for restricted abstraction. Special case of Definition 2.1 of [Quine] p. 16. (Contributed by NM, 9-Oct-2003.)
⊢ (x ∈ {x ∈ A ∣ φ} ↔ (x ∈ A ∧ φ))
Theorem	rabid2 2458*	An "identity" law for restricted class abstraction. (Contributed by NM, 9-Oct-2003.) (Proof shortened by Andrew Salmon, 30-May-2011.)
⊢ (A = {x ∈ A ∣ φ} ↔ ∀x ∈ A φ)
Theorem	rabbi 2459	Equivalent wff's correspond to equal restricted class abstractions. Closed theorem form of rabbidva 2520. (Contributed by NM, 25-Nov-2013.)
⊢ (∀x ∈ A (ψ ↔ χ) ↔ {x ∈ A ∣ ψ} = {x ∈ A ∣ χ})
Theorem	rabswap 2460	Swap with a membership relation in a restricted class abstraction. (Contributed by NM, 4-Jul-2005.)
⊢ {x ∈ A ∣ x ∈ B} = {x ∈ B ∣ x ∈ A}
Theorem	nfrab1 2461	The abstraction variable in a restricted class abstraction isn't free. (Contributed by NM, 19-Mar-1997.)
⊢ Ⅎx{x ∈ A ∣ φ}
Theorem	nfrabxy 2462*	A variable not free in a wff remains so in a restricted class abstraction. (Contributed by Jim Kingdon, 19-Jul-2018.)
⊢ Ⅎxφ    &   ⊢ ℲxA    ⇒   ⊢ Ⅎx{y ∈ A ∣ φ}
Theorem	reubida 2463	Formula-building rule for restricted existential quantifier (deduction rule). (Contributed by Mario Carneiro, 19-Nov-2016.)
⊢ Ⅎxφ    &   ⊢ ((φ ∧ x ∈ A) → (ψ ↔ χ))    ⇒   ⊢ (φ → (∃!x ∈ A ψ ↔ ∃!x ∈ A χ))
Theorem	reubidva 2464*	Formula-building rule for restricted existential quantifier (deduction rule). (Contributed by NM, 13-Nov-2004.)
⊢ ((φ ∧ x ∈ A) → (ψ ↔ χ))    ⇒   ⊢ (φ → (∃!x ∈ A ψ ↔ ∃!x ∈ A χ))
Theorem	reubidv 2465*	Formula-building rule for restricted existential quantifier (deduction rule). (Contributed by NM, 17-Oct-1996.)
⊢ (φ → (ψ ↔ χ))    ⇒   ⊢ (φ → (∃!x ∈ A ψ ↔ ∃!x ∈ A χ))
Theorem	reubiia 2466	Formula-building rule for restricted existential quantifier (inference rule). (Contributed by NM, 14-Nov-2004.)
⊢ (x ∈ A → (φ ↔ ψ))    ⇒   ⊢ (∃!x ∈ A φ ↔ ∃!x ∈ A ψ)
Theorem	reubii 2467	Formula-building rule for restricted existential quantifier (inference rule). (Contributed by NM, 22-Oct-1999.)
⊢ (φ ↔ ψ)    ⇒   ⊢ (∃!x ∈ A φ ↔ ∃!x ∈ A ψ)
Theorem	rmobida 2468	Formula-building rule for restricted existential quantifier (deduction rule). (Contributed by NM, 16-Jun-2017.)
⊢ Ⅎxφ    &   ⊢ ((φ ∧ x ∈ A) → (ψ ↔ χ))    ⇒   ⊢ (φ → (∃*x ∈ A ψ ↔ ∃*x ∈ A χ))
Theorem	rmobidva 2469*	Formula-building rule for restricted existential quantifier (deduction rule). (Contributed by NM, 16-Jun-2017.)
⊢ ((φ ∧ x ∈ A) → (ψ ↔ χ))    ⇒   ⊢ (φ → (∃*x ∈ A ψ ↔ ∃*x ∈ A χ))
Theorem	rmobidv 2470*	Formula-building rule for restricted existential quantifier (deduction rule). (Contributed by NM, 16-Jun-2017.)
⊢ (φ → (ψ ↔ χ))    ⇒   ⊢ (φ → (∃*x ∈ A ψ ↔ ∃*x ∈ A χ))
Theorem	rmobiia 2471	Formula-building rule for restricted existential quantifier (inference rule). (Contributed by NM, 16-Jun-2017.)
⊢ (x ∈ A → (φ ↔ ψ))    ⇒   ⊢ (∃*x ∈ A φ ↔ ∃*x ∈ A ψ)
Theorem	rmobii 2472	Formula-building rule for restricted existential quantifier (inference rule). (Contributed by NM, 16-Jun-2017.)
⊢ (φ ↔ ψ)    ⇒   ⊢ (∃*x ∈ A φ ↔ ∃*x ∈ A ψ)
Theorem	raleqf 2473	Equality theorem for restricted universal quantifier, with bound-variable hypotheses instead of distinct variable restrictions. (Contributed by NM, 7-Mar-2004.) (Revised by Andrew Salmon, 11-Jul-2011.)
⊢ ℲxA    &   ⊢ ℲxB    ⇒   ⊢ (A = B → (∀x ∈ A φ ↔ ∀x ∈ B φ))
Theorem	rexeqf 2474	Equality theorem for restricted existential quantifier, with bound-variable hypotheses instead of distinct variable restrictions. (Contributed by NM, 9-Oct-2003.) (Revised by Andrew Salmon, 11-Jul-2011.)
⊢ ℲxA    &   ⊢ ℲxB    ⇒   ⊢ (A = B → (∃x ∈ A φ ↔ ∃x ∈ B φ))
Theorem	reueq1f 2475	Equality theorem for restricted uniqueness quantifier, with bound-variable hypotheses instead of distinct variable restrictions. (Contributed by NM, 5-Apr-2004.) (Revised by Andrew Salmon, 11-Jul-2011.)
⊢ ℲxA    &   ⊢ ℲxB    ⇒   ⊢ (A = B → (∃!x ∈ A φ ↔ ∃!x ∈ B φ))
Theorem	rmoeq1f 2476	Equality theorem for restricted uniqueness quantifier, with bound-variable hypotheses instead of distinct variable restrictions. (Contributed by Alexander van der Vekens, 17-Jun-2017.)
⊢ ℲxA    &   ⊢ ℲxB    ⇒   ⊢ (A = B → (∃*x ∈ A φ ↔ ∃*x ∈ B φ))
Theorem	raleq 2477*	Equality theorem for restricted universal quantifier. (Contributed by NM, 16-Nov-1995.)
⊢ (A = B → (∀x ∈ A φ ↔ ∀x ∈ B φ))
Theorem	rexeq 2478*	Equality theorem for restricted existential quantifier. (Contributed by NM, 29-Oct-1995.)
⊢ (A = B → (∃x ∈ A φ ↔ ∃x ∈ B φ))
Theorem	reueq1 2479*	Equality theorem for restricted uniqueness quantifier. (Contributed by NM, 5-Apr-2004.)
⊢ (A = B → (∃!x ∈ A φ ↔ ∃!x ∈ B φ))
Theorem	rmoeq1 2480*	Equality theorem for restricted uniqueness quantifier. (Contributed by Alexander van der Vekens, 17-Jun-2017.)
⊢ (A = B → (∃*x ∈ A φ ↔ ∃*x ∈ B φ))
Theorem	raleqi 2481*	Equality inference for restricted universal qualifier. (Contributed by Paul Chapman, 22-Jun-2011.)
⊢ A = B    ⇒   ⊢ (∀x ∈ A φ ↔ ∀x ∈ B φ)
Theorem	rexeqi 2482*	Equality inference for restricted existential qualifier. (Contributed by Mario Carneiro, 23-Apr-2015.)
⊢ A = B    ⇒   ⊢ (∃x ∈ A φ ↔ ∃x ∈ B φ)
Theorem	raleqdv 2483*	Equality deduction for restricted universal quantifier. (Contributed by NM, 13-Nov-2005.)
⊢ (φ → A = B)    ⇒   ⊢ (φ → (∀x ∈ A ψ ↔ ∀x ∈ B ψ))
Theorem	rexeqdv 2484*	Equality deduction for restricted existential quantifier. (Contributed by NM, 14-Jan-2007.)
⊢ (φ → A = B)    ⇒   ⊢ (φ → (∃x ∈ A ψ ↔ ∃x ∈ B ψ))
Theorem	raleqbi1dv 2485*	Equality deduction for restricted universal quantifier. (Contributed by NM, 16-Nov-1995.)
⊢ (A = B → (φ ↔ ψ))    ⇒   ⊢ (A = B → (∀x ∈ A φ ↔ ∀x ∈ B ψ))
Theorem	rexeqbi1dv 2486*	Equality deduction for restricted existential quantifier. (Contributed by NM, 18-Mar-1997.)
⊢ (A = B → (φ ↔ ψ))    ⇒   ⊢ (A = B → (∃x ∈ A φ ↔ ∃x ∈ B ψ))
Theorem	reueqd 2487*	Equality deduction for restricted uniqueness quantifier. (Contributed by NM, 5-Apr-2004.)
⊢ (A = B → (φ ↔ ψ))    ⇒   ⊢ (A = B → (∃!x ∈ A φ ↔ ∃!x ∈ B ψ))
Theorem	rmoeqd 2488*	Equality deduction for restricted uniqueness quantifier. (Contributed by Alexander van der Vekens, 17-Jun-2017.)
⊢ (A = B → (φ ↔ ψ))    ⇒   ⊢ (A = B → (∃*x ∈ A φ ↔ ∃*x ∈ B ψ))
Theorem	raleqbidv 2489*	Equality deduction for restricted universal quantifier. (Contributed by NM, 6-Nov-2007.)
⊢ (φ → A = B)    &   ⊢ (φ → (ψ ↔ χ))    ⇒   ⊢ (φ → (∀x ∈ A ψ ↔ ∀x ∈ B χ))
Theorem	rexeqbidv 2490*	Equality deduction for restricted universal quantifier. (Contributed by NM, 6-Nov-2007.)
⊢ (φ → A = B)    &   ⊢ (φ → (ψ ↔ χ))    ⇒   ⊢ (φ → (∃x ∈ A ψ ↔ ∃x ∈ B χ))
Theorem	raleqbidva 2491*	Equality deduction for restricted universal quantifier. (Contributed by Mario Carneiro, 5-Jan-2017.)
⊢ (φ → A = B)    &   ⊢ ((φ ∧ x ∈ A) → (ψ ↔ χ))    ⇒   ⊢ (φ → (∀x ∈ A ψ ↔ ∀x ∈ B χ))
Theorem	rexeqbidva 2492*	Equality deduction for restricted universal quantifier. (Contributed by Mario Carneiro, 5-Jan-2017.)
⊢ (φ → A = B)    &   ⊢ ((φ ∧ x ∈ A) → (ψ ↔ χ))    ⇒   ⊢ (φ → (∃x ∈ A ψ ↔ ∃x ∈ B χ))
Theorem	mormo 2493	Unrestricted "at most one" implies restricted "at most one". (Contributed by NM, 16-Jun-2017.)
⊢ (∃*xφ → ∃*x ∈ A φ)
Theorem	reu5 2494	Restricted uniqueness in terms of "at most one." (Contributed by NM, 23-May-1999.) (Revised by NM, 16-Jun-2017.)
⊢ (∃!x ∈ A φ ↔ (∃x ∈ A φ ∧ ∃*x ∈ A φ))
Theorem	reurex 2495	Restricted unique existence implies restricted existence. (Contributed by NM, 19-Aug-1999.)
⊢ (∃!x ∈ A φ → ∃x ∈ A φ)
Theorem	reurmo 2496	Restricted existential uniqueness implies restricted "at most one." (Contributed by NM, 16-Jun-2017.)
⊢ (∃!x ∈ A φ → ∃*x ∈ A φ)
Theorem	rmo5 2497	Restricted "at most one" in term of uniqueness. (Contributed by NM, 16-Jun-2017.)
⊢ (∃*x ∈ A φ ↔ (∃x ∈ A φ → ∃!x ∈ A φ))
Theorem	nrexrmo 2498	Nonexistence implies restricted "at most one". (Contributed by NM, 17-Jun-2017.)
⊢ (¬ ∃x ∈ A φ → ∃*x ∈ A φ)
Theorem	cbvralf 2499	Rule used to change bound variables, using implicit substitution. (Contributed by NM, 7-Mar-2004.) (Revised by Mario Carneiro, 9-Oct-2016.)
⊢ ℲxA    &   ⊢ ℲyA    &   ⊢ Ⅎyφ    &   ⊢ Ⅎxψ    &   ⊢ (x = y → (φ ↔ ψ))    ⇒   ⊢ (∀x ∈ A φ ↔ ∀y ∈ A ψ)
Theorem	cbvrexf 2500	Rule used to change bound variables, using implicit substitution. (Contributed by FL, 27-Apr-2008.) (Revised by Mario Carneiro, 9-Oct-2016.) (Proof rewritten by Jim Kingdon, 10-Jun-2018.)
⊢ ℲxA    &   ⊢ ℲyA    &   ⊢ Ⅎyφ    &   ⊢ Ⅎxψ    &   ⊢ (x = y → (φ ↔ ψ))    ⇒   ⊢ (∃x ∈ A φ ↔ ∃y ∈ A ψ)