Theorem ogrpsub 20068

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 20055	. . . . 5 ⊢ (𝐺 ∈ oGrp ↔ (𝐺 ∈ Grp ∧ 𝐺 ∈ oMnd))
2	1	simprbi 496	. . . 4 ⊢ (𝐺 ∈ oGrp → 𝐺 ∈ oMnd)
3	2	3ad2ant1 1133	. . 3 ⊢ ((𝐺 ∈ oGrp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → 𝐺 ∈ oMnd)
4		simp21 1207	. . 3 ⊢ ((𝐺 ∈ oGrp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → 𝑋 ∈ 𝐵)
5		simp22 1208	. . 3 ⊢ ((𝐺 ∈ oGrp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → 𝑌 ∈ 𝐵)
6		ogrpgrp 20056	. . . . 5 ⊢ (𝐺 ∈ oGrp → 𝐺 ∈ Grp)
7	6	3ad2ant1 1133	. . . 4 ⊢ ((𝐺 ∈ oGrp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → 𝐺 ∈ Grp)
8		simp23 1209	. . . 4 ⊢ ((𝐺 ∈ oGrp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → 𝑍 ∈ 𝐵)
9		ogrpsub.0	. . . . 5 ⊢ 𝐵 = (Base‘𝐺)
10		eqid 2736	. . . . 5 ⊢ (invg‘𝐺) = (invg‘𝐺)
11	9, 10	grpinvcl 18919	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑍 ∈ 𝐵) → ((invg‘𝐺)‘𝑍) ∈ 𝐵)
12	7, 8, 11	syl2anc 584	. . 3 ⊢ ((𝐺 ∈ oGrp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → ((invg‘𝐺)‘𝑍) ∈ 𝐵)
13		simp3 1138	. . 3 ⊢ ((𝐺 ∈ oGrp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → 𝑋 ≤ 𝑌)
14		ogrpsub.1	. . . 4 ⊢ ≤ = (le‘𝐺)
15		eqid 2736	. . . 4 ⊢ (+g‘𝐺) = (+g‘𝐺)
16	9, 14, 15	omndadd 20059	. . 3 ⊢ ((𝐺 ∈ oMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ ((invg‘𝐺)‘𝑍) ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑍)) ≤ (𝑌(+g‘𝐺)((invg‘𝐺)‘𝑍)))
17	3, 4, 5, 12, 13, 16	syl131anc 1385	. 2 ⊢ ((𝐺 ∈ oGrp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑍)) ≤ (𝑌(+g‘𝐺)((invg‘𝐺)‘𝑍)))
18		ogrpsub.2	. . . 4 ⊢ − = (-g‘𝐺)
19	9, 15, 10, 18	grpsubval 18917	. . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → (𝑋 − 𝑍) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑍)))
20	4, 8, 19	syl2anc 584	. 2 ⊢ ((𝐺 ∈ oGrp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → (𝑋 − 𝑍) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑍)))
21	9, 15, 10, 18	grpsubval 18917	. . 3 ⊢ ((𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → (𝑌 − 𝑍) = (𝑌(+g‘𝐺)((invg‘𝐺)‘𝑍)))
22	5, 8, 21	syl2anc 584	. 2 ⊢ ((𝐺 ∈ oGrp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → (𝑌 − 𝑍) = (𝑌(+g‘𝐺)((invg‘𝐺)‘𝑍)))
23	17, 20, 22	3brtr4d 5130	1 ⊢ ((𝐺 ∈ oGrp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → (𝑋 − 𝑍) ≤ (𝑌 − 𝑍))

Syntax hints:   → wi 4   ∧ w3a 1086   = wceq 1541   ∈ wcel 2113   class class class wbr 5098  ‘cfv 6492  (class class class)co 7358  Basecbs 17138  +_gcplusg 17179  lecple 17186  Grpcgrp 18865  inv_gcminusg 18866  -_gcsg 18867  oMndcomnd 20050  oGrpcogrp 20051

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rmo 3350  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-iun 4948  df-br 5099  df-opab 5161  df-mpt 5180  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-fv 6500  df-riota 7315  df-ov 7361  df-oprab 7362  df-mpo 7363  df-1st 7933  df-2nd 7934  df-0g 17363  df-mgm 18567  df-sgrp 18646  df-mnd 18662  df-grp 18868  df-minusg 18869  df-sbg 18870  df-omnd 20052  df-ogrp 20053

This theorem is referenced by:  ogrpsublt  20073  ornglmulle  20802  orngrmulle  20803  archiabllem1a  33275  archiabllem2c  33279