Theorem mo2dc 2069

Description: Alternate definition of "at most one" where existence is decidable. (Contributed by Jim Kingdon, 2-Jul-2018.)

Hypothesis

Ref	Expression
mo2dc.1	⊢ Ⅎ𝑦𝜑

Assertion

Ref	Expression
mo2dc	⊢ (DECID ∃𝑥𝜑 → (∃*𝑥𝜑 ↔ ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦)))

Distinct variable group:   𝑥,𝑦

Allowed substitution hints:   𝜑(𝑥,𝑦)

Proof of Theorem mo2dc

Step	Hyp	Ref	Expression
1		mo2dc.1	. . . 4 ⊢ Ⅎ𝑦𝜑
2	1	nfri 1507	. . 3 ⊢ (𝜑 → ∀𝑦𝜑)
3	2	mo3h 2067	. 2 ⊢ (∃*𝑥𝜑 ↔ ∀𝑥∀𝑦((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦))
4	1	modc 2057	. 2 ⊢ (DECID ∃𝑥𝜑 → (∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦) ↔ ∀𝑥∀𝑦((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)))
5	3, 4	bitr4id 198	1 ⊢ (DECID ∃𝑥𝜑 → (∃*𝑥𝜑 ↔ ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦)))

Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104  DECID wdc 824  ∀wal 1341  Ⅎwnf 1448  ∃wex 1480  [wsb 1750  ∃*wmo 2015

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523

This theorem depends on definitions:  df-bi 116  df-dc 825  df-tru 1346  df-fal 1349  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018

This theorem is referenced by: (None)