Theorem condandc 775

Description: Proof by contradiction. This only holds for decidable propositions, as it is part of the family of theorems which assume -. ps, derive a contradiction, and therefore conclude ps. By contrast, assuming ps, deriving a contradiction, and therefore concluding -. ps, as in pm2.65 585, is valid for all propositions. (Contributed by Jim Kingdon, 13-May-2018.)

Hypotheses

Ref	Expression
condandc.1	|- ( ( ph /\ -. ps ) -> ch )
condandc.2	|- ( ( ph /\ -. ps ) -> -. ch )

Assertion

Ref	Expression
condandc	|- (DECID ps -> ( ph -> ps ) )

Proof of Theorem condandc

Step	Hyp	Ref	Expression
1		condandc.1	. . 3 |- ( ( ph /\ -. ps ) -> ch )
2		condandc.2	. . 3 |- ( ( ph /\ -. ps ) -> -. ch )
3	1, 2	pm2.65da 587	. 2 |- ( ph -> -. -. ps )
4		notnotrdc 751	. 2 |- (DECID ps -> ( -. -. ps -> ps ) )
5	3, 4	syl5 28	1 |- (DECID ps -> ( ph -> ps ) )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 97  DECID wdc 742

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 630

This theorem depends on definitions:  df-bi 110  df-dc 743

This theorem is referenced by: (None)