Theorem biadanid 835

Description: Deduction associated with biadani 832. Add a conjunction to an equivalence. (Contributed by Thierry Arnoux, 16-Jun-2024.)

Hypotheses

Ref	Expression
biadanid.1	⊢ ((𝜑 ∧ 𝜓) → 𝜒)
biadanid.2	⊢ ((𝜑 ∧ 𝜒) → (𝜓 ↔ 𝜃))

Assertion

Ref	Expression
biadanid	⊢ (𝜑 → (𝜓 ↔ (𝜒 ∧ 𝜃)))

Proof of Theorem biadanid

Step	Hyp	Ref	Expression
1		biadanid.1	. . 3 ⊢ ((𝜑 ∧ 𝜓) → 𝜒)
2		biadanid.2	. . . . . 6 ⊢ ((𝜑 ∧ 𝜒) → (𝜓 ↔ 𝜃))
3	2	biimpa 482	. . . . 5 ⊢ (((𝜑 ∧ 𝜒) ∧ 𝜓) → 𝜃)
4	3	an32s 665	. . . 4 ⊢ (((𝜑 ∧ 𝜓) ∧ 𝜒) → 𝜃)
5	1, 4	mpdan 700	. . 3 ⊢ ((𝜑 ∧ 𝜓) → 𝜃)
6	1, 5	jca 521	. 2 ⊢ ((𝜑 ∧ 𝜓) → (𝜒 ∧ 𝜃))
7	2	biimpar 483	. . 3 ⊢ (((𝜑 ∧ 𝜒) ∧ 𝜃) → 𝜓)
8	7	anasss 472	. 2 ⊢ ((𝜑 ∧ (𝜒 ∧ 𝜃)) → 𝜓)
9	6, 8	impbida 813	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:  dflidl2  21507  df2idl2  21551  psdmvr  22490  ist0cld  34465  thinccic  50578