Theorem bj-andnotim 33917

Description: Two ways of expressing a certain ternary connective. Note the respective positions of the three formulas on each side of the biconditional. (Contributed by BJ, 6-Oct-2018.)

Assertion

Ref	Expression
bj-andnotim	⊢ (((𝜑 ∧ ¬ 𝜓) → 𝜒) ↔ ((𝜑 → 𝜓) ∨ 𝜒))

Proof of Theorem bj-andnotim

Step	Hyp	Ref	Expression
1		imor 849	. . 3 ⊢ (((𝜑 ∧ ¬ 𝜓) → 𝜒) ↔ (¬ (𝜑 ∧ ¬ 𝜓) ∨ 𝜒))
2		iman 404	. . . . 5 ⊢ ((𝜑 → 𝜓) ↔ ¬ (𝜑 ∧ ¬ 𝜓))
3	2	biimpri 230	. . . 4 ⊢ (¬ (𝜑 ∧ ¬ 𝜓) → (𝜑 → 𝜓))
4	3	orim1i 906	. . 3 ⊢ ((¬ (𝜑 ∧ ¬ 𝜓) ∨ 𝜒) → ((𝜑 → 𝜓) ∨ 𝜒))
5	1, 4	sylbi 219	. 2 ⊢ (((𝜑 ∧ ¬ 𝜓) → 𝜒) → ((𝜑 → 𝜓) ∨ 𝜒))
6		pm2.24 124	. . . . 5 ⊢ (𝜓 → (¬ 𝜓 → 𝜒))
7	6	imim2i 16	. . . 4 ⊢ ((𝜑 → 𝜓) → (𝜑 → (¬ 𝜓 → 𝜒)))
8	7	impd 413	. . 3 ⊢ ((𝜑 → 𝜓) → ((𝜑 ∧ ¬ 𝜓) → 𝜒))
9		ax-1 6	. . 3 ⊢ (𝜒 → ((𝜑 ∧ ¬ 𝜓) → 𝜒))
10	8, 9	jaoi 853	. 2 ⊢ (((𝜑 → 𝜓) ∨ 𝜒) → ((𝜑 ∧ ¬ 𝜓) → 𝜒))
11	5, 10	impbii 211	1 ⊢ (((𝜑 ∧ ¬ 𝜓) → 𝜒) ↔ ((𝜑 → 𝜓) ∨ 𝜒))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 208   ∧ wa 398   ∨ wo 843

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844

This theorem is referenced by: (None)