MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ogrpinv0le Structured version   Visualization version   GIF version

Theorem ogrpinv0le 20377
Description: In an ordered group, the ordering is compatible with group inverse. (Contributed by Thierry Arnoux, 3-Sep-2018.)
Hypotheses
Ref Expression
ogrpsub.0 𝐵 = (Base‘𝐺)
ogrpsub.1 ≤ = (le‘𝐺)
ogrpinv.2 𝐼 = (invg‘𝐺)
ogrpinv.3 0 = (0g‘𝐺)
Assertion
Ref Expression
ogrpinv0le ((𝐺 ∈ oGrp ∧ 𝑋 ∈ 𝐵) → ( 0 ≤ 𝑋 ↔ (𝐼‘𝑋) ≤ 0 ))

Proof of Theorem ogrpinv0le
StepHypRef Expression
1 isogrp 20365 . . . . . 6 (𝐺 ∈ oGrp ↔ (𝐺 ∈ Grp ∧ 𝐺 ∈ oMnd))
21simprbi 503 . . . . 5 (𝐺 ∈ oGrp → 𝐺 ∈ oMnd)
32ad2antrr 739 . . . 4 (((𝐺 ∈ oGrp ∧ 𝑋 ∈ 𝐵) ∧ 0 ≤ 𝑋) → 𝐺 ∈ oMnd)
4 omndmnd 20367 . . . . 5 (𝐺 ∈ oMnd → 𝐺 ∈ Mnd)
5 ogrpsub.0 . . . . . 6 𝐵 = (Base‘𝐺)
6 ogrpinv.3 . . . . . 6 0 = (0g‘𝐺)
75, 6mndidcl 18965 . . . . 5 (𝐺 ∈ Mnd → 0 ∈ 𝐵)
83, 4, 73syl 19 . . . 4 (((𝐺 ∈ oGrp ∧ 𝑋 ∈ 𝐵) ∧ 0 ≤ 𝑋) → 0 ∈ 𝐵)
9 simplr 781 . . . 4 (((𝐺 ∈ oGrp ∧ 𝑋 ∈ 𝐵) ∧ 0 ≤ 𝑋) → 𝑋 ∈ 𝐵)
10 ogrpgrp 20366 . . . . . 6 (𝐺 ∈ oGrp → 𝐺 ∈ Grp)
1110ad2antrr 739 . . . . 5 (((𝐺 ∈ oGrp ∧ 𝑋 ∈ 𝐵) ∧ 0 ≤ 𝑋) → 𝐺 ∈ Grp)
12 ogrpinv.2 . . . . . 6 𝐼 = (invg‘𝐺)
135, 12grpinvcl 19224 . . . . 5 ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝐼‘𝑋) ∈ 𝐵)
1411, 9, 13syl2anc 596 . . . 4 (((𝐺 ∈ oGrp ∧ 𝑋 ∈ 𝐵) ∧ 0 ≤ 𝑋) → (𝐼‘𝑋) ∈ 𝐵)
15 simpr 490 . . . 4 (((𝐺 ∈ oGrp ∧ 𝑋 ∈ 𝐵) ∧ 0 ≤ 𝑋) → 0 ≤ 𝑋)
16 ogrpsub.1 . . . . 5 ≤ = (le‘𝐺)
17 eqid 2763 . . . . 5 (+g‘𝐺) = (+g‘𝐺)
185, 16, 17omndadd 20369 . . . 4 ((𝐺 ∈ oMnd ∧ ( 0 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ (𝐼‘𝑋) ∈ 𝐵) ∧ 0 ≤ 𝑋) → ( 0 (+g‘𝐺)(𝐼‘𝑋)) ≤ (𝑋(+g‘𝐺)(𝐼‘𝑋)))
193, 8, 9, 14, 15, 18syl131anc 1411 . . 3 (((𝐺 ∈ oGrp ∧ 𝑋 ∈ 𝐵) ∧ 0 ≤ 𝑋) → ( 0 (+g‘𝐺)(𝐼‘𝑋)) ≤ (𝑋(+g‘𝐺)(𝐼‘𝑋)))
205, 17, 6grplid 19204 . . . 4 ((𝐺 ∈ Grp ∧ (𝐼‘𝑋) ∈ 𝐵) → ( 0 (+g‘𝐺)(𝐼‘𝑋)) = (𝐼‘𝑋))
2111, 14, 20syl2anc 596 . . 3 (((𝐺 ∈ oGrp ∧ 𝑋 ∈ 𝐵) ∧ 0 ≤ 𝑋) → ( 0 (+g‘𝐺)(𝐼‘𝑋)) = (𝐼‘𝑋))
225, 17, 6, 12grprinv 19227 . . . 4 ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋(+g‘𝐺)(𝐼‘𝑋)) = 0 )
2311, 9, 22syl2anc 596 . . 3 (((𝐺 ∈ oGrp ∧ 𝑋 ∈ 𝐵) ∧ 0 ≤ 𝑋) → (𝑋(+g‘𝐺)(𝐼‘𝑋)) = 0 )
2419, 21, 233brtr3d 5139 . 2 (((𝐺 ∈ oGrp ∧ 𝑋 ∈ 𝐵) ∧ 0 ≤ 𝑋) → (𝐼‘𝑋) ≤ 0 )
252ad2antrr 739 . . . 4 (((𝐺 ∈ oGrp ∧ 𝑋 ∈ 𝐵) ∧ (𝐼‘𝑋) ≤ 0 ) → 𝐺 ∈ oMnd)
2610ad2antrr 739 . . . . 5 (((𝐺 ∈ oGrp ∧ 𝑋 ∈ 𝐵) ∧ (𝐼‘𝑋) ≤ 0 ) → 𝐺 ∈ Grp)
27 simplr 781 . . . . 5 (((𝐺 ∈ oGrp ∧ 𝑋 ∈ 𝐵) ∧ (𝐼‘𝑋) ≤ 0 ) → 𝑋 ∈ 𝐵)
2826, 27, 13syl2anc 596 . . . 4 (((𝐺 ∈ oGrp ∧ 𝑋 ∈ 𝐵) ∧ (𝐼‘𝑋) ≤ 0 ) → (𝐼‘𝑋) ∈ 𝐵)
2925, 4, 73syl 19 . . . 4 (((𝐺 ∈ oGrp ∧ 𝑋 ∈ 𝐵) ∧ (𝐼‘𝑋) ≤ 0 ) → 0 ∈ 𝐵)
30 simpr 490 . . . 4 (((𝐺 ∈ oGrp ∧ 𝑋 ∈ 𝐵) ∧ (𝐼‘𝑋) ≤ 0 ) → (𝐼‘𝑋) ≤ 0 )
315, 16, 17omndadd 20369 . . . 4 ((𝐺 ∈ oMnd ∧ ((𝐼‘𝑋) ∈ 𝐵 ∧ 0 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ (𝐼‘𝑋) ≤ 0 ) → ((𝐼‘𝑋)(+g‘𝐺)𝑋) ≤ ( 0 (+g‘𝐺)𝑋))
3225, 28, 29, 27, 30, 31syl131anc 1411 . . 3 (((𝐺 ∈ oGrp ∧ 𝑋 ∈ 𝐵) ∧ (𝐼‘𝑋) ≤ 0 ) → ((𝐼‘𝑋)(+g‘𝐺)𝑋) ≤ ( 0 (+g‘𝐺)𝑋))
335, 17, 6, 12grplinv 19226 . . . 4 ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((𝐼‘𝑋)(+g‘𝐺)𝑋) = 0 )
3426, 27, 33syl2anc 596 . . 3 (((𝐺 ∈ oGrp ∧ 𝑋 ∈ 𝐵) ∧ (𝐼‘𝑋) ≤ 0 ) → ((𝐼‘𝑋)(+g‘𝐺)𝑋) = 0 )
355, 17, 6grplid 19204 . . . 4 ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ( 0 (+g‘𝐺)𝑋) = 𝑋)
3626, 27, 35syl2anc 596 . . 3 (((𝐺 ∈ oGrp ∧ 𝑋 ∈ 𝐵) ∧ (𝐼‘𝑋) ≤ 0 ) → ( 0 (+g‘𝐺)𝑋) = 𝑋)
3732, 34, 363brtr3d 5139 . 2 (((𝐺 ∈ oGrp ∧ 𝑋 ∈ 𝐵) ∧ (𝐼‘𝑋) ≤ 0 ) → 0 ≤ 𝑋)
3824, 37impbida 813 1 ((𝐺 ∈ oGrp ∧ 𝑋 ∈ 𝐵) → ( 0 ≤ 𝑋 ↔ (𝐼‘𝑋) ≤ 0 ))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147   class class class wbr 5106  ‘cfv 6555  (class class class)co 7440  Basecbs 17413  +gcplusg 17454  lecple 17461  0gc0g 17636  Mndcmnd 18949  Grpcgrp 19170  invgcminusg 19171  oMndcomnd 20360  oGrpcogrp 20361
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-fv 6563  df-riota 7397  df-ov 7443  df-0g 17638  df-mgm 18842  df-sgrp 18934  df-mnd 18950  df-grp 19173  df-minusg 19174  df-omnd 20362  df-ogrp 20363
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator