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

Theorem submomnd 20285
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 490 . 2 ((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) → (𝑀s 𝐴) ∈ Mnd)
2 omndtos 20280 . . . 4 (𝑀 ∈ oMnd → 𝑀 ∈ Toset)
32adantr 486 . . 3 ((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) → 𝑀 ∈ Toset)
4 reldmress 17349 . . . . . . . 8 Rel dom ↾s
54ovprc2 7456 . . . . . . 7 𝐴 ∈ V → (𝑀s 𝐴) = ∅)
65fveq2d 6885 . . . . . 6 𝐴 ∈ V → (Base‘(𝑀s 𝐴)) = (Base‘∅))
76adantl 487 . . . . 5 (((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ ¬ 𝐴 ∈ V) → (Base‘(𝑀s 𝐴)) = (Base‘∅))
8 base0 17331 . . . . 5 ∅ = (Base‘∅)
97, 8eqtr4di 2813 . . . 4 (((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ ¬ 𝐴 ∈ V) → (Base‘(𝑀s 𝐴)) = ∅)
10 eqid 2760 . . . . . . . 8 (Base‘(𝑀s 𝐴)) = (Base‘(𝑀s 𝐴))
11 eqid 2760 . . . . . . . 8 (0g‘(𝑀s 𝐴)) = (0g‘(𝑀s 𝐴))
1210, 11mndidcl 18878 . . . . . . 7 ((𝑀s 𝐴) ∈ Mnd → (0g‘(𝑀s 𝐴)) ∈ (Base‘(𝑀s 𝐴)))
1312ne0d 4288 . . . . . 6 ((𝑀s 𝐴) ∈ Mnd → (Base‘(𝑀s 𝐴)) ≠ ∅)
1413ad2antlr 740 . . . . 5 (((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ ¬ 𝐴 ∈ V) → (Base‘(𝑀s 𝐴)) ≠ ∅)
1514neneqd 2960 . . . 4 (((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ ¬ 𝐴 ∈ V) → ¬ (Base‘(𝑀s 𝐴)) = ∅)
169, 15condan 830 . . 3 ((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) → 𝐴 ∈ V)
17 resstos 18543 . . 3 ((𝑀 ∈ Toset ∧ 𝐴 ∈ V) → (𝑀s 𝐴) ∈ Toset)
183, 16, 17syl2anc 596 . 2 ((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) → (𝑀s 𝐴) ∈ Toset)
19 simplll 787 . . . . . 6 ((((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) ∧ 𝑎(le‘(𝑀s 𝐴))𝑏) → 𝑀 ∈ oMnd)
20 eqid 2760 . . . . . . . . . . 11 (𝑀s 𝐴) = (𝑀s 𝐴)
21 eqid 2760 . . . . . . . . . . 11 (Base‘𝑀) = (Base‘𝑀)
2220, 21ressbas 17353 . . . . . . . . . 10 (𝐴 ∈ V → (𝐴 ∩ (Base‘𝑀)) = (Base‘(𝑀s 𝐴)))
23 inss2 4183 . . . . . . . . . 10 (𝐴 ∩ (Base‘𝑀)) ⊆ (Base‘𝑀)
2422, 23eqsstrrdi 3976 . . . . . . . . 9 (𝐴 ∈ V → (Base‘(𝑀s 𝐴)) ⊆ (Base‘𝑀))
2516, 24syl 18 . . . . . . . 8 ((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) → (Base‘(𝑀s 𝐴)) ⊆ (Base‘𝑀))
2625ad2antrr 739 . . . . . . 7 ((((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) ∧ 𝑎(le‘(𝑀s 𝐴))𝑏) → (Base‘(𝑀s 𝐴)) ⊆ (Base‘𝑀))
27 simplr1 1234 . . . . . . 7 ((((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) ∧ 𝑎(le‘(𝑀s 𝐴))𝑏) → 𝑎 ∈ (Base‘(𝑀s 𝐴)))
2826, 27sseldd 3932 . . . . . 6 ((((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) ∧ 𝑎(le‘(𝑀s 𝐴))𝑏) → 𝑎 ∈ (Base‘𝑀))
29 simplr2 1235 . . . . . . 7 ((((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) ∧ 𝑎(le‘(𝑀s 𝐴))𝑏) → 𝑏 ∈ (Base‘(𝑀s 𝐴)))
3026, 29sseldd 3932 . . . . . 6 ((((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) ∧ 𝑎(le‘(𝑀s 𝐴))𝑏) → 𝑏 ∈ (Base‘𝑀))
31 simplr3 1236 . . . . . . 7 ((((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) ∧ 𝑎(le‘(𝑀s 𝐴))𝑏) → 𝑐 ∈ (Base‘(𝑀s 𝐴)))
3226, 31sseldd 3932 . . . . . 6 ((((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) ∧ 𝑎(le‘(𝑀s 𝐴))𝑏) → 𝑐 ∈ (Base‘𝑀))
33 eqid 2760 . . . . . . . . . . 11 (le‘𝑀) = (le‘𝑀)
3420, 33ressle 17490 . . . . . . . . . 10 (𝐴 ∈ V → (le‘𝑀) = (le‘(𝑀s 𝐴)))
3516, 34syl 18 . . . . . . . . 9 ((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) → (le‘𝑀) = (le‘(𝑀s 𝐴)))
3635adantr 486 . . . . . . . 8 (((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) → (le‘𝑀) = (le‘(𝑀s 𝐴)))
3736breqd 5114 . . . . . . 7 (((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) → (𝑎(le‘𝑀)𝑏𝑎(le‘(𝑀s 𝐴))𝑏))
3837biimpar 483 . . . . . 6 ((((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) ∧ 𝑎(le‘(𝑀s 𝐴))𝑏) → 𝑎(le‘𝑀)𝑏)
39 eqid 2760 . . . . . . 7 (+g𝑀) = (+g𝑀)
4021, 33, 39omndadd 20281 . . . . . 6 ((𝑀 ∈ oMnd ∧ (𝑎 ∈ (Base‘𝑀) ∧ 𝑏 ∈ (Base‘𝑀) ∧ 𝑐 ∈ (Base‘𝑀)) ∧ 𝑎(le‘𝑀)𝑏) → (𝑎(+g𝑀)𝑐)(le‘𝑀)(𝑏(+g𝑀)𝑐))
4119, 28, 30, 32, 38, 40syl131anc 1410 . . . . 5 ((((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) ∧ 𝑎(le‘(𝑀s 𝐴))𝑏) → (𝑎(+g𝑀)𝑐)(le‘𝑀)(𝑏(+g𝑀)𝑐))
4216adantr 486 . . . . . . . . 9 (((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) → 𝐴 ∈ V)
4320, 39ressplusg 17401 . . . . . . . . 9 (𝐴 ∈ V → (+g𝑀) = (+g‘(𝑀s 𝐴)))
4442, 43syl 18 . . . . . . . 8 (((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) → (+g𝑀) = (+g‘(𝑀s 𝐴)))
4544oveqd 7433 . . . . . . 7 (((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) → (𝑎(+g𝑀)𝑐) = (𝑎(+g‘(𝑀s 𝐴))𝑐))
4642, 34syl 18 . . . . . . 7 (((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) → (le‘𝑀) = (le‘(𝑀s 𝐴)))
4744oveqd 7433 . . . . . . 7 (((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) → (𝑏(+g𝑀)𝑐) = (𝑏(+g‘(𝑀s 𝐴))𝑐))
4845, 46, 47breq123d 5117 . . . . . 6 (((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) → ((𝑎(+g𝑀)𝑐)(le‘𝑀)(𝑏(+g𝑀)𝑐) ↔ (𝑎(+g‘(𝑀s 𝐴))𝑐)(le‘(𝑀s 𝐴))(𝑏(+g‘(𝑀s 𝐴))𝑐)))
4948adantr 486 . . . . 5 ((((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) ∧ 𝑎(le‘(𝑀s 𝐴))𝑏) → ((𝑎(+g𝑀)𝑐)(le‘𝑀)(𝑏(+g𝑀)𝑐) ↔ (𝑎(+g‘(𝑀s 𝐴))𝑐)(le‘(𝑀s 𝐴))(𝑏(+g‘(𝑀s 𝐴))𝑐)))
5041, 49mpbid 235 . . . 4 ((((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) ∧ 𝑎(le‘(𝑀s 𝐴))𝑏) → (𝑎(+g‘(𝑀s 𝐴))𝑐)(le‘(𝑀s 𝐴))(𝑏(+g‘(𝑀s 𝐴))𝑐))
5150ex 418 . . 3 (((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) → (𝑎(le‘(𝑀s 𝐴))𝑏 → (𝑎(+g‘(𝑀s 𝐴))𝑐)(le‘(𝑀s 𝐴))(𝑏(+g‘(𝑀s 𝐴))𝑐)))
5251ralrimivvva 3208 . 2 ((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) → ∀𝑎 ∈ (Base‘(𝑀s 𝐴))∀𝑏 ∈ (Base‘(𝑀s 𝐴))∀𝑐 ∈ (Base‘(𝑀s 𝐴))(𝑎(le‘(𝑀s 𝐴))𝑏 → (𝑎(+g‘(𝑀s 𝐴))𝑐)(le‘(𝑀s 𝐴))(𝑏(+g‘(𝑀s 𝐴))𝑐)))
53 eqid 2760 . . 3 (+g‘(𝑀s 𝐴)) = (+g‘(𝑀s 𝐴))
54 eqid 2760 . . 3 (le‘(𝑀s 𝐴)) = (le‘(𝑀s 𝐴))
5510, 53, 54isomnd 20276 . 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 1362 1 ((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) → (𝑀s 𝐴) ∈ oMnd)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wb 209  wa 401  w3a 1103   = wceq 1570  wcel 2145  wne 2955  wral 3076  Vcvv 3450  cin 3898  wss 3899  c0 4279   class class class wbr 5103  cfv 6535  (class class class)co 7416  Basecbs 17326  s cress 17347  +gcplusg 17367  lecple 17374  0gc0g 17549  Tosetctos 18527  Mndcmnd 18862  oMndcomnd 20272
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7742  ax-cnex 11205  ax-resscn 11206  ax-1cn 11207  ax-icn 11208  ax-addcl 11209  ax-addrcl 11210  ax-mulcl 11211  ax-mulrcl 11212  ax-mulcom 11213  ax-addass 11214  ax-mulass 11215  ax-distr 11216  ax-i2m1 11217  ax-1ne0 11218  ax-1rid 11219  ax-rnegex 11220  ax-rrecex 11221  ax-cnre 11222  ax-pre-lttri 11223  ax-pre-lttrn 11224  ax-pre-ltadd 11225  ax-pre-mulgt0 11226
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  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-pred 6301  df-ord 6362  df-on 6363  df-lim 6364  df-suc 6365  df-iota 6491  df-fun 6537  df-fn 6538  df-f 6539  df-f1 6540  df-fo 6541  df-f1o 6542  df-fv 6543  df-riota 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-om 7869  df-2nd 7993  df-frecs 8285  df-wrecs 8316  df-recs 8365  df-rdg 8404  df-er 8703  df-en 8960  df-dom 8961  df-sdom 8962  df-pnf 11294  df-mnf 11295  df-xr 11296  df-ltxr 11297  df-le 11298  df-sub 11492  df-neg 11493  df-nn 12283  df-2 12352  df-3 12353  df-4 12354  df-5 12355  df-6 12356  df-7 12357  df-8 12358  df-9 12359  df-n0 12554  df-z 12641  df-dec 12762  df-sets 17281  df-slot 17299  df-ndx 17311  df-base 17327  df-ress 17348  df-plusg 17380  df-ple 17387  df-0g 17551  df-poset 18426  df-toset 18528  df-mgm 18755  df-sgrp 18847  df-mnd 18863  df-omnd 20274
This theorem is used by:  suborng  21072  nn0omnd  33816
  Copyright terms: Public domain W3C validator