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

Theorem qusgrp 13882
Description: If 𝑌 is a normal subgroup of 𝐺, then 𝐻 = 𝐺 / 𝑌 is a group, called the quotient of 𝐺 by 𝑌. (Contributed by Mario Carneiro, 14-Jun-2015.) (Revised by Mario Carneiro, 12-Aug-2015.)
Hypothesis
Ref Expression
qusgrp.h 𝐻 = (𝐺 /s (𝐺 ~QG 𝑆))
Assertion
Ref Expression
qusgrp (𝑆 ∈ (NrmSGrp‘𝐺) → 𝐻 ∈ Grp)

Proof of Theorem qusgrp
Dummy variables 𝑎 𝑏 𝑐 𝑑 𝑢 𝑣 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 qusgrp.h . . . 4 𝐻 = (𝐺 /s (𝐺 ~QG 𝑆))
21a1i 9 . . 3 (𝑆 ∈ (NrmSGrp‘𝐺) → 𝐻 = (𝐺 /s (𝐺 ~QG 𝑆)))
3 eqidd 2232 . . 3 (𝑆 ∈ (NrmSGrp‘𝐺) → (Base‘𝐺) = (Base‘𝐺))
4 eqidd 2232 . . 3 (𝑆 ∈ (NrmSGrp‘𝐺) → (+g𝐺) = (+g𝐺))
5 nsgsubg 13855 . . . 4 (𝑆 ∈ (NrmSGrp‘𝐺) → 𝑆 ∈ (SubGrp‘𝐺))
6 eqid 2231 . . . . 5 (Base‘𝐺) = (Base‘𝐺)
7 eqid 2231 . . . . 5 (𝐺 ~QG 𝑆) = (𝐺 ~QG 𝑆)
86, 7eqger 13874 . . . 4 (𝑆 ∈ (SubGrp‘𝐺) → (𝐺 ~QG 𝑆) Er (Base‘𝐺))
95, 8syl 14 . . 3 (𝑆 ∈ (NrmSGrp‘𝐺) → (𝐺 ~QG 𝑆) Er (Base‘𝐺))
10 subgrcl 13829 . . . 4 (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
115, 10syl 14 . . 3 (𝑆 ∈ (NrmSGrp‘𝐺) → 𝐺 ∈ Grp)
12 eqid 2231 . . . 4 (+g𝐺) = (+g𝐺)
136, 7, 12eqgcpbl 13878 . . 3 (𝑆 ∈ (NrmSGrp‘𝐺) → ((𝑎(𝐺 ~QG 𝑆)𝑐𝑏(𝐺 ~QG 𝑆)𝑑) → (𝑎(+g𝐺)𝑏)(𝐺 ~QG 𝑆)(𝑐(+g𝐺)𝑑)))
146, 12grpcl 13654 . . . 4 ((𝐺 ∈ Grp ∧ 𝑢 ∈ (Base‘𝐺) ∧ 𝑣 ∈ (Base‘𝐺)) → (𝑢(+g𝐺)𝑣) ∈ (Base‘𝐺))
1511, 14syl3an1 1307 . . 3 ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑢 ∈ (Base‘𝐺) ∧ 𝑣 ∈ (Base‘𝐺)) → (𝑢(+g𝐺)𝑣) ∈ (Base‘𝐺))
169adantr 276 . . . . 5 ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝑢 ∈ (Base‘𝐺) ∧ 𝑣 ∈ (Base‘𝐺) ∧ 𝑤 ∈ (Base‘𝐺))) → (𝐺 ~QG 𝑆) Er (Base‘𝐺))
1711adantr 276 . . . . . 6 ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝑢 ∈ (Base‘𝐺) ∧ 𝑣 ∈ (Base‘𝐺) ∧ 𝑤 ∈ (Base‘𝐺))) → 𝐺 ∈ Grp)
18 simpr1 1030 . . . . . . 7 ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝑢 ∈ (Base‘𝐺) ∧ 𝑣 ∈ (Base‘𝐺) ∧ 𝑤 ∈ (Base‘𝐺))) → 𝑢 ∈ (Base‘𝐺))
19 simpr2 1031 . . . . . . 7 ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝑢 ∈ (Base‘𝐺) ∧ 𝑣 ∈ (Base‘𝐺) ∧ 𝑤 ∈ (Base‘𝐺))) → 𝑣 ∈ (Base‘𝐺))
2017, 18, 19, 14syl3anc 1274 . . . . . 6 ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝑢 ∈ (Base‘𝐺) ∧ 𝑣 ∈ (Base‘𝐺) ∧ 𝑤 ∈ (Base‘𝐺))) → (𝑢(+g𝐺)𝑣) ∈ (Base‘𝐺))
21 simpr3 1032 . . . . . 6 ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝑢 ∈ (Base‘𝐺) ∧ 𝑣 ∈ (Base‘𝐺) ∧ 𝑤 ∈ (Base‘𝐺))) → 𝑤 ∈ (Base‘𝐺))
226, 12grpcl 13654 . . . . . 6 ((𝐺 ∈ Grp ∧ (𝑢(+g𝐺)𝑣) ∈ (Base‘𝐺) ∧ 𝑤 ∈ (Base‘𝐺)) → ((𝑢(+g𝐺)𝑣)(+g𝐺)𝑤) ∈ (Base‘𝐺))
2317, 20, 21, 22syl3anc 1274 . . . . 5 ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝑢 ∈ (Base‘𝐺) ∧ 𝑣 ∈ (Base‘𝐺) ∧ 𝑤 ∈ (Base‘𝐺))) → ((𝑢(+g𝐺)𝑣)(+g𝐺)𝑤) ∈ (Base‘𝐺))
2416, 23erref 6765 . . . 4 ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝑢 ∈ (Base‘𝐺) ∧ 𝑣 ∈ (Base‘𝐺) ∧ 𝑤 ∈ (Base‘𝐺))) → ((𝑢(+g𝐺)𝑣)(+g𝐺)𝑤)(𝐺 ~QG 𝑆)((𝑢(+g𝐺)𝑣)(+g𝐺)𝑤))
256, 12grpass 13655 . . . . 5 ((𝐺 ∈ Grp ∧ (𝑢 ∈ (Base‘𝐺) ∧ 𝑣 ∈ (Base‘𝐺) ∧ 𝑤 ∈ (Base‘𝐺))) → ((𝑢(+g𝐺)𝑣)(+g𝐺)𝑤) = (𝑢(+g𝐺)(𝑣(+g𝐺)𝑤)))
2611, 25sylan 283 . . . 4 ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝑢 ∈ (Base‘𝐺) ∧ 𝑣 ∈ (Base‘𝐺) ∧ 𝑤 ∈ (Base‘𝐺))) → ((𝑢(+g𝐺)𝑣)(+g𝐺)𝑤) = (𝑢(+g𝐺)(𝑣(+g𝐺)𝑤)))
2724, 26breqtrd 4119 . . 3 ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝑢 ∈ (Base‘𝐺) ∧ 𝑣 ∈ (Base‘𝐺) ∧ 𝑤 ∈ (Base‘𝐺))) → ((𝑢(+g𝐺)𝑣)(+g𝐺)𝑤)(𝐺 ~QG 𝑆)(𝑢(+g𝐺)(𝑣(+g𝐺)𝑤)))
28 eqid 2231 . . . . 5 (0g𝐺) = (0g𝐺)
296, 28grpidcl 13675 . . . 4 (𝐺 ∈ Grp → (0g𝐺) ∈ (Base‘𝐺))
3011, 29syl 14 . . 3 (𝑆 ∈ (NrmSGrp‘𝐺) → (0g𝐺) ∈ (Base‘𝐺))
316, 12, 28grplid 13677 . . . . 5 ((𝐺 ∈ Grp ∧ 𝑢 ∈ (Base‘𝐺)) → ((0g𝐺)(+g𝐺)𝑢) = 𝑢)
3211, 31sylan 283 . . . 4 ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑢 ∈ (Base‘𝐺)) → ((0g𝐺)(+g𝐺)𝑢) = 𝑢)
339adantr 276 . . . . 5 ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑢 ∈ (Base‘𝐺)) → (𝐺 ~QG 𝑆) Er (Base‘𝐺))
34 simpr 110 . . . . 5 ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑢 ∈ (Base‘𝐺)) → 𝑢 ∈ (Base‘𝐺))
3533, 34erref 6765 . . . 4 ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑢 ∈ (Base‘𝐺)) → 𝑢(𝐺 ~QG 𝑆)𝑢)
3632, 35eqbrtrd 4115 . . 3 ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑢 ∈ (Base‘𝐺)) → ((0g𝐺)(+g𝐺)𝑢)(𝐺 ~QG 𝑆)𝑢)
37 eqid 2231 . . . . 5 (invg𝐺) = (invg𝐺)
386, 37grpinvcl 13694 . . . 4 ((𝐺 ∈ Grp ∧ 𝑢 ∈ (Base‘𝐺)) → ((invg𝐺)‘𝑢) ∈ (Base‘𝐺))
3911, 38sylan 283 . . 3 ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑢 ∈ (Base‘𝐺)) → ((invg𝐺)‘𝑢) ∈ (Base‘𝐺))
406, 12, 28, 37grplinv 13696 . . . . 5 ((𝐺 ∈ Grp ∧ 𝑢 ∈ (Base‘𝐺)) → (((invg𝐺)‘𝑢)(+g𝐺)𝑢) = (0g𝐺))
4111, 40sylan 283 . . . 4 ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑢 ∈ (Base‘𝐺)) → (((invg𝐺)‘𝑢)(+g𝐺)𝑢) = (0g𝐺))
4230adantr 276 . . . . 5 ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑢 ∈ (Base‘𝐺)) → (0g𝐺) ∈ (Base‘𝐺))
4333, 42erref 6765 . . . 4 ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑢 ∈ (Base‘𝐺)) → (0g𝐺)(𝐺 ~QG 𝑆)(0g𝐺))
4441, 43eqbrtrd 4115 . . 3 ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑢 ∈ (Base‘𝐺)) → (((invg𝐺)‘𝑢)(+g𝐺)𝑢)(𝐺 ~QG 𝑆)(0g𝐺))
452, 3, 4, 9, 11, 13, 15, 27, 30, 36, 39, 44qusgrp2 13763 . 2 (𝑆 ∈ (NrmSGrp‘𝐺) → (𝐻 ∈ Grp ∧ [(0g𝐺)](𝐺 ~QG 𝑆) = (0g𝐻)))
4645simpld 112 1 (𝑆 ∈ (NrmSGrp‘𝐺) → 𝐻 ∈ Grp)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 1005   = wceq 1398  wcel 2202  cfv 5333  (class class class)co 6028   Er wer 6742  [cec 6743  Basecbs 13145  +gcplusg 13223  0gc0g 13402   /s cqus 13446  Grpcgrp 13646  invgcminusg 13647  SubGrpcsubg 13817  NrmSGrpcnsg 13818   ~QG cqg 13819
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 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8166  ax-resscn 8167  ax-1cn 8168  ax-1re 8169  ax-icn 8170  ax-addcl 8171  ax-addrcl 8172  ax-mulcl 8173  ax-addcom 8175  ax-addass 8177  ax-i2m1 8180  ax-0lt1 8181  ax-0id 8183  ax-rnegex 8184  ax-pre-ltirr 8187  ax-pre-lttrn 8189  ax-pre-ltadd 8191
This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rmo 2519  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-tp 3681  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-er 6745  df-ec 6747  df-qs 6751  df-pnf 8258  df-mnf 8259  df-ltxr 8261  df-inn 9186  df-2 9244  df-3 9245  df-ndx 13148  df-slot 13149  df-base 13151  df-sets 13152  df-iress 13153  df-plusg 13236  df-mulr 13237  df-0g 13404  df-iimas 13448  df-qus 13449  df-mgm 13502  df-sgrp 13548  df-mnd 13563  df-grp 13649  df-minusg 13650  df-subg 13820  df-nsg 13821  df-eqg 13822
This theorem is referenced by:  qus0  13885  qusinv  13886  qusghm  13932
  Copyright terms: Public domain W3C validator