ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  mo2dc GIF version

Theorem mo2dc 2061
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
StepHypRef Expression
1 mo2dc.1 . . . 4 𝑦𝜑
21nfri 1499 . . 3 (𝜑 → ∀𝑦𝜑)
32mo3h 2059 . 2 (∃*𝑥𝜑 ↔ ∀𝑥𝑦((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦))
41modc 2049 . 2 (DECID𝑥𝜑 → (∃𝑦𝑥(𝜑𝑥 = 𝑦) ↔ ∀𝑥𝑦((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)))
53, 4bitr4id 198 1 (DECID𝑥𝜑 → (∃*𝑥𝜑 ↔ ∃𝑦𝑥(𝜑𝑥 = 𝑦)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wb 104  DECID wdc 820  wal 1333  wnf 1440  wex 1472  [wsb 1742  ∃*wmo 2007
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 1427  ax-7 1428  ax-gen 1429  ax-ie1 1473  ax-ie2 1474  ax-8 1484  ax-10 1485  ax-11 1486  ax-i12 1487  ax-bndl 1489  ax-4 1490  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515
This theorem depends on definitions:  df-bi 116  df-dc 821  df-tru 1338  df-fal 1341  df-nf 1441  df-sb 1743  df-eu 2009  df-mo 2010
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator