Theorem qusghm 13352

Description: If 𝑌 is a normal subgroup of 𝐺, then the "natural map" from elements to their cosets is a group homomorphism from 𝐺 to 𝐺 / 𝑌. (Contributed by Mario Carneiro, 14-Jun-2015.) (Revised by Mario Carneiro, 18-Sep-2015.)

Hypotheses

Ref	Expression
qusghm.x	⊢ 𝑋 = (Base‘𝐺)
qusghm.h	⊢ 𝐻 = (𝐺 /s (𝐺 ~QG 𝑌))
qusghm.f	⊢ 𝐹 = (𝑥 ∈ 𝑋 ↦ [𝑥](𝐺 ~QG 𝑌))

Assertion

Ref	Expression
qusghm	⊢ (𝑌 ∈ (NrmSGrp‘𝐺) → 𝐹 ∈ (𝐺 GrpHom 𝐻))

Distinct variable groups:   𝑥,𝐺   𝑥,𝐻   𝑥,𝑋   𝑥,𝑌

Allowed substitution hint:   𝐹(𝑥)

Proof of Theorem qusghm

Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		qusghm.x	. 2 ⊢ 𝑋 = (Base‘𝐺)
2		eqid 2193	. 2 ⊢ (Base‘𝐻) = (Base‘𝐻)
3		eqid 2193	. 2 ⊢ (+g‘𝐺) = (+g‘𝐺)
4		eqid 2193	. 2 ⊢ (+g‘𝐻) = (+g‘𝐻)
5		nsgsubg 13275	. . 3 ⊢ (𝑌 ∈ (NrmSGrp‘𝐺) → 𝑌 ∈ (SubGrp‘𝐺))
6		subgrcl 13249	. . 3 ⊢ (𝑌 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
7	5, 6	syl 14	. 2 ⊢ (𝑌 ∈ (NrmSGrp‘𝐺) → 𝐺 ∈ Grp)
8		qusghm.h	. . 3 ⊢ 𝐻 = (𝐺 /s (𝐺 ~QG 𝑌))
9	8	qusgrp 13302	. 2 ⊢ (𝑌 ∈ (NrmSGrp‘𝐺) → 𝐻 ∈ Grp)
10	8, 1, 2	quseccl 13303	. . 3 ⊢ ((𝑌 ∈ (NrmSGrp‘𝐺) ∧ 𝑥 ∈ 𝑋) → [𝑥](𝐺 ~QG 𝑌) ∈ (Base‘𝐻))
11		qusghm.f	. . 3 ⊢ 𝐹 = (𝑥 ∈ 𝑋 ↦ [𝑥](𝐺 ~QG 𝑌))
12	10, 11	fmptd 5712	. 2 ⊢ (𝑌 ∈ (NrmSGrp‘𝐺) → 𝐹:𝑋⟶(Base‘𝐻))
13	8, 1, 3, 4	qusadd 13304	. . . 4 ⊢ ((𝑌 ∈ (NrmSGrp‘𝐺) ∧ 𝑦 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋) → ([𝑦](𝐺 ~QG 𝑌)(+g‘𝐻)[𝑧](𝐺 ~QG 𝑌)) = [(𝑦(+g‘𝐺)𝑧)](𝐺 ~QG 𝑌))
14	13	3expb 1206	. . 3 ⊢ ((𝑌 ∈ (NrmSGrp‘𝐺) ∧ (𝑦 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋)) → ([𝑦](𝐺 ~QG 𝑌)(+g‘𝐻)[𝑧](𝐺 ~QG 𝑌)) = [(𝑦(+g‘𝐺)𝑧)](𝐺 ~QG 𝑌))
15		eceq1 6622	. . . . 5 ⊢ (𝑥 = 𝑦 → [𝑥](𝐺 ~QG 𝑌) = [𝑦](𝐺 ~QG 𝑌))
16		simprl 529	. . . . 5 ⊢ ((𝑌 ∈ (NrmSGrp‘𝐺) ∧ (𝑦 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋)) → 𝑦 ∈ 𝑋)
17		eqgex 13291	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ (NrmSGrp‘𝐺)) → (𝐺 ~QG 𝑌) ∈ V)
18	7, 17	mpancom 422	. . . . . . 7 ⊢ (𝑌 ∈ (NrmSGrp‘𝐺) → (𝐺 ~QG 𝑌) ∈ V)
19	18	adantr 276	. . . . . 6 ⊢ ((𝑌 ∈ (NrmSGrp‘𝐺) ∧ (𝑦 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋)) → (𝐺 ~QG 𝑌) ∈ V)
20		ecexg 6591	. . . . . 6 ⊢ ((𝐺 ~QG 𝑌) ∈ V → [𝑦](𝐺 ~QG 𝑌) ∈ V)
21	19, 20	syl 14	. . . . 5 ⊢ ((𝑌 ∈ (NrmSGrp‘𝐺) ∧ (𝑦 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋)) → [𝑦](𝐺 ~QG 𝑌) ∈ V)
22	11, 15, 16, 21	fvmptd3 5651	. . . 4 ⊢ ((𝑌 ∈ (NrmSGrp‘𝐺) ∧ (𝑦 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋)) → (𝐹‘𝑦) = [𝑦](𝐺 ~QG 𝑌))
23		eceq1 6622	. . . . 5 ⊢ (𝑥 = 𝑧 → [𝑥](𝐺 ~QG 𝑌) = [𝑧](𝐺 ~QG 𝑌))
24		simprr 531	. . . . 5 ⊢ ((𝑌 ∈ (NrmSGrp‘𝐺) ∧ (𝑦 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋)) → 𝑧 ∈ 𝑋)
25		ecexg 6591	. . . . . 6 ⊢ ((𝐺 ~QG 𝑌) ∈ V → [𝑧](𝐺 ~QG 𝑌) ∈ V)
26	19, 25	syl 14	. . . . 5 ⊢ ((𝑌 ∈ (NrmSGrp‘𝐺) ∧ (𝑦 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋)) → [𝑧](𝐺 ~QG 𝑌) ∈ V)
27	11, 23, 24, 26	fvmptd3 5651	. . . 4 ⊢ ((𝑌 ∈ (NrmSGrp‘𝐺) ∧ (𝑦 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋)) → (𝐹‘𝑧) = [𝑧](𝐺 ~QG 𝑌))
28	22, 27	oveq12d 5936	. . 3 ⊢ ((𝑌 ∈ (NrmSGrp‘𝐺) ∧ (𝑦 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋)) → ((𝐹‘𝑦)(+g‘𝐻)(𝐹‘𝑧)) = ([𝑦](𝐺 ~QG 𝑌)(+g‘𝐻)[𝑧](𝐺 ~QG 𝑌)))
29		eceq1 6622	. . . 4 ⊢ (𝑥 = (𝑦(+g‘𝐺)𝑧) → [𝑥](𝐺 ~QG 𝑌) = [(𝑦(+g‘𝐺)𝑧)](𝐺 ~QG 𝑌))
30	1, 3	grpcl 13080	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑦 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋) → (𝑦(+g‘𝐺)𝑧) ∈ 𝑋)
31	30	3expb 1206	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ (𝑦 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋)) → (𝑦(+g‘𝐺)𝑧) ∈ 𝑋)
32	7, 31	sylan 283	. . . 4 ⊢ ((𝑌 ∈ (NrmSGrp‘𝐺) ∧ (𝑦 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋)) → (𝑦(+g‘𝐺)𝑧) ∈ 𝑋)
33		ecexg 6591	. . . . 5 ⊢ ((𝐺 ~QG 𝑌) ∈ V → [(𝑦(+g‘𝐺)𝑧)](𝐺 ~QG 𝑌) ∈ V)
34	19, 33	syl 14	. . . 4 ⊢ ((𝑌 ∈ (NrmSGrp‘𝐺) ∧ (𝑦 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋)) → [(𝑦(+g‘𝐺)𝑧)](𝐺 ~QG 𝑌) ∈ V)
35	11, 29, 32, 34	fvmptd3 5651	. . 3 ⊢ ((𝑌 ∈ (NrmSGrp‘𝐺) ∧ (𝑦 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋)) → (𝐹‘(𝑦(+g‘𝐺)𝑧)) = [(𝑦(+g‘𝐺)𝑧)](𝐺 ~QG 𝑌))
36	14, 28, 35	3eqtr4rd 2237	. 2 ⊢ ((𝑌 ∈ (NrmSGrp‘𝐺) ∧ (𝑦 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋)) → (𝐹‘(𝑦(+g‘𝐺)𝑧)) = ((𝐹‘𝑦)(+g‘𝐻)(𝐹‘𝑧)))
37	1, 2, 3, 4, 7, 9, 12, 36	isghmd 13322	1 ⊢ (𝑌 ∈ (NrmSGrp‘𝐺) → 𝐹 ∈ (𝐺 GrpHom 𝐻))

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1364   ∈ wcel 2164  Vcvv 2760   ↦ cmpt 4090  ‘cfv 5254  (class class class)co 5918  [cec 6585  Basecbs 12618  +_gcplusg 12695   /_s cqus 12883  Grpcgrp 13072  SubGrpcsubg 13237  NrmSGrpcnsg 13238   ~_QG cqg 13239   GrpHom cghm 13310

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  df-ghm 13311

This theorem is referenced by:  qusrhm  14024