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

Theorem subsubm 18741
Description: A submonoid of a submonoid is a submonoid. (Contributed by Mario Carneiro, 21-Jun-2015.)
Hypothesis
Ref Expression
subsubm.h 𝐻 = (𝐺s 𝑆)
Assertion
Ref Expression
subsubm (𝑆 ∈ (SubMnd‘𝐺) → (𝐴 ∈ (SubMnd‘𝐻) ↔ (𝐴 ∈ (SubMnd‘𝐺) ∧ 𝐴𝑆)))

Proof of Theorem subsubm
StepHypRef Expression
1 eqid 2736 . . . . . . . 8 (Base‘𝐻) = (Base‘𝐻)
21submss 18734 . . . . . . 7 (𝐴 ∈ (SubMnd‘𝐻) → 𝐴 ⊆ (Base‘𝐻))
32adantl 481 . . . . . 6 ((𝑆 ∈ (SubMnd‘𝐺) ∧ 𝐴 ∈ (SubMnd‘𝐻)) → 𝐴 ⊆ (Base‘𝐻))
4 subsubm.h . . . . . . . 8 𝐻 = (𝐺s 𝑆)
54submbas 18739 . . . . . . 7 (𝑆 ∈ (SubMnd‘𝐺) → 𝑆 = (Base‘𝐻))
65adantr 480 . . . . . 6 ((𝑆 ∈ (SubMnd‘𝐺) ∧ 𝐴 ∈ (SubMnd‘𝐻)) → 𝑆 = (Base‘𝐻))
73, 6sseqtrrd 3971 . . . . 5 ((𝑆 ∈ (SubMnd‘𝐺) ∧ 𝐴 ∈ (SubMnd‘𝐻)) → 𝐴𝑆)
8 eqid 2736 . . . . . . 7 (Base‘𝐺) = (Base‘𝐺)
98submss 18734 . . . . . 6 (𝑆 ∈ (SubMnd‘𝐺) → 𝑆 ⊆ (Base‘𝐺))
109adantr 480 . . . . 5 ((𝑆 ∈ (SubMnd‘𝐺) ∧ 𝐴 ∈ (SubMnd‘𝐻)) → 𝑆 ⊆ (Base‘𝐺))
117, 10sstrd 3944 . . . 4 ((𝑆 ∈ (SubMnd‘𝐺) ∧ 𝐴 ∈ (SubMnd‘𝐻)) → 𝐴 ⊆ (Base‘𝐺))
12 eqid 2736 . . . . . . 7 (0g𝐺) = (0g𝐺)
134, 12subm0 18740 . . . . . 6 (𝑆 ∈ (SubMnd‘𝐺) → (0g𝐺) = (0g𝐻))
1413adantr 480 . . . . 5 ((𝑆 ∈ (SubMnd‘𝐺) ∧ 𝐴 ∈ (SubMnd‘𝐻)) → (0g𝐺) = (0g𝐻))
15 eqid 2736 . . . . . . 7 (0g𝐻) = (0g𝐻)
1615subm0cl 18736 . . . . . 6 (𝐴 ∈ (SubMnd‘𝐻) → (0g𝐻) ∈ 𝐴)
1716adantl 481 . . . . 5 ((𝑆 ∈ (SubMnd‘𝐺) ∧ 𝐴 ∈ (SubMnd‘𝐻)) → (0g𝐻) ∈ 𝐴)
1814, 17eqeltrd 2836 . . . 4 ((𝑆 ∈ (SubMnd‘𝐺) ∧ 𝐴 ∈ (SubMnd‘𝐻)) → (0g𝐺) ∈ 𝐴)
194oveq1i 7368 . . . . . . 7 (𝐻s 𝐴) = ((𝐺s 𝑆) ↾s 𝐴)
20 ressabs 17175 . . . . . . 7 ((𝑆 ∈ (SubMnd‘𝐺) ∧ 𝐴𝑆) → ((𝐺s 𝑆) ↾s 𝐴) = (𝐺s 𝐴))
2119, 20eqtrid 2783 . . . . . 6 ((𝑆 ∈ (SubMnd‘𝐺) ∧ 𝐴𝑆) → (𝐻s 𝐴) = (𝐺s 𝐴))
227, 21syldan 591 . . . . 5 ((𝑆 ∈ (SubMnd‘𝐺) ∧ 𝐴 ∈ (SubMnd‘𝐻)) → (𝐻s 𝐴) = (𝐺s 𝐴))
23 eqid 2736 . . . . . . 7 (𝐻s 𝐴) = (𝐻s 𝐴)
2423submmnd 18738 . . . . . 6 (𝐴 ∈ (SubMnd‘𝐻) → (𝐻s 𝐴) ∈ Mnd)
2524adantl 481 . . . . 5 ((𝑆 ∈ (SubMnd‘𝐺) ∧ 𝐴 ∈ (SubMnd‘𝐻)) → (𝐻s 𝐴) ∈ Mnd)
2622, 25eqeltrrd 2837 . . . 4 ((𝑆 ∈ (SubMnd‘𝐺) ∧ 𝐴 ∈ (SubMnd‘𝐻)) → (𝐺s 𝐴) ∈ Mnd)
27 submrcl 18727 . . . . . 6 (𝑆 ∈ (SubMnd‘𝐺) → 𝐺 ∈ Mnd)
2827adantr 480 . . . . 5 ((𝑆 ∈ (SubMnd‘𝐺) ∧ 𝐴 ∈ (SubMnd‘𝐻)) → 𝐺 ∈ Mnd)
29 eqid 2736 . . . . . 6 (𝐺s 𝐴) = (𝐺s 𝐴)
308, 12, 29issubm2 18729 . . . . 5 (𝐺 ∈ Mnd → (𝐴 ∈ (SubMnd‘𝐺) ↔ (𝐴 ⊆ (Base‘𝐺) ∧ (0g𝐺) ∈ 𝐴 ∧ (𝐺s 𝐴) ∈ Mnd)))
3128, 30syl 17 . . . 4 ((𝑆 ∈ (SubMnd‘𝐺) ∧ 𝐴 ∈ (SubMnd‘𝐻)) → (𝐴 ∈ (SubMnd‘𝐺) ↔ (𝐴 ⊆ (Base‘𝐺) ∧ (0g𝐺) ∈ 𝐴 ∧ (𝐺s 𝐴) ∈ Mnd)))
3211, 18, 26, 31mpbir3and 1343 . . 3 ((𝑆 ∈ (SubMnd‘𝐺) ∧ 𝐴 ∈ (SubMnd‘𝐻)) → 𝐴 ∈ (SubMnd‘𝐺))
3332, 7jca 511 . 2 ((𝑆 ∈ (SubMnd‘𝐺) ∧ 𝐴 ∈ (SubMnd‘𝐻)) → (𝐴 ∈ (SubMnd‘𝐺) ∧ 𝐴𝑆))
34 simprr 772 . . . 4 ((𝑆 ∈ (SubMnd‘𝐺) ∧ (𝐴 ∈ (SubMnd‘𝐺) ∧ 𝐴𝑆)) → 𝐴𝑆)
355adantr 480 . . . 4 ((𝑆 ∈ (SubMnd‘𝐺) ∧ (𝐴 ∈ (SubMnd‘𝐺) ∧ 𝐴𝑆)) → 𝑆 = (Base‘𝐻))
3634, 35sseqtrd 3970 . . 3 ((𝑆 ∈ (SubMnd‘𝐺) ∧ (𝐴 ∈ (SubMnd‘𝐺) ∧ 𝐴𝑆)) → 𝐴 ⊆ (Base‘𝐻))
3713adantr 480 . . . 4 ((𝑆 ∈ (SubMnd‘𝐺) ∧ (𝐴 ∈ (SubMnd‘𝐺) ∧ 𝐴𝑆)) → (0g𝐺) = (0g𝐻))
3812subm0cl 18736 . . . . 5 (𝐴 ∈ (SubMnd‘𝐺) → (0g𝐺) ∈ 𝐴)
3938ad2antrl 728 . . . 4 ((𝑆 ∈ (SubMnd‘𝐺) ∧ (𝐴 ∈ (SubMnd‘𝐺) ∧ 𝐴𝑆)) → (0g𝐺) ∈ 𝐴)
4037, 39eqeltrrd 2837 . . 3 ((𝑆 ∈ (SubMnd‘𝐺) ∧ (𝐴 ∈ (SubMnd‘𝐺) ∧ 𝐴𝑆)) → (0g𝐻) ∈ 𝐴)
4121adantrl 716 . . . 4 ((𝑆 ∈ (SubMnd‘𝐺) ∧ (𝐴 ∈ (SubMnd‘𝐺) ∧ 𝐴𝑆)) → (𝐻s 𝐴) = (𝐺s 𝐴))
4229submmnd 18738 . . . . 5 (𝐴 ∈ (SubMnd‘𝐺) → (𝐺s 𝐴) ∈ Mnd)
4342ad2antrl 728 . . . 4 ((𝑆 ∈ (SubMnd‘𝐺) ∧ (𝐴 ∈ (SubMnd‘𝐺) ∧ 𝐴𝑆)) → (𝐺s 𝐴) ∈ Mnd)
4441, 43eqeltrd 2836 . . 3 ((𝑆 ∈ (SubMnd‘𝐺) ∧ (𝐴 ∈ (SubMnd‘𝐺) ∧ 𝐴𝑆)) → (𝐻s 𝐴) ∈ Mnd)
454submmnd 18738 . . . . 5 (𝑆 ∈ (SubMnd‘𝐺) → 𝐻 ∈ Mnd)
4645adantr 480 . . . 4 ((𝑆 ∈ (SubMnd‘𝐺) ∧ (𝐴 ∈ (SubMnd‘𝐺) ∧ 𝐴𝑆)) → 𝐻 ∈ Mnd)
471, 15, 23issubm2 18729 . . . 4 (𝐻 ∈ Mnd → (𝐴 ∈ (SubMnd‘𝐻) ↔ (𝐴 ⊆ (Base‘𝐻) ∧ (0g𝐻) ∈ 𝐴 ∧ (𝐻s 𝐴) ∈ Mnd)))
4846, 47syl 17 . . 3 ((𝑆 ∈ (SubMnd‘𝐺) ∧ (𝐴 ∈ (SubMnd‘𝐺) ∧ 𝐴𝑆)) → (𝐴 ∈ (SubMnd‘𝐻) ↔ (𝐴 ⊆ (Base‘𝐻) ∧ (0g𝐻) ∈ 𝐴 ∧ (𝐻s 𝐴) ∈ Mnd)))
4936, 40, 44, 48mpbir3and 1343 . 2 ((𝑆 ∈ (SubMnd‘𝐺) ∧ (𝐴 ∈ (SubMnd‘𝐺) ∧ 𝐴𝑆)) → 𝐴 ∈ (SubMnd‘𝐻))
5033, 49impbida 800 1 (𝑆 ∈ (SubMnd‘𝐺) → (𝐴 ∈ (SubMnd‘𝐻) ↔ (𝐴 ∈ (SubMnd‘𝐺) ∧ 𝐴𝑆)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086   = wceq 1541  wcel 2113  wss 3901  cfv 6492  (class class class)co 7358  Basecbs 17136  s cress 17157  0gc0g 17359  Mndcmnd 18659  SubMndcsubmnd 18707
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680  ax-cnex 11082  ax-resscn 11083  ax-1cn 11084  ax-icn 11085  ax-addcl 11086  ax-addrcl 11087  ax-mulcl 11088  ax-mulrcl 11089  ax-mulcom 11090  ax-addass 11091  ax-mulass 11092  ax-distr 11093  ax-i2m1 11094  ax-1ne0 11095  ax-1rid 11096  ax-rnegex 11097  ax-rrecex 11098  ax-cnre 11099  ax-pre-lttri 11100  ax-pre-lttrn 11101  ax-pre-ltadd 11102  ax-pre-mulgt0 11103
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3061  df-rmo 3350  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-pss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-iun 4948  df-br 5099  df-opab 5161  df-mpt 5180  df-tr 5206  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7315  df-ov 7361  df-oprab 7362  df-mpo 7363  df-om 7809  df-2nd 7934  df-frecs 8223  df-wrecs 8254  df-recs 8303  df-rdg 8341  df-er 8635  df-en 8884  df-dom 8885  df-sdom 8886  df-pnf 11168  df-mnf 11169  df-xr 11170  df-ltxr 11171  df-le 11172  df-sub 11366  df-neg 11367  df-nn 12146  df-2 12208  df-sets 17091  df-slot 17109  df-ndx 17121  df-base 17137  df-ress 17158  df-plusg 17190  df-0g 17361  df-mgm 18565  df-sgrp 18644  df-mnd 18660  df-submnd 18709
This theorem is referenced by:  zrhpsgnmhm  21539  amgmlem  26956  nn0archi  33428  amgmwlem  50047  amgmlemALT  50048
  Copyright terms: Public domain W3C validator