Theorem eqeu 3664

Description: A condition which implies existential uniqueness. (Contributed by Jeff Hankins, 8-Sep-2009.)

Hypothesis

Ref	Expression
eqeu.1	⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))

Assertion

Ref	Expression
eqeu	⊢ ((𝐴 ∈ 𝐵 ∧ 𝜓 ∧ ∀𝑥(𝜑 → 𝑥 = 𝐴)) → ∃!𝑥𝜑)

Distinct variable groups:   𝜓,𝑥   𝑥,𝐴

Allowed substitution hints:   𝜑(𝑥)   𝐵(𝑥)

Proof of Theorem eqeu

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqeu.1	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
2	1	spcegv 3552	. . . 4 ⊢ (𝐴 ∈ 𝐵 → (𝜓 → ∃𝑥𝜑))
3	2	imp 412	. . 3 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝜓) → ∃𝑥𝜑)
4	3	3adant3 1150	. 2 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝜓 ∧ ∀𝑥(𝜑 → 𝑥 = 𝐴)) → ∃𝑥𝜑)
5		eqeq2 2773	. . . . . . 7 ⊢ (𝑦 = 𝐴 → (𝑥 = 𝑦 ↔ 𝑥 = 𝐴))
6	5	imbi2d 343	. . . . . 6 ⊢ (𝑦 = 𝐴 → ((𝜑 → 𝑥 = 𝑦) ↔ (𝜑 → 𝑥 = 𝐴)))
7	6	albidv 1953	. . . . 5 ⊢ (𝑦 = 𝐴 → (∀𝑥(𝜑 → 𝑥 = 𝑦) ↔ ∀𝑥(𝜑 → 𝑥 = 𝐴)))
8	7	spcegv 3552	. . . 4 ⊢ (𝐴 ∈ 𝐵 → (∀𝑥(𝜑 → 𝑥 = 𝐴) → ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦)))
9	8	imp 412	. . 3 ⊢ ((𝐴 ∈ 𝐵 ∧ ∀𝑥(𝜑 → 𝑥 = 𝐴)) → ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦))
10	9	3adant2 1149	. 2 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝜓 ∧ ∀𝑥(𝜑 → 𝑥 = 𝐴)) → ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦))
11		eu3v 2596	. 2 ⊢ (∃!𝑥𝜑 ↔ (∃𝑥𝜑 ∧ ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦)))
12	4, 10, 11	sylanbrc 595	1 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝜓 ∧ ∀𝑥(𝜑 → 𝑥 = 𝐴)) → ∃!𝑥𝜑)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ w3a 1103  ∀wal 1568   = wceq 1570  ∃wex 1812   ∈ wcel 2145  ∃!weu 2594

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733

This proof depends on definitions:  df-bi 210  df-an 402  df-3an 1105  df-tru 1573  df-ex 1813  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836

This theorem is used by:  ringurd  20391  zrinitorngc  20874  zrtermorngc  20875  zrtermoringc  20907  neibastop3  37120  upixp  38631