Theorem cbvrexfw 2689

Description: Rule used to change bound variables, using implicit substitution. Version of cbvrexf 2691 with a disjoint variable condition, which does not require ax-13 2144. (Contributed by FL, 27-Apr-2008.) (Revised by Gino Giotto, 10-Jan-2024.)

Hypotheses

Ref	Expression
cbvrexfw.1	|- F/_ x A
cbvrexfw.2	|- F/_ y A
cbvrexfw.3	|- F/ y ph
cbvrexfw.4	|- F/ x ps
cbvrexfw.5	|- ( x = y -> ( ph <-> ps ) )

Assertion

Ref	Expression
cbvrexfw	|- ( E. x e. A ph <-> E. y e. A ps )

Distinct variable group:   x, y

Allowed substitution hints:   ph( x, y)   ps( x, y)   A( x, y)

Proof of Theorem cbvrexfw

Step	Hyp	Ref	Expression
1		cbvrexfw.2	. . . . 5 |- F/_ y A
2	1	nfcri 2307	. . . 4 |- F/ y x e. A
3		cbvrexfw.3	. . . 4 |- F/ y ph
4	2, 3	nfan 1559	. . 3 |- F/ y ( x e. A /\ ph )
5		cbvrexfw.1	. . . . 5 |- F/_ x A
6	5	nfcri 2307	. . . 4 |- F/ x y e. A
7		cbvrexfw.4	. . . 4 |- F/ x ps
8	6, 7	nfan 1559	. . 3 |- F/ x ( y e. A /\ ps )
9		eleq1w 2232	. . . 4 |- ( x = y -> ( x e. A <-> y e. A ) )
10		cbvrexfw.5	. . . 4 |- ( x = y -> ( ph <-> ps ) )
11	9, 10	anbi12d 471	. . 3 |- ( x = y -> ( ( x e. A /\ ph ) <-> ( y e. A /\ ps ) ) )
12	4, 8, 11	cbvexv1 1746	. 2 |- ( E. x ( x e. A /\ ph ) <-> E. y ( y e. A /\ ps ) )
13		df-rex 2455	. 2 |- ( E. x e. A ph <-> E. x ( x e. A /\ ph ) )
14		df-rex 2455	. 2 |- ( E. y e. A ps <-> E. y ( y e. A /\ ps ) )
15	12, 13, 14	3bitr4i 211	1 |- ( E. x e. A ph <-> E. y e. A ps )

Syntax hints:   -> wi 4   /\ wa 103   <-> wb 104   F/wnf 1454   E.wex 1486   e. wcel 2142   F/_wnfc 2300   E.wrex 2450

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 705  ax-5 1441  ax-7 1442  ax-gen 1443  ax-ie1 1487  ax-ie2 1488  ax-8 1498  ax-10 1499  ax-11 1500  ax-i12 1501  ax-bndl 1503  ax-4 1504  ax-17 1520  ax-i9 1524  ax-ial 1528  ax-i5r 1529  ax-ext 2153

This theorem depends on definitions:  df-bi 116  df-nf 1455  df-sb 1757  df-cleq 2164  df-clel 2167  df-nfc 2302  df-rex 2455

This theorem is referenced by:  nnwofdc  11997