Theorem reu6dv 32631

Description: A condition which implies existential uniqueness. (Contributed by Thierry Arnoux, 13-Oct-2025.)

Hypotheses

Ref	Expression
reu6d.1	⊢ (𝜑 → 𝐵 ∈ 𝐴)
reu6d.2	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝜓 ↔ 𝑥 = 𝐵))

Assertion

Ref	Expression
reu6dv	⊢ (𝜑 → ∃!𝑥 ∈ 𝐴 𝜓)

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝜑,𝑥

Allowed substitution hint:   𝜓(𝑥)

Proof of Theorem reu6dv

Step	Hyp	Ref	Expression
1		reu6d.1	. 2 ⊢ (𝜑 → 𝐵 ∈ 𝐴)
2		reu6d.2	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝜓 ↔ 𝑥 = 𝐵))
3	2	ralrimiva 3153	. 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 (𝜓 ↔ 𝑥 = 𝐵))
4		reu6i 3689	. 2 ⊢ ((𝐵 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝜓 ↔ 𝑥 = 𝐵)) → ∃!𝑥 ∈ 𝐴 𝜓)
5	1, 3, 4	syl2anc 593	1 ⊢ (𝜑 → ∃!𝑥 ∈ 𝐴 𝜓)

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 399   = wceq 1559   ∈ wcel 2141  ∀wral 3075  ∃!wreu 3364

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-12 2211  ax-ext 2733

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-tru 1562  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3076  df-rex 3086  df-reu 3367

This theorem is referenced by:  gsummptrev  33197  gsummptp1  33198  gsummulsubdishift1  33209  elrgspnsubrunlem1  33389  selvply1rhmlemb  33777  evlextv  33800  mplvrpmrhm  33805