Theorem sylanblc 601

Description: Syllogism inference combined with a biconditional. (Contributed by BJ, 25-Apr-2019.)

Hypotheses

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

Assertion

Ref	Expression
sylanblc	⊢ (𝜑 → 𝜃)

Proof of Theorem sylanblc

Step	Hyp	Ref	Expression
1		sylanblc.1	. 2 ⊢ (𝜑 → 𝜓)
2		sylanblc.2	. 2 ⊢ 𝜒
3		sylanblc.3	. . 3 ⊢ ((𝜓 ∧ 𝜒) ↔ 𝜃)
4	3	biimpi 219	. 2 ⊢ ((𝜓 ∧ 𝜒) → 𝜃)
5	1, 2, 4	sylancl 598	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:  uniintsn  4948  xmulpnf1  13434  odd2np1  16543  eltg3i  23312  restntr  23533  cmpcld  23753  rnelfm  24305  ovolctb2  25846  noextendseq  28057  iscgra  29349  isinag  29390  isleag  29399  iseqlg  29445  omlsilem  32037  mblfinlem3  38782