Theorem cbvrmo 3406

Description: Change the bound variable of a restricted at-most-one quantifier using implicit substitution. Usage of this theorem is discouraged because it depends on ax-13 2402. Use the weaker cbvrmow 3391, cbvrmovw 3387 when possible. (Contributed by NM, 16-Jun-2017.) (New usage is discouraged.)

Hypotheses

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

Assertion

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

Distinct variable groups:   𝑥,𝐴   𝑦,𝐴

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

Proof of Theorem cbvrmo

Step	Hyp	Ref	Expression
1		cbvrmo.1	. . . 4 ⊢ Ⅎ𝑦𝜑
2		cbvrmo.2	. . . 4 ⊢ Ⅎ𝑥𝜓
3		cbvrmo.3	. . . 4 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
4	1, 2, 3	cbvrex 3349	. . 3 ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑦 ∈ 𝐴 𝜓)
5	1, 2, 3	cbvreu 3405	. . 3 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑦 ∈ 𝐴 𝜓)
6	4, 5	imbi12i 352	. 2 ⊢ ((∃𝑥 ∈ 𝐴 𝜑 → ∃!𝑥 ∈ 𝐴 𝜑) ↔ (∃𝑦 ∈ 𝐴 𝜓 → ∃!𝑦 ∈ 𝐴 𝜓))
7		rmo5 3384	. 2 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ (∃𝑥 ∈ 𝐴 𝜑 → ∃!𝑥 ∈ 𝐴 𝜑))
8		rmo5 3384	. 2 ⊢ (∃*𝑦 ∈ 𝐴 𝜓 ↔ (∃𝑦 ∈ 𝐴 𝜓 → ∃!𝑦 ∈ 𝐴 𝜓))
9	6, 7, 8	3bitr4i 305	1 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑦 ∈ 𝐴 𝜓)

Syntax hints:   → wi 4   ↔ wb 208  Ⅎwnf 1802  ∃wrex 3085  ∃!wreu 3364  ∃*wrmo 3365

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-10 2174  ax-11 2190  ax-12 2211  ax-13 2402

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-tru 1562  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clel 2836  df-nfc 2910  df-ral 3076  df-rex 3086  df-rmo 3366  df-reu 3367

This theorem is referenced by:  cbvrmov  3407