Theorem eupicka 2106

Description: Version of eupick 2105 with closed formulas. (Contributed by NM, 6-Sep-2008.)

Assertion

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

Proof of Theorem eupicka

Step	Hyp	Ref	Expression
1		hbeu1 2036	. . 3 ⊢ (∃!𝑥𝜑 → ∀𝑥∃!𝑥𝜑)
2		hbe1 1495	. . 3 ⊢ (∃𝑥(𝜑 ∧ 𝜓) → ∀𝑥∃𝑥(𝜑 ∧ 𝜓))
3	1, 2	hban 1547	. 2 ⊢ ((∃!𝑥𝜑 ∧ ∃𝑥(𝜑 ∧ 𝜓)) → ∀𝑥(∃!𝑥𝜑 ∧ ∃𝑥(𝜑 ∧ 𝜓)))
4		eupick 2105	. 2 ⊢ ((∃!𝑥𝜑 ∧ ∃𝑥(𝜑 ∧ 𝜓)) → (𝜑 → 𝜓))
5	3, 4	alrimih 1469	1 ⊢ ((∃!𝑥𝜑 ∧ ∃𝑥(𝜑 ∧ 𝜓)) → ∀𝑥(𝜑 → 𝜓))

Syntax hints:   → wi 4   ∧ wa 104  ∀wal 1351  ∃wex 1492  ∃!weu 2026

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535

This theorem depends on definitions:  df-bi 117  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030

This theorem is referenced by:  eupickbi  2108