Metamath Proof Explorer


Theorem omndadd

Description: In an ordered monoid, the ordering is compatible with group addition. (Contributed by Thierry Arnoux, 30-Jan-2018)

Ref Expression
Hypotheses omndadd.0 ⊢ B = Base M
omndadd.1 ⊢ ≤ ˙ = ≤ M
omndadd.2 ⊢ + ˙ = + M
Assertion omndadd ⊢ M ∈ oMnd ∧ X ∈ B ∧ Y ∈ B ∧ Z ∈ B ∧ X ≤ ˙ Y → X + ˙ Z ≤ ˙ Y + ˙ Z

Proof

Step Hyp Ref Expression
1 omndadd.0 ⊢ B = Base M
2 omndadd.1 ⊢ ≤ ˙ = ≤ M
3 omndadd.2 ⊢ + ˙ = + M
4 1 3 2 isomnd ⊢ M ∈ oMnd ↔ M ∈ Mnd ∧ M ∈ Toset ∧ ∀ a ∈ B ∀ b ∈ B ∀ c ∈ B a ≤ ˙ b → a + ˙ c ≤ ˙ b + ˙ c
5 4 simp3bi ⊢ M ∈ oMnd → ∀ a ∈ B ∀ b ∈ B ∀ c ∈ B a ≤ ˙ b → a + ˙ c ≤ ˙ b + ˙ c
6 breq1 ⊢ a = X → a ≤ ˙ b ↔ X ≤ ˙ b
7 oveq1 ⊢ a = X → a + ˙ c = X + ˙ c
8 7 breq1d ⊢ a = X → a + ˙ c ≤ ˙ b + ˙ c ↔ X + ˙ c ≤ ˙ b + ˙ c
9 6 8 imbi12d ⊢ a = X → a ≤ ˙ b → a + ˙ c ≤ ˙ b + ˙ c ↔ X ≤ ˙ b → X + ˙ c ≤ ˙ b + ˙ c
10 breq2 ⊢ b = Y → X ≤ ˙ b ↔ X ≤ ˙ Y
11 oveq1 ⊢ b = Y → b + ˙ c = Y + ˙ c
12 11 breq2d ⊢ b = Y → X + ˙ c ≤ ˙ b + ˙ c ↔ X + ˙ c ≤ ˙ Y + ˙ c
13 10 12 imbi12d ⊢ b = Y → X ≤ ˙ b → X + ˙ c ≤ ˙ b + ˙ c ↔ X ≤ ˙ Y → X + ˙ c ≤ ˙ Y + ˙ c
14 oveq2 ⊢ c = Z → X + ˙ c = X + ˙ Z
15 oveq2 ⊢ c = Z → Y + ˙ c = Y + ˙ Z
16 14 15 breq12d ⊢ c = Z → X + ˙ c ≤ ˙ Y + ˙ c ↔ X + ˙ Z ≤ ˙ Y + ˙ Z
17 16 imbi2d ⊢ c = Z → X ≤ ˙ Y → X + ˙ c ≤ ˙ Y + ˙ c ↔ X ≤ ˙ Y → X + ˙ Z ≤ ˙ Y + ˙ Z
18 9 13 17 rspc3v ⊢ X ∈ B ∧ Y ∈ B ∧ Z ∈ B → ∀ a ∈ B ∀ b ∈ B ∀ c ∈ B a ≤ ˙ b → a + ˙ c ≤ ˙ b + ˙ c → X ≤ ˙ Y → X + ˙ Z ≤ ˙ Y + ˙ Z
19 5 18 mpan9 ⊢ M ∈ oMnd ∧ X ∈ B ∧ Y ∈ B ∧ Z ∈ B → X ≤ ˙ Y → X + ˙ Z ≤ ˙ Y + ˙ Z
20 19 3impia ⊢ M ∈ oMnd ∧ X ∈ B ∧ Y ∈ B ∧ Z ∈ B ∧ X ≤ ˙ Y → X + ˙ Z ≤ ˙ Y + ˙ Z