Theorem biimpac 298

Description: Inference from a logical equivalence. (Contributed by NM, 3-May-1994.)

Hypothesis

Ref	Expression
biimpa.1	⊢ (𝜑 → (𝜓 ↔ 𝜒))

Assertion

Ref	Expression
biimpac	⊢ ((𝜓 ∧ 𝜑) → 𝜒)

Proof of Theorem biimpac

Step	Hyp	Ref	Expression
1		biimpa.1	. . 3 ⊢ (𝜑 → (𝜓 ↔ 𝜒))
2	1	biimpcd 159	. 2 ⊢ (𝜓 → (𝜑 → 𝜒))
3	2	imp 124	1 ⊢ ((𝜓 ∧ 𝜑) → 𝜒)

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107

This theorem depends on definitions:  df-bi 117

This theorem is referenced by:  gencbvex2  2870  ordtri2or2exmidlem  4668  onsucelsucexmidlem  4671  ordsuc  4705  onsucuni2  4706  poltletr  5183  tz6.12-1  5717  nfunsn  5727  nnaordex  6791  th3qlem1  6901  ssfilem  7167  ssfilemd  7169  diffitest  7181  nqnq0pi  7795  distrlem1prl  7939  distrlem1pru  7940  eqle  8407  swrd0g  11410  flodddiv4  12681  zabsle1  16032