Theorem euanv 2650

Description: Introduction of a conjunct into unique existential quantifier. (Contributed by NM, 23-Mar-1995.) Reduce dependencies on axioms. (Revised by Wolf Lammen, 14-Jan-2023.)

Assertion

Ref	Expression
euanv	⊢ (∃!𝑥(𝜑 ∧ 𝜓) ↔ (𝜑 ∧ ∃!𝑥𝜓))

Distinct variable group:   𝜑,𝑥

Allowed substitution hint:   𝜓(𝑥)

Proof of Theorem euanv

Step	Hyp	Ref	Expression
1		euex 2603	. . . 4 ⊢ (∃!𝑥(𝜑 ∧ 𝜓) → ∃𝑥(𝜑 ∧ 𝜓))
2		simpl 488	. . . . 5 ⊢ ((𝜑 ∧ 𝜓) → 𝜑)
3	2	exlimiv 1963	. . . 4 ⊢ (∃𝑥(𝜑 ∧ 𝜓) → 𝜑)
4	1, 3	syl 18	. . 3 ⊢ (∃!𝑥(𝜑 ∧ 𝜓) → 𝜑)
5		ibar 538	. . . . 5 ⊢ (𝜑 → (𝜓 ↔ (𝜑 ∧ 𝜓)))
6	5	eubidv 2612	. . . 4 ⊢ (𝜑 → (∃!𝑥𝜓 ↔ ∃!𝑥(𝜑 ∧ 𝜓)))
7	6	biimprcd 253	. . 3 ⊢ (∃!𝑥(𝜑 ∧ 𝜓) → (𝜑 → ∃!𝑥𝜓))
8	4, 7	jcai 526	. 2 ⊢ (∃!𝑥(𝜑 ∧ 𝜓) → (𝜑 ∧ ∃!𝑥𝜓))
9	6	biimpa 482	. 2 ⊢ ((𝜑 ∧ ∃!𝑥𝜓) → ∃!𝑥(𝜑 ∧ 𝜓))
10	8, 9	impbii 212	1 ⊢ (∃!𝑥(𝜑 ∧ 𝜓) ↔ (𝜑 ∧ ∃!𝑥𝜓))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401  ∃wex 1812  ∃!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

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-mo 2565  df-eu 2595

This theorem is used by:  eueq2  3668  2reu5lem1  3713  fsn  7136  dfac5lem5  10206