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

Theorem modc 2069
Description: Equivalent definitions of "there exists at most one," given decidable existence. (Contributed by Jim Kingdon, 1-Jul-2018.)
Hypothesis
Ref Expression
modc.1 𝑦𝜑
Assertion
Ref Expression
modc (DECID𝑥𝜑 → (∃𝑦𝑥(𝜑𝑥 = 𝑦) ↔ ∀𝑥𝑦((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)))
Distinct variable group:   𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥,𝑦)

Proof of Theorem modc
StepHypRef Expression
1 modc.1 . . 3 𝑦𝜑
21mo23 2067 . 2 (∃𝑦𝑥(𝜑𝑥 = 𝑦) → ∀𝑥𝑦((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦))
3 exmiddc 836 . . 3 (DECID𝑥𝜑 → (∃𝑥𝜑 ∨ ¬ ∃𝑥𝜑))
41mor 2068 . . . 4 (∃𝑥𝜑 → (∀𝑥𝑦((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦) → ∃𝑦𝑥(𝜑𝑥 = 𝑦)))
51mo2n 2054 . . . . 5 (¬ ∃𝑥𝜑 → ∃𝑦𝑥(𝜑𝑥 = 𝑦))
65a1d 22 . . . 4 (¬ ∃𝑥𝜑 → (∀𝑥𝑦((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦) → ∃𝑦𝑥(𝜑𝑥 = 𝑦)))
74, 6jaoi 716 . . 3 ((∃𝑥𝜑 ∨ ¬ ∃𝑥𝜑) → (∀𝑥𝑦((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦) → ∃𝑦𝑥(𝜑𝑥 = 𝑦)))
83, 7syl 14 . 2 (DECID𝑥𝜑 → (∀𝑥𝑦((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦) → ∃𝑦𝑥(𝜑𝑥 = 𝑦)))
92, 8impbid2 143 1 (DECID𝑥𝜑 → (∃𝑦𝑥(𝜑𝑥 = 𝑦) ↔ ∀𝑥𝑦((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wb 105  wo 708  DECID wdc 834  wal 1351  wnf 1460  wex 1492  [wsb 1762
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-11 1506  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535
This theorem depends on definitions:  df-bi 117  df-dc 835  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763
This theorem is referenced by:  mo2dc  2081
  Copyright terms: Public domain W3C validator