Theorem qusgrp 13164

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 2190	. . 3 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → (Base‘𝐺) = (Base‘𝐺))
4		eqidd 2190	. . 3 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → (+g‘𝐺) = (+g‘𝐺))
5		nsgsubg 13137	. . . 4 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → 𝑆 ∈ (SubGrp‘𝐺))
6		eqid 2189	. . . . 5 ⊢ (Base‘𝐺) = (Base‘𝐺)
7		eqid 2189	. . . . 5 ⊢ (𝐺 ~QG 𝑆) = (𝐺 ~QG 𝑆)
8	6, 7	eqger 13156	. . . 4 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (𝐺 ~QG 𝑆) Er (Base‘𝐺))
9	5, 8	syl 14	. . 3 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → (𝐺 ~QG 𝑆) Er (Base‘𝐺))
10		subgrcl 13111	. . . 4 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
11	5, 10	syl 14	. . 3 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → 𝐺 ∈ Grp)
12		eqid 2189	. . . 4 ⊢ (+g‘𝐺) = (+g‘𝐺)
13	6, 7, 12	eqgcpbl 13160	. . 3 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → ((𝑎(𝐺 ~QG 𝑆)𝑐 ∧ 𝑏(𝐺 ~QG 𝑆)𝑑) → (𝑎(+g‘𝐺)𝑏)(𝐺 ~QG 𝑆)(𝑐(+g‘𝐺)𝑑)))
14	6, 12	grpcl 12946	. . . 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 12946	. . . . . 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 6574	. . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝑢 ∈ (Base‘𝐺) ∧ 𝑣 ∈ (Base‘𝐺) ∧ 𝑤 ∈ (Base‘𝐺))) → ((𝑢(+g‘𝐺)𝑣)(+g‘𝐺)𝑤)(𝐺 ~QG 𝑆)((𝑢(+g‘𝐺)𝑣)(+g‘𝐺)𝑤))
25	6, 12	grpass 12947	. . . . 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 4044	. . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝑢 ∈ (Base‘𝐺) ∧ 𝑣 ∈ (Base‘𝐺) ∧ 𝑤 ∈ (Base‘𝐺))) → ((𝑢(+g‘𝐺)𝑣)(+g‘𝐺)𝑤)(𝐺 ~QG 𝑆)(𝑢(+g‘𝐺)(𝑣(+g‘𝐺)𝑤)))
28		eqid 2189	. . . . 5 ⊢ (0g‘𝐺) = (0g‘𝐺)
29	6, 28	grpidcl 12966	. . . 4 ⊢ (𝐺 ∈ Grp → (0g‘𝐺) ∈ (Base‘𝐺))
30	11, 29	syl 14	. . 3 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → (0g‘𝐺) ∈ (Base‘𝐺))
31	6, 12, 28	grplid 12968	. . . . 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 6574	. . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑢 ∈ (Base‘𝐺)) → 𝑢(𝐺 ~QG 𝑆)𝑢)
36	32, 35	eqbrtrd 4040	. . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑢 ∈ (Base‘𝐺)) → ((0g‘𝐺)(+g‘𝐺)𝑢)(𝐺 ~QG 𝑆)𝑢)
37		eqid 2189	. . . . 5 ⊢ (invg‘𝐺) = (invg‘𝐺)
38	6, 37	grpinvcl 12985	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑢 ∈ (Base‘𝐺)) → ((invg‘𝐺)‘𝑢) ∈ (Base‘𝐺))
39	11, 38	sylan 283	. . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑢 ∈ (Base‘𝐺)) → ((invg‘𝐺)‘𝑢) ∈ (Base‘𝐺))
40	6, 12, 28, 37	grplinv 12987	. . . . 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 6574	. . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑢 ∈ (Base‘𝐺)) → (0g‘𝐺)(𝐺 ~QG 𝑆)(0g‘𝐺))
44	41, 43	eqbrtrd 4040	. . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑢 ∈ (Base‘𝐺)) → (((invg‘𝐺)‘𝑢)(+g‘𝐺)𝑢)(𝐺 ~QG 𝑆)(0g‘𝐺))
45	2, 3, 4, 9, 11, 13, 15, 27, 30, 36, 39, 44	qusgrp2 13048	. 2 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → (𝐻 ∈ Grp ∧ [(0g‘𝐺)](𝐺 ~QG 𝑆) = (0g‘𝐻)))
46	45	simpld 112	1 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → 𝐻 ∈ Grp)

Syntax hints:   → wi 4   ∧ wa 104   ∧ w3a 980   = wceq 1364   ∈ wcel 2160  ‘cfv 5232  (class class class)co 5892   Er wer 6551  [cec 6552  Basecbs 12507  +_gcplusg 12582  0_gc0g 12754   /_s cqus 12770  Grpcgrp 12938  inv_gcminusg 12939  SubGrpcsubg 13099  NrmSGrpcnsg 13100   ~_QG cqg 13101

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 2162  ax-14 2163  ax-ext 2171  ax-coll 4133  ax-sep 4136  ax-pow 4189  ax-pr 4224  ax-un 4448  ax-setind 4551  ax-cnex 7927  ax-resscn 7928  ax-1cn 7929  ax-1re 7930  ax-icn 7931  ax-addcl 7932  ax-addrcl 7933  ax-mulcl 7934  ax-addcom 7936  ax-addass 7938  ax-i2m1 7941  ax-0lt1 7942  ax-0id 7944  ax-rnegex 7945  ax-pre-ltirr 7948  ax-pre-lttrn 7950  ax-pre-ltadd 7952

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 2041  df-mo 2042  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ne 2361  df-nel 2456  df-ral 2473  df-rex 2474  df-reu 2475  df-rmo 2476  df-rab 2477  df-v 2754  df-sbc 2978  df-csb 3073  df-dif 3146  df-un 3148  df-in 3150  df-ss 3157  df-nul 3438  df-pw 3592  df-sn 3613  df-pr 3614  df-tp 3615  df-op 3616  df-uni 3825  df-int 3860  df-iun 3903  df-br 4019  df-opab 4080  df-mpt 4081  df-id 4308  df-xp 4647  df-rel 4648  df-cnv 4649  df-co 4650  df-dm 4651  df-rn 4652  df-res 4653  df-ima 4654  df-iota 5193  df-fun 5234  df-fn 5235  df-f 5236  df-f1 5237  df-fo 5238  df-f1o 5239  df-fv 5240  df-riota 5848  df-ov 5895  df-oprab 5896  df-mpo 5897  df-er 6554  df-ec 6556  df-qs 6560  df-pnf 8019  df-mnf 8020  df-ltxr 8022  df-inn 8945  df-2 9003  df-3 9004  df-ndx 12510  df-slot 12511  df-base 12513  df-sets 12514  df-iress 12515  df-plusg 12595  df-mulr 12596  df-0g 12756  df-iimas 12772  df-qus 12773  df-mgm 12825  df-sgrp 12858  df-mnd 12871  df-grp 12941  df-minusg 12942  df-subg 13102  df-nsg 13103  df-eqg 13104

This theorem is referenced by:  qus0  13167  qusinv  13168  qusghm  13214