ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  qusghm GIF version

Theorem qusghm 13932
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.
StepHypRef Expression
1 qusghm.x . 2 𝑋 = (Base‘𝐺)
2 eqid 2231 . 2 (Base‘𝐻) = (Base‘𝐻)
3 eqid 2231 . 2 (+g𝐺) = (+g𝐺)
4 eqid 2231 . 2 (+g𝐻) = (+g𝐻)
5 nsgsubg 13855 . . 3 (𝑌 ∈ (NrmSGrp‘𝐺) → 𝑌 ∈ (SubGrp‘𝐺))
6 subgrcl 13829 . . 3 (𝑌 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
75, 6syl 14 . 2 (𝑌 ∈ (NrmSGrp‘𝐺) → 𝐺 ∈ Grp)
8 qusghm.h . . 3 𝐻 = (𝐺 /s (𝐺 ~QG 𝑌))
98qusgrp 13882 . 2 (𝑌 ∈ (NrmSGrp‘𝐺) → 𝐻 ∈ Grp)
108, 1, 2quseccl 13883 . . 3 ((𝑌 ∈ (NrmSGrp‘𝐺) ∧ 𝑥𝑋) → [𝑥](𝐺 ~QG 𝑌) ∈ (Base‘𝐻))
11 qusghm.f . . 3 𝐹 = (𝑥𝑋 ↦ [𝑥](𝐺 ~QG 𝑌))
1210, 11fmptd 5809 . 2 (𝑌 ∈ (NrmSGrp‘𝐺) → 𝐹:𝑋⟶(Base‘𝐻))
138, 1, 3, 4qusadd 13884 . . . 4 ((𝑌 ∈ (NrmSGrp‘𝐺) ∧ 𝑦𝑋𝑧𝑋) → ([𝑦](𝐺 ~QG 𝑌)(+g𝐻)[𝑧](𝐺 ~QG 𝑌)) = [(𝑦(+g𝐺)𝑧)](𝐺 ~QG 𝑌))
14133expb 1231 . . 3 ((𝑌 ∈ (NrmSGrp‘𝐺) ∧ (𝑦𝑋𝑧𝑋)) → ([𝑦](𝐺 ~QG 𝑌)(+g𝐻)[𝑧](𝐺 ~QG 𝑌)) = [(𝑦(+g𝐺)𝑧)](𝐺 ~QG 𝑌))
15 eceq1 6780 . . . . 5 (𝑥 = 𝑦 → [𝑥](𝐺 ~QG 𝑌) = [𝑦](𝐺 ~QG 𝑌))
16 simprl 531 . . . . 5 ((𝑌 ∈ (NrmSGrp‘𝐺) ∧ (𝑦𝑋𝑧𝑋)) → 𝑦𝑋)
17 eqgex 13871 . . . . . . . 8 ((𝐺 ∈ Grp ∧ 𝑌 ∈ (NrmSGrp‘𝐺)) → (𝐺 ~QG 𝑌) ∈ V)
187, 17mpancom 422 . . . . . . 7 (𝑌 ∈ (NrmSGrp‘𝐺) → (𝐺 ~QG 𝑌) ∈ V)
1918adantr 276 . . . . . 6 ((𝑌 ∈ (NrmSGrp‘𝐺) ∧ (𝑦𝑋𝑧𝑋)) → (𝐺 ~QG 𝑌) ∈ V)
20 ecexg 6749 . . . . . 6 ((𝐺 ~QG 𝑌) ∈ V → [𝑦](𝐺 ~QG 𝑌) ∈ V)
2119, 20syl 14 . . . . 5 ((𝑌 ∈ (NrmSGrp‘𝐺) ∧ (𝑦𝑋𝑧𝑋)) → [𝑦](𝐺 ~QG 𝑌) ∈ V)
2211, 15, 16, 21fvmptd3 5749 . . . 4 ((𝑌 ∈ (NrmSGrp‘𝐺) ∧ (𝑦𝑋𝑧𝑋)) → (𝐹𝑦) = [𝑦](𝐺 ~QG 𝑌))
23 eceq1 6780 . . . . 5 (𝑥 = 𝑧 → [𝑥](𝐺 ~QG 𝑌) = [𝑧](𝐺 ~QG 𝑌))
24 simprr 533 . . . . 5 ((𝑌 ∈ (NrmSGrp‘𝐺) ∧ (𝑦𝑋𝑧𝑋)) → 𝑧𝑋)
25 ecexg 6749 . . . . . 6 ((𝐺 ~QG 𝑌) ∈ V → [𝑧](𝐺 ~QG 𝑌) ∈ V)
2619, 25syl 14 . . . . 5 ((𝑌 ∈ (NrmSGrp‘𝐺) ∧ (𝑦𝑋𝑧𝑋)) → [𝑧](𝐺 ~QG 𝑌) ∈ V)
2711, 23, 24, 26fvmptd3 5749 . . . 4 ((𝑌 ∈ (NrmSGrp‘𝐺) ∧ (𝑦𝑋𝑧𝑋)) → (𝐹𝑧) = [𝑧](𝐺 ~QG 𝑌))
2822, 27oveq12d 6046 . . 3 ((𝑌 ∈ (NrmSGrp‘𝐺) ∧ (𝑦𝑋𝑧𝑋)) → ((𝐹𝑦)(+g𝐻)(𝐹𝑧)) = ([𝑦](𝐺 ~QG 𝑌)(+g𝐻)[𝑧](𝐺 ~QG 𝑌)))
29 eceq1 6780 . . . 4 (𝑥 = (𝑦(+g𝐺)𝑧) → [𝑥](𝐺 ~QG 𝑌) = [(𝑦(+g𝐺)𝑧)](𝐺 ~QG 𝑌))
301, 3grpcl 13654 . . . . . 6 ((𝐺 ∈ Grp ∧ 𝑦𝑋𝑧𝑋) → (𝑦(+g𝐺)𝑧) ∈ 𝑋)
31303expb 1231 . . . . 5 ((𝐺 ∈ Grp ∧ (𝑦𝑋𝑧𝑋)) → (𝑦(+g𝐺)𝑧) ∈ 𝑋)
327, 31sylan 283 . . . 4 ((𝑌 ∈ (NrmSGrp‘𝐺) ∧ (𝑦𝑋𝑧𝑋)) → (𝑦(+g𝐺)𝑧) ∈ 𝑋)
33 ecexg 6749 . . . . 5 ((𝐺 ~QG 𝑌) ∈ V → [(𝑦(+g𝐺)𝑧)](𝐺 ~QG 𝑌) ∈ V)
3419, 33syl 14 . . . 4 ((𝑌 ∈ (NrmSGrp‘𝐺) ∧ (𝑦𝑋𝑧𝑋)) → [(𝑦(+g𝐺)𝑧)](𝐺 ~QG 𝑌) ∈ V)
3511, 29, 32, 34fvmptd3 5749 . . 3 ((𝑌 ∈ (NrmSGrp‘𝐺) ∧ (𝑦𝑋𝑧𝑋)) → (𝐹‘(𝑦(+g𝐺)𝑧)) = [(𝑦(+g𝐺)𝑧)](𝐺 ~QG 𝑌))
3614, 28, 353eqtr4rd 2275 . 2 ((𝑌 ∈ (NrmSGrp‘𝐺) ∧ (𝑦𝑋𝑧𝑋)) → (𝐹‘(𝑦(+g𝐺)𝑧)) = ((𝐹𝑦)(+g𝐻)(𝐹𝑧)))
371, 2, 3, 4, 7, 9, 12, 36isghmd 13902 1 (𝑌 ∈ (NrmSGrp‘𝐺) → 𝐹 ∈ (𝐺 GrpHom 𝐻))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1398  wcel 2202  Vcvv 2803  cmpt 4155  cfv 5333  (class class class)co 6028  [cec 6743  Basecbs 13145  +gcplusg 13223   /s cqus 13446  Grpcgrp 13646  SubGrpcsubg 13817  NrmSGrpcnsg 13818   ~QG cqg 13819   GrpHom cghm 13890
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8166  ax-resscn 8167  ax-1cn 8168  ax-1re 8169  ax-icn 8170  ax-addcl 8171  ax-addrcl 8172  ax-mulcl 8173  ax-addcom 8175  ax-addass 8177  ax-i2m1 8180  ax-0lt1 8181  ax-0id 8183  ax-rnegex 8184  ax-pre-ltirr 8187  ax-pre-lttrn 8189  ax-pre-ltadd 8191
This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rmo 2519  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-tp 3681  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-er 6745  df-ec 6747  df-qs 6751  df-pnf 8258  df-mnf 8259  df-ltxr 8261  df-inn 9186  df-2 9244  df-3 9245  df-ndx 13148  df-slot 13149  df-base 13151  df-sets 13152  df-iress 13153  df-plusg 13236  df-mulr 13237  df-0g 13404  df-iimas 13448  df-qus 13449  df-mgm 13502  df-sgrp 13548  df-mnd 13563  df-grp 13649  df-minusg 13650  df-subg 13820  df-nsg 13821  df-eqg 13822  df-ghm 13891
This theorem is referenced by:  qusrhm  14607
  Copyright terms: Public domain W3C validator