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

Theorem 0nsg 13931
Description: The zero subgroup is normal. (Contributed by Mario Carneiro, 4-Feb-2015.)
Hypothesis
Ref Expression
0nsg.z  |-  .0.  =  ( 0g `  G )
Assertion
Ref Expression
0nsg  |-  ( G  e.  Grp  ->  {  .0.  }  e.  (NrmSGrp `  G
) )

Proof of Theorem 0nsg
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 0nsg.z . . 3  |-  .0.  =  ( 0g `  G )
210subg 13916 . 2  |-  ( G  e.  Grp  ->  {  .0.  }  e.  (SubGrp `  G
) )
3 elsni 3707 . . . . . . . . 9  |-  ( y  e.  {  .0.  }  ->  y  =  .0.  )
43ad2antll 491 . . . . . . . 8  |-  ( ( G  e.  Grp  /\  ( x  e.  ( Base `  G )  /\  y  e.  {  .0.  } ) )  ->  y  =  .0.  )
54oveq2d 6066 . . . . . . 7  |-  ( ( G  e.  Grp  /\  ( x  e.  ( Base `  G )  /\  y  e.  {  .0.  } ) )  ->  (
x ( +g  `  G
) y )  =  ( x ( +g  `  G )  .0.  )
)
6 eqid 2232 . . . . . . . . 9  |-  ( Base `  G )  =  (
Base `  G )
7 eqid 2232 . . . . . . . . 9  |-  ( +g  `  G )  =  ( +g  `  G )
86, 7, 1grprid 13745 . . . . . . . 8  |-  ( ( G  e.  Grp  /\  x  e.  ( Base `  G ) )  -> 
( x ( +g  `  G )  .0.  )  =  x )
98adantrr 479 . . . . . . 7  |-  ( ( G  e.  Grp  /\  ( x  e.  ( Base `  G )  /\  y  e.  {  .0.  } ) )  ->  (
x ( +g  `  G
)  .0.  )  =  x )
105, 9eqtrd 2265 . . . . . 6  |-  ( ( G  e.  Grp  /\  ( x  e.  ( Base `  G )  /\  y  e.  {  .0.  } ) )  ->  (
x ( +g  `  G
) y )  =  x )
1110oveq1d 6065 . . . . 5  |-  ( ( G  e.  Grp  /\  ( x  e.  ( Base `  G )  /\  y  e.  {  .0.  } ) )  ->  (
( x ( +g  `  G ) y ) ( -g `  G
) x )  =  ( x ( -g `  G ) x ) )
12 eqid 2232 . . . . . . 7  |-  ( -g `  G )  =  (
-g `  G )
136, 1, 12grpsubid 13797 . . . . . 6  |-  ( ( G  e.  Grp  /\  x  e.  ( Base `  G ) )  -> 
( x ( -g `  G ) x )  =  .0.  )
1413adantrr 479 . . . . 5  |-  ( ( G  e.  Grp  /\  ( x  e.  ( Base `  G )  /\  y  e.  {  .0.  } ) )  ->  (
x ( -g `  G
) x )  =  .0.  )
1511, 14eqtrd 2265 . . . 4  |-  ( ( G  e.  Grp  /\  ( x  e.  ( Base `  G )  /\  y  e.  {  .0.  } ) )  ->  (
( x ( +g  `  G ) y ) ( -g `  G
) x )  =  .0.  )
16 simpl 109 . . . . . 6  |-  ( ( G  e.  Grp  /\  ( x  e.  ( Base `  G )  /\  y  e.  {  .0.  } ) )  ->  G  e.  Grp )
17 simprl 531 . . . . . . 7  |-  ( ( G  e.  Grp  /\  ( x  e.  ( Base `  G )  /\  y  e.  {  .0.  } ) )  ->  x  e.  ( Base `  G
) )
186, 1grpidcl 13742 . . . . . . . . 9  |-  ( G  e.  Grp  ->  .0.  e.  ( Base `  G
) )
1918adantr 276 . . . . . . . 8  |-  ( ( G  e.  Grp  /\  ( x  e.  ( Base `  G )  /\  y  e.  {  .0.  } ) )  ->  .0.  e.  ( Base `  G
) )
204, 19eqeltrd 2309 . . . . . . 7  |-  ( ( G  e.  Grp  /\  ( x  e.  ( Base `  G )  /\  y  e.  {  .0.  } ) )  ->  y  e.  ( Base `  G
) )
216, 7, 16, 17, 20grpcld 13727 . . . . . 6  |-  ( ( G  e.  Grp  /\  ( x  e.  ( Base `  G )  /\  y  e.  {  .0.  } ) )  ->  (
x ( +g  `  G
) y )  e.  ( Base `  G
) )
226, 12grpsubcl 13793 . . . . . 6  |-  ( ( G  e.  Grp  /\  ( x ( +g  `  G ) y )  e.  ( Base `  G
)  /\  x  e.  ( Base `  G )
)  ->  ( (
x ( +g  `  G
) y ) (
-g `  G )
x )  e.  (
Base `  G )
)
2316, 21, 17, 22syl3anc 1274 . . . . 5  |-  ( ( G  e.  Grp  /\  ( x  e.  ( Base `  G )  /\  y  e.  {  .0.  } ) )  ->  (
( x ( +g  `  G ) y ) ( -g `  G
) x )  e.  ( Base `  G
) )
24 elsng 3704 . . . . 5  |-  ( ( ( x ( +g  `  G ) y ) ( -g `  G
) x )  e.  ( Base `  G
)  ->  ( (
( x ( +g  `  G ) y ) ( -g `  G
) x )  e. 
{  .0.  }  <->  ( (
x ( +g  `  G
) y ) (
-g `  G )
x )  =  .0.  ) )
2523, 24syl 14 . . . 4  |-  ( ( G  e.  Grp  /\  ( x  e.  ( Base `  G )  /\  y  e.  {  .0.  } ) )  ->  (
( ( x ( +g  `  G ) y ) ( -g `  G ) x )  e.  {  .0.  }  <->  ( ( x ( +g  `  G ) y ) ( -g `  G
) x )  =  .0.  ) )
2615, 25mpbird 167 . . 3  |-  ( ( G  e.  Grp  /\  ( x  e.  ( Base `  G )  /\  y  e.  {  .0.  } ) )  ->  (
( x ( +g  `  G ) y ) ( -g `  G
) x )  e. 
{  .0.  } )
2726ralrimivva 2624 . 2  |-  ( G  e.  Grp  ->  A. x  e.  ( Base `  G
) A. y  e. 
{  .0.  }  (
( x ( +g  `  G ) y ) ( -g `  G
) x )  e. 
{  .0.  } )
286, 7, 12isnsg3 13924 . 2  |-  ( {  .0.  }  e.  (NrmSGrp `  G )  <->  ( {  .0.  }  e.  (SubGrp `  G )  /\  A. x  e.  ( Base `  G ) A. y  e.  {  .0.  }  (
( x ( +g  `  G ) y ) ( -g `  G
) x )  e. 
{  .0.  } ) )
292, 27, 28sylanbrc 417 1  |-  ( G  e.  Grp  ->  {  .0.  }  e.  (NrmSGrp `  G
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398    e. wcel 2203   A.wral 2520   {csn 3689   ` cfv 5352  (class class class)co 6050   Basecbs 13212   +g cplusg 13290   0gc0g 13469   Grpcgrp 13713   -gcsg 13715  SubGrpcsubg 13884  NrmSGrpcnsg 13885
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4225  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-cnex 8218  ax-resscn 8219  ax-1cn 8220  ax-1re 8221  ax-icn 8222  ax-addcl 8223  ax-addrcl 8224  ax-mulcl 8225  ax-addcom 8227  ax-addass 8229  ax-i2m1 8232  ax-0lt1 8233  ax-0id 8235  ax-rnegex 8236  ax-pre-ltirr 8239  ax-pre-ltadd 8243
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rmo 2528  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-riota 6003  df-ov 6053  df-oprab 6054  df-mpo 6055  df-1st 6334  df-2nd 6335  df-pnf 8310  df-mnf 8311  df-ltxr 8313  df-inn 9238  df-2 9296  df-ndx 13215  df-slot 13216  df-base 13218  df-sets 13219  df-iress 13220  df-plusg 13303  df-0g 13471  df-mgm 13569  df-sgrp 13615  df-mnd 13630  df-submnd 13673  df-grp 13716  df-minusg 13717  df-sbg 13718  df-subg 13887  df-nsg 13888
This theorem is referenced by:  0idnsgd  13933  1nsgtrivd  13936  ghmker  13987
  Copyright terms: Public domain W3C validator