Theorem nmo 32165

Description: Negation of "at most one". (Contributed by Thierry Arnoux, 26-Feb-2017.)

Hypothesis

Ref	Expression
nmo.1	⊢ Ⅎ𝑦𝜑

Assertion

Ref	Expression
nmo	⊢ (¬ ∃*𝑥𝜑 ↔ ∀𝑦∃𝑥(𝜑 ∧ 𝑥 ≠ 𝑦))

Distinct variable group:   𝑥,𝑦

Allowed substitution hints:   𝜑(𝑥,𝑦)

Proof of Theorem nmo

Step	Hyp	Ref	Expression
1		nmo.1	. . . 4 ⊢ Ⅎ𝑦𝜑
2	1	mof 2556	. . 3 ⊢ (∃*𝑥𝜑 ↔ ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦))
3	2	notbii 320	. 2 ⊢ (¬ ∃*𝑥𝜑 ↔ ¬ ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦))
4		alnex 1782	. 2 ⊢ (∀𝑦 ¬ ∀𝑥(𝜑 → 𝑥 = 𝑦) ↔ ¬ ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦))
5		exnal 1828	. . . 4 ⊢ (∃𝑥 ¬ (𝜑 → 𝑥 = 𝑦) ↔ ¬ ∀𝑥(𝜑 → 𝑥 = 𝑦))
6		pm4.61 404	. . . . . 6 ⊢ (¬ (𝜑 → 𝑥 = 𝑦) ↔ (𝜑 ∧ ¬ 𝑥 = 𝑦))
7		biid 261	. . . . . . . 8 ⊢ (𝑥 = 𝑦 ↔ 𝑥 = 𝑦)
8	7	necon3bbii 2987	. . . . . . 7 ⊢ (¬ 𝑥 = 𝑦 ↔ 𝑥 ≠ 𝑦)
9	8	anbi2i 622	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝑥 = 𝑦) ↔ (𝜑 ∧ 𝑥 ≠ 𝑦))
10	6, 9	bitri 275	. . . . 5 ⊢ (¬ (𝜑 → 𝑥 = 𝑦) ↔ (𝜑 ∧ 𝑥 ≠ 𝑦))
11	10	exbii 1849	. . . 4 ⊢ (∃𝑥 ¬ (𝜑 → 𝑥 = 𝑦) ↔ ∃𝑥(𝜑 ∧ 𝑥 ≠ 𝑦))
12	5, 11	bitr3i 277	. . 3 ⊢ (¬ ∀𝑥(𝜑 → 𝑥 = 𝑦) ↔ ∃𝑥(𝜑 ∧ 𝑥 ≠ 𝑦))
13	12	albii 1820	. 2 ⊢ (∀𝑦 ¬ ∀𝑥(𝜑 → 𝑥 = 𝑦) ↔ ∀𝑦∃𝑥(𝜑 ∧ 𝑥 ≠ 𝑦))
14	3, 4, 13	3bitr2i 299	1 ⊢ (¬ ∃*𝑥𝜑 ↔ ∀𝑦∃𝑥(𝜑 ∧ 𝑥 ≠ 𝑦))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 395  ∀wal 1538  ∃wex 1780  Ⅎwnf 1784  ∃*wmo 2531   ≠ wne 2939

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-10 2136  ax-11 2153  ax-12 2170

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-ex 1781  df-nf 1785  df-mo 2533  df-ne 2940

This theorem is referenced by: (None)