Theorem pm5.54dc 903

Description: A conjunction is equivalent to one of its conjuncts, given a decidable conjunct. Based on theorem *5.54 of [WhiteheadRussell] p. 125. (Contributed by Jim Kingdon, 30-Mar-2018.)

Assertion

Ref	Expression
pm5.54dc	⊢ (DECID 𝜑 → (((𝜑 ∧ 𝜓) ↔ 𝜑) ∨ ((𝜑 ∧ 𝜓) ↔ 𝜓)))

Proof of Theorem pm5.54dc

Step	Hyp	Ref	Expression
1		df-dc 820	. . 3 ⊢ (DECID 𝜑 ↔ (𝜑 ∨ ¬ 𝜑))
2		simpr 109	. . . . 5 ⊢ ((𝜑 ∧ 𝜓) → 𝜓)
3		ax-ia3 107	. . . . 5 ⊢ (𝜑 → (𝜓 → (𝜑 ∧ 𝜓)))
4	2, 3	impbid2 142	. . . 4 ⊢ (𝜑 → ((𝜑 ∧ 𝜓) ↔ 𝜓))
5		simpl 108	. . . . 5 ⊢ ((𝜑 ∧ 𝜓) → 𝜑)
6		ax-in2 604	. . . . 5 ⊢ (¬ 𝜑 → (𝜑 → (𝜑 ∧ 𝜓)))
7	5, 6	impbid2 142	. . . 4 ⊢ (¬ 𝜑 → ((𝜑 ∧ 𝜓) ↔ 𝜑))
8	4, 7	orim12i 748	. . 3 ⊢ ((𝜑 ∨ ¬ 𝜑) → (((𝜑 ∧ 𝜓) ↔ 𝜓) ∨ ((𝜑 ∧ 𝜓) ↔ 𝜑)))
9	1, 8	sylbi 120	. 2 ⊢ (DECID 𝜑 → (((𝜑 ∧ 𝜓) ↔ 𝜓) ∨ ((𝜑 ∧ 𝜓) ↔ 𝜑)))
10	9	orcomd 718	1 ⊢ (DECID 𝜑 → (((𝜑 ∧ 𝜓) ↔ 𝜑) ∨ ((𝜑 ∧ 𝜓) ↔ 𝜓)))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 103   ↔ wb 104   ∨ wo 697  DECID wdc 819

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-in2 604  ax-io 698

This theorem depends on definitions:  df-bi 116  df-dc 820

This theorem is referenced by: (None)