Theorem mobid 2576

Description: Formula-building rule for the at-most-one quantifier (deduction form). (Contributed by NM, 8-Mar-1995.) Remove dependency on ax-10 2174, ax-11 2190, ax-13 2402. (Revised by BJ, 14-Oct-2022.) (Proof shortened by Wolf Lammen, 18-Feb-2023.)

Hypotheses

Ref	Expression
mobid.1	⊢ Ⅎ𝑥𝜑
mobid.2	⊢ (𝜑 → (𝜓 ↔ 𝜒))

Assertion

Ref	Expression
mobid	⊢ (𝜑 → (∃*𝑥𝜓 ↔ ∃*𝑥𝜒))

Proof of Theorem mobid

Step	Hyp	Ref	Expression
1		mobid.1	. . 3 ⊢ Ⅎ𝑥𝜑
2		mobid.2	. . 3 ⊢ (𝜑 → (𝜓 ↔ 𝜒))
3	1, 2	alrimi 2247	. 2 ⊢ (𝜑 → ∀𝑥(𝜓 ↔ 𝜒))
4		mobi 2573	. 2 ⊢ (∀𝑥(𝜓 ↔ 𝜒) → (∃*𝑥𝜓 ↔ ∃*𝑥𝜒))
5	3, 4	syl 18	1 ⊢ (𝜑 → (∃*𝑥𝜓 ↔ ∃*𝑥𝜒))

Syntax hints:   → wi 4   ↔ wb 209  ∀wal 1566  Ⅎwnf 1811  ∃*wmo 2563

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-12 2211

This theorem depends on definitions:  df-bi 210  df-an 401  df-ex 1808  df-nf 1812  df-mo 2565

This theorem is referenced by:  moanim  2646  rmobida  3390  rmoeq1f  3404  funcnvmpt  6991