Theorem cbvrmo 2695

Description: Change the bound variable of restricted "at most one" using implicit substitution. (Contributed by NM, 16-Jun-2017.)

Hypotheses

Ref	Expression
cbvral.1	|- F/ y ph
cbvral.2	|- F/ x ps
cbvral.3	|- ( x = y -> ( ph <-> ps ) )

Assertion

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

Distinct variable groups:   x, A   y, A

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

Proof of Theorem cbvrmo

Step	Hyp	Ref	Expression
1		cbvral.1	. . . 4 |- F/ y ph
2		cbvral.2	. . . 4 |- F/ x ps
3		cbvral.3	. . . 4 |- ( x = y -> ( ph <-> ps ) )
4	1, 2, 3	cbvrex 2693	. . 3 |- ( E. x e. A ph <-> E. y e. A ps )
5	1, 2, 3	cbvreu 2694	. . 3 |- ( E! x e. A ph <-> E! y e. A ps )
6	4, 5	imbi12i 238	. 2 |- ( ( E. x e. A ph -> E! x e. A ph ) <-> ( E. y e. A ps -> E! y e. A ps ) )
7		rmo5 2685	. 2 |- ( E* x e. A ph <-> ( E. x e. A ph -> E! x e. A ph ) )
8		rmo5 2685	. 2 |- ( E* y e. A ps <-> ( E. y e. A ps -> E! y e. A ps ) )
9	6, 7, 8	3bitr4i 211	1 |- ( E* x e. A ph <-> E* y e. A ps )

Syntax hints:   -> wi 4   <-> wb 104   F/wnf 1453   E.wrex 2449   E!wreu 2450   E*wrmo 2451

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 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152

This theorem depends on definitions:  df-bi 116  df-tru 1351  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-cleq 2163  df-clel 2166  df-nfc 2301  df-rex 2454  df-reu 2455  df-rmo 2456

This theorem is referenced by:  cbvrmov  2699  cbvdisj  3976