Theorem mobi 2575

Description: Equivalence theorem for the at-most-one quantifier. (Contributed by BJ, 7-Oct-2022.) (Proof shortened by Wolf Lammen, 18-Feb-2023.)

Assertion

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

Proof of Theorem mobi

Step	Hyp	Ref	Expression
1		albiim 1919	. 2 ⊢ (∀𝑥(𝜑 ↔ 𝜓) ↔ (∀𝑥(𝜑 → 𝜓) ∧ ∀𝑥(𝜓 → 𝜑)))
2		moim 2572	. . . 4 ⊢ (∀𝑥(𝜓 → 𝜑) → (∃*𝑥𝜑 → ∃*𝑥𝜓))
3		moim 2572	. . . 4 ⊢ (∀𝑥(𝜑 → 𝜓) → (∃*𝑥𝜓 → ∃*𝑥𝜑))
4	2, 3	impbid21d 214	. . 3 ⊢ (∀𝑥(𝜑 → 𝜓) → (∀𝑥(𝜓 → 𝜑) → (∃*𝑥𝜑 ↔ ∃*𝑥𝜓)))
5	4	imp 411	. 2 ⊢ ((∀𝑥(𝜑 → 𝜓) ∧ ∀𝑥(𝜓 → 𝜑)) → (∃*𝑥𝜑 ↔ ∃*𝑥𝜓))
6	1, 5	sylbi 220	1 ⊢ (∀𝑥(𝜑 ↔ 𝜓) → (∃*𝑥𝜑 ↔ ∃*𝑥𝜓))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 400  ∀wal 1568  ∃*wmo 2565

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038

This proof depends on definitions:  df-bi 210  df-an 401  df-ex 1810  df-mo 2567

This theorem is used by:  mobii  2576  mobidv  2577  mobid  2578  eubi  2612