Theorem reuxfr1dd 48699

Description: Transfer existential uniqueness from a variable 𝑥 to another variable 𝑦 contained in expression 𝐴. Simplifies reuxfr1d 3755. (Contributed by Zhi Wang, 20-Sep-2025.)

Hypotheses

Ref	Expression
reuxfr1dd.1	⊢ ((𝜑 ∧ 𝑦 ∈ 𝐶) → 𝐴 ∈ 𝐵)
reuxfr1dd.2	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ∃!𝑦 ∈ 𝐶 𝑥 = 𝐴)
reuxfr1dd.3	⊢ ((𝜑 ∧ (𝑦 ∈ 𝐶 ∧ 𝑥 = 𝐴)) → (𝜓 ↔ 𝜒))

Assertion

Ref	Expression
reuxfr1dd	⊢ (𝜑 → (∃!𝑥 ∈ 𝐵 𝜓 ↔ ∃!𝑦 ∈ 𝐶 𝜒))

Distinct variable groups:   𝑥,𝑦,𝜑   𝜓,𝑦   𝜒,𝑥   𝑥,𝐴   𝑥,𝐵,𝑦   𝑥,𝐶,𝑦

Allowed substitution hints:   𝜓(𝑥)   𝜒(𝑦)   𝐴(𝑦)

Proof of Theorem reuxfr1dd

Step	Hyp	Ref	Expression
1		reuxfr1dd.2	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ∃!𝑦 ∈ 𝐶 𝑥 = 𝐴)
2		reurex 3383	. . . . . 6 ⊢ (∃!𝑦 ∈ 𝐶 𝑥 = 𝐴 → ∃𝑦 ∈ 𝐶 𝑥 = 𝐴)
3	1, 2	syl 17	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ∃𝑦 ∈ 𝐶 𝑥 = 𝐴)
4	3	biantrurd 532	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝜓 ↔ (∃𝑦 ∈ 𝐶 𝑥 = 𝐴 ∧ 𝜓)))
5		r19.41v 3188	. . . . . 6 ⊢ (∃𝑦 ∈ 𝐶 (𝑥 = 𝐴 ∧ 𝜓) ↔ (∃𝑦 ∈ 𝐶 𝑥 = 𝐴 ∧ 𝜓))
6		reuxfr1dd.3	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐶 ∧ 𝑥 = 𝐴)) → (𝜓 ↔ 𝜒))
7	6	pm5.32da 579	. . . . . . . 8 ⊢ (𝜑 → (((𝑦 ∈ 𝐶 ∧ 𝑥 = 𝐴) ∧ 𝜓) ↔ ((𝑦 ∈ 𝐶 ∧ 𝑥 = 𝐴) ∧ 𝜒)))
8		anass 468	. . . . . . . 8 ⊢ (((𝑦 ∈ 𝐶 ∧ 𝑥 = 𝐴) ∧ 𝜓) ↔ (𝑦 ∈ 𝐶 ∧ (𝑥 = 𝐴 ∧ 𝜓)))
9		anass 468	. . . . . . . 8 ⊢ (((𝑦 ∈ 𝐶 ∧ 𝑥 = 𝐴) ∧ 𝜒) ↔ (𝑦 ∈ 𝐶 ∧ (𝑥 = 𝐴 ∧ 𝜒)))
10	7, 8, 9	3bitr3g 313	. . . . . . 7 ⊢ (𝜑 → ((𝑦 ∈ 𝐶 ∧ (𝑥 = 𝐴 ∧ 𝜓)) ↔ (𝑦 ∈ 𝐶 ∧ (𝑥 = 𝐴 ∧ 𝜒))))
11	10	rexbidv2 3174	. . . . . 6 ⊢ (𝜑 → (∃𝑦 ∈ 𝐶 (𝑥 = 𝐴 ∧ 𝜓) ↔ ∃𝑦 ∈ 𝐶 (𝑥 = 𝐴 ∧ 𝜒)))
12	5, 11	bitr3id 285	. . . . 5 ⊢ (𝜑 → ((∃𝑦 ∈ 𝐶 𝑥 = 𝐴 ∧ 𝜓) ↔ ∃𝑦 ∈ 𝐶 (𝑥 = 𝐴 ∧ 𝜒)))
13	12	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ((∃𝑦 ∈ 𝐶 𝑥 = 𝐴 ∧ 𝜓) ↔ ∃𝑦 ∈ 𝐶 (𝑥 = 𝐴 ∧ 𝜒)))
14	4, 13	bitrd 279	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝜓 ↔ ∃𝑦 ∈ 𝐶 (𝑥 = 𝐴 ∧ 𝜒)))
15	14	reubidva 3395	. 2 ⊢ (𝜑 → (∃!𝑥 ∈ 𝐵 𝜓 ↔ ∃!𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐶 (𝑥 = 𝐴 ∧ 𝜒)))
16		reuxfr1dd.1	. . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐶) → 𝐴 ∈ 𝐵)
17		reurmo 3382	. . . 4 ⊢ (∃!𝑦 ∈ 𝐶 𝑥 = 𝐴 → ∃*𝑦 ∈ 𝐶 𝑥 = 𝐴)
18	1, 17	syl 17	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ∃*𝑦 ∈ 𝐶 𝑥 = 𝐴)
19	16, 18	reuxfrd 3753	. 2 ⊢ (𝜑 → (∃!𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐶 (𝑥 = 𝐴 ∧ 𝜒) ↔ ∃!𝑦 ∈ 𝐶 𝜒))
20	15, 19	bitrd 279	1 ⊢ (𝜑 → (∃!𝑥 ∈ 𝐵 𝜓 ↔ ∃!𝑦 ∈ 𝐶 𝜒))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2108  ∃wrex 3069  ∃!wreu 3377  ∃*wrmo 3378

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-tru 1543  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2728  df-clel 2815  df-ral 3061  df-rex 3070  df-rmo 3379  df-reu 3380

This theorem is referenced by:  upeu2  48902