Theorem reuhypd 5319

Description: A theorem useful for eliminating the restricted existential uniqueness hypotheses in riotaxfrd 7147. (Contributed by NM, 16-Jan-2012.)

Hypotheses

Ref	Expression
reuhypd.1	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝐵 ∈ 𝐶)
reuhypd.2	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶) → (𝑥 = 𝐴 ↔ 𝑦 = 𝐵))

Assertion

Ref	Expression
reuhypd	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ∃!𝑦 ∈ 𝐶 𝑥 = 𝐴)

Distinct variable groups:   𝜑,𝑦   𝑦,𝐵   𝑦,𝐶   𝑥,𝑦

Allowed substitution hints:   𝜑(𝑥)   𝐴(𝑥,𝑦)   𝐵(𝑥)   𝐶(𝑥)

Proof of Theorem reuhypd

Step	Hyp	Ref	Expression
1		reuhypd.1	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝐵 ∈ 𝐶)
2	1	elexd 3514	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝐵 ∈ V)
3		eueq 3698	. . . 4 ⊢ (𝐵 ∈ V ↔ ∃!𝑦 𝑦 = 𝐵)
4	2, 3	sylib 220	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ∃!𝑦 𝑦 = 𝐵)
5		eleq1 2900	. . . . . . 7 ⊢ (𝑦 = 𝐵 → (𝑦 ∈ 𝐶 ↔ 𝐵 ∈ 𝐶))
6	1, 5	syl5ibrcom 249	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (𝑦 = 𝐵 → 𝑦 ∈ 𝐶))
7	6	pm4.71rd 565	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (𝑦 = 𝐵 ↔ (𝑦 ∈ 𝐶 ∧ 𝑦 = 𝐵)))
8		reuhypd.2	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶) → (𝑥 = 𝐴 ↔ 𝑦 = 𝐵))
9	8	3expa 1114	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐶) ∧ 𝑦 ∈ 𝐶) → (𝑥 = 𝐴 ↔ 𝑦 = 𝐵))
10	9	pm5.32da 581	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ((𝑦 ∈ 𝐶 ∧ 𝑥 = 𝐴) ↔ (𝑦 ∈ 𝐶 ∧ 𝑦 = 𝐵)))
11	7, 10	bitr4d 284	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (𝑦 = 𝐵 ↔ (𝑦 ∈ 𝐶 ∧ 𝑥 = 𝐴)))
12	11	eubidv 2668	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (∃!𝑦 𝑦 = 𝐵 ↔ ∃!𝑦(𝑦 ∈ 𝐶 ∧ 𝑥 = 𝐴)))
13	4, 12	mpbid 234	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ∃!𝑦(𝑦 ∈ 𝐶 ∧ 𝑥 = 𝐴))
14		df-reu 3145	. 2 ⊢ (∃!𝑦 ∈ 𝐶 𝑥 = 𝐴 ↔ ∃!𝑦(𝑦 ∈ 𝐶 ∧ 𝑥 = 𝐴))
15	13, 14	sylibr 236	1 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ∃!𝑦 ∈ 𝐶 𝑥 = 𝐴)

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   ∧ w3a 1083   = wceq 1533   ∈ wcel 2110  ∃!weu 2649  ∃!wreu 3140  Vcvv 3494

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-ext 2793

This theorem depends on definitions:  df-bi 209  df-an 399  df-3an 1085  df-ex 1777  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-reu 3145  df-v 3496

This theorem is referenced by:  reuhyp  5320  riotaocN  36344