Theorem mopickr 38365

Description: "At most one" picks a variable value, eliminating an existential quantifier. The proof begins with references *2.21 (pm2.21 123) and *14.26 (eupickbi 2635) from [WhiteheadRussell] p. 104 and p. 183. (Contributed by Peter Mazsa, 18-Nov-2024.) (Proof modification is discouraged.)

Assertion

Ref	Expression
mopickr	⊢ ((∃*𝑥𝜓 ∧ ∃𝑥(𝜑 ∧ 𝜓)) → (𝜓 → 𝜑))

Proof of Theorem mopickr

Step	Hyp	Ref	Expression
1		exancom 1860	. . 3 ⊢ (∃𝑥(𝜑 ∧ 𝜓) ↔ ∃𝑥(𝜓 ∧ 𝜑))
2		moeu2 38364	. . . 4 ⊢ (∃*𝑥𝜓 ↔ (¬ ∃𝑥𝜓 ∨ ∃!𝑥𝜓))
3		19.8a 2180	. . . . . . . 8 ⊢ (𝜓 → ∃𝑥𝜓)
4	3	con3i 154	. . . . . . 7 ⊢ (¬ ∃𝑥𝜓 → ¬ 𝜓)
5		pm2.21 123	. . . . . . 7 ⊢ (¬ 𝜓 → (𝜓 → 𝜑))
6	4, 5	syl 17	. . . . . 6 ⊢ (¬ ∃𝑥𝜓 → (𝜓 → 𝜑))
7	6	a1d 25	. . . . 5 ⊢ (¬ ∃𝑥𝜓 → (∃𝑥(𝜓 ∧ 𝜑) → (𝜓 → 𝜑)))
8		eupickbi 2635	. . . . . 6 ⊢ (∃!𝑥𝜓 → (∃𝑥(𝜓 ∧ 𝜑) ↔ ∀𝑥(𝜓 → 𝜑)))
9		sp 2182	. . . . . 6 ⊢ (∀𝑥(𝜓 → 𝜑) → (𝜓 → 𝜑))
10	8, 9	biimtrdi 253	. . . . 5 ⊢ (∃!𝑥𝜓 → (∃𝑥(𝜓 ∧ 𝜑) → (𝜓 → 𝜑)))
11	7, 10	jaoi 857	. . . 4 ⊢ ((¬ ∃𝑥𝜓 ∨ ∃!𝑥𝜓) → (∃𝑥(𝜓 ∧ 𝜑) → (𝜓 → 𝜑)))
12	2, 11	sylbi 217	. . 3 ⊢ (∃*𝑥𝜓 → (∃𝑥(𝜓 ∧ 𝜑) → (𝜓 → 𝜑)))
13	1, 12	biimtrid 242	. 2 ⊢ (∃*𝑥𝜓 → (∃𝑥(𝜑 ∧ 𝜓) → (𝜓 → 𝜑)))
14	13	imp 406	1 ⊢ ((∃*𝑥𝜓 ∧ ∃𝑥(𝜑 ∧ 𝜓)) → (𝜓 → 𝜑))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∨ wo 847  ∀wal 1537  ∃wex 1778  ∃*wmo 2537  ∃!weu 2567

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-10 2140  ax-11 2156  ax-12 2176

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1542  df-ex 1779  df-nf 1783  df-mo 2539  df-eu 2568

This theorem is referenced by: (None)