Theorem qusgrp 13809

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 2230	. . 3 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → (Base‘𝐺) = (Base‘𝐺))
4		eqidd 2230	. . 3 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → (+g‘𝐺) = (+g‘𝐺))
5		nsgsubg 13782	. . . 4 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → 𝑆 ∈ (SubGrp‘𝐺))
6		eqid 2229	. . . . 5 ⊢ (Base‘𝐺) = (Base‘𝐺)
7		eqid 2229	. . . . 5 ⊢ (𝐺 ~QG 𝑆) = (𝐺 ~QG 𝑆)
8	6, 7	eqger 13801	. . . 4 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (𝐺 ~QG 𝑆) Er (Base‘𝐺))
9	5, 8	syl 14	. . 3 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → (𝐺 ~QG 𝑆) Er (Base‘𝐺))
10		subgrcl 13756	. . . 4 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
11	5, 10	syl 14	. . 3 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → 𝐺 ∈ Grp)
12		eqid 2229	. . . 4 ⊢ (+g‘𝐺) = (+g‘𝐺)
13	6, 7, 12	eqgcpbl 13805	. . 3 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → ((𝑎(𝐺 ~QG 𝑆)𝑐 ∧ 𝑏(𝐺 ~QG 𝑆)𝑑) → (𝑎(+g‘𝐺)𝑏)(𝐺 ~QG 𝑆)(𝑐(+g‘𝐺)𝑑)))
14	6, 12	grpcl 13581	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑢 ∈ (Base‘𝐺) ∧ 𝑣 ∈ (Base‘𝐺)) → (𝑢(+g‘𝐺)𝑣) ∈ (Base‘𝐺))
15	11, 14	syl3an1 1304	. . 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 1027	. . . . . . 7 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝑢 ∈ (Base‘𝐺) ∧ 𝑣 ∈ (Base‘𝐺) ∧ 𝑤 ∈ (Base‘𝐺))) → 𝑢 ∈ (Base‘𝐺))
19		simpr2 1028	. . . . . . 7 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝑢 ∈ (Base‘𝐺) ∧ 𝑣 ∈ (Base‘𝐺) ∧ 𝑤 ∈ (Base‘𝐺))) → 𝑣 ∈ (Base‘𝐺))
20	17, 18, 19, 14	syl3anc 1271	. . . . . 6 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝑢 ∈ (Base‘𝐺) ∧ 𝑣 ∈ (Base‘𝐺) ∧ 𝑤 ∈ (Base‘𝐺))) → (𝑢(+g‘𝐺)𝑣) ∈ (Base‘𝐺))
21		simpr3 1029	. . . . . 6 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝑢 ∈ (Base‘𝐺) ∧ 𝑣 ∈ (Base‘𝐺) ∧ 𝑤 ∈ (Base‘𝐺))) → 𝑤 ∈ (Base‘𝐺))
22	6, 12	grpcl 13581	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ (𝑢(+g‘𝐺)𝑣) ∈ (Base‘𝐺) ∧ 𝑤 ∈ (Base‘𝐺)) → ((𝑢(+g‘𝐺)𝑣)(+g‘𝐺)𝑤) ∈ (Base‘𝐺))
23	17, 20, 21, 22	syl3anc 1271	. . . . 5 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝑢 ∈ (Base‘𝐺) ∧ 𝑣 ∈ (Base‘𝐺) ∧ 𝑤 ∈ (Base‘𝐺))) → ((𝑢(+g‘𝐺)𝑣)(+g‘𝐺)𝑤) ∈ (Base‘𝐺))
24	16, 23	erref 6717	. . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝑢 ∈ (Base‘𝐺) ∧ 𝑣 ∈ (Base‘𝐺) ∧ 𝑤 ∈ (Base‘𝐺))) → ((𝑢(+g‘𝐺)𝑣)(+g‘𝐺)𝑤)(𝐺 ~QG 𝑆)((𝑢(+g‘𝐺)𝑣)(+g‘𝐺)𝑤))
25	6, 12	grpass 13582	. . . . 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 4112	. . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝑢 ∈ (Base‘𝐺) ∧ 𝑣 ∈ (Base‘𝐺) ∧ 𝑤 ∈ (Base‘𝐺))) → ((𝑢(+g‘𝐺)𝑣)(+g‘𝐺)𝑤)(𝐺 ~QG 𝑆)(𝑢(+g‘𝐺)(𝑣(+g‘𝐺)𝑤)))
28		eqid 2229	. . . . 5 ⊢ (0g‘𝐺) = (0g‘𝐺)
29	6, 28	grpidcl 13602	. . . 4 ⊢ (𝐺 ∈ Grp → (0g‘𝐺) ∈ (Base‘𝐺))
30	11, 29	syl 14	. . 3 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → (0g‘𝐺) ∈ (Base‘𝐺))
31	6, 12, 28	grplid 13604	. . . . 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 6717	. . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑢 ∈ (Base‘𝐺)) → 𝑢(𝐺 ~QG 𝑆)𝑢)
36	32, 35	eqbrtrd 4108	. . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑢 ∈ (Base‘𝐺)) → ((0g‘𝐺)(+g‘𝐺)𝑢)(𝐺 ~QG 𝑆)𝑢)
37		eqid 2229	. . . . 5 ⊢ (invg‘𝐺) = (invg‘𝐺)
38	6, 37	grpinvcl 13621	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑢 ∈ (Base‘𝐺)) → ((invg‘𝐺)‘𝑢) ∈ (Base‘𝐺))
39	11, 38	sylan 283	. . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑢 ∈ (Base‘𝐺)) → ((invg‘𝐺)‘𝑢) ∈ (Base‘𝐺))
40	6, 12, 28, 37	grplinv 13623	. . . . 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 6717	. . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑢 ∈ (Base‘𝐺)) → (0g‘𝐺)(𝐺 ~QG 𝑆)(0g‘𝐺))
44	41, 43	eqbrtrd 4108	. . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑢 ∈ (Base‘𝐺)) → (((invg‘𝐺)‘𝑢)(+g‘𝐺)𝑢)(𝐺 ~QG 𝑆)(0g‘𝐺))
45	2, 3, 4, 9, 11, 13, 15, 27, 30, 36, 39, 44	qusgrp2 13690	. 2 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → (𝐻 ∈ Grp ∧ [(0g‘𝐺)](𝐺 ~QG 𝑆) = (0g‘𝐻)))
46	45	simpld 112	1 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → 𝐻 ∈ Grp)

