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

Theorem con4biddc 825
 Description: A contraposition deduction. (Contributed by Jim Kingdon, 18-May-2018.)
Hypothesis
Ref Expression
con4biddc.1 DECID DECID
Assertion
Ref Expression
con4biddc DECID DECID

Proof of Theorem con4biddc
StepHypRef Expression
1 con4biddc.1 . . . . . 6 DECID DECID
2 bi2 129 . . . . . 6
31, 2syl8 71 . . . . 5 DECID DECID
4 condc 821 . . . . . 6 DECID
54a2i 11 . . . . 5 DECID DECID
63, 5syl6 33 . . . 4 DECID DECID
76imp31 254 . . 3 DECID DECID
8 bi1 117 . . . . . 6
91, 8syl8 71 . . . . 5 DECID DECID
10 condc 821 . . . . . 6 DECID
1110imim2d 54 . . . . 5 DECID DECID DECID
129, 11sylcom 28 . . . 4 DECID DECID
1312imp31 254 . . 3 DECID DECID
147, 13impbid 128 . 2 DECID DECID
1514exp31 359 1 DECID DECID
 Colors of variables: wff set class Syntax hints:   wn 3   wi 4   wa 103   wb 104  DECID wdc 802 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 586  ax-in2 587  ax-io 681 This theorem depends on definitions:  df-bi 116  df-stab 799  df-dc 803 This theorem is referenced by:  necon4abiddc  2356
 Copyright terms: Public domain W3C validator