Theorem biimpac 296

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 158	. 2 ⊢ (𝜓 → (𝜑 → 𝜒))
3	2	imp 123	1 ⊢ ((𝜓 ∧ 𝜑) → 𝜒)

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

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

This theorem depends on definitions:  df-bi 116

This theorem is referenced by:  gencbvex2  2733  ordtri2or2exmidlem  4441  onsucelsucexmidlem  4444  ordsuc  4478  onsucuni2  4479  poltletr  4939  tz6.12-1  5448  nfunsn  5455  nnaordex  6423  th3qlem1  6531  ssfilem  6769  diffitest  6781  nqnq0pi  7246  distrlem1prl  7390  distrlem1pru  7391  eqle  7855  flodddiv4  11631