Theorem wl-ifpimpr 38389

Description: If one case of an if- condition is a consequence of the other, the expression in df-ifp 1079 can be shortened. (Contributed by Wolf Lammen, 12-Jun-2024.)

Assertion

Ref	Expression
wl-ifpimpr	⊢ ((𝜒 → 𝜓) → (if-(𝜑, 𝜓, 𝜒) ↔ ((𝜑 ∧ 𝜓) ∨ 𝜒)))

Proof of Theorem wl-ifpimpr

Step	Hyp	Ref	Expression
1		pm4.72 964	. . . . . . 7 ⊢ ((𝜒 → 𝜓) ↔ (𝜓 ↔ (𝜒 ∨ 𝜓)))
2	1	biimpi 219	. . . . . 6 ⊢ ((𝜒 → 𝜓) → (𝜓 ↔ (𝜒 ∨ 𝜓)))
3		orcom 884	. . . . . 6 ⊢ ((𝜒 ∨ 𝜓) ↔ (𝜓 ∨ 𝜒))
4	2, 3	bitrdi 290	. . . . 5 ⊢ ((𝜒 → 𝜓) → (𝜓 ↔ (𝜓 ∨ 𝜒)))
5	4	anbi2d 642	. . . 4 ⊢ ((𝜒 → 𝜓) → ((𝜑 ∧ 𝜓) ↔ (𝜑 ∧ (𝜓 ∨ 𝜒))))
6		andi 1025	. . . 4 ⊢ ((𝜑 ∧ (𝜓 ∨ 𝜒)) ↔ ((𝜑 ∧ 𝜓) ∨ (𝜑 ∧ 𝜒)))
7	5, 6	bitrdi 290	. . 3 ⊢ ((𝜒 → 𝜓) → ((𝜑 ∧ 𝜓) ↔ ((𝜑 ∧ 𝜓) ∨ (𝜑 ∧ 𝜒))))
8	7	orbi1d 930	. 2 ⊢ ((𝜒 → 𝜓) → (((𝜑 ∧ 𝜓) ∨ (¬ 𝜑 ∧ 𝜒)) ↔ (((𝜑 ∧ 𝜓) ∨ (𝜑 ∧ 𝜒)) ∨ (¬ 𝜑 ∧ 𝜒))))
9		df-ifp 1079	. 2 ⊢ (if-(𝜑, 𝜓, 𝜒) ↔ ((𝜑 ∧ 𝜓) ∨ (¬ 𝜑 ∧ 𝜒)))
10		biidd 265	. . . . 5 ⊢ (𝜑 → (𝜒 ↔ 𝜒))
11		biidd 265	. . . . 5 ⊢ (¬ 𝜑 → (𝜒 ↔ 𝜒))
12	10, 11	cases 1058	. . . 4 ⊢ (𝜒 ↔ ((𝜑 ∧ 𝜒) ∨ (¬ 𝜑 ∧ 𝜒)))
13	12	orbi2i 926	. . 3 ⊢ (((𝜑 ∧ 𝜓) ∨ 𝜒) ↔ ((𝜑 ∧ 𝜓) ∨ ((𝜑 ∧ 𝜒) ∨ (¬ 𝜑 ∧ 𝜒))))
14		orass 935	. . 3 ⊢ ((((𝜑 ∧ 𝜓) ∨ (𝜑 ∧ 𝜒)) ∨ (¬ 𝜑 ∧ 𝜒)) ↔ ((𝜑 ∧ 𝜓) ∨ ((𝜑 ∧ 𝜒) ∨ (¬ 𝜑 ∧ 𝜒))))
15	13, 14	bitr4i 281	. 2 ⊢ (((𝜑 ∧ 𝜓) ∨ 𝜒) ↔ (((𝜑 ∧ 𝜓) ∨ (𝜑 ∧ 𝜒)) ∨ (¬ 𝜑 ∧ 𝜒)))
16	8, 9, 15	3bitr4g 317	1 ⊢ ((𝜒 → 𝜓) → (if-(𝜑, 𝜓, 𝜒) ↔ ((𝜑 ∧ 𝜓) ∨ 𝜒)))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861  if-wif 1078

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-ifp 1079

This theorem is used by:  wl-ifp4impr  38390  wl-df2-3mintru2  38408