Theorem biadan 831

Description: An implication is equivalent to the equivalence of some implied equivalence and some other equivalence involving a conjunction. A utility lemma as illustrated in biadanii 834 and elelb 37809. (Contributed by BJ, 4-Mar-2023.) (Proof shortened by Wolf Lammen, 8-Mar-2023.)

Assertion

Ref	Expression
biadan	⊢ ((𝜑 → 𝜓) ↔ ((𝜓 → (𝜑 ↔ 𝜒)) ↔ (𝜑 ↔ (𝜓 ∧ 𝜒))))

Proof of Theorem biadan

Step	Hyp	Ref	Expression
1		pm4.71r 568	. 2 ⊢ ((𝜑 → 𝜓) ↔ (𝜑 ↔ (𝜓 ∧ 𝜑)))
2		bicom 225	. 2 ⊢ ((𝜑 ↔ (𝜓 ∧ 𝜑)) ↔ ((𝜓 ∧ 𝜑) ↔ 𝜑))
3		bicom 225	. . . 4 ⊢ ((𝜑 ↔ (𝜓 ∧ 𝜒)) ↔ ((𝜓 ∧ 𝜒) ↔ 𝜑))
4		pm5.32 584	. . . 4 ⊢ ((𝜓 → (𝜑 ↔ 𝜒)) ↔ ((𝜓 ∧ 𝜑) ↔ (𝜓 ∧ 𝜒)))
5	3, 4	bibi12i 342	. . 3 ⊢ (((𝜑 ↔ (𝜓 ∧ 𝜒)) ↔ (𝜓 → (𝜑 ↔ 𝜒))) ↔ (((𝜓 ∧ 𝜒) ↔ 𝜑) ↔ ((𝜓 ∧ 𝜑) ↔ (𝜓 ∧ 𝜒))))
6		bicom 225	. . 3 ⊢ (((𝜓 → (𝜑 ↔ 𝜒)) ↔ (𝜑 ↔ (𝜓 ∧ 𝜒))) ↔ ((𝜑 ↔ (𝜓 ∧ 𝜒)) ↔ (𝜓 → (𝜑 ↔ 𝜒))))
7		biluk 390	. . 3 ⊢ (((𝜓 ∧ 𝜑) ↔ 𝜑) ↔ (((𝜓 ∧ 𝜒) ↔ 𝜑) ↔ ((𝜓 ∧ 𝜑) ↔ (𝜓 ∧ 𝜒))))
8	5, 6, 7	3bitr4ri 307	. 2 ⊢ (((𝜓 ∧ 𝜑) ↔ 𝜑) ↔ ((𝜓 → (𝜑 ↔ 𝜒)) ↔ (𝜑 ↔ (𝜓 ∧ 𝜒))))
9	1, 2, 8	3bitri 300	1 ⊢ ((𝜑 → 𝜓) ↔ ((𝜓 → (𝜑 ↔ 𝜒)) ↔ (𝜑 ↔ (𝜓 ∧ 𝜒))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401

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

This theorem is used by:  biadani  832