Theorem con1dc 864

Description: Contraposition for a decidable proposition. Based on theorem *2.15 of [WhiteheadRussell] p. 102. (Contributed by Jim Kingdon, 29-Mar-2018.)

Assertion

Ref	Expression
con1dc	⊢ (DECID 𝜑 → ((¬ 𝜑 → 𝜓) → (¬ 𝜓 → 𝜑)))

Proof of Theorem con1dc

Step	Hyp	Ref	Expression
1		notnot 634	. . 3 ⊢ (𝜓 → ¬ ¬ 𝜓)
2	1	imim2i 12	. 2 ⊢ ((¬ 𝜑 → 𝜓) → (¬ 𝜑 → ¬ ¬ 𝜓))
3		condc 861	. 2 ⊢ (DECID 𝜑 → ((¬ 𝜑 → ¬ ¬ 𝜓) → (¬ 𝜓 → 𝜑)))
4	2, 3	syl5 32	1 ⊢ (DECID 𝜑 → ((¬ 𝜑 → 𝜓) → (¬ 𝜓 → 𝜑)))

Syntax hints:  ¬ wn 3   → wi 4  DECID wdc 842

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 619  ax-in2 620  ax-io 717

This theorem depends on definitions:  df-bi 117  df-stab 839  df-dc 843

This theorem is referenced by:  impidc  866  simplimdc  868  con1biimdc  881  con1bdc  886  pm3.13dc  968  necon1aidc  2463  necon1bidc  2464  necon1addc  2488  necon1bddc  2489  exmidapne  7570  bitsinv1lem  12640  phiprmpw  12912  fldivp1  13039  prmpwdvds  13046