Theorem qusgrp 13302

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.

Step	Hyp	Ref	Expression
1		qusgrp.h	. . . 4 ⊢ 𝐻 = (𝐺 /s (𝐺 ~QG 𝑆))
2	1	a1i 9	. . 3 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → 𝐻 = (𝐺 /s (𝐺 ~QG 𝑆)))
3		eqidd 2194	. . 3 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → (Base‘𝐺) = (Base‘𝐺))
4		eqidd 2194	. . 3 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → (+g‘𝐺) = (+g‘𝐺))
5		nsgsubg 13275	. . . 4 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → 𝑆 ∈ (SubGrp‘𝐺))
6		eqid 2193	. . . . 5 ⊢ (Base‘𝐺) = (Base‘𝐺)
7		eqid 2193	. . . . 5 ⊢ (𝐺 ~QG 𝑆) = (𝐺 ~QG 𝑆)
8	6, 7	eqger 13294	. . . 4 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (𝐺 ~QG 𝑆) Er (Base‘𝐺))
9	5, 8	syl 14	. . 3 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → (𝐺 ~QG 𝑆) Er (Base‘𝐺))
10		subgrcl 13249	. . . 4 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
11	5, 10	syl 14	. . 3 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → 𝐺 ∈ Grp)
12		eqid 2193	. . . 4 ⊢ (+g‘𝐺) = (+g‘𝐺)
13	6, 7, 12	eqgcpbl 13298	. . 3 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → ((𝑎(𝐺 ~QG 𝑆)𝑐 ∧ 𝑏(𝐺 ~QG 𝑆)𝑑) → (𝑎(+g‘𝐺)𝑏)(𝐺 ~QG 𝑆)(𝑐(+g‘𝐺)𝑑)))
14	6, 12	grpcl 13080	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑢 ∈ (Base‘𝐺) ∧ 𝑣 ∈ (Base‘𝐺)) → (𝑢(+g‘𝐺)𝑣) ∈ (Base‘𝐺))
15	11, 14	syl3an1 1282	. . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑢 ∈ (Base‘𝐺) ∧ 𝑣 ∈ (Base‘𝐺)) → (𝑢(+g‘𝐺)𝑣) ∈ (Base‘𝐺))
16	9	adantr 276	. . . . 5 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝑢 ∈ (Base‘𝐺) ∧ 𝑣 ∈ (Base‘𝐺) ∧ 𝑤 ∈ (Base‘𝐺))) → (𝐺 ~QG 𝑆) Er (Base‘𝐺))
17	11	adantr 276	. . . . . 6 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝑢 ∈ (Base‘𝐺) ∧ 𝑣 ∈ (Base‘𝐺) ∧ 𝑤 ∈ (Base‘𝐺))) → 𝐺 ∈ Grp)
18		simpr1 1005	. . . . . . 7 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝑢 ∈ (Base‘𝐺) ∧ 𝑣 ∈ (Base‘𝐺) ∧ 𝑤 ∈ (Base‘𝐺))) → 𝑢 ∈ (Base‘𝐺))
19		simpr2 1006	. . . . . . 7 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝑢 ∈ (Base‘𝐺) ∧ 𝑣 ∈ (Base‘𝐺) ∧ 𝑤 ∈ (Base‘𝐺))) → 𝑣 ∈ (Base‘𝐺))
20	17, 18, 19, 14	syl3anc 1249	. . . . . 6 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝑢 ∈ (Base‘𝐺) ∧ 𝑣 ∈ (Base‘𝐺) ∧ 𝑤 ∈ (Base‘𝐺))) → (𝑢(+g‘𝐺)𝑣) ∈ (Base‘𝐺))
21		simpr3 1007	. . . . . 6 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝑢 ∈ (Base‘𝐺) ∧ 𝑣 ∈ (Base‘𝐺) ∧ 𝑤 ∈ (Base‘𝐺))) → 𝑤 ∈ (Base‘𝐺))
22	6, 12	grpcl 13080	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ (𝑢(+g‘𝐺)𝑣) ∈ (Base‘𝐺) ∧ 𝑤 ∈ (Base‘𝐺)) → ((𝑢(+g‘𝐺)𝑣)(+g‘𝐺)𝑤) ∈ (Base‘𝐺))
23	17, 20, 21, 22	syl3anc 1249	. . . . 5 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝑢 ∈ (Base‘𝐺) ∧ 𝑣 ∈ (Base‘𝐺) ∧ 𝑤 ∈ (Base‘𝐺))) → ((𝑢(+g‘𝐺)𝑣)(+g‘𝐺)𝑤) ∈ (Base‘𝐺))
24	16, 23	erref 6607	. . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝑢 ∈ (Base‘𝐺) ∧ 𝑣 ∈ (Base‘𝐺) ∧ 𝑤 ∈ (Base‘𝐺))) → ((𝑢(+g‘𝐺)𝑣)(+g‘𝐺)𝑤)(𝐺 ~QG 𝑆)((𝑢(+g‘𝐺)𝑣)(+g‘𝐺)𝑤))
25	6, 12	grpass 13081	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ (𝑢 ∈ (Base‘𝐺) ∧ 𝑣 ∈ (Base‘𝐺) ∧ 𝑤 ∈ (Base‘𝐺))) → ((𝑢(+g‘𝐺)𝑣)(+g‘𝐺)𝑤) = (𝑢(+g‘𝐺)(𝑣(+g‘𝐺)𝑤)))
26	11, 25	sylan 283	. . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝑢 ∈ (Base‘𝐺) ∧ 𝑣 ∈ (Base‘𝐺) ∧ 𝑤 ∈ (Base‘𝐺))) → ((𝑢(+g‘𝐺)𝑣)(+g‘𝐺)𝑤) = (𝑢(+g‘𝐺)(𝑣(+g‘𝐺)𝑤)))
27	24, 26	breqtrd 4055	. . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝑢 ∈ (Base‘𝐺) ∧ 𝑣 ∈ (Base‘𝐺) ∧ 𝑤 ∈ (Base‘𝐺))) → ((𝑢(+g‘𝐺)𝑣)(+g‘𝐺)𝑤)(𝐺 ~QG 𝑆)(𝑢(+g‘𝐺)(𝑣(+g‘𝐺)𝑤)))
28		eqid 2193	. . . . 5 ⊢ (0g‘𝐺) = (0g‘𝐺)
29	6, 28	grpidcl 13101	. . . 4 ⊢ (𝐺 ∈ Grp → (0g‘𝐺) ∈ (Base‘𝐺))
30	11, 29	syl 14	. . 3 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → (0g‘𝐺) ∈ (Base‘𝐺))
31	6, 12, 28	grplid 13103	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑢 ∈ (Base‘𝐺)) → ((0g‘𝐺)(+g‘𝐺)𝑢) = 𝑢)
32	11, 31	sylan 283	. . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑢 ∈ (Base‘𝐺)) → ((0g‘𝐺)(+g‘𝐺)𝑢) = 𝑢)
33	9	adantr 276	. . . . 5 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑢 ∈ (Base‘𝐺)) → (𝐺 ~QG 𝑆) Er (Base‘𝐺))
34		simpr 110	. . . . 5 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑢 ∈ (Base‘𝐺)) → 𝑢 ∈ (Base‘𝐺))
35	33, 34	erref 6607	. . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑢 ∈ (Base‘𝐺)) → 𝑢(𝐺 ~QG 𝑆)𝑢)
36	32, 35	eqbrtrd 4051	. . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑢 ∈ (Base‘𝐺)) → ((0g‘𝐺)(+g‘𝐺)𝑢)(𝐺 ~QG 𝑆)𝑢)
37		eqid 2193	. . . . 5 ⊢ (invg‘𝐺) = (invg‘𝐺)
38	6, 37	grpinvcl 13120	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑢 ∈ (Base‘𝐺)) → ((invg‘𝐺)‘𝑢) ∈ (Base‘𝐺))
39	11, 38	sylan 283	. . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑢 ∈ (Base‘𝐺)) → ((invg‘𝐺)‘𝑢) ∈ (Base‘𝐺))
40	6, 12, 28, 37	grplinv 13122	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑢 ∈ (Base‘𝐺)) → (((invg‘𝐺)‘𝑢)(+g‘𝐺)𝑢) = (0g‘𝐺))
41	11, 40	sylan 283	. . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑢 ∈ (Base‘𝐺)) → (((invg‘𝐺)‘𝑢)(+g‘𝐺)𝑢) = (0g‘𝐺))
42	30	adantr 276	. . . . 5 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑢 ∈ (Base‘𝐺)) → (0g‘𝐺) ∈ (Base‘𝐺))
43	33, 42	erref 6607	. . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑢 ∈ (Base‘𝐺)) → (0g‘𝐺)(𝐺 ~QG 𝑆)(0g‘𝐺))
44	41, 43	eqbrtrd 4051	. . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑢 ∈ (Base‘𝐺)) → (((invg‘𝐺)‘𝑢)(+g‘𝐺)𝑢)(𝐺 ~QG 𝑆)(0g‘𝐺))
45	2, 3, 4, 9, 11, 13, 15, 27, 30, 36, 39, 44	qusgrp2 13183	. 2 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → (𝐻 ∈ Grp ∧ [(0g‘𝐺)](𝐺 ~QG 𝑆) = (0g‘𝐻)))
46	45	simpld 112	1 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → 𝐻 ∈ Grp)

