NFE Home New Foundations Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  NFE Home  >  Th. List  >  pm2.61da3ne Unicode version

Theorem pm2.61da3ne 2597
Description: Deduction eliminating three inequalities in an antecedent. (Contributed by NM, 15-Jun-2013.)
Hypotheses
Ref Expression
pm2.61da3ne.1
pm2.61da3ne.2
pm2.61da3ne.3
pm2.61da3ne.4
Assertion
Ref Expression
pm2.61da3ne

Proof of Theorem pm2.61da3ne
StepHypRef Expression
1 pm2.61da3ne.1 . 2
2 pm2.61da3ne.2 . 2
3 pm2.61da3ne.3 . . . 4
43adantlr 695 . . 3
5 simpll 730 . . . 4
6 simplrl 736 . . . 4
7 simplrr 737 . . . 4
8 simpr 447 . . . 4
9 pm2.61da3ne.4 . . . 4
105, 6, 7, 8, 9syl13anc 1184 . . 3
114, 10pm2.61dane 2595 . 2
121, 2, 11pm2.61da2ne 2596 1
Colors of variables: wff setvar class
Syntax hints:   wi 4   wa 358   w3a 934   wceq 1642   wne 2517
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8
This theorem depends on definitions:  df-bi 177  df-an 360  df-3an 936  df-ne 2519
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator