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

Theorem 19.30dc 1534
 Description: Theorem 19.30 of [Margaris] p. 90, with an additional decidability condition. (Contributed by Jim Kingdon, 21-Jul-2018.)
Assertion
Ref Expression
19.30dc (DECID𝑥𝜓 → (∀𝑥(𝜑𝜓) → (∀𝑥𝜑 ∨ ∃𝑥𝜓)))

Proof of Theorem 19.30dc
StepHypRef Expression
1 df-dc 754 . 2 (DECID𝑥𝜓 ↔ (∃𝑥𝜓 ∨ ¬ ∃𝑥𝜓))
2 olc 642 . . . 4 (∃𝑥𝜓 → (∀𝑥𝜑 ∨ ∃𝑥𝜓))
32a1d 22 . . 3 (∃𝑥𝜓 → (∀𝑥(𝜑𝜓) → (∀𝑥𝜑 ∨ ∃𝑥𝜓)))
4 alnex 1404 . . . . 5 (∀𝑥 ¬ 𝜓 ↔ ¬ ∃𝑥𝜓)
5 orel2 655 . . . . . 6 𝜓 → ((𝜑𝜓) → 𝜑))
65al2imi 1363 . . . . 5 (∀𝑥 ¬ 𝜓 → (∀𝑥(𝜑𝜓) → ∀𝑥𝜑))
74, 6sylbir 129 . . . 4 (¬ ∃𝑥𝜓 → (∀𝑥(𝜑𝜓) → ∀𝑥𝜑))
8 orc 643 . . . 4 (∀𝑥𝜑 → (∀𝑥𝜑 ∨ ∃𝑥𝜓))
97, 8syl6 33 . . 3 (¬ ∃𝑥𝜓 → (∀𝑥(𝜑𝜓) → (∀𝑥𝜑 ∨ ∃𝑥𝜓)))
103, 9jaoi 646 . 2 ((∃𝑥𝜓 ∨ ¬ ∃𝑥𝜓) → (∀𝑥(𝜑𝜓) → (∀𝑥𝜑 ∨ ∃𝑥𝜓)))
111, 10sylbi 118 1 (DECID𝑥𝜓 → (∀𝑥(𝜑𝜓) → (∀𝑥𝜑 ∨ ∃𝑥𝜓)))
 Colors of variables: wff set class Syntax hints:  ¬ wn 3   → wi 4   ∨ wo 639  DECID wdc 753  ∀wal 1257  ∃wex 1397 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-in1 554  ax-in2 555  ax-io 640  ax-5 1352  ax-gen 1354  ax-ie2 1399 This theorem depends on definitions:  df-bi 114  df-dc 754  df-tru 1262  df-fal 1265 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator