Theorem moim 2569

Description: The at-most-one quantifier reverses implication. (Contributed by NM, 22-Apr-1995.)

Assertion

Ref	Expression
moim	⊢ (∀𝑥(𝜑 → 𝜓) → (∃*𝑥𝜓 → ∃*𝑥𝜑))

Proof of Theorem moim

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		imim1 84	. . . 4 ⊢ ((𝜑 → 𝜓) → ((𝜓 → 𝑥 = 𝑦) → (𝜑 → 𝑥 = 𝑦)))
2	1	al2imi 1847	. . 3 ⊢ (∀𝑥(𝜑 → 𝜓) → (∀𝑥(𝜓 → 𝑥 = 𝑦) → ∀𝑥(𝜑 → 𝑥 = 𝑦)))
3	2	eximdv 1949	. 2 ⊢ (∀𝑥(𝜑 → 𝜓) → (∃𝑦∀𝑥(𝜓 → 𝑥 = 𝑦) → ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦)))
4		dfmo 2565	. 2 ⊢ (∃*𝑥𝜓 ↔ ∃𝑦∀𝑥(𝜓 → 𝑥 = 𝑦))
5		dfmo 2565	. 2 ⊢ (∃*𝑥𝜑 ↔ ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦))
6	3, 4, 5	3imtr4g 299	1 ⊢ (∀𝑥(𝜑 → 𝜓) → (∃*𝑥𝜓 → ∃*𝑥𝜑))

This proof depends on syntax axioms:   → wi 4  ∀wal 1567  ∃wex 1811  ∃*wmo 2562

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1812  df-mo 2564

This theorem is used by:  moimi  2570  moimdv  2571  mobi  2572  euimmo  2641  moexexlem  2651  rmoim  3697  rmoimi2  3700  ssrmof  3976  disjss3  5101  funmo  6554  uptx  23949  taylf  26693