|   | 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 33078 | . . . 4 ⊢ (𝑀 ∈ oMnd ↔ (𝑀 ∈ Mnd ∧ 𝑀 ∈ Toset ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝑎 ≤ 𝑏 → (𝑎 + 𝑐) ≤ (𝑏 + 𝑐)))) | 
| 5 | 4 | simp3bi 1148 | . . 3 ⊢ (𝑀 ∈ oMnd → ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝑎 ≤ 𝑏 → (𝑎 + 𝑐) ≤ (𝑏 + 𝑐))) | 
| 6 | breq1 5146 | . . . . 5 ⊢ (𝑎 = 𝑋 → (𝑎 ≤ 𝑏 ↔ 𝑋 ≤ 𝑏)) | |
| 7 | oveq1 7438 | . . . . . 6 ⊢ (𝑎 = 𝑋 → (𝑎 + 𝑐) = (𝑋 + 𝑐)) | |
| 8 | 7 | breq1d 5153 | . . . . 5 ⊢ (𝑎 = 𝑋 → ((𝑎 + 𝑐) ≤ (𝑏 + 𝑐) ↔ (𝑋 + 𝑐) ≤ (𝑏 + 𝑐))) | 
| 9 | 6, 8 | imbi12d 344 | . . . 4 ⊢ (𝑎 = 𝑋 → ((𝑎 ≤ 𝑏 → (𝑎 + 𝑐) ≤ (𝑏 + 𝑐)) ↔ (𝑋 ≤ 𝑏 → (𝑋 + 𝑐) ≤ (𝑏 + 𝑐)))) | 
| 10 | breq2 5147 | . . . . 5 ⊢ (𝑏 = 𝑌 → (𝑋 ≤ 𝑏 ↔ 𝑋 ≤ 𝑌)) | |
| 11 | oveq1 7438 | . . . . . 6 ⊢ (𝑏 = 𝑌 → (𝑏 + 𝑐) = (𝑌 + 𝑐)) | |
| 12 | 11 | breq2d 5155 | . . . . 5 ⊢ (𝑏 = 𝑌 → ((𝑋 + 𝑐) ≤ (𝑏 + 𝑐) ↔ (𝑋 + 𝑐) ≤ (𝑌 + 𝑐))) | 
| 13 | 10, 12 | imbi12d 344 | . . . 4 ⊢ (𝑏 = 𝑌 → ((𝑋 ≤ 𝑏 → (𝑋 + 𝑐) ≤ (𝑏 + 𝑐)) ↔ (𝑋 ≤ 𝑌 → (𝑋 + 𝑐) ≤ (𝑌 + 𝑐)))) | 
| 14 | oveq2 7439 | . . . . . 6 ⊢ (𝑐 = 𝑍 → (𝑋 + 𝑐) = (𝑋 + 𝑍)) | |
| 15 | oveq2 7439 | . . . . . 6 ⊢ (𝑐 = 𝑍 → (𝑌 + 𝑐) = (𝑌 + 𝑍)) | |
| 16 | 14, 15 | breq12d 5156 | . . . . 5 ⊢ (𝑐 = 𝑍 → ((𝑋 + 𝑐) ≤ (𝑌 + 𝑐) ↔ (𝑋 + 𝑍) ≤ (𝑌 + 𝑍))) | 
| 17 | 16 | imbi2d 340 | . . . 4 ⊢ (𝑐 = 𝑍 → ((𝑋 ≤ 𝑌 → (𝑋 + 𝑐) ≤ (𝑌 + 𝑐)) ↔ (𝑋 ≤ 𝑌 → (𝑋 + 𝑍) ≤ (𝑌 + 𝑍)))) | 
| 18 | 9, 13, 17 | rspc3v 3638 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → (∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝑎 ≤ 𝑏 → (𝑎 + 𝑐) ≤ (𝑏 + 𝑐)) → (𝑋 ≤ 𝑌 → (𝑋 + 𝑍) ≤ (𝑌 + 𝑍)))) | 
| 19 | 5, 18 | mpan9 506 | . 2 ⊢ ((𝑀 ∈ oMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑋 ≤ 𝑌 → (𝑋 + 𝑍) ≤ (𝑌 + 𝑍))) | 
| 20 | 19 | 3impia 1118 | 1 ⊢ ((𝑀 ∈ oMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → (𝑋 + 𝑍) ≤ (𝑌 + 𝑍)) | 
| Colors of variables: wff setvar class | 
| Syntax hints: → wi 4 ∧ w3a 1087 = wceq 1540 ∈ wcel 2108 ∀wral 3061 class class class wbr 5143 ‘cfv 6561 (class class class)co 7431 Basecbs 17247 +gcplusg 17297 lecple 17304 Tosetctos 18461 Mndcmnd 18747 oMndcomnd 33074 | 
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2708 ax-nul 5306 | 
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2065 df-clab 2715 df-cleq 2729 df-clel 2816 df-ne 2941 df-ral 3062 df-rex 3071 df-rab 3437 df-v 3482 df-sbc 3789 df-dif 3954 df-un 3956 df-ss 3968 df-nul 4334 df-if 4526 df-sn 4627 df-pr 4629 df-op 4633 df-uni 4908 df-br 5144 df-iota 6514 df-fv 6569 df-ov 7434 df-omnd 33076 | 
| This theorem is referenced by: omndaddr 33084 omndadd2d 33085 omndadd2rd 33086 submomnd 33087 omndmul2 33089 omndmul3 33090 ogrpinv0le 33092 ogrpsub 33093 ogrpaddlt 33094 orngsqr 33334 ornglmulle 33335 orngrmulle 33336 | 
| Copyright terms: Public domain | W3C validator |