Theorem ogrpsub 20107

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

Hypotheses

Ref	Expression
ogrpsub.0	⊢ 𝐵 = (Base‘𝐺)
ogrpsub.1	⊢ ≤ = (le‘𝐺)
ogrpsub.2	⊢ − = (-g‘𝐺)

Assertion

Ref	Expression
ogrpsub	⊢ ((𝐺 ∈ oGrp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → (𝑋 − 𝑍) ≤ (𝑌 − 𝑍))

Proof of Theorem ogrpsub

Step	Hyp	Ref	Expression
1		isogrp 20094	. . . . 5 ⊢ (𝐺 ∈ oGrp ↔ (𝐺 ∈ Grp ∧ 𝐺 ∈ oMnd))
2	1	simprbi 499	. . . 4 ⊢ (𝐺 ∈ oGrp → 𝐺 ∈ oMnd)
3	2	3ad2ant1 1140	. . 3 ⊢ ((𝐺 ∈ oGrp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → 𝐺 ∈ oMnd)
4		simp21 1214	. . 3 ⊢ ((𝐺 ∈ oGrp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → 𝑋 ∈ 𝐵)
5		simp22 1215	. . 3 ⊢ ((𝐺 ∈ oGrp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → 𝑌 ∈ 𝐵)
6		ogrpgrp 20095	. . . . 5 ⊢ (𝐺 ∈ oGrp → 𝐺 ∈ Grp)
7	6	3ad2ant1 1140	. . . 4 ⊢ ((𝐺 ∈ oGrp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → 𝐺 ∈ Grp)
8		simp23 1216	. . . 4 ⊢ ((𝐺 ∈ oGrp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → 𝑍 ∈ 𝐵)
9		ogrpsub.0	. . . . 5 ⊢ 𝐵 = (Base‘𝐺)
10		eqid 2741	. . . . 5 ⊢ (invg‘𝐺) = (invg‘𝐺)
11	9, 10	grpinvcl 18958	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑍 ∈ 𝐵) → ((invg‘𝐺)‘𝑍) ∈ 𝐵)
12	7, 8, 11	syl2anc 591	. . 3 ⊢ ((𝐺 ∈ oGrp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → ((invg‘𝐺)‘𝑍) ∈ 𝐵)
13		simp3 1145	. . 3 ⊢ ((𝐺 ∈ oGrp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → 𝑋 ≤ 𝑌)
14		ogrpsub.1	. . . 4 ⊢ ≤ = (le‘𝐺)
15		eqid 2741	. . . 4 ⊢ (+g‘𝐺) = (+g‘𝐺)
16	9, 14, 15	omndadd 20098	. . 3 ⊢ ((𝐺 ∈ oMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ ((invg‘𝐺)‘𝑍) ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑍)) ≤ (𝑌(+g‘𝐺)((invg‘𝐺)‘𝑍)))
17	3, 4, 5, 12, 13, 16	syl131anc 1392	. 2 ⊢ ((𝐺 ∈ oGrp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑍)) ≤ (𝑌(+g‘𝐺)((invg‘𝐺)‘𝑍)))
18		ogrpsub.2	. . . 4 ⊢ − = (-g‘𝐺)
19	9, 15, 10, 18	grpsubval 18956	. . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → (𝑋 − 𝑍) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑍)))
20	4, 8, 19	syl2anc 591	. 2 ⊢ ((𝐺 ∈ oGrp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → (𝑋 − 𝑍) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑍)))
21	9, 15, 10, 18	grpsubval 18956	. . 3 ⊢ ((𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → (𝑌 − 𝑍) = (𝑌(+g‘𝐺)((invg‘𝐺)‘𝑍)))
22	5, 8, 21	syl2anc 591	. 2 ⊢ ((𝐺 ∈ oGrp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → (𝑌 − 𝑍) = (𝑌(+g‘𝐺)((invg‘𝐺)‘𝑍)))
23	17, 20, 22	3brtr4d 5107	1 ⊢ ((𝐺 ∈ oGrp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → (𝑋 − 𝑍) ≤ (𝑌 − 𝑍))

Syntax hints:   → wi 4   ∧ w3a 1093   = wceq 1548   ∈ wcel 2121   class class class wbr 5075  ‘cfv 6489  (class class class)co 7360  Basecbs 17174  +_gcplusg 17215  lecple 17222  Grpcgrp 18904  inv_gcminusg 18905  -_gcsg 18906  oMndcomnd 20089  oGrpcogrp 20090

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-10 2154  ax-11 2170  ax-12 2191  ax-ext 2713  ax-sep 5221  ax-nul 5231  ax-pow 5297  ax-pr 5365  ax-un 7682

This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-nf 1792  df-sb 2075  df-mo 2545  df-eu 2575  df-clab 2720  df-cleq 2733  df-clel 2816  df-nfc 2890  df-ne 2937  df-ral 3056  df-rex 3066  df-rmo 3346  df-reu 3347  df-rab 3394  df-v 3435  df-sbc 3726  df-csb 3834  df-dif 3888  df-un 3890  df-in 3892  df-ss 3902  df-nul 4265  df-if 4458  df-pw 4534  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4842  df-iun 4926  df-br 5076  df-opab 5138  df-mpt 5157  df-id 5516  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-fv 6497  df-riota 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-1st 7935  df-2nd 7936  df-0g 17399  df-mgm 18603  df-sgrp 18682  df-mnd 18698  df-grp 18907  df-minusg 18908  df-sbg 18909  df-omnd 20091  df-ogrp 20092

This theorem is referenced by:  ogrpsublt  20112  ornglmulle  20843  orngrmulle  20844  archiabllem1a  33276  archiabllem2c  33280