ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  submnd0 Unicode version

Theorem submnd0 13734
Description: The zero of a submonoid is the same as the zero in the parent monoid. (Note that we must add the condition that the zero of the parent monoid is actually contained in the submonoid, because it is possible to have "subsets that are monoids" which are not submonoids because they have a different identity element. (Contributed by Mario Carneiro, 10-Jan-2015.)
Hypotheses
Ref Expression
submnd0.b  |-  B  =  ( Base `  G
)
submnd0.z  |-  .0.  =  ( 0g `  G )
submnd0.h  |-  H  =  ( Gs  S )
Assertion
Ref Expression
submnd0  |-  ( ( ( G  e.  Mnd  /\  H  e.  Mnd )  /\  ( S  C_  B  /\  .0.  e.  S ) )  ->  .0.  =  ( 0g `  H ) )

Proof of Theorem submnd0
StepHypRef Expression
1 simpll 531 . 2  |-  ( ( ( G  e.  Mnd  /\  H  e.  Mnd )  /\  ( S  C_  B  /\  .0.  e.  S ) )  ->  G  e.  Mnd )
2 simprr 537 . 2  |-  ( ( ( G  e.  Mnd  /\  H  e.  Mnd )  /\  ( S  C_  B  /\  .0.  e.  S ) )  ->  .0.  e.  S )
3 simprl 535 . 2  |-  ( ( ( G  e.  Mnd  /\  H  e.  Mnd )  /\  ( S  C_  B  /\  .0.  e.  S ) )  ->  S  C_  B
)
4 submnd0.h . . 3  |-  H  =  ( Gs  S )
5 submnd0.b . . 3  |-  B  =  ( Base `  G
)
6 submnd0.z . . 3  |-  .0.  =  ( 0g `  G )
74, 5, 6ress0g 13733 . 2  |-  ( ( G  e.  Mnd  /\  .0.  e.  S  /\  S  C_  B )  ->  .0.  =  ( 0g `  H ) )
81, 2, 3, 7syl3anc 1278 1  |-  ( ( ( G  e.  Mnd  /\  H  e.  Mnd )  /\  ( S  C_  B  /\  .0.  e.  S ) )  ->  .0.  =  ( 0g `  H ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209    C_ wss 3220   ` cfv 5372  (class class class)co 6075   Basecbs 13330   ↾s cress 13331   0gc0g 13587   Mndcmnd 13706
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-addcom 8269  ax-addass 8271  ax-i2m1 8274  ax-0lt1 8275  ax-0id 8277  ax-rnegex 8278  ax-pre-ltirr 8281  ax-pre-ltadd 8285
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-iota 5332  df-fun 5374  df-fn 5375  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-pnf 8352  df-mnf 8353  df-ltxr 8355  df-inn 9284  df-2 9342  df-ndx 13333  df-slot 13334  df-base 13336  df-sets 13337  df-iress 13338  df-plusg 13421  df-0g 13589  df-mgm 13653  df-sgrp 13694  df-mnd 13707
This theorem is referenced by:  subm0  13766
  Copyright terms: Public domain W3C validator