Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > omndadd | Structured version Visualization version GIF version |
Description: In an ordered monoid, the ordering is compatible with group addition. (Contributed by Thierry Arnoux, 30-Jan-2018.) |
Ref | Expression |
---|---|
omndadd.0 | ⊢ 𝐵 = (Base‘𝑀) |
omndadd.1 | ⊢ ≤ = (le‘𝑀) |
omndadd.2 | ⊢ + = (+g‘𝑀) |
Ref | Expression |
---|---|
omndadd | ⊢ ((𝑀 ∈ oMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → (𝑋 + 𝑍) ≤ (𝑌 + 𝑍)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | omndadd.0 | . . . . 5 ⊢ 𝐵 = (Base‘𝑀) | |
2 | omndadd.2 | . . . . 5 ⊢ + = (+g‘𝑀) | |
3 | omndadd.1 | . . . . 5 ⊢ ≤ = (le‘𝑀) | |
4 | 1, 2, 3 | isomnd 30752 | . . . 4 ⊢ (𝑀 ∈ oMnd ↔ (𝑀 ∈ Mnd ∧ 𝑀 ∈ Toset ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝑎 ≤ 𝑏 → (𝑎 + 𝑐) ≤ (𝑏 + 𝑐)))) |
5 | 4 | simp3bi 1144 | . . 3 ⊢ (𝑀 ∈ oMnd → ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝑎 ≤ 𝑏 → (𝑎 + 𝑐) ≤ (𝑏 + 𝑐))) |
6 | breq1 5033 | . . . . 5 ⊢ (𝑎 = 𝑋 → (𝑎 ≤ 𝑏 ↔ 𝑋 ≤ 𝑏)) | |
7 | oveq1 7142 | . . . . . 6 ⊢ (𝑎 = 𝑋 → (𝑎 + 𝑐) = (𝑋 + 𝑐)) | |
8 | 7 | breq1d 5040 | . . . . 5 ⊢ (𝑎 = 𝑋 → ((𝑎 + 𝑐) ≤ (𝑏 + 𝑐) ↔ (𝑋 + 𝑐) ≤ (𝑏 + 𝑐))) |
9 | 6, 8 | imbi12d 348 | . . . 4 ⊢ (𝑎 = 𝑋 → ((𝑎 ≤ 𝑏 → (𝑎 + 𝑐) ≤ (𝑏 + 𝑐)) ↔ (𝑋 ≤ 𝑏 → (𝑋 + 𝑐) ≤ (𝑏 + 𝑐)))) |
10 | breq2 5034 | . . . . 5 ⊢ (𝑏 = 𝑌 → (𝑋 ≤ 𝑏 ↔ 𝑋 ≤ 𝑌)) | |
11 | oveq1 7142 | . . . . . 6 ⊢ (𝑏 = 𝑌 → (𝑏 + 𝑐) = (𝑌 + 𝑐)) | |
12 | 11 | breq2d 5042 | . . . . 5 ⊢ (𝑏 = 𝑌 → ((𝑋 + 𝑐) ≤ (𝑏 + 𝑐) ↔ (𝑋 + 𝑐) ≤ (𝑌 + 𝑐))) |
13 | 10, 12 | imbi12d 348 | . . . 4 ⊢ (𝑏 = 𝑌 → ((𝑋 ≤ 𝑏 → (𝑋 + 𝑐) ≤ (𝑏 + 𝑐)) ↔ (𝑋 ≤ 𝑌 → (𝑋 + 𝑐) ≤ (𝑌 + 𝑐)))) |
14 | oveq2 7143 | . . . . . 6 ⊢ (𝑐 = 𝑍 → (𝑋 + 𝑐) = (𝑋 + 𝑍)) | |
15 | oveq2 7143 | . . . . . 6 ⊢ (𝑐 = 𝑍 → (𝑌 + 𝑐) = (𝑌 + 𝑍)) | |
16 | 14, 15 | breq12d 5043 | . . . . 5 ⊢ (𝑐 = 𝑍 → ((𝑋 + 𝑐) ≤ (𝑌 + 𝑐) ↔ (𝑋 + 𝑍) ≤ (𝑌 + 𝑍))) |
17 | 16 | imbi2d 344 | . . . 4 ⊢ (𝑐 = 𝑍 → ((𝑋 ≤ 𝑌 → (𝑋 + 𝑐) ≤ (𝑌 + 𝑐)) ↔ (𝑋 ≤ 𝑌 → (𝑋 + 𝑍) ≤ (𝑌 + 𝑍)))) |
18 | 9, 13, 17 | rspc3v 3584 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → (∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝑎 ≤ 𝑏 → (𝑎 + 𝑐) ≤ (𝑏 + 𝑐)) → (𝑋 ≤ 𝑌 → (𝑋 + 𝑍) ≤ (𝑌 + 𝑍)))) |
19 | 5, 18 | mpan9 510 | . 2 ⊢ ((𝑀 ∈ oMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑋 ≤ 𝑌 → (𝑋 + 𝑍) ≤ (𝑌 + 𝑍))) |
20 | 19 | 3impia 1114 | 1 ⊢ ((𝑀 ∈ oMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → (𝑋 + 𝑍) ≤ (𝑌 + 𝑍)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1084 = wceq 1538 ∈ wcel 2111 ∀wral 3106 class class class wbr 5030 ‘cfv 6324 (class class class)co 7135 Basecbs 16475 +gcplusg 16557 lecple 16564 Tosetctos 17635 Mndcmnd 17903 oMndcomnd 30748 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-nul 5174 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ral 3111 df-rex 3112 df-rab 3115 df-v 3443 df-sbc 3721 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-iota 6283 df-fv 6332 df-ov 7138 df-omnd 30750 |
This theorem is referenced by: omndaddr 30758 omndadd2d 30759 omndadd2rd 30760 submomnd 30761 omndmul2 30763 omndmul3 30764 ogrpinv0le 30766 ogrpsub 30767 ogrpaddlt 30768 orngsqr 30928 ornglmulle 30929 orngrmulle 30930 |
Copyright terms: Public domain | W3C validator |