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

Theorem 19.33bdc 1537
Description: Converse of 19.33 1389 given ¬ (∃𝑥𝜑 ∧ ∃𝑥𝜓) and a decidability condition. Compare Theorem 19.33 of [Margaris] p. 90. For a version which does not require a decidability condition, see 19.33b2 1536 (Contributed by Jim Kingdon, 23-Apr-2018.)
Assertion
Ref Expression
19.33bdc (DECID𝑥𝜑 → (¬ (∃𝑥𝜑 ∧ ∃𝑥𝜓) → (∀𝑥(𝜑𝜓) ↔ (∀𝑥𝜑 ∨ ∀𝑥𝜓))))

Proof of Theorem 19.33bdc
StepHypRef Expression
1 ianordc 810 . 2 (DECID𝑥𝜑 → (¬ (∃𝑥𝜑 ∧ ∃𝑥𝜓) ↔ (¬ ∃𝑥𝜑 ∨ ¬ ∃𝑥𝜓)))
2 19.33b2 1536 . 2 ((¬ ∃𝑥𝜑 ∨ ¬ ∃𝑥𝜓) → (∀𝑥(𝜑𝜓) ↔ (∀𝑥𝜑 ∨ ∀𝑥𝜓)))
31, 2syl6bi 156 1 (DECID𝑥𝜑 → (¬ (∃𝑥𝜑 ∧ ∃𝑥𝜓) → (∀𝑥(𝜑𝜓) ↔ (∀𝑥𝜑 ∨ ∀𝑥𝜓))))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 101  wb 102  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