Syntax hints:   → wi 4   ∧ wa 104   ∧ w3a 1002   = wceq 1395   ∈ wcel 2200  ‘cfv 5324  (class class class)co 6013   Er wer 6694  [cec 6695  Basecbs 13072  +_gcplusg 13150  0_gc0g 13329   /_s cqus 13373  Grpcgrp 13573  inv_gcminusg 13574  SubGrpcsubg 13744  NrmSGrpcnsg 13745   ~_QG cqg 13746

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-1cn 8115  ax-1re 8116  ax-icn 8117  ax-addcl 8118  ax-addrcl 8119  ax-mulcl 8120  ax-addcom 8122  ax-addass 8124  ax-i2m1 8127  ax-0lt1 8128  ax-0id 8130  ax-rnegex 8131  ax-pre-ltirr 8134  ax-pre-lttrn 8136  ax-pre-ltadd 8138

This theorem depends on definitions:  df-bi 117  df-3or 1003  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-nel 2496  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-nul 3493  df-pw 3652  df-sn 3673  df-pr 3674  df-tp 3675  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-er 6697  df-ec 6699  df-qs 6703  df-pnf 8206  df-mnf 8207  df-ltxr 8209  df-inn 9134  df-2 9192  df-3 9193  df-ndx 13075  df-slot 13076  df-base 13078  df-sets 13079  df-iress 13080  df-plusg 13163  df-mulr 13164  df-0g 13331  df-iimas 13375  df-qus 13376  df-mgm 13429  df-sgrp 13475  df-mnd 13490  df-grp 13576  df-minusg 13577  df-subg 13747  df-nsg 13748  df-eqg 13749

This theorem is referenced by:  qus0  13812  qusinv  13813  qusghm  13859