Theorem pm3.11dc 957

Description: Theorem *3.11 of [WhiteheadRussell] p. 111, but for decidable propositions. The converse, pm3.1 754, holds for all propositions, not just decidable ones. (Contributed by Jim Kingdon, 22-Apr-2018.)

Assertion

Ref	Expression
pm3.11dc	|- (DECID ph -> (DECID ps -> ( -. ( -. ph \/ -. ps ) -> ( ph /\ ps ) ) ) )

Proof of Theorem pm3.11dc

Step	Hyp	Ref	Expression
1		anordc 956	. . . 4 |- (DECID ph -> (DECID ps -> ( ( ph /\ ps ) <-> -. ( -. ph \/ -. ps ) ) ) )
2	1	imp 124	. . 3 |- ( (DECID ph /\ DECID ps ) -> ( ( ph /\ ps ) <-> -. ( -. ph \/ -. ps ) ) )
3	2	biimprd 158	. 2 |- ( (DECID ph /\ DECID ps ) -> ( -. ( -. ph \/ -. ps ) -> ( ph /\ ps ) ) )
4	3	ex 115	1 |- (DECID ph -> (DECID ps -> ( -. ( -. ph \/ -. ps ) -> ( ph /\ ps ) ) ) )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   \/ wo 708  DECID wdc 834

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 614  ax-in2 615  ax-io 709

This theorem depends on definitions:  df-bi 117  df-stab 831  df-dc 835

This theorem is referenced by:  pm3.12dc  958  pm3.13dc  959