ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  pm5.17dc Structured version   Unicode version

Theorem pm5.17dc 809
Description: Two ways of stating exclusive-or which are equivalent for a decidable proposition. Based on theorem *5.17 of [WhiteheadRussell] p. 124. (Contributed by Jim Kingdon, 16-Apr-2018.)
Assertion
Ref Expression
pm5.17dc DECID

Proof of Theorem pm5.17dc
StepHypRef Expression
1 bicom 128 . 2
2 dfbi2 368 . . 3
3 orcom 646 . . . . 5
4 dfordc 790 . . . . 5 DECID
53, 4syl5rbb 182 . . . 4 DECID
6 imnan 623 . . . . 5
76a1i 9 . . . 4 DECID
85, 7anbi12d 442 . . 3 DECID
92, 8syl5bb 181 . 2 DECID
101, 9syl5rbb 182 1 DECID
Colors of variables: wff set class
Syntax hints:   wn 3   wi 4   wa 97   wb 98   wo 628  DECID wdc 741
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in1 544  ax-in2 545  ax-io 629
This theorem depends on definitions:  df-bi 110  df-dc 742
This theorem is referenced by:  xor2dc  1278
  Copyright terms: Public domain W3C validator