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

Theorem submomnd 20099
Description: A submonoid of an ordered monoid is also ordered. (Contributed by Thierry Arnoux, 23-Mar-2018.)
Assertion
Ref Expression
submomnd ((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) → (𝑀s 𝐴) ∈ oMnd)

Proof of Theorem submomnd
Dummy variables 𝑎 𝑏 𝑐 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpr 485 . 2 ((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) → (𝑀s 𝐴) ∈ Mnd)
2 omndtos 20094 . . . 4 (𝑀 ∈ oMnd → 𝑀 ∈ Toset)
32adantr 481 . . 3 ((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) → 𝑀 ∈ Toset)
4 reldmress 17194 . . . . . . . 8 Rel dom ↾s
54ovprc2 7397 . . . . . . 7 𝐴 ∈ V → (𝑀s 𝐴) = ∅)
65fveq2d 6832 . . . . . 6 𝐴 ∈ V → (Base‘(𝑀s 𝐴)) = (Base‘∅))
76adantl 482 . . . . 5 (((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ ¬ 𝐴 ∈ V) → (Base‘(𝑀s 𝐴)) = (Base‘∅))
8 base0 17176 . . . . 5 ∅ = (Base‘∅)
97, 8eqtr4di 2792 . . . 4 (((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ ¬ 𝐴 ∈ V) → (Base‘(𝑀s 𝐴)) = ∅)
10 eqid 2739 . . . . . . . 8 (Base‘(𝑀s 𝐴)) = (Base‘(𝑀s 𝐴))
11 eqid 2739 . . . . . . . 8 (0g‘(𝑀s 𝐴)) = (0g‘(𝑀s 𝐴))
1210, 11mndidcl 18709 . . . . . . 7 ((𝑀s 𝐴) ∈ Mnd → (0g‘(𝑀s 𝐴)) ∈ (Base‘(𝑀s 𝐴)))
1312ne0d 4271 . . . . . 6 ((𝑀s 𝐴) ∈ Mnd → (Base‘(𝑀s 𝐴)) ≠ ∅)
1413ad2antlr 733 . . . . 5 (((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ ¬ 𝐴 ∈ V) → (Base‘(𝑀s 𝐴)) ≠ ∅)
1514neneqd 2939 . . . 4 (((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ ¬ 𝐴 ∈ V) → ¬ (Base‘(𝑀s 𝐴)) = ∅)
169, 15condan 823 . . 3 ((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) → 𝐴 ∈ V)
17 resstos 18388 . . 3 ((𝑀 ∈ Toset ∧ 𝐴 ∈ V) → (𝑀s 𝐴) ∈ Toset)
183, 16, 17syl2anc 590 . 2 ((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) → (𝑀s 𝐴) ∈ Toset)
19 simplll 780 . . . . . 6 ((((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) ∧ 𝑎(le‘(𝑀s 𝐴))𝑏) → 𝑀 ∈ oMnd)
20 eqid 2739 . . . . . . . . . . 11 (𝑀s 𝐴) = (𝑀s 𝐴)
21 eqid 2739 . . . . . . . . . . 11 (Base‘𝑀) = (Base‘𝑀)
2220, 21ressbas 17198 . . . . . . . . . 10 (𝐴 ∈ V → (𝐴 ∩ (Base‘𝑀)) = (Base‘(𝑀s 𝐴)))
23 inss2 4167 . . . . . . . . . 10 (𝐴 ∩ (Base‘𝑀)) ⊆ (Base‘𝑀)
2422, 23eqsstrrdi 3960 . . . . . . . . 9 (𝐴 ∈ V → (Base‘(𝑀s 𝐴)) ⊆ (Base‘𝑀))
2516, 24syl 17 . . . . . . . 8 ((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) → (Base‘(𝑀s 𝐴)) ⊆ (Base‘𝑀))
2625ad2antrr 732 . . . . . . 7 ((((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) ∧ 𝑎(le‘(𝑀s 𝐴))𝑏) → (Base‘(𝑀s 𝐴)) ⊆ (Base‘𝑀))
27 simplr1 1222 . . . . . . 7 ((((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) ∧ 𝑎(le‘(𝑀s 𝐴))𝑏) → 𝑎 ∈ (Base‘(𝑀s 𝐴)))
2826, 27sseldd 3916 . . . . . 6 ((((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) ∧ 𝑎(le‘(𝑀s 𝐴))𝑏) → 𝑎 ∈ (Base‘𝑀))
29 simplr2 1223 . . . . . . 7 ((((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) ∧ 𝑎(le‘(𝑀s 𝐴))𝑏) → 𝑏 ∈ (Base‘(𝑀s 𝐴)))
3026, 29sseldd 3916 . . . . . 6 ((((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) ∧ 𝑎(le‘(𝑀s 𝐴))𝑏) → 𝑏 ∈ (Base‘𝑀))
31 simplr3 1224 . . . . . . 7 ((((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) ∧ 𝑎(le‘(𝑀s 𝐴))𝑏) → 𝑐 ∈ (Base‘(𝑀s 𝐴)))
3226, 31sseldd 3916 . . . . . 6 ((((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) ∧ 𝑎(le‘(𝑀s 𝐴))𝑏) → 𝑐 ∈ (Base‘𝑀))
33 eqid 2739 . . . . . . . . . . 11 (le‘𝑀) = (le‘𝑀)
3420, 33ressle 17335 . . . . . . . . . 10 (𝐴 ∈ V → (le‘𝑀) = (le‘(𝑀s 𝐴)))
3516, 34syl 17 . . . . . . . . 9 ((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) → (le‘𝑀) = (le‘(𝑀s 𝐴)))
3635adantr 481 . . . . . . . 8 (((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) → (le‘𝑀) = (le‘(𝑀s 𝐴)))
3736breqd 5084 . . . . . . 7 (((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) → (𝑎(le‘𝑀)𝑏𝑎(le‘(𝑀s 𝐴))𝑏))
3837biimpar 478 . . . . . 6 ((((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) ∧ 𝑎(le‘(𝑀s 𝐴))𝑏) → 𝑎(le‘𝑀)𝑏)
39 eqid 2739 . . . . . . 7 (+g𝑀) = (+g𝑀)
4021, 33, 39omndadd 20095 . . . . . 6 ((𝑀 ∈ oMnd ∧ (𝑎 ∈ (Base‘𝑀) ∧ 𝑏 ∈ (Base‘𝑀) ∧ 𝑐 ∈ (Base‘𝑀)) ∧ 𝑎(le‘𝑀)𝑏) → (𝑎(+g𝑀)𝑐)(le‘𝑀)(𝑏(+g𝑀)𝑐))
4119, 28, 30, 32, 38, 40syl131anc 1391 . . . . 5 ((((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) ∧ 𝑎(le‘(𝑀s 𝐴))𝑏) → (𝑎(+g𝑀)𝑐)(le‘𝑀)(𝑏(+g𝑀)𝑐))
4216adantr 481 . . . . . . . . 9 (((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) → 𝐴 ∈ V)
4320, 39ressplusg 17246 . . . . . . . . 9 (𝐴 ∈ V → (+g𝑀) = (+g‘(𝑀s 𝐴)))
4442, 43syl 17 . . . . . . . 8 (((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) → (+g𝑀) = (+g‘(𝑀s 𝐴)))
4544oveqd 7374 . . . . . . 7 (((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) → (𝑎(+g𝑀)𝑐) = (𝑎(+g‘(𝑀s 𝐴))𝑐))
4642, 34syl 17 . . . . . . 7 (((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) → (le‘𝑀) = (le‘(𝑀s 𝐴)))
4744oveqd 7374 . . . . . . 7 (((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) → (𝑏(+g𝑀)𝑐) = (𝑏(+g‘(𝑀s 𝐴))𝑐))
4845, 46, 47breq123d 5087 . . . . . 6 (((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) → ((𝑎(+g𝑀)𝑐)(le‘𝑀)(𝑏(+g𝑀)𝑐) ↔ (𝑎(+g‘(𝑀s 𝐴))𝑐)(le‘(𝑀s 𝐴))(𝑏(+g‘(𝑀s 𝐴))𝑐)))
4948adantr 481 . . . . 5 ((((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) ∧ 𝑎(le‘(𝑀s 𝐴))𝑏) → ((𝑎(+g𝑀)𝑐)(le‘𝑀)(𝑏(+g𝑀)𝑐) ↔ (𝑎(+g‘(𝑀s 𝐴))𝑐)(le‘(𝑀s 𝐴))(𝑏(+g‘(𝑀s 𝐴))𝑐)))
5041, 49mpbid 233 . . . 4 ((((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) ∧ 𝑎(le‘(𝑀s 𝐴))𝑏) → (𝑎(+g‘(𝑀s 𝐴))𝑐)(le‘(𝑀s 𝐴))(𝑏(+g‘(𝑀s 𝐴))𝑐))
5150ex 413 . . 3 (((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) → (𝑎(le‘(𝑀s 𝐴))𝑏 → (𝑎(+g‘(𝑀s 𝐴))𝑐)(le‘(𝑀s 𝐴))(𝑏(+g‘(𝑀s 𝐴))𝑐)))
5251ralrimivvva 3185 . 2 ((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) → ∀𝑎 ∈ (Base‘(𝑀s 𝐴))∀𝑏 ∈ (Base‘(𝑀s 𝐴))∀𝑐 ∈ (Base‘(𝑀s 𝐴))(𝑎(le‘(𝑀s 𝐴))𝑏 → (𝑎(+g‘(𝑀s 𝐴))𝑐)(le‘(𝑀s 𝐴))(𝑏(+g‘(𝑀s 𝐴))𝑐)))
53 eqid 2739 . . 3 (+g‘(𝑀s 𝐴)) = (+g‘(𝑀s 𝐴))
54 eqid 2739 . . 3 (le‘(𝑀s 𝐴)) = (le‘(𝑀s 𝐴))
5510, 53, 54isomnd 20090 . 2 ((𝑀s 𝐴) ∈ oMnd ↔ ((𝑀s 𝐴) ∈ Mnd ∧ (𝑀s 𝐴) ∈ Toset ∧ ∀𝑎 ∈ (Base‘(𝑀s 𝐴))∀𝑏 ∈ (Base‘(𝑀s 𝐴))∀𝑐 ∈ (Base‘(𝑀s 𝐴))(𝑎(le‘(𝑀s 𝐴))𝑏 → (𝑎(+g‘(𝑀s 𝐴))𝑐)(le‘(𝑀s 𝐴))(𝑏(+g‘(𝑀s 𝐴))𝑐))))
561, 18, 52, 55syl3anbrc 1350 1 ((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) → (𝑀s 𝐴) ∈ oMnd)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 207  wa 396  w3a 1092   = wceq 1547  wcel 2119  wne 2934  wral 3053  Vcvv 3431  cin 3882  wss 3883  c0 4262   class class class wbr 5073  cfv 6486  (class class class)co 7357  Basecbs 17171  s cress 17192  +gcplusg 17212  lecple 17219  0gc0g 17394  Tosetctos 18372  Mndcmnd 18694  oMndcomnd 20086
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-sep 5219  ax-nul 5229  ax-pow 5295  ax-pr 5363  ax-un 7679  ax-cnex 11086  ax-resscn 11087  ax-1cn 11088  ax-icn 11089  ax-addcl 11090  ax-addrcl 11091  ax-mulcl 11092  ax-mulrcl 11093  ax-mulcom 11094  ax-addass 11095  ax-mulass 11096  ax-distr 11097  ax-i2m1 11098  ax-1ne0 11099  ax-1rid 11100  ax-rnegex 11101  ax-rrecex 11102  ax-cnre 11103  ax-pre-lttri 11104  ax-pre-lttrn 11105  ax-pre-ltadd 11106  ax-pre-mulgt0 11107
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-nel 3039  df-ral 3054  df-rex 3064  df-rmo 3344  df-reu 3345  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3903  df-nul 4263  df-if 4456  df-pw 4532  df-sn 4557  df-pr 4559  df-op 4563  df-uni 4840  df-iun 4924  df-br 5074  df-opab 5136  df-mpt 5155  df-tr 5181  df-id 5514  df-eprel 5519  df-po 5527  df-so 5528  df-fr 5572  df-we 5574  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-pred 6253  df-ord 6314  df-on 6315  df-lim 6316  df-suc 6317  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-riota 7314  df-ov 7360  df-oprab 7361  df-mpo 7362  df-om 7808  df-2nd 7933  df-frecs 8222  df-wrecs 8253  df-recs 8302  df-rdg 8340  df-er 8634  df-en 8885  df-dom 8886  df-sdom 8887  df-pnf 11173  df-mnf 11174  df-xr 11175  df-ltxr 11176  df-le 11177  df-sub 11371  df-neg 11372  df-nn 12167  df-2 12236  df-3 12237  df-4 12238  df-5 12239  df-6 12240  df-7 12241  df-8 12242  df-9 12243  df-dec 12637  df-sets 17126  df-slot 17144  df-ndx 17156  df-base 17172  df-ress 17193  df-plusg 17225  df-ple 17232  df-0g 17396  df-poset 18271  df-toset 18373  df-mgm 18600  df-sgrp 18679  df-mnd 18695  df-omnd 20088
This theorem is referenced by:  suborng  20849  nn0omnd  33428
  Copyright terms: Public domain W3C validator