Theorem eubid 2673

Description: Formula-building rule for the unique existential quantifier (deduction form). (Contributed by NM, 9-Jul-1994.) (Proof shortened by Wolf Lammen, 19-Feb-2023.)

Hypotheses

Ref	Expression
eubid.1	⊢ Ⅎ𝑥𝜑
eubid.2	⊢ (𝜑 → (𝜓 ↔ 𝜒))

Assertion

Ref	Expression
eubid	⊢ (𝜑 → (∃!𝑥𝜓 ↔ ∃!𝑥𝜒))

Proof of Theorem eubid

Step	Hyp	Ref	Expression
1		eubid.1	. . 3 ⊢ Ⅎ𝑥𝜑
2		eubid.2	. . 3 ⊢ (𝜑 → (𝜓 ↔ 𝜒))
3	1, 2	alrimi 2213	. 2 ⊢ (𝜑 → ∀𝑥(𝜓 ↔ 𝜒))
4		eubi 2669	. 2 ⊢ (∀𝑥(𝜓 ↔ 𝜒) → (∃!𝑥𝜓 ↔ ∃!𝑥𝜒))
5	3, 4	syl 17	1 ⊢ (𝜑 → (∃!𝑥𝜓 ↔ ∃!𝑥𝜒))

Syntax hints:   → wi 4   ↔ wb 208  ∀wal 1535  Ⅎwnf 1784  ∃!weu 2653

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-12 2177

This theorem depends on definitions:  df-bi 209  df-an 399  df-ex 1781  df-nf 1785  df-mo 2622  df-eu 2654

This theorem is referenced by:  euor  2695  euor2  2697  euan  2706  reubida  3389  reueq1f  3401  eusv2i  5297  reusv2lem3  5303  eubiOLD  40775