Theorem euim 2617

Description: Add unique existential quantifiers to an implication. Note the reversed implication in the antecedent. (Contributed by NM, 19-Oct-2005.) (Proof shortened by Andrew Salmon, 14-Jun-2011.) (Proof shortened by Wolf Lammen, 1-Oct-2023.)

Assertion

Ref	Expression
euim	⊢ ((∃𝑥𝜑 ∧ ∀𝑥(𝜑 → 𝜓)) → (∃!𝑥𝜓 → ∃!𝑥𝜑))

Proof of Theorem euim

Step	Hyp	Ref	Expression
1		euimmo 2616	. 2 ⊢ (∀𝑥(𝜑 → 𝜓) → (∃!𝑥𝜓 → ∃*𝑥𝜑))
2		exmoeub 2580	. . 3 ⊢ (∃𝑥𝜑 → (∃*𝑥𝜑 ↔ ∃!𝑥𝜑))
3	2	biimpd 229	. 2 ⊢ (∃𝑥𝜑 → (∃*𝑥𝜑 → ∃!𝑥𝜑))
4	1, 3	sylan9r 508	1 ⊢ ((∃𝑥𝜑 ∧ ∀𝑥(𝜑 → 𝜓)) → (∃!𝑥𝜓 → ∃!𝑥𝜑))

Syntax hints:   → wi 4   ∧ wa 395  ∀wal 1538  ∃wex 1779  ∃*wmo 2538  ∃!weu 2568

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910

This theorem depends on definitions:  df-bi 207  df-an 396  df-ex 1780  df-mo 2540  df-eu 2569

This theorem is referenced by:  2eu1  2651  2eu1v  2652  dfatcolem  47267