P. 27 of Theorem List - Intuitionistic Logic Explorer

Theorem List for Intuitionistic Logic Explorer - 2601-2700   *Has distinct variable group(s)

Type	Label	Description
Statement
Theorem	reximssdv 2601*	Derivation of a restricted existential quantification over a subset (the second hypothesis implies A C_ B), deduction form. (Contributed by AV, 21-Aug-2022.)
|- ( ph -> E. x e. B ps )   &    |- ( ( ph /\ ( x e. B /\ ps ) ) -> x e. A )   &    |- ( ( ph /\ ( x e. B /\ ps ) ) -> ch )   =>    |- ( ph -> E. x e. A ch )
Theorem	reximddv2 2602*	Double deduction from Theorem 19.22 of [Margaris] p. 90. (Contributed by Thierry Arnoux, 15-Dec-2019.)
|- ( ( ( ( ph /\ x e. A ) /\ y e. B ) /\ ps ) -> ch )   &    |- ( ph -> E. x e. A E. y e. B ps )   =>    |- ( ph -> E. x e. A E. y e. B ch )
Theorem	r19.12 2603*	Theorem 19.12 of [Margaris] p. 89 with restricted quantifiers. (Contributed by NM, 15-Oct-2003.) (Proof shortened by Andrew Salmon, 30-May-2011.)
|- ( E. x e. A A. y e. B ph -> A. y e. B E. x e. A ph )
Theorem	r19.23t 2604	Closed theorem form of r19.23 2605. (Contributed by NM, 4-Mar-2013.) (Revised by Mario Carneiro, 8-Oct-2016.)
|- ( F/ x ps -> ( A. x e. A ( ph -> ps ) <-> ( E. x e. A ph -> ps ) ) )
Theorem	r19.23 2605	Theorem 19.23 of [Margaris] p. 90 with restricted quantifiers. (Contributed by NM, 22-Oct-2010.) (Proof shortened by Mario Carneiro, 8-Oct-2016.)
|- F/ x ps   =>    |- ( A. x e. A ( ph -> ps ) <-> ( E. x e. A ph -> ps ) )
Theorem	r19.23v 2606*	Theorem 19.23 of [Margaris] p. 90 with restricted quantifiers. (Contributed by NM, 31-Aug-1999.)
|- ( A. x e. A ( ph -> ps ) <-> ( E. x e. A ph -> ps ) )
Theorem	rexlimi 2607	Inference from Theorem 19.21 of [Margaris] p. 90. (Restricted quantifier version.) (Contributed by NM, 30-Nov-2003.) (Proof shortened by Andrew Salmon, 30-May-2011.)
|- F/ x ps   &    |- ( x e. A -> ( ph -> ps ) )   =>    |- ( E. x e. A ph -> ps )
Theorem	rexlimiv 2608*	Inference from Theorem 19.23 of [Margaris] p. 90. (Restricted quantifier version.) (Contributed by NM, 20-Nov-1994.)
|- ( x e. A -> ( ph -> ps ) )   =>    |- ( E. x e. A ph -> ps )
Theorem	rexlimiva 2609*	Inference from Theorem 19.23 of [Margaris] p. 90 (restricted quantifier version). (Contributed by NM, 18-Dec-2006.)
|- ( ( x e. A /\ ph ) -> ps )   =>    |- ( E. x e. A ph -> ps )
Theorem	rexlimivw 2610*	Weaker version of rexlimiv 2608. (Contributed by FL, 19-Sep-2011.)
|- ( ph -> ps )   =>    |- ( E. x e. A ph -> ps )
Theorem	rexlimd 2611	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.)
|- F/ x ph   &    |- F/ x ch   &    |- ( ph -> ( x e. A -> ( ps -> ch ) ) )   =>    |- ( ph -> ( E. x e. A ps -> ch ) )
Theorem	rexlimd2 2612	Version of rexlimd 2611 with deduction version of second hypothesis. (Contributed by NM, 21-Jul-2013.) (Revised by Mario Carneiro, 8-Oct-2016.)
|- F/ x ph   &    |- ( ph -> F/ x ch )   &    |- ( ph -> ( x e. A -> ( ps -> ch ) ) )   =>    |- ( ph -> ( E. x e. A ps -> ch ) )
Theorem	rexlimdv 2613*	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.)
|- ( ph -> ( x e. A -> ( ps -> ch ) ) )   =>    |- ( ph -> ( E. x e. A ps -> ch ) )
Theorem	rexlimdva 2614*	Inference from Theorem 19.23 of [Margaris] p. 90 (restricted quantifier version). (Contributed by NM, 20-Jan-2007.)
|- ( ( ph /\ x e. A ) -> ( ps -> ch ) )   =>    |- ( ph -> ( E. x e. A ps -> ch ) )
Theorem	rexlimdvaa 2615*	Inference from Theorem 19.23 of [Margaris] p. 90 (restricted quantifier version). (Contributed by Mario Carneiro, 15-Jun-2016.)
|- ( ( ph /\ ( x e. A /\ ps ) ) -> ch )   =>    |- ( ph -> ( E. x e. A ps -> ch ) )
Theorem	rexlimdv3a 2616*	Inference from Theorem 19.23 of [Margaris] p. 90 (restricted quantifier version). Frequently-used variant of rexlimdv 2613. (Contributed by NM, 7-Jun-2015.)
|- ( ( ph /\ x e. A /\ ps ) -> ch )   =>    |- ( ph -> ( E. x e. A ps -> ch ) )
Theorem	rexlimdva2 2617*	Inference from Theorem 19.23 of [Margaris] p. 90 (restricted quantifier version). (Contributed by Glauco Siliprandi, 2-Jan-2022.)
|- ( ( ( ph /\ x e. A ) /\ ps ) -> ch )   =>    |- ( ph -> ( E. x e. A ps -> ch ) )
Theorem	rexlimdvw 2618*	Inference from Theorem 19.23 of [Margaris] p. 90 (restricted quantifier version). (Contributed by NM, 18-Jun-2014.)
|- ( ph -> ( ps -> ch ) )   =>    |- ( ph -> ( E. x e. A ps -> ch ) )
Theorem	rexlimddv 2619*	Restricted existential elimination rule of natural deduction. (Contributed by Mario Carneiro, 15-Jun-2016.)
|- ( ph -> E. x e. A ps )   &    |- ( ( ph /\ ( x e. A /\ ps ) ) -> ch )   =>    |- ( ph -> ch )
Theorem	rexlimivv 2620*	Inference from Theorem 19.23 of [Margaris] p. 90 (restricted quantifier version). (Contributed by NM, 17-Feb-2004.)
|- ( ( x e. A /\ y e. B ) -> ( ph -> ps ) )   =>    |- ( E. x e. A E. y e. B ph -> ps )
Theorem	rexlimdvv 2621*	Inference from Theorem 19.23 of [Margaris] p. 90. (Restricted quantifier version.) (Contributed by NM, 22-Jul-2004.)
|- ( ph -> ( ( x e. A /\ y e. B ) -> ( ps -> ch ) ) )   =>    |- ( ph -> ( E. x e. A E. y e. B ps -> ch ) )
Theorem	rexlimdvva 2622*	Inference from Theorem 19.23 of [Margaris] p. 90. (Restricted quantifier version.) (Contributed by NM, 18-Jun-2014.)
|- ( ( ph /\ ( x e. A /\ y e. B ) ) -> ( ps -> ch ) )   =>    |- ( ph -> ( E. x e. A E. y e. B ps -> ch ) )
Theorem	r19.26 2623	Theorem 19.26 of [Margaris] p. 90 with restricted quantifiers. (Contributed by NM, 28-Jan-1997.) (Proof shortened by Andrew Salmon, 30-May-2011.)
|- ( A. x e. A ( ph /\ ps ) <-> ( A. x e. A ph /\ A. x e. A ps ) )
Theorem	r19.27v 2624*	Restricted quantitifer version of one direction of 19.27 1575. (The other direction holds when A is inhabited, see r19.27mv 3548.) (Contributed by NM, 3-Jun-2004.) (Proof shortened by Andrew Salmon, 30-May-2011.) (Proof shortened by Wolf Lammen, 17-Jun-2023.)
|- ( ( A. x e. A ph /\ ps ) -> A. x e. A ( ph /\ ps ) )
Theorem	r19.28v 2625*	Restricted quantifier version of one direction of 19.28 1577. (The other direction holds when A is inhabited, see r19.28mv 3544.) (Contributed by NM, 2-Apr-2004.) (Proof shortened by Wolf Lammen, 17-Jun-2023.)
|- ( ( ph /\ A. x e. A ps ) -> A. x e. A ( ph /\ ps ) )
Theorem	r19.26-2 2626	Theorem 19.26 of [Margaris] p. 90 with 2 restricted quantifiers. (Contributed by NM, 10-Aug-2004.)
|- ( A. x e. A A. y e. B ( ph /\ ps ) <-> ( A. x e. A A. y e. B ph /\ A. x e. A A. y e. B ps ) )
Theorem	r19.26-3 2627	Theorem 19.26 of [Margaris] p. 90 with 3 restricted quantifiers. (Contributed by FL, 22-Nov-2010.)
|- ( A. x e. A ( ph /\ ps /\ ch ) <-> ( A. x e. A ph /\ A. x e. A ps /\ A. x e. A ch ) )
Theorem	r19.26m 2628	Theorem 19.26 of [Margaris] p. 90 with mixed quantifiers. (Contributed by NM, 22-Feb-2004.)
|- ( A. x ( ( x e. A -> ph ) /\ ( x e. B -> ps ) ) <-> ( A. x e. A ph /\ A. x e. B ps ) )
Theorem	ralbi 2629	Distribute a restricted universal quantifier over a biconditional. Theorem 19.15 of [Margaris] p. 90 with restricted quantification. (Contributed by NM, 6-Oct-2003.)
|- ( A. x e. A ( ph <-> ps ) -> ( A. x e. A ph <-> A. x e. A ps ) )
Theorem	rexbi 2630	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.)
|- ( A. x e. A ( ph <-> ps ) -> ( E. x e. A ph <-> E. x e. A ps ) )
Theorem	ralbiim 2631	Split a biconditional and distribute quantifier. (Contributed by NM, 3-Jun-2012.)
|- ( A. x e. A ( ph <-> ps ) <-> ( A. x e. A ( ph -> ps ) /\ A. x e. A ( ps -> ph ) ) )
Theorem	r19.27av 2632*	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.)
|- ( ( A. x e. A ph /\ ps ) -> A. x e. A ( ph /\ ps ) )
Theorem	r19.28av 2633*	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.)
|- ( ( ph /\ A. x e. A ps ) -> A. x e. A ( ph /\ ps ) )
Theorem	r19.29 2634	Theorem 19.29 of [Margaris] p. 90 with restricted quantifiers. (Contributed by NM, 31-Aug-1999.) (Proof shortened by Andrew Salmon, 30-May-2011.)
|- ( ( A. x e. A ph /\ E. x e. A ps ) -> E. x e. A ( ph /\ ps ) )
Theorem	r19.29r 2635	Variation of Theorem 19.29 of [Margaris] p. 90 with restricted quantifiers. (Contributed by NM, 31-Aug-1999.)
|- ( ( E. x e. A ph /\ A. x e. A ps ) -> E. x e. A ( ph /\ ps ) )
Theorem	ralnex2 2636	Relationship between two restricted universal and existential quantifiers. (Contributed by Glauco Siliprandi, 11-Dec-2019.) (Proof shortened by Wolf Lammen, 18-May-2023.)
|- ( A. x e. A A. y e. B -. ph <-> -. E. x e. A E. y e. B ph )
Theorem	r19.29af2 2637	A commonly used pattern based on r19.29 2634. (Contributed by Thierry Arnoux, 17-Dec-2017.)
|- F/ x ph   &    |- F/ x ch   &    |- ( ( ( ph /\ x e. A ) /\ ps ) -> ch )   &    |- ( ph -> E. x e. A ps )   =>    |- ( ph -> ch )
Theorem	r19.29af 2638*	A commonly used pattern based on r19.29 2634. (Contributed by Thierry Arnoux, 29-Nov-2017.)
|- F/ x ph   &    |- ( ( ( ph /\ x e. A ) /\ ps ) -> ch )   &    |- ( ph -> E. x e. A ps )   =>    |- ( ph -> ch )
Theorem	r19.29an 2639*	A commonly used pattern based on r19.29 2634. (Contributed by Thierry Arnoux, 29-Dec-2019.)
|- ( ( ( ph /\ x e. A ) /\ ps ) -> ch )   =>    |- ( ( ph /\ E. x e. A ps ) -> ch )
Theorem	r19.29a 2640*	A commonly used pattern based on r19.29 2634. (Contributed by Thierry Arnoux, 22-Nov-2017.)
|- ( ( ( ph /\ x e. A ) /\ ps ) -> ch )   &    |- ( ph -> E. x e. A ps )   =>    |- ( ph -> ch )
Theorem	r19.29d2r 2641	Theorem 19.29 of [Margaris] p. 90 with two restricted quantifiers, deduction version. (Contributed by Thierry Arnoux, 30-Jan-2017.)
|- ( ph -> A. x e. A A. y e. B ps )   &    |- ( ph -> E. x e. A E. y e. B ch )   =>    |- ( ph -> E. x e. A E. y e. B ( ps /\ ch ) )
Theorem	r19.29vva 2642*	A commonly used pattern based on r19.29 2634, version with two restricted quantifiers. (Contributed by Thierry Arnoux, 26-Nov-2017.)
|- ( ( ( ( ph /\ x e. A ) /\ y e. B ) /\ ps ) -> ch )   &    |- ( ph -> E. x e. A E. y e. B ps )   =>    |- ( ph -> ch )
Theorem	r19.32r 2643	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.)
|- F/ x ph   =>    |- ( ( ph \/ A. x e. A ps ) -> A. x e. A ( ph \/ ps ) )
Theorem	r19.30dc 2644	Restricted quantifier version of 19.30dc 1641. (Contributed by Scott Fenton, 25-Feb-2011.) (Proof shortened by Wolf Lammen, 18-Jun-2023.)
|- ( ( A. x e. A ( ph \/ ps ) /\ DECID E. x e. A ps ) -> ( A. x e. A ph \/ E. x e. A ps ) )
Theorem	r19.32vr 2645*	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 2646. (Contributed by Jim Kingdon, 19-Aug-2018.)
|- ( ( ph \/ A. x e. A ps ) -> A. x e. A ( ph \/ ps ) )
Theorem	r19.32vdc 2646*	Theorem 19.32 of [Margaris] p. 90 with restricted quantifiers, where ph is decidable. (Contributed by Jim Kingdon, 4-Jun-2018.)
|- (DECID ph -> ( A. x e. A ( ph \/ ps ) <-> ( ph \/ A. x e. A ps ) ) )
Theorem	r19.35-1 2647	Restricted quantifier version of 19.35-1 1638. (Contributed by Jim Kingdon, 4-Jun-2018.)
|- ( E. x e. A ( ph -> ps ) -> ( A. x e. A ph -> E. x e. A ps ) )
Theorem	r19.36av 2648*	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.)
|- ( E. x e. A ( ph -> ps ) -> ( A. x e. A ph -> ps ) )
Theorem	r19.37 2649	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.)
|- F/ x ph   =>    |- ( E. x e. A ( ph -> ps ) -> ( ph -> E. x e. A ps ) )
Theorem	r19.37av 2650*	Restricted version of one direction of Theorem 19.37 of [Margaris] p. 90. (Contributed by NM, 2-Apr-2004.)
|- ( E. x e. A ( ph -> ps ) -> ( ph -> E. x e. A ps ) )
Theorem	r19.40 2651	Restricted quantifier version of Theorem 19.40 of [Margaris] p. 90. (Contributed by NM, 2-Apr-2004.)
|- ( E. x e. A ( ph /\ ps ) -> ( E. x e. A ph /\ E. x e. A ps ) )
Theorem	r19.41 2652	Restricted quantifier version of Theorem 19.41 of [Margaris] p. 90. (Contributed by NM, 1-Nov-2010.)
|- F/ x ps   =>    |- ( E. x e. A ( ph /\ ps ) <-> ( E. x e. A ph /\ ps ) )
Theorem	r19.41v 2653*	Restricted quantifier version of Theorem 19.41 of [Margaris] p. 90. (Contributed by NM, 17-Dec-2003.)
|- ( E. x e. A ( ph /\ ps ) <-> ( E. x e. A ph /\ ps ) )
Theorem	r19.42v 2654*	Restricted version of Theorem 19.42 of [Margaris] p. 90. (Contributed by NM, 27-May-1998.)
|- ( E. x e. A ( ph /\ ps ) <-> ( ph /\ E. x e. A ps ) )
Theorem	r19.43 2655	Restricted version of Theorem 19.43 of [Margaris] p. 90. (Contributed by NM, 27-May-1998.) (Proof rewritten by Jim Kingdon, 5-Jun-2018.)
|- ( E. x e. A ( ph \/ ps ) <-> ( E. x e. A ph \/ E. x e. A ps ) )
Theorem	r19.44av 2656*	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.)
|- ( E. x e. A ( ph \/ ps ) -> ( E. x e. A ph \/ ps ) )
Theorem	r19.45av 2657*	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.)
|- ( E. x e. A ( ph \/ ps ) -> ( ph \/ E. x e. A ps ) )
Theorem	ralcomf 2658*	Commutation of restricted quantifiers. (Contributed by Mario Carneiro, 14-Oct-2016.)
|- F/_ y A   &    |- F/_ x B   =>    |- ( A. x e. A A. y e. B ph <-> A. y e. B A. x e. A ph )
Theorem	rexcomf 2659*	Commutation of restricted quantifiers. (Contributed by Mario Carneiro, 14-Oct-2016.)
|- F/_ y A   &    |- F/_ x B   =>    |- ( E. x e. A E. y e. B ph <-> E. y e. B E. x e. A ph )
Theorem	ralcom 2660*	Commutation of restricted quantifiers. (Contributed by NM, 13-Oct-1999.) (Revised by Mario Carneiro, 14-Oct-2016.)
|- ( A. x e. A A. y e. B ph <-> A. y e. B A. x e. A ph )
Theorem	rexcom 2661*	Commutation of restricted quantifiers. (Contributed by NM, 19-Nov-1995.) (Revised by Mario Carneiro, 14-Oct-2016.)
|- ( E. x e. A E. y e. B ph <-> E. y e. B E. x e. A ph )
Theorem	ralrot3 2662*	Rotate three restricted universal quantifiers. (Contributed by AV, 3-Dec-2021.)
|- ( A. x e. A A. y e. B A. z e. C ph <-> A. z e. C A. x e. A A. y e. B ph )
Theorem	rexcom13 2663*	Swap 1st and 3rd restricted existential quantifiers. (Contributed by NM, 8-Apr-2015.)
|- ( E. x e. A E. y e. B E. z e. C ph <-> E. z e. C E. y e. B E. x e. A ph )
Theorem	rexrot4 2664*	Rotate existential restricted quantifiers twice. (Contributed by NM, 8-Apr-2015.)
|- ( E. x e. A E. y e. B E. z e. C E. w e. D ph <-> E. z e. C E. w e. D E. x e. A E. y e. B ph )
Theorem	ralcom3 2665	A commutative law for restricted quantifiers that swaps the domain of the restriction. (Contributed by NM, 22-Feb-2004.)
|- ( A. x e. A ( x e. B -> ph ) <-> A. x e. B ( x e. A -> ph ) )
Theorem	reean 2666*	Rearrange existential quantifiers. (Contributed by NM, 27-Oct-2010.) (Proof shortened by Andrew Salmon, 30-May-2011.)
|- F/ y ph   &    |- F/ x ps   =>    |- ( E. x e. A E. y e. B ( ph /\ ps ) <-> ( E. x e. A ph /\ E. y e. B ps ) )
Theorem	reeanv 2667*	Rearrange existential quantifiers. (Contributed by NM, 9-May-1999.)
|- ( E. x e. A E. y e. B ( ph /\ ps ) <-> ( E. x e. A ph /\ E. y e. B ps ) )
Theorem	3reeanv 2668*	Rearrange three existential quantifiers. (Contributed by Jeff Madsen, 11-Jun-2010.)
|- ( E. x e. A E. y e. B E. z e. C ( ph /\ ps /\ ch ) <-> ( E. x e. A ph /\ E. y e. B ps /\ E. z e. C ch ) )
Theorem	nfreu1 2669	x is not free in E! x e. A ph. (Contributed by NM, 19-Mar-1997.)
|- F/ x E! x e. A ph
Theorem	nfrmo1 2670	x is not free in E* x e. A ph. (Contributed by NM, 16-Jun-2017.)
|- F/ x E* x e. A ph
Theorem	nfreudxy 2671*	Not-free deduction for restricted uniqueness. This is a version where x and y are distinct. (Contributed by Jim Kingdon, 6-Jun-2018.)
|- F/ y ph   &    |- ( ph -> F/_ x A )   &    |- ( ph -> F/ x ps )   =>    |- ( ph -> F/ x E! y e. A ps )
Theorem	nfreuxy 2672*	Not-free for restricted uniqueness. This is a version where x and y are distinct. (Contributed by Jim Kingdon, 6-Jun-2018.)
|- F/_ x A   &    |- F/ x ph   =>    |- F/ x E! y e. A ph
Theorem	rabid 2673	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 e. { x e. A | ph } <-> ( x e. A /\ ph ) )
Theorem	rabid2 2674*	An "identity" law for restricted class abstraction. (Contributed by NM, 9-Oct-2003.) (Proof shortened by Andrew Salmon, 30-May-2011.)
|- ( A = { x e. A | ph } <-> A. x e. A ph )
Theorem	rabbi 2675	Equivalent wff's correspond to equal restricted class abstractions. Closed theorem form of rabbidva 2751. (Contributed by NM, 25-Nov-2013.)
|- ( A. x e. A ( ps <-> ch ) <-> { x e. A | ps } = { x e. A | ch } )
Theorem	rabswap 2676	Swap with a membership relation in a restricted class abstraction. (Contributed by NM, 4-Jul-2005.)
|- { x e. A | x e. B } = { x e. B | x e. A }
Theorem	nfrab1 2677	The abstraction variable in a restricted class abstraction isn't free. (Contributed by NM, 19-Mar-1997.)
|- F/_ x { x e. A | ph }
Theorem	nfrabw 2678*	A variable not free in a wff remains so in a restricted class abstraction. (Contributed by Jim Kingdon, 19-Jul-2018.)
|- F/ x ph   &    |- F/_ x A   =>    |- F/_ x { y e. A | ph }
Theorem	reubida 2679	Formula-building rule for restricted existential quantifier (deduction form). (Contributed by Mario Carneiro, 19-Nov-2016.)
|- F/ x ph   &    |- ( ( ph /\ x e. A ) -> ( ps <-> ch ) )   =>    |- ( ph -> ( E! x e. A ps <-> E! x e. A ch ) )
Theorem	reubidva 2680*	Formula-building rule for restricted existential quantifier (deduction form). (Contributed by NM, 13-Nov-2004.)
|- ( ( ph /\ x e. A ) -> ( ps <-> ch ) )   =>    |- ( ph -> ( E! x e. A ps <-> E! x e. A ch ) )
Theorem	reubidv 2681*	Formula-building rule for restricted existential quantifier (deduction form). (Contributed by NM, 17-Oct-1996.)
|- ( ph -> ( ps <-> ch ) )   =>    |- ( ph -> ( E! x e. A ps <-> E! x e. A ch ) )
Theorem	reubiia 2682	Formula-building rule for restricted existential quantifier (inference form). (Contributed by NM, 14-Nov-2004.)
|- ( x e. A -> ( ph <-> ps ) )   =>    |- ( E! x e. A ph <-> E! x e. A ps )
Theorem	reubii 2683	Formula-building rule for restricted existential quantifier (inference form). (Contributed by NM, 22-Oct-1999.)
|- ( ph <-> ps )   =>    |- ( E! x e. A ph <-> E! x e. A ps )
Theorem	rmobida 2684	Formula-building rule for restricted existential quantifier (deduction form). (Contributed by NM, 16-Jun-2017.)
|- F/ x ph   &    |- ( ( ph /\ x e. A ) -> ( ps <-> ch ) )   =>    |- ( ph -> ( E* x e. A ps <-> E* x e. A ch ) )
Theorem	rmobidva 2685*	Formula-building rule for restricted existential quantifier (deduction form). (Contributed by NM, 16-Jun-2017.)
|- ( ( ph /\ x e. A ) -> ( ps <-> ch ) )   =>    |- ( ph -> ( E* x e. A ps <-> E* x e. A ch ) )
Theorem	rmobidv 2686*	Formula-building rule for restricted existential quantifier (deduction form). (Contributed by NM, 16-Jun-2017.)
|- ( ph -> ( ps <-> ch ) )   =>    |- ( ph -> ( E* x e. A ps <-> E* x e. A ch ) )
Theorem	rmobiia 2687	Formula-building rule for restricted existential quantifier (inference form). (Contributed by NM, 16-Jun-2017.)
|- ( x e. A -> ( ph <-> ps ) )   =>    |- ( E* x e. A ph <-> E* x e. A ps )
Theorem	rmobii 2688	Formula-building rule for restricted existential quantifier (inference form). (Contributed by NM, 16-Jun-2017.)
|- ( ph <-> ps )   =>    |- ( E* x e. A ph <-> E* x e. A ps )
Theorem	raleqf 2689	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.)
|- F/_ x A   &    |- F/_ x B   =>    |- ( A = B -> ( A. x e. A ph <-> A. x e. B ph ) )
Theorem	rexeqf 2690	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.)
|- F/_ x A   &    |- F/_ x B   =>    |- ( A = B -> ( E. x e. A ph <-> E. x e. B ph ) )
Theorem	reueq1f 2691	Equality theorem for restricted unique existential quantifier, with bound-variable hypotheses instead of distinct variable restrictions. (Contributed by NM, 5-Apr-2004.) (Revised by Andrew Salmon, 11-Jul-2011.)
|- F/_ x A   &    |- F/_ x B   =>    |- ( A = B -> ( E! x e. A ph <-> E! x e. B ph ) )
Theorem	rmoeq1f 2692	Equality theorem for restricted at-most-one quantifier, with bound-variable hypotheses instead of distinct variable restrictions. (Contributed by Alexander van der Vekens, 17-Jun-2017.)
|- F/_ x A   &    |- F/_ x B   =>    |- ( A = B -> ( E* x e. A ph <-> E* x e. B ph ) )
Theorem	raleq 2693*	Equality theorem for restricted universal quantifier. (Contributed by NM, 16-Nov-1995.)
|- ( A = B -> ( A. x e. A ph <-> A. x e. B ph ) )
Theorem	rexeq 2694*	Equality theorem for restricted existential quantifier. (Contributed by NM, 29-Oct-1995.)
|- ( A = B -> ( E. x e. A ph <-> E. x e. B ph ) )
Theorem	reueq1 2695*	Equality theorem for restricted unique existential quantifier. (Contributed by NM, 5-Apr-2004.)
|- ( A = B -> ( E! x e. A ph <-> E! x e. B ph ) )
Theorem	rmoeq1 2696*	Equality theorem for restricted at-most-one quantifier. (Contributed by Alexander van der Vekens, 17-Jun-2017.)
|- ( A = B -> ( E* x e. A ph <-> E* x e. B ph ) )
Theorem	raleqi 2697*	Equality inference for restricted universal qualifier. (Contributed by Paul Chapman, 22-Jun-2011.)
|- A = B   =>    |- ( A. x e. A ph <-> A. x e. B ph )
Theorem	rexeqi 2698*	Equality inference for restricted existential qualifier. (Contributed by Mario Carneiro, 23-Apr-2015.)
|- A = B   =>    |- ( E. x e. A ph <-> E. x e. B ph )
Theorem	raleqdv 2699*	Equality deduction for restricted universal quantifier. (Contributed by NM, 13-Nov-2005.)
|- ( ph -> A = B )   =>    |- ( ph -> ( A. x e. A ps <-> A. x e. B ps ) )
Theorem	rexeqdv 2700*	Equality deduction for restricted existential quantifier. (Contributed by NM, 14-Jan-2007.)
|- ( ph -> A = B )   =>    |- ( ph -> ( E. x e. A ps <-> E. x e. B ps ) )