Theorem reuxfr1d 3712

Description: Transfer existential uniqueness from a variable 𝑥 to another variable 𝑦 contained in expression 𝐴. Cf. reuxfr1ds 3713. (Contributed by Thierry Arnoux, 7-Apr-2017.)

Hypotheses

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

Assertion

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

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

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

Proof of Theorem reuxfr1d

Step	Hyp	Ref	Expression
1		reuxfr1d.2	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ∃!𝑦 ∈ 𝐶 𝑥 = 𝐴)
2		reurex 3372	. . . . . 6 ⊢ (∃!𝑦 ∈ 𝐶 𝑥 = 𝐴 → ∃𝑦 ∈ 𝐶 𝑥 = 𝐴)
3	1, 2	syl 18	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ∃𝑦 ∈ 𝐶 𝑥 = 𝐴)
4	3	biantrurd 541	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝜓 ↔ (∃𝑦 ∈ 𝐶 𝑥 = 𝐴 ∧ 𝜓)))
5		r19.41v 3194	. . . . . 6 ⊢ (∃𝑦 ∈ 𝐶 (𝑥 = 𝐴 ∧ 𝜓) ↔ (∃𝑦 ∈ 𝐶 𝑥 = 𝐴 ∧ 𝜓))
6		reuxfr1d.3	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (𝜓 ↔ 𝜒))
7	6	pm5.32da 589	. . . . . . 7 ⊢ (𝜑 → ((𝑥 = 𝐴 ∧ 𝜓) ↔ (𝑥 = 𝐴 ∧ 𝜒)))
8	7	rexbidv 3188	. . . . . 6 ⊢ (𝜑 → (∃𝑦 ∈ 𝐶 (𝑥 = 𝐴 ∧ 𝜓) ↔ ∃𝑦 ∈ 𝐶 (𝑥 = 𝐴 ∧ 𝜒)))
9	5, 8	bitr3id 288	. . . . 5 ⊢ (𝜑 → ((∃𝑦 ∈ 𝐶 𝑥 = 𝐴 ∧ 𝜓) ↔ ∃𝑦 ∈ 𝐶 (𝑥 = 𝐴 ∧ 𝜒)))
10	9	adantr 485	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ((∃𝑦 ∈ 𝐶 𝑥 = 𝐴 ∧ 𝜓) ↔ ∃𝑦 ∈ 𝐶 (𝑥 = 𝐴 ∧ 𝜒)))
11	4, 10	bitrd 282	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝜓 ↔ ∃𝑦 ∈ 𝐶 (𝑥 = 𝐴 ∧ 𝜒)))
12	11	reubidva 3382	. 2 ⊢ (𝜑 → (∃!𝑥 ∈ 𝐵 𝜓 ↔ ∃!𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐶 (𝑥 = 𝐴 ∧ 𝜒)))
13		reuxfr1d.1	. . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐶) → 𝐴 ∈ 𝐵)
14		reurmo 3371	. . . 4 ⊢ (∃!𝑦 ∈ 𝐶 𝑥 = 𝐴 → ∃*𝑦 ∈ 𝐶 𝑥 = 𝐴)
15	1, 14	syl 18	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ∃*𝑦 ∈ 𝐶 𝑥 = 𝐴)
16	13, 15	reuxfrd 3710	. 2 ⊢ (𝜑 → (∃!𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐶 (𝑥 = 𝐴 ∧ 𝜒) ↔ ∃!𝑦 ∈ 𝐶 𝜒))
17	12, 16	bitrd 282	1 ⊢ (𝜑 → (∃!𝑥 ∈ 𝐵 𝜓 ↔ ∃!𝑦 ∈ 𝐶 𝜒))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1569   ∈ wcel 2142  ∃wrex 3088  ∃!wreu 3366  ∃*wrmo 3367

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1572  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rex 3089  df-rmo 3368  df-reu 3369

This theorem is used by:  reuxfr1ds  3713  rmoxfrd  32850  fcnvgreu  33028  reuf1odnf  47872  reuf1od  47873