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  4944  xmulpnf1  13407  odd2np1  16516  eltg3i  23284  restntr  23505  cmpcld  23725  rnelfm  24277  ovolctb2  25818  noextendseq  28029  iscgra  29321  isinag  29362  isleag  29371  iseqlg  29417  omlsilem  32009  mblfinlem3  38670