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

Theorem xor3dc 1275
Description: Two ways to express "exclusive or" between decidable propositions. (Contributed by Jim Kingdon, 12-Apr-2018.)
Assertion
Ref Expression
xor3dc DECID DECID

Proof of Theorem xor3dc
StepHypRef Expression
1 dcn 745 . . . . . 6 DECID DECID
2 dcbi 843 . . . . . 6 DECID DECID DECID
31, 2syl5 28 . . . . 5 DECID DECID DECID
43imp 115 . . . 4 DECID DECID DECID
5 pm5.18dc 776 . . . . . . 7 DECID DECID
65imp 115 . . . . . 6 DECID DECID
76a1d 22 . . . . 5 DECID DECID DECID
87con2biddc 773 . . . 4 DECID DECID DECID
94, 8mpd 13 . . 3 DECID DECID
109bicomd 129 . 2 DECID DECID
1110ex 108 1 DECID DECID
Colors of variables: wff set class
Syntax hints:   wn 3   wi 4   wa 97   wb 98  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:  pm5.15dc  1277  xor2dc  1278  nbbndc  1282
  Copyright terms: Public domain W3C validator