Theorem simplbi2 385

Description: Deduction eliminating a conjunct. (Contributed by Alan Sare, 31-Dec-2011.)

Hypothesis

Ref	Expression
pm3.26bi2.1	⊢ (𝜑 ↔ (𝜓 ∧ 𝜒))

Assertion

Ref	Expression
simplbi2	⊢ (𝜓 → (𝜒 → 𝜑))

Proof of Theorem simplbi2

Step	Hyp	Ref	Expression
1		pm3.26bi2.1	. . 3 ⊢ (𝜑 ↔ (𝜓 ∧ 𝜒))
2	1	biimpri 133	. 2 ⊢ ((𝜓 ∧ 𝜒) → 𝜑)
3	2	ex 115	1 ⊢ (𝜓 → (𝜒 → 𝜑))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108

This proof depends on definitions:  df-bi 117

This theorem is used by:  pm5.62dc  958  pm5.63dc  959  simplbi2com  1494  reuss2  3513  elni2  7688  elpq  10067  elfz0ubfz0  10550  elfzmlbp  10557  fzo1fzo0n0  10613  elfzo0z  10614  fzofzim  10618  elfzodifsumelfzo  10637  swrdswrd  11500  swrdccatin1  11520  p1modz1  12587  dfgcd2  12817  algcvga  12855  pcprendvds  13099  usgruspgrben  16644  trlf1  16846