Theorem eqeu 3701

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 3587	. . . 4 ⊢ (𝐴 ∈ 𝐵 → (𝜓 → ∃𝑥𝜑))
3	2	imp 407	. . 3 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝜓) → ∃𝑥𝜑)
4	3	3adant3 1132	. 2 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝜓 ∧ ∀𝑥(𝜑 → 𝑥 = 𝐴)) → ∃𝑥𝜑)
5		eqeq2 2744	. . . . . . 7 ⊢ (𝑦 = 𝐴 → (𝑥 = 𝑦 ↔ 𝑥 = 𝐴))
6	5	imbi2d 340	. . . . . 6 ⊢ (𝑦 = 𝐴 → ((𝜑 → 𝑥 = 𝑦) ↔ (𝜑 → 𝑥 = 𝐴)))
7	6	albidv 1923	. . . . 5 ⊢ (𝑦 = 𝐴 → (∀𝑥(𝜑 → 𝑥 = 𝑦) ↔ ∀𝑥(𝜑 → 𝑥 = 𝐴)))
8	7	spcegv 3587	. . . 4 ⊢ (𝐴 ∈ 𝐵 → (∀𝑥(𝜑 → 𝑥 = 𝐴) → ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦)))
9	8	imp 407	. . 3 ⊢ ((𝐴 ∈ 𝐵 ∧ ∀𝑥(𝜑 → 𝑥 = 𝐴)) → ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦))
10	9	3adant2 1131	. 2 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝜓 ∧ ∀𝑥(𝜑 → 𝑥 = 𝐴)) → ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦))
11		eu3v 2564	. 2 ⊢ (∃!𝑥𝜑 ↔ (∃𝑥𝜑 ∧ ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦)))
12	4, 10, 11	sylanbrc 583	1 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝜓 ∧ ∀𝑥(𝜑 → 𝑥 = 𝐴)) → ∃!𝑥𝜑)

Syntax hints:   → wi 4   ↔ wb 205   ∧ w3a 1087  ∀wal 1539   = wceq 1541  ∃wex 1781   ∈ wcel 2106  ∃!weu 2562

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2703

This theorem depends on definitions:  df-bi 206  df-an 397  df-3an 1089  df-tru 1544  df-ex 1782  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810

This theorem is referenced by:  rngurd  32367  neibastop3  35235  upixp  36585  zrinitorngc  46851  zrtermorngc  46852  zrtermoringc  46921