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

Theorem isnsg3 13784
Description: A subgroup is normal iff the conjugation of all the elements of the subgroup is in the subgroup. (Contributed by Mario Carneiro, 18-Jan-2015.)
Hypotheses
Ref Expression
isnsg3.1 𝑋 = (Base‘𝐺)
isnsg3.2 + = (+g𝐺)
isnsg3.3 = (-g𝐺)
Assertion
Ref Expression
isnsg3 (𝑆 ∈ (NrmSGrp‘𝐺) ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆))
Distinct variable groups:   𝑥,𝑦,   𝑥,𝐺,𝑦   𝑥, + ,𝑦   𝑥,𝑆,𝑦   𝑥,𝑋,𝑦

Proof of Theorem isnsg3
Dummy variables 𝑤 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 nsgsubg 13782 . . 3 (𝑆 ∈ (NrmSGrp‘𝐺) → 𝑆 ∈ (SubGrp‘𝐺))
2 isnsg3.1 . . . . . 6 𝑋 = (Base‘𝐺)
3 isnsg3.2 . . . . . 6 + = (+g𝐺)
4 isnsg3.3 . . . . . 6 = (-g𝐺)
52, 3, 4nsgconj 13783 . . . . 5 ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑥𝑋𝑦𝑆) → ((𝑥 + 𝑦) 𝑥) ∈ 𝑆)
653expb 1228 . . . 4 ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝑥𝑋𝑦𝑆)) → ((𝑥 + 𝑦) 𝑥) ∈ 𝑆)
76ralrimivva 2612 . . 3 (𝑆 ∈ (NrmSGrp‘𝐺) → ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆)
81, 7jca 306 . 2 (𝑆 ∈ (NrmSGrp‘𝐺) → (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆))
9 simpl 109 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) → 𝑆 ∈ (SubGrp‘𝐺))
10 subgrcl 13756 . . . . . . . . . . . 12 (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
1110ad2antrr 488 . . . . . . . . . . 11 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → 𝐺 ∈ Grp)
12 simprll 537 . . . . . . . . . . 11 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → 𝑧𝑋)
13 eqid 2229 . . . . . . . . . . . 12 (0g𝐺) = (0g𝐺)
14 eqid 2229 . . . . . . . . . . . 12 (invg𝐺) = (invg𝐺)
152, 3, 13, 14grplinv 13623 . . . . . . . . . . 11 ((𝐺 ∈ Grp ∧ 𝑧𝑋) → (((invg𝐺)‘𝑧) + 𝑧) = (0g𝐺))
1611, 12, 15syl2anc 411 . . . . . . . . . 10 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → (((invg𝐺)‘𝑧) + 𝑧) = (0g𝐺))
1716oveq1d 6028 . . . . . . . . 9 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((((invg𝐺)‘𝑧) + 𝑧) + 𝑤) = ((0g𝐺) + 𝑤))
182, 14grpinvcl 13621 . . . . . . . . . . 11 ((𝐺 ∈ Grp ∧ 𝑧𝑋) → ((invg𝐺)‘𝑧) ∈ 𝑋)
1911, 12, 18syl2anc 411 . . . . . . . . . 10 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((invg𝐺)‘𝑧) ∈ 𝑋)
20 simprlr 538 . . . . . . . . . 10 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → 𝑤𝑋)
212, 3grpass 13582 . . . . . . . . . 10 ((𝐺 ∈ Grp ∧ (((invg𝐺)‘𝑧) ∈ 𝑋𝑧𝑋𝑤𝑋)) → ((((invg𝐺)‘𝑧) + 𝑧) + 𝑤) = (((invg𝐺)‘𝑧) + (𝑧 + 𝑤)))
2211, 19, 12, 20, 21syl13anc 1273 . . . . . . . . 9 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((((invg𝐺)‘𝑧) + 𝑧) + 𝑤) = (((invg𝐺)‘𝑧) + (𝑧 + 𝑤)))
232, 3, 13grplid 13604 . . . . . . . . . 10 ((𝐺 ∈ Grp ∧ 𝑤𝑋) → ((0g𝐺) + 𝑤) = 𝑤)
2411, 20, 23syl2anc 411 . . . . . . . . 9 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((0g𝐺) + 𝑤) = 𝑤)
2517, 22, 243eqtr3d 2270 . . . . . . . 8 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → (((invg𝐺)‘𝑧) + (𝑧 + 𝑤)) = 𝑤)
2625oveq1d 6028 . . . . . . 7 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((((invg𝐺)‘𝑧) + (𝑧 + 𝑤)) ((invg𝐺)‘𝑧)) = (𝑤 ((invg𝐺)‘𝑧)))
272, 3, 4, 14, 11, 20, 12grpsubinv 13646 . . . . . . 7 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → (𝑤 ((invg𝐺)‘𝑧)) = (𝑤 + 𝑧))
2826, 27eqtrd 2262 . . . . . 6 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((((invg𝐺)‘𝑧) + (𝑧 + 𝑤)) ((invg𝐺)‘𝑧)) = (𝑤 + 𝑧))
29 simprr 531 . . . . . . 7 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → (𝑧 + 𝑤) ∈ 𝑆)
30 simplr 528 . . . . . . 7 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆)
31 oveq1 6020 . . . . . . . . . 10 (𝑥 = ((invg𝐺)‘𝑧) → (𝑥 + 𝑦) = (((invg𝐺)‘𝑧) + 𝑦))
32 id 19 . . . . . . . . . 10 (𝑥 = ((invg𝐺)‘𝑧) → 𝑥 = ((invg𝐺)‘𝑧))
3331, 32oveq12d 6031 . . . . . . . . 9 (𝑥 = ((invg𝐺)‘𝑧) → ((𝑥 + 𝑦) 𝑥) = ((((invg𝐺)‘𝑧) + 𝑦) ((invg𝐺)‘𝑧)))
3433eleq1d 2298 . . . . . . . 8 (𝑥 = ((invg𝐺)‘𝑧) → (((𝑥 + 𝑦) 𝑥) ∈ 𝑆 ↔ ((((invg𝐺)‘𝑧) + 𝑦) ((invg𝐺)‘𝑧)) ∈ 𝑆))
35 oveq2 6021 . . . . . . . . . 10 (𝑦 = (𝑧 + 𝑤) → (((invg𝐺)‘𝑧) + 𝑦) = (((invg𝐺)‘𝑧) + (𝑧 + 𝑤)))
3635oveq1d 6028 . . . . . . . . 9 (𝑦 = (𝑧 + 𝑤) → ((((invg𝐺)‘𝑧) + 𝑦) ((invg𝐺)‘𝑧)) = ((((invg𝐺)‘𝑧) + (𝑧 + 𝑤)) ((invg𝐺)‘𝑧)))
3736eleq1d 2298 . . . . . . . 8 (𝑦 = (𝑧 + 𝑤) → (((((invg𝐺)‘𝑧) + 𝑦) ((invg𝐺)‘𝑧)) ∈ 𝑆 ↔ ((((invg𝐺)‘𝑧) + (𝑧 + 𝑤)) ((invg𝐺)‘𝑧)) ∈ 𝑆))
3834, 37rspc2va 2922 . . . . . . 7 (((((invg𝐺)‘𝑧) ∈ 𝑋 ∧ (𝑧 + 𝑤) ∈ 𝑆) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) → ((((invg𝐺)‘𝑧) + (𝑧 + 𝑤)) ((invg𝐺)‘𝑧)) ∈ 𝑆)
3919, 29, 30, 38syl21anc 1270 . . . . . 6 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((((invg𝐺)‘𝑧) + (𝑧 + 𝑤)) ((invg𝐺)‘𝑧)) ∈ 𝑆)
4028, 39eqeltrrd 2307 . . . . 5 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → (𝑤 + 𝑧) ∈ 𝑆)
4140expr 375 . . . 4 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ (𝑧𝑋𝑤𝑋)) → ((𝑧 + 𝑤) ∈ 𝑆 → (𝑤 + 𝑧) ∈ 𝑆))
4241ralrimivva 2612 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) → ∀𝑧𝑋𝑤𝑋 ((𝑧 + 𝑤) ∈ 𝑆 → (𝑤 + 𝑧) ∈ 𝑆))
432, 3isnsg2 13780 . . 3 (𝑆 ∈ (NrmSGrp‘𝐺) ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑧𝑋𝑤𝑋 ((𝑧 + 𝑤) ∈ 𝑆 → (𝑤 + 𝑧) ∈ 𝑆)))
449, 42, 43sylanbrc 417 . 2 ((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) → 𝑆 ∈ (NrmSGrp‘𝐺))
458, 44impbii 126 1 (𝑆 ∈ (NrmSGrp‘𝐺) ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1395  wcel 2200  wral 2508  cfv 5324  (class class class)co 6013  Basecbs 13072  +gcplusg 13150  0gc0g 13329  Grpcgrp 13573  invgcminusg 13574  -gcsg 13575  SubGrpcsubg 13744  NrmSGrpcnsg 13745
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4202  ax-sep 4205  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-cnex 8113  ax-resscn 8114  ax-1re 8116  ax-addrcl 8119
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-riota 5966  df-ov 6016  df-oprab 6017  df-mpo 6018  df-1st 6298  df-2nd 6299  df-inn 9134  df-2 9192  df-ndx 13075  df-slot 13076  df-base 13078  df-plusg 13163  df-0g 13331  df-mgm 13429  df-sgrp 13475  df-mnd 13490  df-grp 13576  df-minusg 13577  df-sbg 13578  df-subg 13747  df-nsg 13748
This theorem is referenced by:  0nsg  13791  nsgid  13792  ghmnsgima  13845  ghmnsgpreima  13846
  Copyright terms: Public domain W3C validator