Theorem submcld 19058

Description: Submonoids are closed under the monoid operation. (Contributed by Thierry Arnoux, 4-May-2025.)

Hypotheses

Ref	Expression
submcld.1	⊢ + = (+g‘𝑀)
submcld.2	⊢ (𝜑 → 𝑆 ∈ (SubMnd‘𝑀))
submcld.3	⊢ (𝜑 → 𝑋 ∈ 𝑆)
submcld.4	⊢ (𝜑 → 𝑌 ∈ 𝑆)

Assertion

Ref	Expression
submcld	⊢ (𝜑 → (𝑋 + 𝑌) ∈ 𝑆)

Proof of Theorem submcld

Step	Hyp	Ref	Expression
1		submcld.2	. 2 ⊢ (𝜑 → 𝑆 ∈ (SubMnd‘𝑀))
2		submcld.3	. 2 ⊢ (𝜑 → 𝑋 ∈ 𝑆)
3		submcld.4	. 2 ⊢ (𝜑 → 𝑌 ∈ 𝑆)
4		submcld.1	. . 3 ⊢ + = (+g‘𝑀)
5	4	submcl 19057	. 2 ⊢ ((𝑆 ∈ (SubMnd‘𝑀) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑋 + 𝑌) ∈ 𝑆)
6	1, 2, 3, 5	syl3anc 1399	1 ⊢ (𝜑 → (𝑋 + 𝑌) ∈ 𝑆)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  ‘cfv 6566  (class class class)co 7451  +_gcplusg 17472  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-rab 3417  df-v 3456  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-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fv 6574  df-ov 7454  df-submnd 19029

This theorem is used by:  ssdifidlprm  21693  gsumwun  33736  rloccring  33931  rlocisunit  33936