Theorem annimdc 933

Description: Express conjunction in terms of implication. The forward direction, annimim 682, is valid for all propositions, but as an equivalence, it requires a decidability condition. (Contributed by Jim Kingdon, 25-Apr-2018.)

Assertion

Ref	Expression
annimdc	⊢ (DECID 𝜑 → (DECID 𝜓 → ((𝜑 ∧ ¬ 𝜓) ↔ ¬ (𝜑 → 𝜓))))

Proof of Theorem annimdc

Step	Hyp	Ref	Expression
1		imandc 885	. . . 4 ⊢ (DECID 𝜓 → ((𝜑 → 𝜓) ↔ ¬ (𝜑 ∧ ¬ 𝜓)))
2	1	adantl 275	. . 3 ⊢ ((DECID 𝜑 ∧ DECID 𝜓) → ((𝜑 → 𝜓) ↔ ¬ (𝜑 ∧ ¬ 𝜓)))
3		dcim 837	. . . . 5 ⊢ (DECID 𝜑 → (DECID 𝜓 → DECID (𝜑 → 𝜓)))
4	3	imp 123	. . . 4 ⊢ ((DECID 𝜑 ∧ DECID 𝜓) → DECID (𝜑 → 𝜓))
5		dcn 838	. . . . . 6 ⊢ (DECID 𝜓 → DECID ¬ 𝜓)
6		dcan2 930	. . . . . 6 ⊢ (DECID 𝜑 → (DECID ¬ 𝜓 → DECID (𝜑 ∧ ¬ 𝜓)))
7	5, 6	syl5 32	. . . . 5 ⊢ (DECID 𝜑 → (DECID 𝜓 → DECID (𝜑 ∧ ¬ 𝜓)))
8	7	imp 123	. . . 4 ⊢ ((DECID 𝜑 ∧ DECID 𝜓) → DECID (𝜑 ∧ ¬ 𝜓))
9		con2bidc 871	. . . 4 ⊢ (DECID (𝜑 → 𝜓) → (DECID (𝜑 ∧ ¬ 𝜓) → (((𝜑 → 𝜓) ↔ ¬ (𝜑 ∧ ¬ 𝜓)) ↔ ((𝜑 ∧ ¬ 𝜓) ↔ ¬ (𝜑 → 𝜓)))))
10	4, 8, 9	sylc 62	. . 3 ⊢ ((DECID 𝜑 ∧ DECID 𝜓) → (((𝜑 → 𝜓) ↔ ¬ (𝜑 ∧ ¬ 𝜓)) ↔ ((𝜑 ∧ ¬ 𝜓) ↔ ¬ (𝜑 → 𝜓))))
11	2, 10	mpbid 146	. 2 ⊢ ((DECID 𝜑 ∧ DECID 𝜓) → ((𝜑 ∧ ¬ 𝜓) ↔ ¬ (𝜑 → 𝜓)))
12	11	ex 114	1 ⊢ (DECID 𝜑 → (DECID 𝜓 → ((𝜑 ∧ ¬ 𝜓) ↔ ¬ (𝜑 → 𝜓))))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 103   ↔ wb 104  DECID wdc 830

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 610  ax-in2 611  ax-io 705

This theorem depends on definitions:  df-bi 116  df-stab 827  df-dc 831

This theorem is referenced by:  xordidc  1395