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

Theorem 0nsg 13967
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 13952 . 2  |-  ( G  e.  Grp  ->  {  .0.  }  e.  (SubGrp `  G
) )
3 elsni 3712 . . . . . . . . 9  |-  ( y  e.  {  .0.  }  ->  y  =  .0.  )
43ad2antll 491 . . . . . . . 8  |-  ( ( G  e.  Grp  /\  ( x  e.  ( Base `  G )  /\  y  e.  {  .0.  } ) )  ->  y  =  .0.  )
54oveq2d 6074 . . . . . . 7  |-  ( ( G  e.  Grp  /\  ( x  e.  ( Base `  G )  /\  y  e.  {  .0.  } ) )  ->  (
x ( +g  `  G
) y )  =  ( x ( +g  `  G )  .0.  )
)
6 eqid 2234 . . . . . . . . 9  |-  ( Base `  G )  =  (
Base `  G )
7 eqid 2234 . . . . . . . . 9  |-  ( +g  `  G )  =  ( +g  `  G )
86, 7, 1grprid 13787 . . . . . . . 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 2267 . . . . . 6  |-  ( ( G  e.  Grp  /\  ( x  e.  ( Base `  G )  /\  y  e.  {  .0.  } ) )  ->  (
x ( +g  `  G
) y )  =  x )
1110oveq1d 6073 . . . . 5  |-  ( ( G  e.  Grp  /\  ( x  e.  ( Base `  G )  /\  y  e.  {  .0.  } ) )  ->  (
( x ( +g  `  G ) y ) ( -g `  G
) x )  =  ( x ( -g `  G ) x ) )
12 eqid 2234 . . . . . . 7  |-  ( -g `  G )  =  (
-g `  G )
136, 1, 12grpsubid 13839 . . . . . 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 2267 . . . 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 13784 . . . . . . . . 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 2311 . . . . . . 7  |-  ( ( G  e.  Grp  /\  ( x  e.  ( Base `  G )  /\  y  e.  {  .0.  } ) )  ->  y  e.  ( Base `  G
) )
216, 7, 16, 17, 20grpcld 13769 . . . . . 6  |-  ( ( G  e.  Grp  /\  ( x  e.  ( Base `  G )  /\  y  e.  {  .0.  } ) )  ->  (
x ( +g  `  G
) y )  e.  ( Base `  G
) )
226, 12grpsubcl 13835 . . . . . 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 3709 . . . . 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 2626 . 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 13960 . 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 2205   A.wral 2522   {csn 3694   ` cfv 5357  (class class class)co 6058   Basecbs 13296   +g cplusg 13374   0gc0g 13553   Grpcgrp 13755   -gcsg 13757  SubGrpcsubg 13920  NrmSGrpcnsg 13921
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 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-addcom 8243  ax-addass 8245  ax-i2m1 8248  ax-0lt1 8249  ax-0id 8251  ax-rnegex 8252  ax-pre-ltirr 8255  ax-pre-ltadd 8259
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 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-pnf 8326  df-mnf 8327  df-ltxr 8329  df-inn 9255  df-2 9313  df-ndx 13299  df-slot 13300  df-base 13302  df-sets 13303  df-iress 13304  df-plusg 13387  df-0g 13555  df-mgm 13619  df-sgrp 13665  df-mnd 13678  df-submnd 13715  df-grp 13758  df-minusg 13759  df-sbg 13760  df-subg 13923  df-nsg 13924
This theorem is referenced by:  0idnsgd  13969  1nsgtrivd  13972  ghmker  14023
  Copyright terms: Public domain W3C validator