Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  ndmovordi Unicode version

Theorem ndmovordi 6197
 Description: Elimination of redundant antecedent in an ordering law. (Contributed by NM, 25-Jun-1998.)
Hypotheses
Ref Expression
ndmovordi.2
ndmovordi.4
ndmovordi.5
ndmovordi.6
Assertion
Ref Expression
ndmovordi

Proof of Theorem ndmovordi
StepHypRef Expression
1 ndmovordi.4 . . . . 5
21brel 4885 . . . 4
32simpld 446 . . 3
4 ndmovordi.2 . . . . 5
5 ndmovordi.5 . . . . 5
64, 5ndmovrcl 6192 . . . 4
76simpld 446 . . 3
83, 7syl 16 . 2
9 ndmovordi.6 . . 3
109biimprd 215 . 2
118, 10mpcom 34 1
 Colors of variables: wff set class Syntax hints:   wn 3   wi 4   wb 177   wceq 1649   wcel 1721   wss 3280  c0 3588   class class class wbr 4172   cxp 4835   cdm 4837  (class class class)co 6040 This theorem is referenced by:  ltexprlem4  8872  ltsosr  8925 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1662  ax-8 1683  ax-13 1723  ax-14 1725  ax-6 1740  ax-7 1745  ax-11 1757  ax-12 1946  ax-ext 2385  ax-sep 4290  ax-nul 4298  ax-pow 4337  ax-pr 4363 This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-eu 2258  df-mo 2259  df-clab 2391  df-cleq 2397  df-clel 2400  df-nfc 2529  df-ne 2569  df-ral 2671  df-rex 2672  df-rab 2675  df-v 2918  df-dif 3283  df-un 3285  df-in 3287  df-ss 3294  df-nul 3589  df-if 3700  df-sn 3780  df-pr 3781  df-op 3783  df-uni 3976  df-br 4173  df-opab 4227  df-xp 4843  df-dm 4847  df-iota 5377  df-fv 5421  df-ov 6043
 Copyright terms: Public domain W3C validator