Theorem mpbiran3d 49727

Description: Equivalence with a conjunction one of whose conjuncts is a consequence of the other. Deduction form. (Contributed by Zhi Wang, 24-Sep-2024.)

Hypotheses

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

Assertion

Ref	Expression
mpbiran3d	⊢ (𝜑 → (𝜓 ↔ 𝜒))

Proof of Theorem mpbiran3d

Step	Hyp	Ref	Expression
1		mpbiran3d.1	. . . 4 ⊢ (𝜑 → (𝜓 ↔ (𝜒 ∧ 𝜃)))
2	1	simprbda 504	. . 3 ⊢ ((𝜑 ∧ 𝜓) → 𝜒)
3	2	ex 418	. 2 ⊢ (𝜑 → (𝜓 → 𝜒))
4		mpbiran3d.2	. . . . 5 ⊢ ((𝜑 ∧ 𝜒) → 𝜃)
5	4	ex 418	. . . 4 ⊢ (𝜑 → (𝜒 → 𝜃))
6	5	ancld 560	. . 3 ⊢ (𝜑 → (𝜒 → (𝜒 ∧ 𝜃)))
7	6, 1	sylibrd 262	. 2 ⊢ (𝜑 → (𝜒 → 𝜓))
8	3, 7	impbid 215	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:  mpbiran4d  49728  functhinc  50376  thincsect  50395  thincinv  50397  grptcmon  50521  grptcepi  50522