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

Theorem 0subm 19063
Description: The zero submonoid of an arbitrary monoid. (Contributed by AV, 17-Feb-2024.)
Hypothesis
Ref Expression
0subm.z 0 = (0g‘𝐺)
Assertion
Ref Expression
0subm (𝐺 ∈ Mnd → { 0 } ∈ (SubMnd‘𝐺))

Proof of Theorem 0subm
Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2763 . . . 4 (Base‘𝐺) = (Base‘𝐺)
2 0subm.z . . . 4 0 = (0g‘𝐺)
31, 2mndidcl 18989 . . 3 (𝐺 ∈ Mnd → 0 ∈ (Base‘𝐺))
43snssd 4749 . 2 (𝐺 ∈ Mnd → { 0 } ⊆ (Base‘𝐺))
52fvexi 6930 . . . 4 0 ∈ V
65snid 4624 . . 3 0 ∈ { 0 }
76a1i 11 . 2 (𝐺 ∈ Mnd → 0 ∈ { 0 })
8 velsn 4600 . . . . 5 (𝑎 ∈ { 0 } ↔ 𝑎 = 0 )
9 velsn 4600 . . . . 5 (𝑏 ∈ { 0 } ↔ 𝑏 = 0 )
108, 9anbi12i 640 . . . 4 ((𝑎 ∈ { 0 } ∧ 𝑏 ∈ { 0 }) ↔ (𝑎 = 0 ∧ 𝑏 = 0 ))
11 eqid 2763 . . . . . . . 8 (+g‘𝐺) = (+g‘𝐺)
121, 11, 2mndlid 18994 . . . . . . 7 ((𝐺 ∈ Mnd ∧ 0 ∈ (Base‘𝐺)) → ( 0 (+g‘𝐺) 0 ) = 0 )
133, 12mpdan 700 . . . . . 6 (𝐺 ∈ Mnd → ( 0 (+g‘𝐺) 0 ) = 0 )
14 ovex 7484 . . . . . . 7 ( 0 (+g‘𝐺) 0 ) ∈ V
1514elsn 4599 . . . . . 6 (( 0 (+g‘𝐺) 0 ) ∈ { 0 } ↔ ( 0 (+g‘𝐺) 0 ) = 0 )
1613, 15sylibr 237 . . . . 5 (𝐺 ∈ Mnd → ( 0 (+g‘𝐺) 0 ) ∈ { 0 })
17 oveq12 7460 . . . . . 6 ((𝑎 = 0 ∧ 𝑏 = 0 ) → (𝑎(+g‘𝐺)𝑏) = ( 0 (+g‘𝐺) 0 ))
1817eleq1d 2849 . . . . 5 ((𝑎 = 0 ∧ 𝑏 = 0 ) → ((𝑎(+g‘𝐺)𝑏) ∈ { 0 } ↔ ( 0 (+g‘𝐺) 0 ) ∈ { 0 }))
1916, 18syl5ibrcom 250 . . . 4 (𝐺 ∈ Mnd → ((𝑎 = 0 ∧ 𝑏 = 0 ) → (𝑎(+g‘𝐺)𝑏) ∈ { 0 }))
2010, 19biimtrid 245 . . 3 (𝐺 ∈ Mnd → ((𝑎 ∈ { 0 } ∧ 𝑏 ∈ { 0 }) → (𝑎(+g‘𝐺)𝑏) ∈ { 0 }))
2120ralrimivv 3207 . 2 (𝐺 ∈ Mnd → ∀𝑎 ∈ { 0 }∀𝑏 ∈ { 0 } (𝑎(+g‘𝐺)𝑏) ∈ { 0 })
221, 2, 11issubm 19048 . 2 (𝐺 ∈ Mnd → ({ 0 } ∈ (SubMnd‘𝐺) ↔ ({ 0 } ⊆ (Base‘𝐺) ∧ 0 ∈ { 0 } ∧ ∀𝑎 ∈ { 0 }∀𝑏 ∈ { 0 } (𝑎(+g‘𝐺)𝑏) ∈ { 0 })))
234, 7, 21, 22mpbir3and 1361 1 (𝐺 ∈ Mnd → { 0 } ∈ (SubMnd‘𝐺))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080   ⊆ wss 3900  {csn 4588  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  +gcplusg 17472  0gc0g 17660  Mndcmnd 18973  SubMndcsubmnd 19027
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 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398
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 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-iota 6520  df-fun 6568  df-fv 6574  df-riota 7408  df-ov 7454  df-0g 17662  df-mgm 18866  df-sgrp 18958  df-mnd 18974  df-submnd 19029
This theorem is used by:  idressubmefmnd  19144  0subg  19412  0subgALT  19833
  Copyright terms: Public domain W3C validator