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

Theorem submomnd 20202
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 489 . 2 ((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) → (𝑀s 𝐴) ∈ Mnd)
2 omndtos 20197 . . . 4 (𝑀 ∈ oMnd → 𝑀 ∈ Toset)
32adantr 485 . . 3 ((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) → 𝑀 ∈ Toset)
4 reldmress 17292 . . . . . . . 8 Rel dom ↾s
54ovprc2 7451 . . . . . . 7 𝐴 ∈ V → (𝑀s 𝐴) = ∅)
65fveq2d 6886 . . . . . 6 𝐴 ∈ V → (Base‘(𝑀s 𝐴)) = (Base‘∅))
76adantl 486 . . . . 5 (((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ ¬ 𝐴 ∈ V) → (Base‘(𝑀s 𝐴)) = (Base‘∅))
8 base0 17274 . . . . 5 ∅ = (Base‘∅)
97, 8eqtr4di 2822 . . . 4 (((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ ¬ 𝐴 ∈ V) → (Base‘(𝑀s 𝐴)) = ∅)
10 eqid 2769 . . . . . . . 8 (Base‘(𝑀s 𝐴)) = (Base‘(𝑀s 𝐴))
11 eqid 2769 . . . . . . . 8 (0g‘(𝑀s 𝐴)) = (0g‘(𝑀s 𝐴))
1210, 11mndidcl 18807 . . . . . . 7 ((𝑀s 𝐴) ∈ Mnd → (0g‘(𝑀s 𝐴)) ∈ (Base‘(𝑀s 𝐴)))
1312ne0d 4303 . . . . . 6 ((𝑀s 𝐴) ∈ Mnd → (Base‘(𝑀s 𝐴)) ≠ ∅)
1413ad2antlr 739 . . . . 5 (((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ ¬ 𝐴 ∈ V) → (Base‘(𝑀s 𝐴)) ≠ ∅)
1514neneqd 2969 . . . 4 (((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ ¬ 𝐴 ∈ V) → ¬ (Base‘(𝑀s 𝐴)) = ∅)
169, 15condan 829 . . 3 ((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) → 𝐴 ∈ V)
17 resstos 18486 . . 3 ((𝑀 ∈ Toset ∧ 𝐴 ∈ V) → (𝑀s 𝐴) ∈ Toset)
183, 16, 17syl2anc 595 . 2 ((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) → (𝑀s 𝐴) ∈ Toset)
19 simplll 786 . . . . . 6 ((((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) ∧ 𝑎(le‘(𝑀s 𝐴))𝑏) → 𝑀 ∈ oMnd)
20 eqid 2769 . . . . . . . . . . 11 (𝑀s 𝐴) = (𝑀s 𝐴)
21 eqid 2769 . . . . . . . . . . 11 (Base‘𝑀) = (Base‘𝑀)
2220, 21ressbas 17296 . . . . . . . . . 10 (𝐴 ∈ V → (𝐴 ∩ (Base‘𝑀)) = (Base‘(𝑀s 𝐴)))
23 inss2 4198 . . . . . . . . . 10 (𝐴 ∩ (Base‘𝑀)) ⊆ (Base‘𝑀)
2422, 23eqsstrrdi 3990 . . . . . . . . 9 (𝐴 ∈ V → (Base‘(𝑀s 𝐴)) ⊆ (Base‘𝑀))
2516, 24syl 18 . . . . . . . 8 ((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) → (Base‘(𝑀s 𝐴)) ⊆ (Base‘𝑀))
2625ad2antrr 738 . . . . . . 7 ((((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) ∧ 𝑎(le‘(𝑀s 𝐴))𝑏) → (Base‘(𝑀s 𝐴)) ⊆ (Base‘𝑀))
27 simplr1 1232 . . . . . . 7 ((((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) ∧ 𝑎(le‘(𝑀s 𝐴))𝑏) → 𝑎 ∈ (Base‘(𝑀s 𝐴)))
2826, 27sseldd 3946 . . . . . 6 ((((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) ∧ 𝑎(le‘(𝑀s 𝐴))𝑏) → 𝑎 ∈ (Base‘𝑀))
29 simplr2 1233 . . . . . . 7 ((((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) ∧ 𝑎(le‘(𝑀s 𝐴))𝑏) → 𝑏 ∈ (Base‘(𝑀s 𝐴)))
3026, 29sseldd 3946 . . . . . 6 ((((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) ∧ 𝑎(le‘(𝑀s 𝐴))𝑏) → 𝑏 ∈ (Base‘𝑀))
31 simplr3 1234 . . . . . . 7 ((((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) ∧ 𝑎(le‘(𝑀s 𝐴))𝑏) → 𝑐 ∈ (Base‘(𝑀s 𝐴)))
3226, 31sseldd 3946 . . . . . 6 ((((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) ∧ 𝑎(le‘(𝑀s 𝐴))𝑏) → 𝑐 ∈ (Base‘𝑀))
33 eqid 2769 . . . . . . . . . . 11 (le‘𝑀) = (le‘𝑀)
3420, 33ressle 17433 . . . . . . . . . 10 (𝐴 ∈ V → (le‘𝑀) = (le‘(𝑀s 𝐴)))
3516, 34syl 18 . . . . . . . . 9 ((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) → (le‘𝑀) = (le‘(𝑀s 𝐴)))
3635adantr 485 . . . . . . . 8 (((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) → (le‘𝑀) = (le‘(𝑀s 𝐴)))
3736breqd 5124 . . . . . . 7 (((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) → (𝑎(le‘𝑀)𝑏𝑎(le‘(𝑀s 𝐴))𝑏))
3837biimpar 482 . . . . . 6 ((((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) ∧ 𝑎(le‘(𝑀s 𝐴))𝑏) → 𝑎(le‘𝑀)𝑏)
39 eqid 2769 . . . . . . 7 (+g𝑀) = (+g𝑀)
4021, 33, 39omndadd 20198 . . . . . 6 ((𝑀 ∈ oMnd ∧ (𝑎 ∈ (Base‘𝑀) ∧ 𝑏 ∈ (Base‘𝑀) ∧ 𝑐 ∈ (Base‘𝑀)) ∧ 𝑎(le‘𝑀)𝑏) → (𝑎(+g𝑀)𝑐)(le‘𝑀)(𝑏(+g𝑀)𝑐))
4119, 28, 30, 32, 38, 40syl131anc 1408 . . . . 5 ((((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) ∧ 𝑎(le‘(𝑀s 𝐴))𝑏) → (𝑎(+g𝑀)𝑐)(le‘𝑀)(𝑏(+g𝑀)𝑐))
4216adantr 485 . . . . . . . . 9 (((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) → 𝐴 ∈ V)
4320, 39ressplusg 17344 . . . . . . . . 9 (𝐴 ∈ V → (+g𝑀) = (+g‘(𝑀s 𝐴)))
4442, 43syl 18 . . . . . . . 8 (((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) → (+g𝑀) = (+g‘(𝑀s 𝐴)))
4544oveqd 7428 . . . . . . 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 7428 . . . . . . 7 (((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) → (𝑏(+g𝑀)𝑐) = (𝑏(+g‘(𝑀s 𝐴))𝑐))
4845, 46, 47breq123d 5127 . . . . . 6 (((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) → ((𝑎(+g𝑀)𝑐)(le‘𝑀)(𝑏(+g𝑀)𝑐) ↔ (𝑎(+g‘(𝑀s 𝐴))𝑐)(le‘(𝑀s 𝐴))(𝑏(+g‘(𝑀s 𝐴))𝑐)))
4948adantr 485 . . . . 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 417 . . 3 (((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) ∧ (𝑎 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑏 ∈ (Base‘(𝑀s 𝐴)) ∧ 𝑐 ∈ (Base‘(𝑀s 𝐴)))) → (𝑎(le‘(𝑀s 𝐴))𝑏 → (𝑎(+g‘(𝑀s 𝐴))𝑐)(le‘(𝑀s 𝐴))(𝑏(+g‘(𝑀s 𝐴))𝑐)))
5251ralrimivvva 3217 . 2 ((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) → ∀𝑎 ∈ (Base‘(𝑀s 𝐴))∀𝑏 ∈ (Base‘(𝑀s 𝐴))∀𝑐 ∈ (Base‘(𝑀s 𝐴))(𝑎(le‘(𝑀s 𝐴))𝑏 → (𝑎(+g‘(𝑀s 𝐴))𝑐)(le‘(𝑀s 𝐴))(𝑏(+g‘(𝑀s 𝐴))𝑐)))
53 eqid 2769 . . 3 (+g‘(𝑀s 𝐴)) = (+g‘(𝑀s 𝐴))
54 eqid 2769 . . 3 (le‘(𝑀s 𝐴)) = (le‘(𝑀s 𝐴))
5510, 53, 54isomnd 20193 . 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 1360 1 ((𝑀 ∈ oMnd ∧ (𝑀s 𝐴) ∈ Mnd) → (𝑀s 𝐴) ∈ oMnd)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 209  wa 400  w3a 1101   = wceq 1567  wcel 2149  wne 2964  wral 3085  Vcvv 3463  cin 3912  wss 3913  c0 4294   class class class wbr 5113  cfv 6537  (class class class)co 7411  Basecbs 17269  s cress 17290  +gcplusg 17310  lecple 17317  0gc0g 17492  Tosetctos 18470  Mndcmnd 18792  oMndcomnd 20189
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733  ax-cnex 11156  ax-resscn 11157  ax-1cn 11158  ax-icn 11159  ax-addcl 11160  ax-addrcl 11161  ax-mulcl 11162  ax-mulrcl 11163  ax-mulcom 11164  ax-addass 11165  ax-mulass 11166  ax-distr 11167  ax-i2m1 11168  ax-1ne0 11169  ax-1rid 11170  ax-rnegex 11171  ax-rrecex 11172  ax-cnre 11173  ax-pre-lttri 11174  ax-pre-lttrn 11175  ax-pre-ltadd 11176  ax-pre-mulgt0 11177
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-nel 3071  df-ral 3086  df-rex 3096  df-rmo 3376  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-iun 4962  df-br 5114  df-opab 5178  df-mpt 5197  df-tr 5223  df-id 5557  df-eprel 5562  df-po 5570  df-so 5571  df-fr 5615  df-we 5617  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7368  df-ov 7414  df-oprab 7415  df-mpo 7416  df-om 7863  df-2nd 7987  df-frecs 8278  df-wrecs 8309  df-recs 8358  df-rdg 8397  df-er 8694  df-en 8944  df-dom 8945  df-sdom 8946  df-pnf 11245  df-mnf 11246  df-xr 11247  df-ltxr 11248  df-le 11249  df-sub 11443  df-neg 11444  df-nn 12234  df-2 12303  df-3 12304  df-4 12305  df-5 12306  df-6 12307  df-7 12308  df-8 12309  df-9 12310  df-n0 12505  df-z 12592  df-dec 12712  df-sets 17224  df-slot 17242  df-ndx 17254  df-base 17270  df-ress 17291  df-plusg 17323  df-ple 17330  df-0g 17494  df-poset 18369  df-toset 18471  df-mgm 18698  df-sgrp 18777  df-mnd 18793  df-omnd 20191
This theorem is referenced by:  suborng  20957  nn0omnd  33607
  Copyright terms: Public domain W3C validator