Theorem mo5f 33132

Description: Alternate definition of "at most one." (Contributed by Thierry Arnoux, 1-Mar-2017.)

Hypotheses

Ref	Expression
mo5f.1	⊢ Ⅎ𝑖𝜑
mo5f.2	⊢ Ⅎ𝑗𝜑

Assertion

Ref	Expression
mo5f	⊢ (∃*𝑥𝜑 ↔ ∀𝑖∀𝑗(([𝑖 / 𝑥]𝜑 ∧ [𝑗 / 𝑥]𝜑) → 𝑖 = 𝑗))

Distinct variable group:   𝑖,𝑗,𝑥

Allowed substitution hints:   𝜑(𝑥, 𝑖, 𝑗)

Proof of Theorem mo5f

Step	Hyp	Ref	Expression
1		mo5f.2	. . 3 ⊢ Ⅎ𝑗𝜑
2	1	mo3 2589	. 2 ⊢ (∃*𝑥𝜑 ↔ ∀𝑥∀𝑗((𝜑 ∧ [𝑗 / 𝑥]𝜑) → 𝑥 = 𝑗))
3		mo5f.1	. . . . . 6 ⊢ Ⅎ𝑖𝜑
4	3	nfsbv 2360	. . . . . 6 ⊢ Ⅎ𝑖[𝑗 / 𝑥]𝜑
5	3, 4	nfan 1931	. . . . 5 ⊢ Ⅎ𝑖(𝜑 ∧ [𝑗 / 𝑥]𝜑)
6		nfv 1946	. . . . 5 ⊢ Ⅎ𝑖 𝑥 = 𝑗
7	5, 6	nfim 1928	. . . 4 ⊢ Ⅎ𝑖((𝜑 ∧ [𝑗 / 𝑥]𝜑) → 𝑥 = 𝑗)
8	7	nfal 2353	. . 3 ⊢ Ⅎ𝑖∀𝑗((𝜑 ∧ [𝑗 / 𝑥]𝜑) → 𝑥 = 𝑗)
9	8	sb8f 2383	. 2 ⊢ (∀𝑥∀𝑗((𝜑 ∧ [𝑗 / 𝑥]𝜑) → 𝑥 = 𝑗) ↔ ∀𝑖[𝑖 / 𝑥]∀𝑗((𝜑 ∧ [𝑗 / 𝑥]𝜑) → 𝑥 = 𝑗))
10		sbim 2336	. . . . 5 ⊢ ([𝑖 / 𝑥]((𝜑 ∧ [𝑗 / 𝑥]𝜑) → 𝑥 = 𝑗) ↔ ([𝑖 / 𝑥](𝜑 ∧ [𝑗 / 𝑥]𝜑) → [𝑖 / 𝑥]𝑥 = 𝑗))
11		sban 2116	. . . . . . 7 ⊢ ([𝑖 / 𝑥](𝜑 ∧ [𝑗 / 𝑥]𝜑) ↔ ([𝑖 / 𝑥]𝜑 ∧ [𝑖 / 𝑥][𝑗 / 𝑥]𝜑))
12		nfs1v 2192	. . . . . . . . . 10 ⊢ Ⅎ𝑥[𝑗 / 𝑥]𝜑
13	12	sbf 2304	. . . . . . . . 9 ⊢ ([𝑖 / 𝑥][𝑗 / 𝑥]𝜑 ↔ [𝑗 / 𝑥]𝜑)
14	13	bicomi 227	. . . . . . . 8 ⊢ ([𝑗 / 𝑥]𝜑 ↔ [𝑖 / 𝑥][𝑗 / 𝑥]𝜑)
15	14	anbi2i 635	. . . . . . 7 ⊢ (([𝑖 / 𝑥]𝜑 ∧ [𝑗 / 𝑥]𝜑) ↔ ([𝑖 / 𝑥]𝜑 ∧ [𝑖 / 𝑥][𝑗 / 𝑥]𝜑))
16	11, 15	bitr4i 281	. . . . . 6 ⊢ ([𝑖 / 𝑥](𝜑 ∧ [𝑗 / 𝑥]𝜑) ↔ ([𝑖 / 𝑥]𝜑 ∧ [𝑗 / 𝑥]𝜑))
17		equsb3 2139	. . . . . 6 ⊢ ([𝑖 / 𝑥]𝑥 = 𝑗 ↔ 𝑖 = 𝑗)
18	16, 17	imbi12i 353	. . . . 5 ⊢ (([𝑖 / 𝑥](𝜑 ∧ [𝑗 / 𝑥]𝜑) → [𝑖 / 𝑥]𝑥 = 𝑗) ↔ (([𝑖 / 𝑥]𝜑 ∧ [𝑗 / 𝑥]𝜑) → 𝑖 = 𝑗))
19	10, 18	bitri 278	. . . 4 ⊢ ([𝑖 / 𝑥]((𝜑 ∧ [𝑗 / 𝑥]𝜑) → 𝑥 = 𝑗) ↔ (([𝑖 / 𝑥]𝜑 ∧ [𝑗 / 𝑥]𝜑) → 𝑖 = 𝑗))
20	19	sbalv 2206	. . 3 ⊢ ([𝑖 / 𝑥]∀𝑗((𝜑 ∧ [𝑗 / 𝑥]𝜑) → 𝑥 = 𝑗) ↔ ∀𝑗(([𝑖 / 𝑥]𝜑 ∧ [𝑗 / 𝑥]𝜑) → 𝑖 = 𝑗))
21	20	albii 1851	. 2 ⊢ (∀𝑖[𝑖 / 𝑥]∀𝑗((𝜑 ∧ [𝑗 / 𝑥]𝜑) → 𝑥 = 𝑗) ↔ ∀𝑖∀𝑗(([𝑖 / 𝑥]𝜑 ∧ [𝑗 / 𝑥]𝜑) → 𝑖 = 𝑗))
22	2, 9, 21	3bitri 300	1 ⊢ (∃*𝑥𝜑 ↔ ∀𝑖∀𝑗(([𝑖 / 𝑥]𝜑 ∧ [𝑗 / 𝑥]𝜑) → 𝑖 = 𝑗))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1567  Ⅎwnf 1815  [wsb 2098  ∃*wmo 2562

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-10 2177  ax-11 2193  ax-12 2212

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564

This theorem is used by: (None)