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

Theorem cntrsubgnsg 14169
Description: A central subgroup is normal. (Contributed by Stefan O'Rear, 6-Sep-2015.)
Hypothesis
Ref Expression
cntrnsg.z 𝑍 = (Cntr‘𝑀)
Assertion
Ref Expression
cntrsubgnsg ((𝑋 ∈ (SubGrp‘𝑀) ∧ 𝑋 ⊆ 𝑍) → 𝑋 ∈ (NrmSGrp‘𝑀))

Proof of Theorem cntrsubgnsg
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpl 109 . 2 ((𝑋 ∈ (SubGrp‘𝑀) ∧ 𝑋 ⊆ 𝑍) → 𝑋 ∈ (SubGrp‘𝑀))
2 simplr 533 . . . . . . . . 9 (((𝑋 ∈ (SubGrp‘𝑀) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑥 ∈ (Base‘𝑀) ∧ 𝑦 ∈ 𝑋)) → 𝑋 ⊆ 𝑍)
3 simprr 537 . . . . . . . . 9 (((𝑋 ∈ (SubGrp‘𝑀) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑥 ∈ (Base‘𝑀) ∧ 𝑦 ∈ 𝑋)) → 𝑦 ∈ 𝑋)
42, 3sseldd 3249 . . . . . . . 8 (((𝑋 ∈ (SubGrp‘𝑀) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑥 ∈ (Base‘𝑀) ∧ 𝑦 ∈ 𝑋)) → 𝑦 ∈ 𝑍)
5 eqid 2238 . . . . . . . . . 10 (Base‘𝑀) = (Base‘𝑀)
6 eqid 2238 . . . . . . . . . 10 (Cntz‘𝑀) = (Cntz‘𝑀)
75, 6cntrval 14145 . . . . . . . . 9 ((Cntz‘𝑀)‘(Base‘𝑀)) = (Cntr‘𝑀)
8 cntrnsg.z . . . . . . . . 9 𝑍 = (Cntr‘𝑀)
97, 8eqtr4i 2262 . . . . . . . 8 ((Cntz‘𝑀)‘(Base‘𝑀)) = 𝑍
104, 9eleqtrrdi 2332 . . . . . . 7 (((𝑋 ∈ (SubGrp‘𝑀) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑥 ∈ (Base‘𝑀) ∧ 𝑦 ∈ 𝑋)) → 𝑦 ∈ ((Cntz‘𝑀)‘(Base‘𝑀)))
11 simprl 535 . . . . . . 7 (((𝑋 ∈ (SubGrp‘𝑀) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑥 ∈ (Base‘𝑀) ∧ 𝑦 ∈ 𝑋)) → 𝑥 ∈ (Base‘𝑀))
12 eqid 2238 . . . . . . . 8 (+g‘𝑀) = (+g‘𝑀)
1312, 6cntzi 14156 . . . . . . 7 ((𝑦 ∈ ((Cntz‘𝑀)‘(Base‘𝑀)) ∧ 𝑥 ∈ (Base‘𝑀)) → (𝑦(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)𝑦))
1410, 11, 13syl2anc 415 . . . . . 6 (((𝑋 ∈ (SubGrp‘𝑀) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑥 ∈ (Base‘𝑀) ∧ 𝑦 ∈ 𝑋)) → (𝑦(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)𝑦))
1514oveq1d 6100 . . . . 5 (((𝑋 ∈ (SubGrp‘𝑀) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑥 ∈ (Base‘𝑀) ∧ 𝑦 ∈ 𝑋)) → ((𝑦(+g‘𝑀)𝑥)(-g‘𝑀)𝑥) = ((𝑥(+g‘𝑀)𝑦)(-g‘𝑀)𝑥))
16 subgrcl 14035 . . . . . . 7 (𝑋 ∈ (SubGrp‘𝑀) → 𝑀 ∈ Grp)
1716ad2antrr 492 . . . . . 6 (((𝑋 ∈ (SubGrp‘𝑀) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑥 ∈ (Base‘𝑀) ∧ 𝑦 ∈ 𝑋)) → 𝑀 ∈ Grp)
185subgss 14030 . . . . . . . 8 (𝑋 ∈ (SubGrp‘𝑀) → 𝑋 ⊆ (Base‘𝑀))
1918ad2antrr 492 . . . . . . 7 (((𝑋 ∈ (SubGrp‘𝑀) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑥 ∈ (Base‘𝑀) ∧ 𝑦 ∈ 𝑋)) → 𝑋 ⊆ (Base‘𝑀))
2019, 3sseldd 3249 . . . . . 6 (((𝑋 ∈ (SubGrp‘𝑀) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑥 ∈ (Base‘𝑀) ∧ 𝑦 ∈ 𝑋)) → 𝑦 ∈ (Base‘𝑀))
21 eqid 2238 . . . . . . 7 (-g‘𝑀) = (-g‘𝑀)
225, 12, 21grppncan 13949 . . . . . 6 ((𝑀 ∈ Grp ∧ 𝑦 ∈ (Base‘𝑀) ∧ 𝑥 ∈ (Base‘𝑀)) → ((𝑦(+g‘𝑀)𝑥)(-g‘𝑀)𝑥) = 𝑦)
2317, 20, 11, 22syl3anc 1278 . . . . 5 (((𝑋 ∈ (SubGrp‘𝑀) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑥 ∈ (Base‘𝑀) ∧ 𝑦 ∈ 𝑋)) → ((𝑦(+g‘𝑀)𝑥)(-g‘𝑀)𝑥) = 𝑦)
2415, 23eqtr3d 2273 . . . 4 (((𝑋 ∈ (SubGrp‘𝑀) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑥 ∈ (Base‘𝑀) ∧ 𝑦 ∈ 𝑋)) → ((𝑥(+g‘𝑀)𝑦)(-g‘𝑀)𝑥) = 𝑦)
2524, 3eqeltrd 2315 . . 3 (((𝑋 ∈ (SubGrp‘𝑀) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑥 ∈ (Base‘𝑀) ∧ 𝑦 ∈ 𝑋)) → ((𝑥(+g‘𝑀)𝑦)(-g‘𝑀)𝑥) ∈ 𝑋)
2625ralrimivva 2632 . 2 ((𝑋 ∈ (SubGrp‘𝑀) ∧ 𝑋 ⊆ 𝑍) → ∀𝑥 ∈ (Base‘𝑀)∀𝑦 ∈ 𝑋 ((𝑥(+g‘𝑀)𝑦)(-g‘𝑀)𝑥) ∈ 𝑋)
275, 12, 21isnsg3 14063 . 2 (𝑋 ∈ (NrmSGrp‘𝑀) ↔ (𝑋 ∈ (SubGrp‘𝑀) ∧ ∀𝑥 ∈ (Base‘𝑀)∀𝑦 ∈ 𝑋 ((𝑥(+g‘𝑀)𝑦)(-g‘𝑀)𝑥) ∈ 𝑋))
281, 26, 27sylanbrc 421 1 ((𝑋 ∈ (SubGrp‘𝑀) ∧ 𝑋 ⊆ 𝑍) → 𝑋 ∈ (NrmSGrp‘𝑀))
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   = wceq 1402   ∈ wcel 2209  ∀wral 2528   ⊆ wss 3220  ‘cfv 5377  (class class class)co 6085  Basecbs 13404  +gcplusg 13484  Grpcgrp 13858  -gcsg 13860  SubGrpcsubg 14023  NrmSGrpcnsg 14024  Cntzccntz 14140  Cntrccntr 14141
This proof depends on 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-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8271  ax-resscn 8272  ax-1re 8274  ax-addrcl 8277
This proof 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-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-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-inn 9308  df-2 9366  df-ndx 13407  df-slot 13408  df-base 13410  df-plusg 13497  df-0g 13665  df-mgm 13729  df-sgrp 13770  df-mnd 13783  df-grp 13861  df-minusg 13862  df-sbg 13863  df-subg 14026  df-nsg 14027  df-cntz 14142  df-cntr 14143
This theorem is used by:  cntrnsg  14170
  Copyright terms: Public domain W3C validator