Syntax hints:   → wi 4   ∧ wa 104   ∧ w3a 980   = wceq 1364   ∈ wcel 2164  ‘cfv 5254  (class class class)co 5918   Er wer 6584  [cec 6585  Basecbs 12618  +_gcplusg 12695  0_gc0g 12867   /_s cqus 12883  Grpcgrp 13072  inv_gcminusg 13073  SubGrpcsubg 13237  NrmSGrpcnsg 13238   ~_QG cqg 13239

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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4144  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-cnex 7963  ax-resscn 7964  ax-1cn 7965  ax-1re 7966  ax-icn 7967  ax-addcl 7968  ax-addrcl 7969  ax-mulcl 7970  ax-addcom 7972  ax-addass 7974  ax-i2m1 7977  ax-0lt1 7978  ax-0id 7980  ax-rnegex 7981  ax-pre-ltirr 7984  ax-pre-lttrn 7986  ax-pre-ltadd 7988

This theorem depends on definitions:  df-bi 117  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-reu 2479  df-rmo 2480  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-pw 3603  df-sn 3624  df-pr 3625  df-tp 3626  df-op 3627  df-uni 3836  df-int 3871  df-iun 3914  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-fv 5262  df-riota 5873  df-ov 5921  df-oprab 5922  df-mpo 5923  df-er 6587  df-ec 6589  df-qs 6593  df-pnf 8056  df-mnf 8057  df-ltxr 8059  df-inn 8983  df-2 9041  df-3 9042  df-ndx 12621  df-slot 12622  df-base 12624  df-sets 12625  df-iress 12626  df-plusg 12708  df-mulr 12709  df-0g 12869  df-iimas 12885  df-qus 12886  df-mgm 12939  df-sgrp 12985  df-mnd 12998  df-grp 13075  df-minusg 13076  df-subg 13240  df-nsg 13241  df-eqg 13242

This theorem is referenced by:  qus0  13305  qusinv  13306  qusghm  13352