Theorem mo4f 2597

Description: At-most-one quantifier expressed using implicit substitution. Note that the disjoint variable condition on 𝑦, 𝜑 can be replaced by the nonfreeness hypothesis ⊢ Ⅎ𝑦𝜑 with essentially the same proof. (Contributed by NM, 10-Apr-2004.) Remove dependency on ax-13 2406. (Revised by Wolf Lammen, 19-Jan-2023.)

Hypotheses

Ref	Expression
mo4f.1	⊢ Ⅎ𝑥𝜓
mo4f.2	⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))

Assertion

Ref	Expression
mo4f	⊢ (∃*𝑥𝜑 ↔ ∀𝑥∀𝑦((𝜑 ∧ 𝜓) → 𝑥 = 𝑦))

Distinct variable groups:   𝑥,𝑦   𝜑,𝑦

Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑥, 𝑦)

Proof of Theorem mo4f

Step	Hyp	Ref	Expression
1		nfv 1947	. . 3 ⊢ Ⅎ𝑦𝜑
2	1	mo3 2594	. 2 ⊢ (∃*𝑥𝜑 ↔ ∀𝑥∀𝑦((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦))
3		mo4f.1	. . . . . 6 ⊢ Ⅎ𝑥𝜓
4		mo4f.2	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
5	3, 4	sbiev 2349	. . . . 5 ⊢ ([𝑦 / 𝑥]𝜑 ↔ 𝜓)
6	5	anbi2i 635	. . . 4 ⊢ ((𝜑 ∧ [𝑦 / 𝑥]𝜑) ↔ (𝜑 ∧ 𝜓))
7	6	imbi1i 352	. . 3 ⊢ (((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦) ↔ ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦))
8	7	2albii 1853	. 2 ⊢ (∀𝑥∀𝑦((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦) ↔ ∀𝑥∀𝑦((𝜑 ∧ 𝜓) → 𝑥 = 𝑦))
9	2, 8	bitri 278	1 ⊢ (∃*𝑥𝜑 ↔ ∀𝑥∀𝑦((𝜑 ∧ 𝜓) → 𝑥 = 𝑦))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568  Ⅎwnf 1816  [wsb 2099  ∃*wmo 2567

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-10 2179  ax-11 2195  ax-12 2216

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569

This theorem is used by:  axextmo  2741  mob2  3680  moop2  5487