Theorem mobi 2550

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 1888	. 2 ⊢ (∀𝑥(𝜑 ↔ 𝜓) ↔ (∀𝑥(𝜑 → 𝜓) ∧ ∀𝑥(𝜓 → 𝜑)))
2		moim 2547	. . . 4 ⊢ (∀𝑥(𝜓 → 𝜑) → (∃*𝑥𝜑 → ∃*𝑥𝜓))
3		moim 2547	. . . 4 ⊢ (∀𝑥(𝜑 → 𝜓) → (∃*𝑥𝜓 → ∃*𝑥𝜑))
4	2, 3	impbid21d 211	. . 3 ⊢ (∀𝑥(𝜑 → 𝜓) → (∀𝑥(𝜓 → 𝜑) → (∃*𝑥𝜑 ↔ ∃*𝑥𝜓)))
5	4	imp 406	. 2 ⊢ ((∀𝑥(𝜑 → 𝜓) ∧ ∀𝑥(𝜓 → 𝜑)) → (∃*𝑥𝜑 ↔ ∃*𝑥𝜓))
6	1, 5	sylbi 217	1 ⊢ (∀𝑥(𝜑 ↔ 𝜓) → (∃*𝑥𝜑 ↔ ∃*𝑥𝜓))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395  ∀wal 1535  ∃*wmo 2541

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909

This theorem depends on definitions:  df-bi 207  df-an 396  df-ex 1778  df-mo 2543

This theorem is referenced by:  mobidv  2552  mobid  2553  eubi  2587