Theorem reuxfr1d 3711

Description: Transfer existential uniqueness from a variable 𝑥 to another variable 𝑦 contained in expression 𝐴. Cf. reuxfr1ds 3712. (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 3373	. . . . . 6 ⊢ (∃!𝑦 ∈ 𝐶 𝑥 = 𝐴 → ∃𝑦 ∈ 𝐶 𝑥 = 𝐴)
3	1, 2	syl 18	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ∃𝑦 ∈ 𝐶 𝑥 = 𝐴)
4	3	biantrurd 542	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝜓 ↔ (∃𝑦 ∈ 𝐶 𝑥 = 𝐴 ∧ 𝜓)))
5		r19.41v 3196	. . . . . 6 ⊢ (∃𝑦 ∈ 𝐶 (𝑥 = 𝐴 ∧ 𝜓) ↔ (∃𝑦 ∈ 𝐶 𝑥 = 𝐴 ∧ 𝜓))
6		reuxfr1d.3	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (𝜓 ↔ 𝜒))
7	6	pm5.32da 590	. . . . . . 7 ⊢ (𝜑 → ((𝑥 = 𝐴 ∧ 𝜓) ↔ (𝑥 = 𝐴 ∧ 𝜒)))
8	7	rexbidv 3190	. . . . . 6 ⊢ (𝜑 → (∃𝑦 ∈ 𝐶 (𝑥 = 𝐴 ∧ 𝜓) ↔ ∃𝑦 ∈ 𝐶 (𝑥 = 𝐴 ∧ 𝜒)))
9	5, 8	bitr3id 288	. . . . 5 ⊢ (𝜑 → ((∃𝑦 ∈ 𝐶 𝑥 = 𝐴 ∧ 𝜓) ↔ ∃𝑦 ∈ 𝐶 (𝑥 = 𝐴 ∧ 𝜒)))
10	9	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ((∃𝑦 ∈ 𝐶 𝑥 = 𝐴 ∧ 𝜓) ↔ ∃𝑦 ∈ 𝐶 (𝑥 = 𝐴 ∧ 𝜒)))
11	4, 10	bitrd 282	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝜓 ↔ ∃𝑦 ∈ 𝐶 (𝑥 = 𝐴 ∧ 𝜒)))
12	11	reubidva 3383	. 2 ⊢ (𝜑 → (∃!𝑥 ∈ 𝐵 𝜓 ↔ ∃!𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐶 (𝑥 = 𝐴 ∧ 𝜒)))
13		reuxfr1d.1	. . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐶) → 𝐴 ∈ 𝐵)
14		reurmo 3372	. . . 4 ⊢ (∃!𝑦 ∈ 𝐶 𝑥 = 𝐴 → ∃*𝑦 ∈ 𝐶 𝑥 = 𝐴)
15	1, 14	syl 18	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ∃*𝑦 ∈ 𝐶 𝑥 = 𝐴)
16	13, 15	reuxfrd 3709	. 2 ⊢ (𝜑 → (∃!𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐶 (𝑥 = 𝐴 ∧ 𝜒) ↔ ∃!𝑦 ∈ 𝐶 𝜒))
17	12, 16	bitrd 282	1 ⊢ (𝜑 → (∃!𝑥 ∈ 𝐵 𝜓 ↔ ∃!𝑦 ∈ 𝐶 𝜒))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∃wrex 3090  ∃!wreu 3367  ∃*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-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370

This theorem is used by:  reuxfr1ds  3712  rmoxfrd  33158  fcnvgreu  33335  reuf1odnf  48381  reuf1od  48382