Theorem pm2.61ii 185

Description: Inference eliminating two antecedents. (Contributed by NM, 4-Jan-1993.) (Proof shortened by Josh Purinton, 29-Dec-2000.)

Hypotheses

Ref	Expression
pm2.61ii.1	⊢ (¬ 𝜑 → (¬ 𝜓 → 𝜒))
pm2.61ii.2	⊢ (𝜑 → 𝜒)
pm2.61ii.3	⊢ (𝜓 → 𝜒)

Assertion

Ref	Expression
pm2.61ii	⊢ 𝜒

Proof of Theorem pm2.61ii

Step	Hyp	Ref	Expression
1		pm2.61ii.2	. 2 ⊢ (𝜑 → 𝜒)
2		pm2.61ii.1	. . 3 ⊢ (¬ 𝜑 → (¬ 𝜓 → 𝜒))
3		pm2.61ii.3	. . 3 ⊢ (𝜓 → 𝜒)
4	2, 3	pm2.61d2 183	. 2 ⊢ (¬ 𝜑 → 𝜒)
5	1, 4	pm2.61i 184	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:  pm2.61iii  187  hbae  2460  pssnn  9191  alephadd  10669  axextnd  10683  axunnd  10688  axpownd  10693  axregndlem2  10695  axregnd  10696  axinfndlem1  10697  axinfnd  10698  2cshwcshw  14984  ressress  17434  frgrreg  31004  bj-hbaeb2  37826  hbae-o  40069  hbequid  40075  ax5eq  40098  ax5el  40103  odd2prm2  48924