Metamath Proof Explorer


Theorem omndadd2rd

Description: In a left- and right- ordered monoid, the ordering is compatible with monoid addition. Double addition version. (Contributed by Thierry Arnoux, 2-May-2018)

Ref Expression
Hypotheses omndadd.0 ⊢ B = Base M
omndadd.1 ⊢ ≤ ˙ = ≤ M
omndadd.2 ⊢ + ˙ = + M
omndadd2d.m ⊢ φ → M ∈ oMnd
omndadd2d.w ⊢ φ → W ∈ B
omndadd2d.x ⊢ φ → X ∈ B
omndadd2d.y ⊢ φ → Y ∈ B
omndadd2d.z ⊢ φ → Z ∈ B
omndadd2d.1 ⊢ φ → X ≤ ˙ Z
omndadd2d.2 ⊢ φ → Y ≤ ˙ W
omndadd2rd.c ⊢ φ → opp 𝑔 ⁡ M ∈ oMnd
Assertion omndadd2rd ⊢ φ → X + ˙ Y ≤ ˙ Z + ˙ W

Proof

Step Hyp Ref Expression
1 omndadd.0 ⊢ B = Base M
2 omndadd.1 ⊢ ≤ ˙ = ≤ M
3 omndadd.2 ⊢ + ˙ = + M
4 omndadd2d.m ⊢ φ → M ∈ oMnd
5 omndadd2d.w ⊢ φ → W ∈ B
6 omndadd2d.x ⊢ φ → X ∈ B
7 omndadd2d.y ⊢ φ → Y ∈ B
8 omndadd2d.z ⊢ φ → Z ∈ B
9 omndadd2d.1 ⊢ φ → X ≤ ˙ Z
10 omndadd2d.2 ⊢ φ → Y ≤ ˙ W
11 omndadd2rd.c ⊢ φ → opp 𝑔 ⁡ M ∈ oMnd
12 omndtos ⊢ M ∈ oMnd → M ∈ Toset
13 tospos ⊢ M ∈ Toset → M ∈ Poset
14 4 12 13 3syl ⊢ φ → M ∈ Poset
15 omndmnd ⊢ M ∈ oMnd → M ∈ Mnd
16 4 15 syl ⊢ φ → M ∈ Mnd
17 1 3 mndcl ⊢ M ∈ Mnd ∧ X ∈ B ∧ Y ∈ B → X + ˙ Y ∈ B
18 16 6 7 17 syl3anc ⊢ φ → X + ˙ Y ∈ B
19 1 3 mndcl ⊢ M ∈ Mnd ∧ X ∈ B ∧ W ∈ B → X + ˙ W ∈ B
20 16 6 5 19 syl3anc ⊢ φ → X + ˙ W ∈ B
21 1 3 mndcl ⊢ M ∈ Mnd ∧ Z ∈ B ∧ W ∈ B → Z + ˙ W ∈ B
22 16 8 5 21 syl3anc ⊢ φ → Z + ˙ W ∈ B
23 18 20 22 3jca ⊢ φ → X + ˙ Y ∈ B ∧ X + ˙ W ∈ B ∧ Z + ˙ W ∈ B
24 1 2 3 omndaddr ⊢ opp 𝑔 ⁡ M ∈ oMnd ∧ Y ∈ B ∧ W ∈ B ∧ X ∈ B ∧ Y ≤ ˙ W → X + ˙ Y ≤ ˙ X + ˙ W
25 11 7 5 6 10 24 syl131anc ⊢ φ → X + ˙ Y ≤ ˙ X + ˙ W
26 1 2 3 omndadd ⊢ M ∈ oMnd ∧ X ∈ B ∧ Z ∈ B ∧ W ∈ B ∧ X ≤ ˙ Z → X + ˙ W ≤ ˙ Z + ˙ W
27 4 6 8 5 9 26 syl131anc ⊢ φ → X + ˙ W ≤ ˙ Z + ˙ W
28 1 2 postr ⊢ M ∈ Poset ∧ X + ˙ Y ∈ B ∧ X + ˙ W ∈ B ∧ Z + ˙ W ∈ B → X + ˙ Y ≤ ˙ X + ˙ W ∧ X + ˙ W ≤ ˙ Z + ˙ W → X + ˙ Y ≤ ˙ Z + ˙ W
29 28 imp ⊢ M ∈ Poset ∧ X + ˙ Y ∈ B ∧ X + ˙ W ∈ B ∧ Z + ˙ W ∈ B ∧ X + ˙ Y ≤ ˙ X + ˙ W ∧ X + ˙ W ≤ ˙ Z + ˙ W → X + ˙ Y ≤ ˙ Z + ˙ W
30 14 23 25 27 29 syl22anc ⊢ φ → X + ˙ Y ≤ ˙ Z + ˙ W