Theorem jcnd 164

Description: Deduction joining the consequents of two premises. (Contributed by Glauco Siliprandi, 11-Dec-2019.) (Proof shortened by Wolf Lammen, 10-Apr-2024.)

Hypotheses

Ref	Expression
jcnd.1	⊢ (𝜑 → 𝜓)
jcnd.2	⊢ (𝜑 → ¬ 𝜒)

Assertion

Ref	Expression
jcnd	⊢ (𝜑 → ¬ (𝜓 → 𝜒))

Proof of Theorem jcnd

Step	Hyp	Ref	Expression
1		jcnd.1	. 2 ⊢ (𝜑 → 𝜓)
2		jcnd.2	. 2 ⊢ (𝜑 → ¬ 𝜒)
3		jcn 163	. 2 ⊢ (𝜓 → (¬ 𝜒 → ¬ (𝜓 → 𝜒)))
4	1, 2, 3	sylc 66	1 ⊢ (𝜑 → ¬ (𝜓 → 𝜒))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4

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

This theorem is used by:  nf1const  7305  isf34lem4  10379  strlem6  32737  hstrlem6  32745  antnestlaw3lem  36269  antnestlaw1  36270  antnestlaw2  36271  nn0prpw  36942  unblimceq0  37204  relexpmulg  44550  limcrecl  46459  et-sqrtnegnre  47701  ichnreuop  48372