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

Theorem ndmovordi 7055
Description: Elimination of redundant antecedent in an ordering law. (Contributed by NM, 25-Jun-1998.)
Hypotheses
Ref Expression
ndmovordi.2 dom 𝐹 = (𝑆 × 𝑆)
ndmovordi.4 𝑅 ⊆ (𝑆 × 𝑆)
ndmovordi.5 ¬ ∅ ∈ 𝑆
ndmovordi.6 (𝐶𝑆 → (𝐴𝑅𝐵 ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵)))
Assertion
Ref Expression
ndmovordi ((𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵) → 𝐴𝑅𝐵)

Proof of Theorem ndmovordi
StepHypRef Expression
1 ndmovordi.4 . . . . 5 𝑅 ⊆ (𝑆 × 𝑆)
21brel 5368 . . . 4 ((𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵) → ((𝐶𝐹𝐴) ∈ 𝑆 ∧ (𝐶𝐹𝐵) ∈ 𝑆))
32simpld 484 . . 3 ((𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵) → (𝐶𝐹𝐴) ∈ 𝑆)
4 ndmovordi.2 . . . . 5 dom 𝐹 = (𝑆 × 𝑆)
5 ndmovordi.5 . . . . 5 ¬ ∅ ∈ 𝑆
64, 5ndmovrcl 7050 . . . 4 ((𝐶𝐹𝐴) ∈ 𝑆 → (𝐶𝑆𝐴𝑆))
76simpld 484 . . 3 ((𝐶𝐹𝐴) ∈ 𝑆𝐶𝑆)
83, 7syl 17 . 2 ((𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵) → 𝐶𝑆)
9 ndmovordi.6 . . 3 (𝐶𝑆 → (𝐴𝑅𝐵 ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵)))
109biimprd 239 . 2 (𝐶𝑆 → ((𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵) → 𝐴𝑅𝐵))
118, 10mpcom 38 1 ((𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵) → 𝐴𝑅𝐵)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 197   = wceq 1637  wcel 2156  wss 3769  c0 4116   class class class wbr 4844   × cxp 5309  dom cdm 5311  (class class class)co 6874
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1877  ax-4 1894  ax-5 2001  ax-6 2068  ax-7 2104  ax-8 2158  ax-9 2165  ax-10 2185  ax-11 2201  ax-12 2214  ax-13 2420  ax-ext 2784  ax-sep 4975  ax-nul 4983  ax-pow 5035  ax-pr 5096
This theorem depends on definitions:  df-bi 198  df-an 385  df-or 866  df-3an 1102  df-tru 1641  df-ex 1860  df-nf 1864  df-sb 2061  df-eu 2634  df-mo 2635  df-clab 2793  df-cleq 2799  df-clel 2802  df-nfc 2937  df-ral 3101  df-rex 3102  df-rab 3105  df-v 3393  df-dif 3772  df-un 3774  df-in 3776  df-ss 3783  df-nul 4117  df-if 4280  df-sn 4371  df-pr 4373  df-op 4377  df-uni 4631  df-br 4845  df-opab 4907  df-xp 5317  df-dm 5321  df-iota 6064  df-fv 6109  df-ov 6877
This theorem is referenced by:  ltexprlem4  10146  ltsosr  10200
  Copyright terms: Public domain W3C validator