Theorem eupickbi 2539

Description: Theorem *14.26 in [WhiteheadRussell] p. 192. (Contributed by Andrew Salmon, 11-Jul-2011.) (Proof shortened by Wolf Lammen, 27-Dec-2018.)

Assertion

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

Proof of Theorem eupickbi

Step	Hyp	Ref	Expression
1		eupicka 2537	. . 3 ⊢ ((∃!𝑥𝜑 ∧ ∃𝑥(𝜑 ∧ 𝜓)) → ∀𝑥(𝜑 → 𝜓))
2	1	ex 450	. 2 ⊢ (∃!𝑥𝜑 → (∃𝑥(𝜑 ∧ 𝜓) → ∀𝑥(𝜑 → 𝜓)))
3		euex 2494	. . 3 ⊢ (∃!𝑥𝜑 → ∃𝑥𝜑)
4		exintr 1819	. . 3 ⊢ (∀𝑥(𝜑 → 𝜓) → (∃𝑥𝜑 → ∃𝑥(𝜑 ∧ 𝜓)))
5	3, 4	syl5com 31	. 2 ⊢ (∃!𝑥𝜑 → (∀𝑥(𝜑 → 𝜓) → ∃𝑥(𝜑 ∧ 𝜓)))
6	2, 5	impbid 202	1 ⊢ (∃!𝑥𝜑 → (∃𝑥(𝜑 ∧ 𝜓) ↔ ∀𝑥(𝜑 → 𝜓)))

Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 384  ∀wal 1481  ∃wex 1704  ∃!weu 2470

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-10 2019  ax-11 2034  ax-12 2047

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-tru 1486  df-ex 1705  df-nf 1710  df-eu 2474  df-mo 2475

This theorem is referenced by:  sbaniota  38636