Theorem cbvrmow 3394

Description: Change the bound variable of a restricted at-most-one quantifier using implicit substitution. Version of cbvrmo 3409 with a disjoint variable condition, which does not require ax-10 2180, ax-13 2404. (Contributed by NM, 16-Jun-2017.) Avoid ax-10 2180, ax-13 2404. (Revised by GG, 23-May-2024.)

Hypotheses

Ref	Expression
cbvrmow.1	⊢ Ⅎ𝑦𝜑
cbvrmow.2	⊢ Ⅎ𝑥𝜓
cbvrmow.3	⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))

Assertion

Ref	Expression
cbvrmow	⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑦 ∈ 𝐴 𝜓)

Distinct variable group:   𝑥,𝑦,𝐴

Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝜓(𝑥, 𝑦)

Proof of Theorem cbvrmow

Step	Hyp	Ref	Expression
1		nfv 1949	. . . 4 ⊢ Ⅎ𝑦 𝑥 ∈ 𝐴
2		cbvrmow.1	. . . 4 ⊢ Ⅎ𝑦𝜑
3	1, 2	nfan 1934	. . 3 ⊢ Ⅎ𝑦(𝑥 ∈ 𝐴 ∧ 𝜑)
4		nfv 1949	. . . 4 ⊢ Ⅎ𝑥 𝑦 ∈ 𝐴
5		cbvrmow.2	. . . 4 ⊢ Ⅎ𝑥𝜓
6	4, 5	nfan 1934	. . 3 ⊢ Ⅎ𝑥(𝑦 ∈ 𝐴 ∧ 𝜓)
7		eleq1w 2847	. . . 4 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
8		cbvrmow.3	. . . 4 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
9	7, 8	anbi12d 644	. . 3 ⊢ (𝑥 = 𝑦 → ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝑦 ∈ 𝐴 ∧ 𝜓)))
10	3, 6, 9	cbvmow 2631	. 2 ⊢ (∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∃*𝑦(𝑦 ∈ 𝐴 ∧ 𝜓))
11		df-rmo 3369	. 2 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
12		df-rmo 3369	. 2 ⊢ (∃*𝑦 ∈ 𝐴 𝜓 ↔ ∃*𝑦(𝑦 ∈ 𝐴 ∧ 𝜓))
13	10, 11, 12	3bitr4i 306	1 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑦 ∈ 𝐴 𝜓)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  Ⅎwnf 1816   ∈ wcel 2147  ∃*wmo 2565  ∃*wrmo 3368

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-11 2197  ax-12 2216

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-mo 2567  df-clel 2839  df-rmo 3369

This theorem is used by:  cbvreuw  3395  cbvdisj  5083