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	necon2bbiddc 2401	Contrapositive deduction for inequality. (Contributed by Jim Kingdon, 16-May-2018.)
|- ( ph -> (DECID A = B -> ( ps <-> A =/= B ) ) )   =>    |- ( ph -> (DECID A = B -> ( A = B <-> -. ps ) ) )
Theorem	necon4aidc 2402	Contrapositive inference for inequality. (Contributed by Jim Kingdon, 16-May-2018.)
|- (DECID A = B -> ( A =/= B -> -. ph ) )   =>    |- (DECID A = B -> ( ph -> A = B ) )
Theorem	necon4idc 2403	Contrapositive inference for inequality. (Contributed by Jim Kingdon, 16-May-2018.)
|- (DECID A = B -> ( A =/= B -> C =/= D ) )   =>    |- (DECID A = B -> ( C = D -> A = B ) )
Theorem	necon4addc 2404	Contrapositive inference for inequality. (Contributed by Jim Kingdon, 17-May-2018.)
|- ( ph -> (DECID A = B -> ( A =/= B -> -. ps ) ) )   =>    |- ( ph -> (DECID A = B -> ( ps -> A = B ) ) )
Theorem	necon4bddc 2405	Contrapositive inference for inequality. (Contributed by Jim Kingdon, 17-May-2018.)
|- ( ph -> (DECID ps -> ( -. ps -> A =/= B ) ) )   =>    |- ( ph -> (DECID ps -> ( A = B -> ps ) ) )
Theorem	necon4ddc 2406	Contrapositive inference for inequality. (Contributed by Jim Kingdon, 17-May-2018.)
|- ( ph -> (DECID A = B -> ( A =/= B -> C =/= D ) ) )   =>    |- ( ph -> (DECID A = B -> ( C = D -> A = B ) ) )
Theorem	necon4abiddc 2407	Contrapositive law deduction for inequality. (Contributed by Jim Kingdon, 18-May-2018.)
|- ( ph -> (DECID A = B -> (DECID ps -> ( A =/= B <-> -. ps ) ) ) )   =>    |- ( ph -> (DECID A = B -> (DECID ps -> ( A = B <-> ps ) ) ) )
Theorem	necon4bbiddc 2408	Contrapositive law deduction for inequality. (Contributed by Jim Kingdon, 19-May-2018.)
|- ( ph -> (DECID ps -> (DECID A = B -> ( -. ps <-> A =/= B ) ) ) )   =>    |- ( ph -> (DECID ps -> (DECID A = B -> ( ps <-> A = B ) ) ) )
Theorem	necon4biddc 2409	Contrapositive law deduction for inequality. (Contributed by Jim Kingdon, 19-May-2018.)
|- ( ph -> (DECID A = B -> (DECID C = D -> ( A =/= B <-> C =/= D ) ) ) )   =>    |- ( ph -> (DECID A = B -> (DECID C = D -> ( A = B <-> C = D ) ) ) )
Theorem	necon1addc 2410	Contrapositive deduction for inequality. (Contributed by Jim Kingdon, 19-May-2018.)
|- ( ph -> (DECID ps -> ( -. ps -> A = B ) ) )   =>    |- ( ph -> (DECID ps -> ( A =/= B -> ps ) ) )
Theorem	necon1bddc 2411	Contrapositive deduction for inequality. (Contributed by Jim Kingdon, 19-May-2018.)
|- ( ph -> (DECID A = B -> ( A =/= B -> ps ) ) )   =>    |- ( ph -> (DECID A = B -> ( -. ps -> A = B ) ) )
Theorem	necon1ddc 2412	Contrapositive law deduction for inequality. (Contributed by Jim Kingdon, 19-May-2018.)
|- ( ph -> (DECID A = B -> ( A =/= B -> C = D ) ) )   =>    |- ( ph -> (DECID A = B -> ( C =/= D -> A = B ) ) )
Theorem	neneqad 2413	If it is not the case that two classes are equal, they are unequal. Converse of neneqd 2355. One-way deduction form of df-ne 2335. (Contributed by David Moews, 28-Feb-2017.)
|- ( ph -> -. A = B )   =>    |- ( ph -> A =/= B )
Theorem	nebidc 2414	Contraposition law for inequality. (Contributed by Jim Kingdon, 19-May-2018.)
|- (DECID A = B -> (DECID C = D -> ( ( A = B <-> C = D ) <-> ( A =/= B <-> C =/= D ) ) ) )
Theorem	pm13.18 2415	Theorem *13.18 in [WhiteheadRussell] p. 178. (Contributed by Andrew Salmon, 3-Jun-2011.)
|- ( ( A = B /\ A =/= C ) -> B =/= C )
Theorem	pm13.181 2416	Theorem *13.181 in [WhiteheadRussell] p. 178. (Contributed by Andrew Salmon, 3-Jun-2011.)
|- ( ( A = B /\ B =/= C ) -> A =/= C )
Theorem	pm2.21ddne 2417	A contradiction implies anything. Equality/inequality deduction form. (Contributed by David Moews, 28-Feb-2017.)
|- ( ph -> A = B )   &    |- ( ph -> A =/= B )   =>    |- ( ph -> ps )
Theorem	necom 2418	Commutation of inequality. (Contributed by NM, 14-May-1999.)
|- ( A =/= B <-> B =/= A )
Theorem	necomi 2419	Inference from commutative law for inequality. (Contributed by NM, 17-Oct-2012.)
|- A =/= B   =>    |- B =/= A
Theorem	necomd 2420	Deduction from commutative law for inequality. (Contributed by NM, 12-Feb-2008.)
|- ( ph -> A =/= B )   =>    |- ( ph -> B =/= A )
Theorem	neanior 2421	A De Morgan's law for inequality. (Contributed by NM, 18-May-2007.)
|- ( ( A =/= B /\ C =/= D ) <-> -. ( A = B \/ C = D ) )
Theorem	ne3anior 2422	A De Morgan's law for inequality. (Contributed by NM, 30-Sep-2013.) (Proof rewritten by Jim Kingdon, 19-May-2018.)
|- ( ( A =/= B /\ C =/= D /\ E =/= F ) <-> -. ( A = B \/ C = D \/ E = F ) )
Theorem	nemtbir 2423	An inference from an inequality, related to modus tollens. (Contributed by NM, 13-Apr-2007.)
|- A =/= B   &    |- ( ph <-> A = B )   =>    |- -. ph
Theorem	nelne1 2424	Two classes are different if they don't contain the same element. (Contributed by NM, 3-Feb-2012.)
|- ( ( A e. B /\ -. A e. C ) -> B =/= C )
Theorem	nelne2 2425	Two classes are different if they don't belong to the same class. (Contributed by NM, 25-Jun-2012.)
|- ( ( A e. C /\ -. B e. C ) -> A =/= B )
Theorem	nelelne 2426	Two classes are different if they don't belong to the same class. (Contributed by Rodolfo Medina, 17-Oct-2010.) (Proof shortened by AV, 10-May-2020.)
|- ( -. A e. B -> ( C e. B -> C =/= A ) )
Theorem	nfne 2427	Bound-variable hypothesis builder for inequality. (Contributed by NM, 10-Nov-2007.) (Revised by Mario Carneiro, 7-Oct-2016.)
|- F/_ x A   &    |- F/_ x B   =>    |- F/ x A =/= B
Theorem	nfned 2428	Bound-variable hypothesis builder for inequality. (Contributed by NM, 10-Nov-2007.) (Revised by Mario Carneiro, 7-Oct-2016.)
|- ( ph -> F/_ x A )   &    |- ( ph -> F/_ x B )   =>    |- ( ph -> F/ x A =/= B )
2.1.4.2  Negated membership
Syntax	wnel 2429	Extend wff notation to include negated membership.
wff A e/ B
Definition	df-nel 2430	Define negated membership. (Contributed by NM, 7-Aug-1994.)
|- ( A e/ B <-> -. A e. B )
Theorem	neli 2431	Inference associated with df-nel 2430. (Contributed by BJ, 7-Jul-2018.)
|- A e/ B   =>    |- -. A e. B
Theorem	nelir 2432	Inference associated with df-nel 2430. (Contributed by BJ, 7-Jul-2018.)
|- -. A e. B   =>    |- A e/ B
Theorem	neleq1 2433	Equality theorem for negated membership. (Contributed by NM, 20-Nov-1994.)
|- ( A = B -> ( A e/ C <-> B e/ C ) )
Theorem	neleq2 2434	Equality theorem for negated membership. (Contributed by NM, 20-Nov-1994.)
|- ( A = B -> ( C e/ A <-> C e/ B ) )
Theorem	neleq12d 2435	Equality theorem for negated membership. (Contributed by FL, 10-Aug-2016.)
|- ( ph -> A = B )   &    |- ( ph -> C = D )   =>    |- ( ph -> ( A e/ C <-> B e/ D ) )
Theorem	nfnel 2436	Bound-variable hypothesis builder for negated membership. (Contributed by David Abernethy, 26-Jun-2011.) (Revised by Mario Carneiro, 7-Oct-2016.)
|- F/_ x A   &    |- F/_ x B   =>    |- F/ x A e/ B
Theorem	nfneld 2437	Bound-variable hypothesis builder for negated membership. (Contributed by David Abernethy, 26-Jun-2011.) (Revised by Mario Carneiro, 7-Oct-2016.)
|- ( ph -> F/_ x A )   &    |- ( ph -> F/_ x B )   =>    |- ( ph -> F/ x A e/ B )
Theorem	elnelne1 2438	Two classes are different if they don't contain the same element. (Contributed by AV, 28-Jan-2020.)
|- ( ( A e. B /\ A e/ C ) -> B =/= C )
Theorem	elnelne2 2439	Two classes are different if they don't belong to the same class. (Contributed by AV, 28-Jan-2020.)
|- ( ( A e. C /\ B e/ C ) -> A =/= B )
Theorem	nelcon3d 2440	Contrapositive law deduction for negated membership. (Contributed by AV, 28-Jan-2020.)
|- ( ph -> ( A e. B -> C e. D ) )   =>    |- ( ph -> ( C e/ D -> A e/ B ) )
Theorem	elnelall 2441	A contradiction concerning membership implies anything. (Contributed by Alexander van der Vekens, 25-Jan-2018.)
|- ( A e. B -> ( A e/ B -> ph ) )
2.1.5  Restricted quantification
Syntax	wral 2442	Extend wff notation to include restricted universal quantification.
wff A. x e. A ph
Syntax	wrex 2443	Extend wff notation to include restricted existential quantification.
wff E. x e. A ph
Syntax	wreu 2444	Extend wff notation to include restricted existential uniqueness.
wff E! x e. A ph
Syntax	wrmo 2445	Extend wff notation to include restricted "at most one."
wff E* x e. A ph
Syntax	crab 2446	Extend class notation to include the restricted class abstraction (class builder).
class { x e. A | ph }
Definition	df-ral 2447	Define restricted universal quantification. Special case of Definition 4.15(3) of [TakeutiZaring] p. 22. (Contributed by NM, 19-Aug-1993.)
|- ( A. x e. A ph <-> A. x ( x e. A -> ph ) )
Definition	df-rex 2448	Define restricted existential quantification. Special case of Definition 4.15(4) of [TakeutiZaring] p. 22. (Contributed by NM, 30-Aug-1993.)
|- ( E. x e. A ph <-> E. x ( x e. A /\ ph ) )
Definition	df-reu 2449	Define restricted existential uniqueness. (Contributed by NM, 22-Nov-1994.)
|- ( E! x e. A ph <-> E! x ( x e. A /\ ph ) )
Definition	df-rmo 2450	Define restricted "at most one". (Contributed by NM, 16-Jun-2017.)
|- ( E* x e. A ph <-> E* x ( x e. A /\ ph ) )
Definition	df-rab 2451	Define a restricted class abstraction (class builder), which is the class of all x in A such that ph is true. Definition of [TakeutiZaring] p. 20. (Contributed by NM, 22-Nov-1994.)
|- { x e. A | ph } = { x | ( x e. A /\ ph ) }
Theorem	ralnex 2452	Relationship between restricted universal and existential quantifiers. (Contributed by NM, 21-Jan-1997.)
|- ( A. x e. A -. ph <-> -. E. x e. A ph )
Theorem	rexnalim 2453	Relationship between restricted universal and existential quantifiers. In classical logic this would be a biconditional. (Contributed by Jim Kingdon, 17-Aug-2018.)
|- ( E. x e. A -. ph -> -. A. x e. A ph )
Theorem	nnral 2454	The double negation of a universal quantification implies the universal quantification of the double negation. Restricted quantifier version of nnal 1636. (Contributed by Jim Kingdon, 1-Aug-2024.)
|- ( -. -. A. x e. A ph -> A. x e. A -. -. ph )
Theorem	dfrex2dc 2455	Relationship between restricted universal and existential quantifiers. (Contributed by Jim Kingdon, 29-Jun-2022.)
|- (DECID E. x e. A ph -> ( E. x e. A ph <-> -. A. x e. A -. ph ) )
Theorem	ralexim 2456	Relationship between restricted universal and existential quantifiers. (Contributed by Jim Kingdon, 17-Aug-2018.)
|- ( A. x e. A ph -> -. E. x e. A -. ph )
Theorem	rexalim 2457	Relationship between restricted universal and existential quantifiers. (Contributed by Jim Kingdon, 17-Aug-2018.)
|- ( E. x e. A ph -> -. A. x e. A -. ph )
Theorem	ralbida 2458	Formula-building rule for restricted universal quantifier (deduction form). (Contributed by NM, 6-Oct-2003.)
|- F/ x ph   &    |- ( ( ph /\ x e. A ) -> ( ps <-> ch ) )   =>    |- ( ph -> ( A. x e. A ps <-> A. x e. A ch ) )
Theorem	rexbida 2459	Formula-building rule for restricted existential quantifier (deduction form). (Contributed by NM, 6-Oct-2003.)
|- F/ x ph   &    |- ( ( ph /\ x e. A ) -> ( ps <-> ch ) )   =>    |- ( ph -> ( E. x e. A ps <-> E. x e. A ch ) )
Theorem	ralbidva 2460*	Formula-building rule for restricted universal quantifier (deduction form). (Contributed by NM, 4-Mar-1997.)
|- ( ( ph /\ x e. A ) -> ( ps <-> ch ) )   =>    |- ( ph -> ( A. x e. A ps <-> A. x e. A ch ) )
Theorem	rexbidva 2461*	Formula-building rule for restricted existential quantifier (deduction form). (Contributed by NM, 9-Mar-1997.)
|- ( ( ph /\ x e. A ) -> ( ps <-> ch ) )   =>    |- ( ph -> ( E. x e. A ps <-> E. x e. A ch ) )
Theorem	ralbid 2462	Formula-building rule for restricted universal quantifier (deduction form). (Contributed by NM, 27-Jun-1998.)
|- F/ x ph   &    |- ( ph -> ( ps <-> ch ) )   =>    |- ( ph -> ( A. x e. A ps <-> A. x e. A ch ) )
Theorem	rexbid 2463	Formula-building rule for restricted existential quantifier (deduction form). (Contributed by NM, 27-Jun-1998.)
|- F/ x ph   &    |- ( ph -> ( ps <-> ch ) )   =>    |- ( ph -> ( E. x e. A ps <-> E. x e. A ch ) )
Theorem	ralbidv 2464*	Formula-building rule for restricted universal quantifier (deduction form). (Contributed by NM, 20-Nov-1994.)
|- ( ph -> ( ps <-> ch ) )   =>    |- ( ph -> ( A. x e. A ps <-> A. x e. A ch ) )
Theorem	rexbidv 2465*	Formula-building rule for restricted existential quantifier (deduction form). (Contributed by NM, 20-Nov-1994.)
|- ( ph -> ( ps <-> ch ) )   =>    |- ( ph -> ( E. x e. A ps <-> E. x e. A ch ) )
Theorem	ralbidv2 2466*	Formula-building rule for restricted universal quantifier (deduction form). (Contributed by NM, 6-Apr-1997.)
|- ( ph -> ( ( x e. A -> ps ) <-> ( x e. B -> ch ) ) )   =>    |- ( ph -> ( A. x e. A ps <-> A. x e. B ch ) )
Theorem	rexbidv2 2467*	Formula-building rule for restricted existential quantifier (deduction form). (Contributed by NM, 22-May-1999.)
|- ( ph -> ( ( x e. A /\ ps ) <-> ( x e. B /\ ch ) ) )   =>    |- ( ph -> ( E. x e. A ps <-> E. x e. B ch ) )
Theorem	ralbid2 2468	Formula-building rule for restricted universal quantifier (deduction form). (Contributed by BJ, 14-Jul-2024.)
|- F/ x ph   &    |- ( ph -> ( ( x e. A -> ps ) <-> ( x e. B -> ch ) ) )   =>    |- ( ph -> ( A. x e. A ps <-> A. x e. B ch ) )
Theorem	rexbid2 2469	Formula-building rule for restricted existential quantifier (deduction form). (Contributed by BJ, 14-Jul-2024.)
|- F/ x ph   &    |- ( ph -> ( ( x e. A /\ ps ) <-> ( x e. B /\ ch ) ) )   =>    |- ( ph -> ( E. x e. A ps <-> E. x e. B ch ) )
Theorem	ralbii 2470	Inference adding restricted universal quantifier to both sides of an equivalence. (Contributed by NM, 23-Nov-1994.) (Revised by Mario Carneiro, 17-Oct-2016.)
|- ( ph <-> ps )   =>    |- ( A. x e. A ph <-> A. x e. A ps )
Theorem	rexbii 2471	Inference adding restricted existential quantifier to both sides of an equivalence. (Contributed by NM, 23-Nov-1994.) (Revised by Mario Carneiro, 17-Oct-2016.)
|- ( ph <-> ps )   =>    |- ( E. x e. A ph <-> E. x e. A ps )
Theorem	2ralbii 2472	Inference adding two restricted universal quantifiers to both sides of an equivalence. (Contributed by NM, 1-Aug-2004.)
|- ( ph <-> ps )   =>    |- ( A. x e. A A. y e. B ph <-> A. x e. A A. y e. B ps )
Theorem	2rexbii 2473	Inference adding two restricted existential quantifiers to both sides of an equivalence. (Contributed by NM, 11-Nov-1995.)
|- ( ph <-> ps )   =>    |- ( E. x e. A E. y e. B ph <-> E. x e. A E. y e. B ps )
Theorem	ralbii2 2474	Inference adding different restricted universal quantifiers to each side of an equivalence. (Contributed by NM, 15-Aug-2005.)
|- ( ( x e. A -> ph ) <-> ( x e. B -> ps ) )   =>    |- ( A. x e. A ph <-> A. x e. B ps )
Theorem	rexbii2 2475	Inference adding different restricted existential quantifiers to each side of an equivalence. (Contributed by NM, 4-Feb-2004.)
|- ( ( x e. A /\ ph ) <-> ( x e. B /\ ps ) )   =>    |- ( E. x e. A ph <-> E. x e. B ps )
Theorem	raleqbii 2476	Equality deduction for restricted universal quantifier, changing both formula and quantifier domain. Inference form. (Contributed by David Moews, 1-May-2017.)
|- A = B   &    |- ( ps <-> ch )   =>    |- ( A. x e. A ps <-> A. x e. B ch )
Theorem	rexeqbii 2477	Equality deduction for restricted existential quantifier, changing both formula and quantifier domain. Inference form. (Contributed by David Moews, 1-May-2017.)
|- A = B   &    |- ( ps <-> ch )   =>    |- ( E. x e. A ps <-> E. x e. B ch )
Theorem	ralbiia 2478	Inference adding restricted universal quantifier to both sides of an equivalence. (Contributed by NM, 26-Nov-2000.)
|- ( x e. A -> ( ph <-> ps ) )   =>    |- ( A. x e. A ph <-> A. x e. A ps )
Theorem	rexbiia 2479	Inference adding restricted existential quantifier to both sides of an equivalence. (Contributed by NM, 26-Oct-1999.)
|- ( x e. A -> ( ph <-> ps ) )   =>    |- ( E. x e. A ph <-> E. x e. A ps )
Theorem	2rexbiia 2480*	Inference adding two restricted existential quantifiers to both sides of an equivalence. (Contributed by NM, 1-Aug-2004.)
|- ( ( x e. A /\ y e. B ) -> ( ph <-> ps ) )   =>    |- ( E. x e. A E. y e. B ph <-> E. x e. A E. y e. B ps )
Theorem	r2alf 2481*	Double restricted universal quantification. (Contributed by Mario Carneiro, 14-Oct-2016.)
|- F/_ y A   =>    |- ( A. x e. A A. y e. B ph <-> A. x A. y ( ( x e. A /\ y e. B ) -> ph ) )
Theorem	r2exf 2482*	Double restricted existential quantification. (Contributed by Mario Carneiro, 14-Oct-2016.)
|- F/_ y A   =>    |- ( E. x e. A E. y e. B ph <-> E. x E. y ( ( x e. A /\ y e. B ) /\ ph ) )
Theorem	r2al 2483*	Double restricted universal quantification. (Contributed by NM, 19-Nov-1995.)
|- ( A. x e. A A. y e. B ph <-> A. x A. y ( ( x e. A /\ y e. B ) -> ph ) )
Theorem	r2ex 2484*	Double restricted existential quantification. (Contributed by NM, 11-Nov-1995.)
|- ( E. x e. A E. y e. B ph <-> E. x E. y ( ( x e. A /\ y e. B ) /\ ph ) )
Theorem	2ralbida 2485*	Formula-building rule for restricted universal quantifier (deduction form). (Contributed by NM, 24-Feb-2004.)
|- F/ x ph   &    |- F/ y ph   &    |- ( ( ph /\ ( x e. A /\ y e. B ) ) -> ( ps <-> ch ) )   =>    |- ( ph -> ( A. x e. A A. y e. B ps <-> A. x e. A A. y e. B ch ) )
Theorem	2ralbidva 2486*	Formula-building rule for restricted universal quantifiers (deduction form). (Contributed by NM, 4-Mar-1997.)
|- ( ( ph /\ ( x e. A /\ y e. B ) ) -> ( ps <-> ch ) )   =>    |- ( ph -> ( A. x e. A A. y e. B ps <-> A. x e. A A. y e. B ch ) )
Theorem	2rexbidva 2487*	Formula-building rule for restricted existential quantifiers (deduction form). (Contributed by NM, 15-Dec-2004.)
|- ( ( ph /\ ( x e. A /\ y e. B ) ) -> ( ps <-> ch ) )   =>    |- ( ph -> ( E. x e. A E. y e. B ps <-> E. x e. A E. y e. B ch ) )
Theorem	2ralbidv 2488*	Formula-building rule for restricted universal quantifiers (deduction form). (Contributed by NM, 28-Jan-2006.) (Revised by Szymon Jaroszewicz, 16-Mar-2007.)
|- ( ph -> ( ps <-> ch ) )   =>    |- ( ph -> ( A. x e. A A. y e. B ps <-> A. x e. A A. y e. B ch ) )
Theorem	2rexbidv 2489*	Formula-building rule for restricted existential quantifiers (deduction form). (Contributed by NM, 28-Jan-2006.)
|- ( ph -> ( ps <-> ch ) )   =>    |- ( ph -> ( E. x e. A E. y e. B ps <-> E. x e. A E. y e. B ch ) )
Theorem	rexralbidv 2490*	Formula-building rule for restricted quantifiers (deduction form). (Contributed by NM, 28-Jan-2006.)
|- ( ph -> ( ps <-> ch ) )   =>    |- ( ph -> ( E. x e. A A. y e. B ps <-> E. x e. A A. y e. B ch ) )
Theorem	ralinexa 2491	A transformation of restricted quantifiers and logical connectives. (Contributed by NM, 4-Sep-2005.)
|- ( A. x e. A ( ph -> -. ps ) <-> -. E. x e. A ( ph /\ ps ) )
Theorem	risset 2492*	Two ways to say " A belongs to B." (Contributed by NM, 22-Nov-1994.)
|- ( A e. B <-> E. x e. B x = A )
Theorem	hbral 2493	Bound-variable hypothesis builder for restricted quantification. (Contributed by NM, 1-Sep-1999.) (Revised by David Abernethy, 13-Dec-2009.)
|- ( y e. A -> A. x y e. A )   &    |- ( ph -> A. x ph )   =>    |- ( A. y e. A ph -> A. x A. y e. A ph )
Theorem	hbra1 2494	x is not free in A. x e. A ph. (Contributed by NM, 18-Oct-1996.)
|- ( A. x e. A ph -> A. x A. x e. A ph )
Theorem	nfra1 2495	x is not free in A. x e. A ph. (Contributed by NM, 18-Oct-1996.) (Revised by Mario Carneiro, 7-Oct-2016.)
|- F/ x A. x e. A ph
Theorem	nfraldw 2496*	Not-free for restricted universal quantification where x and y are distinct. See nfraldya 2499 for a version with y and A distinct instead. (Contributed by NM, 15-Feb-2013.) (Revised by Gino Giotto, 10-Jan-2024.)
|- F/ y ph   &    |- ( ph -> F/_ x A )   &    |- ( ph -> F/ x ps )   =>    |- ( ph -> F/ x A. y e. A ps )
Theorem	nfraldxy 2497*	Old name for nfraldw 2496. (Contributed by Jim Kingdon, 29-May-2018.) (New usage is discouraged.)
|- F/ y ph   &    |- ( ph -> F/_ x A )   &    |- ( ph -> F/ x ps )   =>    |- ( ph -> F/ x A. y e. A ps )
Theorem	nfrexdxy 2498*	Not-free for restricted existential quantification where x and y are distinct. See nfrexdya 2500 for a version with y and A distinct instead. (Contributed by Jim Kingdon, 30-May-2018.)
|- F/ y ph   &    |- ( ph -> F/_ x A )   &    |- ( ph -> F/ x ps )   =>    |- ( ph -> F/ x E. y e. A ps )
Theorem	nfraldya 2499*	Not-free for restricted universal quantification where y and A are distinct. See nfraldxy 2497 for a version with x and y distinct instead. (Contributed by Jim Kingdon, 30-May-2018.)
|- F/ y ph   &    |- ( ph -> F/_ x A )   &    |- ( ph -> F/ x ps )   =>    |- ( ph -> F/ x A. y e. A ps )
Theorem	nfrexdya 2500*	Not-free for restricted existential quantification where y and A are distinct. See nfrexdxy 2498 for a version with x and y distinct instead. (Contributed by Jim Kingdon, 30-May-2018.)
|- F/ y ph   &    |- ( ph -> F/_ x A )   &    |- ( ph -> F/ x ps )   =>    |- ( ph -> F/ x E. y e. A ps )