Theorem exdistrfor 1663

Description: Distribution of existential quantifiers, with a bound-variable hypothesis saying that y is not free in ph, but x can be free in ph (and there is no distinct variable condition on x and y). (Contributed by Jim Kingdon, 25-Feb-2018.)

Hypothesis

Ref	Expression
exdistrfor.1	|- (A.x x = y \/ A.x F/yph)

Assertion

Ref	Expression
exdistrfor	|- (E.xE.y(ph /\ ps) -> E.x(ph /\ E.yps))

Proof of Theorem exdistrfor

Step	Hyp	Ref	Expression
1		exdistrfor.1	. 2 |- (A.x x = y \/ A.x F/yph)
2		biidd 161	. . . . . 6 |- (A.x x = y -> ((ph /\ ps) <-> (ph /\ ps)))
3	2	drex1 1661	. . . . 5 |- (A.x x = y -> (E.x(ph /\ ps) <-> E.y(ph /\ ps)))
4	3	drex2 1602	. . . 4 |- (A.x x = y -> (E.xE.x(ph /\ ps) <-> E.xE.y(ph /\ ps)))
5		hbe1 1365	. . . . . 6 |- (E.x(ph /\ ps) -> A.xE.x(ph /\ ps))
6	5	19.9h 1516	. . . . 5 |- (E.xE.x(ph /\ ps) <-> E.x(ph /\ ps))
7		19.8a 1464	. . . . . . 7 |- (ps -> E.yps)
8	7	anim2i 324	. . . . . 6 |- ((ph /\ ps) -> (ph /\ E.yps))
9	8	eximi 1473	. . . . 5 |- (E.x(ph /\ ps) -> E.x(ph /\ E.yps))
10	6, 9	sylbi 114	. . . 4 |- (E.xE.x(ph /\ ps) -> E.x(ph /\ E.yps))
11	4, 10	syl6bir 153	. . 3 |- (A.x x = y -> (E.xE.y(ph /\ ps) -> E.x(ph /\ E.yps)))
12		ax-ial 1409	. . . 4 |- (A.x F/yph -> A.xA.x F/yph)
13		19.40 1504	. . . . . 6 |- (E.y(ph /\ ps) -> (E.yph /\ E.yps))
14		19.9t 1515	. . . . . . . 8 |- ( F/yph -> (E.yph <-> ph))
15	14	biimpd 132	. . . . . . 7 |- ( F/yph -> (E.yph -> ph))
16	15	anim1d 319	. . . . . 6 |- ( F/yph -> ((E.yph /\ E.yps) -> (ph /\ E.yps)))
17	13, 16	syl5 28	. . . . 5 |- ( F/yph -> (E.y(ph /\ ps) -> (ph /\ E.yps)))
18	17	sps 1412	. . . 4 |- (A.x F/yph -> (E.y(ph /\ ps) -> (ph /\ E.yps)))
19	12, 18	eximdh 1484	. . 3 |- (A.x F/yph -> (E.xE.y(ph /\ ps) -> E.x(ph /\ E.yps)))
20	11, 19	jaoi 623	. 2 |- ((A.x x = y \/ A.x F/yph) -> (E.xE.y(ph /\ ps) -> E.x(ph /\ E.yps)))
21	1, 20	ax-mp 7	1 |- (E.xE.y(ph /\ ps) -> E.x(ph /\ E.yps))

Syntax hints:   -> wi 4   /\ wa 97   \/ wo 616  A.wal 1226   F/wnf 1329  E.wex 1362

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 617  ax-5 1316  ax-7 1317  ax-gen 1318  ax-ie1 1363  ax-ie2 1364  ax-8 1376  ax-10 1377  ax-11 1378  ax-i12 1379  ax-4 1381  ax-17 1400  ax-i9 1404  ax-ial 1409

This theorem depends on definitions:  df-bi 110  df-nf 1330

This theorem is referenced by:  oprabidlem  5460