Theorem jarr 107

Description: Elimination of a nested antecedent. Sometimes called "Syll-Simp" since it is a syllogism applied to ax-1 6 ("Simplification"). (Contributed by Wolf Lammen, 9-May-2013.)

Assertion

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

Proof of Theorem jarr

Step	Hyp	Ref	Expression
1		ax-1 6	. 2 ⊢ (𝜓 → (𝜑 → 𝜓))
2	1	imim1i 64	1 ⊢ (((𝜑 → 𝜓) → 𝜒) → (𝜓 → 𝜒))

This proof depends on syntax axioms:   → wi 4

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7

This theorem is used by:  loolin  112  loowoz  113  minimp  1654  bj-stabpeirce  37185  bj-sbievw2  37522  ax3h  47671  adh-jarrsc  47778  adh-minimp  47791