Theorem qusgrp 13438

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 2197	. . 3 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → (Base‘𝐺) = (Base‘𝐺))
4		eqidd 2197	. . 3 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → (+g‘𝐺) = (+g‘𝐺))
5		nsgsubg 13411	. . . 4 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → 𝑆 ∈ (SubGrp‘𝐺))
6		eqid 2196	. . . . 5 ⊢ (Base‘𝐺) = (Base‘𝐺)
7		eqid 2196	. . . . 5 ⊢ (𝐺 ~QG 𝑆) = (𝐺 ~QG 𝑆)
8	6, 7	eqger 13430	. . . 4 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (𝐺 ~QG 𝑆) Er (Base‘𝐺))
9	5, 8	syl 14	. . 3 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → (𝐺 ~QG 𝑆) Er (Base‘𝐺))
10		subgrcl 13385	. . . 4 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
11	5, 10	syl 14	. . 3 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → 𝐺 ∈ Grp)
12		eqid 2196	. . . 4 ⊢ (+g‘𝐺) = (+g‘𝐺)
13	6, 7, 12	eqgcpbl 13434	. . 3 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → ((𝑎(𝐺 ~QG 𝑆)𝑐 ∧ 𝑏(𝐺 ~QG 𝑆)𝑑) → (𝑎(+g‘𝐺)𝑏)(𝐺 ~QG 𝑆)(𝑐(+g‘𝐺)𝑑)))
14	6, 12	grpcl 13210	. . . 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 13210	. . . . . 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 6621	. . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝑢 ∈ (Base‘𝐺) ∧ 𝑣 ∈ (Base‘𝐺) ∧ 𝑤 ∈ (Base‘𝐺))) → ((𝑢(+g‘𝐺)𝑣)(+g‘𝐺)𝑤)(𝐺 ~QG 𝑆)((𝑢(+g‘𝐺)𝑣)(+g‘𝐺)𝑤))
25	6, 12	grpass 13211	. . . . 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 4060	. . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝑢 ∈ (Base‘𝐺) ∧ 𝑣 ∈ (Base‘𝐺) ∧ 𝑤 ∈ (Base‘𝐺))) → ((𝑢(+g‘𝐺)𝑣)(+g‘𝐺)𝑤)(𝐺 ~QG 𝑆)(𝑢(+g‘𝐺)(𝑣(+g‘𝐺)𝑤)))
28		eqid 2196	. . . . 5 ⊢ (0g‘𝐺) = (0g‘𝐺)
29	6, 28	grpidcl 13231	. . . 4 ⊢ (𝐺 ∈ Grp → (0g‘𝐺) ∈ (Base‘𝐺))
30	11, 29	syl 14	. . 3 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → (0g‘𝐺) ∈ (Base‘𝐺))
31	6, 12, 28	grplid 13233	. . . . 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 6621	. . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑢 ∈ (Base‘𝐺)) → 𝑢(𝐺 ~QG 𝑆)𝑢)
36	32, 35	eqbrtrd 4056	. . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑢 ∈ (Base‘𝐺)) → ((0g‘𝐺)(+g‘𝐺)𝑢)(𝐺 ~QG 𝑆)𝑢)
37		eqid 2196	. . . . 5 ⊢ (invg‘𝐺) = (invg‘𝐺)
38	6, 37	grpinvcl 13250	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑢 ∈ (Base‘𝐺)) → ((invg‘𝐺)‘𝑢) ∈ (Base‘𝐺))
39	11, 38	sylan 283	. . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑢 ∈ (Base‘𝐺)) → ((invg‘𝐺)‘𝑢) ∈ (Base‘𝐺))
40	6, 12, 28, 37	grplinv 13252	. . . . 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 6621	. . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑢 ∈ (Base‘𝐺)) → (0g‘𝐺)(𝐺 ~QG 𝑆)(0g‘𝐺))
44	41, 43	eqbrtrd 4056	. . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑢 ∈ (Base‘𝐺)) → (((invg‘𝐺)‘𝑢)(+g‘𝐺)𝑢)(𝐺 ~QG 𝑆)(0g‘𝐺))
45	2, 3, 4, 9, 11, 13, 15, 27, 30, 36, 39, 44	qusgrp2 13319	. 2 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → (𝐻 ∈ Grp ∧ [(0g‘𝐺)](𝐺 ~QG 𝑆) = (0g‘𝐻)))
46	45	simpld 112	1 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → 𝐻 ∈ Grp)

Syntax hints:   → wi 4   ∧ wa 104   ∧ w3a 980   = wceq 1364   ∈ wcel 2167  ‘cfv 5259  (class class class)co 5925   Er wer 6598  [cec 6599  Basecbs 12703  +_gcplusg 12780  0_gc0g 12958   /_s cqus 13002  Grpcgrp 13202  inv_gcminusg 13203  SubGrpcsubg 13373  NrmSGrpcnsg 13374   ~_QG cqg 13375

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 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4149  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-cnex 7987  ax-resscn 7988  ax-1cn 7989  ax-1re 7990  ax-icn 7991  ax-addcl 7992  ax-addrcl 7993  ax-mulcl 7994  ax-addcom 7996  ax-addass 7998  ax-i2m1 8001  ax-0lt1 8002  ax-0id 8004  ax-rnegex 8005  ax-pre-ltirr 8008  ax-pre-lttrn 8010  ax-pre-ltadd 8012

This theorem depends on definitions:  df-bi 117  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3452  df-pw 3608  df-sn 3629  df-pr 3630  df-tp 3631  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-riota 5880  df-ov 5928  df-oprab 5929  df-mpo 5930  df-er 6601  df-ec 6603  df-qs 6607  df-pnf 8080  df-mnf 8081  df-ltxr 8083  df-inn 9008  df-2 9066  df-3 9067  df-ndx 12706  df-slot 12707  df-base 12709  df-sets 12710  df-iress 12711  df-plusg 12793  df-mulr 12794  df-0g 12960  df-iimas 13004  df-qus 13005  df-mgm 13058  df-sgrp 13104  df-mnd 13119  df-grp 13205  df-minusg 13206  df-subg 13376  df-nsg 13377  df-eqg 13378

This theorem is referenced by:  qus0  13441  qusinv  13442  qusghm  13488