MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  qusabl Structured version   Visualization version   GIF version

Theorem qusabl 20130
Description: If 𝑌 is a subgroup of the abelian group 𝐺, then 𝐻 = 𝐺 / 𝑌 is an abelian group. (Contributed by Mario Carneiro, 26-Apr-2016.)
Hypothesis
Ref Expression
qusabl.h 𝐻 = (𝐺 /s (𝐺 ~QG 𝑆))
Assertion
Ref Expression
qusabl ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → 𝐻 ∈ Abel)

Proof of Theorem qusabl
Dummy variables 𝑎 𝑏 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ablnsg 20112 . . . . 5 (𝐺 ∈ Abel → (NrmSGrp‘𝐺) = (SubGrp‘𝐺))
21eleq2d 2850 . . . 4 (𝐺 ∈ Abel → (𝑆 ∈ (NrmSGrp‘𝐺) ↔ 𝑆 ∈ (SubGrp‘𝐺)))
32biimpar 483 . . 3 ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → 𝑆 ∈ (NrmSGrp‘𝐺))
4 qusabl.h . . . 4 𝐻 = (𝐺 /s (𝐺 ~QG 𝑆))
54qusgrp 19451 . . 3 (𝑆 ∈ (NrmSGrp‘𝐺) → 𝐻 ∈ Grp)
63, 5syl 18 . 2 ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → 𝐻 ∈ Grp)
7 vex 3458 . . . . . . 7 𝑥 ∈ V
87elqs 8823 . . . . . 6 (𝑥 ∈ ((Base‘𝐺) / (𝐺 ~QG 𝑆)) ↔ ∃𝑎 ∈ (Base‘𝐺)𝑥 = [𝑎](𝐺 ~QG 𝑆))
94a1i 11 . . . . . . . 8 ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → 𝐻 = (𝐺 /s (𝐺 ~QG 𝑆)))
10 eqidd 2764 . . . . . . . 8 ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → (Base‘𝐺) = (Base‘𝐺))
11 ovexd 7486 . . . . . . . 8 ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → (𝐺 ~QG 𝑆) ∈ V)
12 simpl 488 . . . . . . . 8 ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → 𝐺 ∈ Abel)
139, 10, 11, 12qusbas 17767 . . . . . . 7 ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → ((Base‘𝐺) / (𝐺 ~QG 𝑆)) = (Base‘𝐻))
1413eleq2d 2850 . . . . . 6 ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → (𝑥 ∈ ((Base‘𝐺) / (𝐺 ~QG 𝑆)) ↔ 𝑥 ∈ (Base‘𝐻)))
158, 14bitr3id 288 . . . . 5 ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → (∃𝑎 ∈ (Base‘𝐺)𝑥 = [𝑎](𝐺 ~QG 𝑆) ↔ 𝑥 ∈ (Base‘𝐻)))
16 vex 3458 . . . . . . 7 𝑦 ∈ V
1716elqs 8823 . . . . . 6 (𝑦 ∈ ((Base‘𝐺) / (𝐺 ~QG 𝑆)) ↔ ∃𝑏 ∈ (Base‘𝐺)𝑦 = [𝑏](𝐺 ~QG 𝑆))
1813eleq2d 2850 . . . . . 6 ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → (𝑦 ∈ ((Base‘𝐺) / (𝐺 ~QG 𝑆)) ↔ 𝑦 ∈ (Base‘𝐻)))
1917, 18bitr3id 288 . . . . 5 ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → (∃𝑏 ∈ (Base‘𝐺)𝑦 = [𝑏](𝐺 ~QG 𝑆) ↔ 𝑦 ∈ (Base‘𝐻)))
2015, 19anbi12d 644 . . . 4 ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → ((∃𝑎 ∈ (Base‘𝐺)𝑥 = [𝑎](𝐺 ~QG 𝑆) ∧ ∃𝑏 ∈ (Base‘𝐺)𝑦 = [𝑏](𝐺 ~QG 𝑆)) ↔ (𝑥 ∈ (Base‘𝐻) ∧ 𝑦 ∈ (Base‘𝐻))))
21 reeanv 3238 . . . . 5 (∃𝑎 ∈ (Base‘𝐺)∃𝑏 ∈ (Base‘𝐺)(𝑥 = [𝑎](𝐺 ~QG 𝑆) ∧ 𝑦 = [𝑏](𝐺 ~QG 𝑆)) ↔ (∃𝑎 ∈ (Base‘𝐺)𝑥 = [𝑎](𝐺 ~QG 𝑆) ∧ ∃𝑏 ∈ (Base‘𝐺)𝑦 = [𝑏](𝐺 ~QG 𝑆)))
22 eqid 2763 . . . . . . . . . . . 12 (Base‘𝐺) = (Base‘𝐺)
23 eqid 2763 . . . . . . . . . . . 12 (+g‘𝐺) = (+g‘𝐺)
2422, 23ablcom 20064 . . . . . . . . . . 11 ((𝐺 ∈ Abel ∧ 𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺)) → (𝑎(+g‘𝐺)𝑏) = (𝑏(+g‘𝐺)𝑎))
25243expb 1138 . . . . . . . . . 10 ((𝐺 ∈ Abel ∧ (𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺))) → (𝑎(+g‘𝐺)𝑏) = (𝑏(+g‘𝐺)𝑎))
2625adantlr 728 . . . . . . . . 9 (((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ (𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺))) → (𝑎(+g‘𝐺)𝑏) = (𝑏(+g‘𝐺)𝑎))
2726eceq1d 8796 . . . . . . . 8 (((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ (𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺))) → [(𝑎(+g‘𝐺)𝑏)](𝐺 ~QG 𝑆) = [(𝑏(+g‘𝐺)𝑎)](𝐺 ~QG 𝑆))
283adantr 486 . . . . . . . . 9 (((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ (𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺))) → 𝑆 ∈ (NrmSGrp‘𝐺))
29 simprl 783 . . . . . . . . 9 (((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ (𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺))) → 𝑎 ∈ (Base‘𝐺))
30 simprr 785 . . . . . . . . 9 (((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ (𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺))) → 𝑏 ∈ (Base‘𝐺))
31 eqid 2763 . . . . . . . . . 10 (+g‘𝐻) = (+g‘𝐻)
324, 22, 23, 31qusadd 19453 . . . . . . . . 9 ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺)) → ([𝑎](𝐺 ~QG 𝑆)(+g‘𝐻)[𝑏](𝐺 ~QG 𝑆)) = [(𝑎(+g‘𝐺)𝑏)](𝐺 ~QG 𝑆))
3328, 29, 30, 32syl3anc 1399 . . . . . . . 8 (((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ (𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺))) → ([𝑎](𝐺 ~QG 𝑆)(+g‘𝐻)[𝑏](𝐺 ~QG 𝑆)) = [(𝑎(+g‘𝐺)𝑏)](𝐺 ~QG 𝑆))
344, 22, 23, 31qusadd 19453 . . . . . . . . 9 ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺) ∧ 𝑎 ∈ (Base‘𝐺)) → ([𝑏](𝐺 ~QG 𝑆)(+g‘𝐻)[𝑎](𝐺 ~QG 𝑆)) = [(𝑏(+g‘𝐺)𝑎)](𝐺 ~QG 𝑆))
3528, 30, 29, 34syl3anc 1399 . . . . . . . 8 (((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ (𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺))) → ([𝑏](𝐺 ~QG 𝑆)(+g‘𝐻)[𝑎](𝐺 ~QG 𝑆)) = [(𝑏(+g‘𝐺)𝑎)](𝐺 ~QG 𝑆))
3627, 33, 353eqtr4d 2808 . . . . . . 7 (((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ (𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺))) → ([𝑎](𝐺 ~QG 𝑆)(+g‘𝐻)[𝑏](𝐺 ~QG 𝑆)) = ([𝑏](𝐺 ~QG 𝑆)(+g‘𝐻)[𝑎](𝐺 ~QG 𝑆)))
37 oveq12 7460 . . . . . . . 8 ((𝑥 = [𝑎](𝐺 ~QG 𝑆) ∧ 𝑦 = [𝑏](𝐺 ~QG 𝑆)) → (𝑥(+g‘𝐻)𝑦) = ([𝑎](𝐺 ~QG 𝑆)(+g‘𝐻)[𝑏](𝐺 ~QG 𝑆)))
38 oveq12 7460 . . . . . . . . 9 ((𝑦 = [𝑏](𝐺 ~QG 𝑆) ∧ 𝑥 = [𝑎](𝐺 ~QG 𝑆)) → (𝑦(+g‘𝐻)𝑥) = ([𝑏](𝐺 ~QG 𝑆)(+g‘𝐻)[𝑎](𝐺 ~QG 𝑆)))
3938ancoms 464 . . . . . . . 8 ((𝑥 = [𝑎](𝐺 ~QG 𝑆) ∧ 𝑦 = [𝑏](𝐺 ~QG 𝑆)) → (𝑦(+g‘𝐻)𝑥) = ([𝑏](𝐺 ~QG 𝑆)(+g‘𝐻)[𝑎](𝐺 ~QG 𝑆)))
4037, 39eqeq12d 2779 . . . . . . 7 ((𝑥 = [𝑎](𝐺 ~QG 𝑆) ∧ 𝑦 = [𝑏](𝐺 ~QG 𝑆)) → ((𝑥(+g‘𝐻)𝑦) = (𝑦(+g‘𝐻)𝑥) ↔ ([𝑎](𝐺 ~QG 𝑆)(+g‘𝐻)[𝑏](𝐺 ~QG 𝑆)) = ([𝑏](𝐺 ~QG 𝑆)(+g‘𝐻)[𝑎](𝐺 ~QG 𝑆))))
4136, 40syl5ibrcom 250 . . . . . 6 (((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ (𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺))) → ((𝑥 = [𝑎](𝐺 ~QG 𝑆) ∧ 𝑦 = [𝑏](𝐺 ~QG 𝑆)) → (𝑥(+g‘𝐻)𝑦) = (𝑦(+g‘𝐻)𝑥)))
4241rexlimdvva 3223 . . . . 5 ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → (∃𝑎 ∈ (Base‘𝐺)∃𝑏 ∈ (Base‘𝐺)(𝑥 = [𝑎](𝐺 ~QG 𝑆) ∧ 𝑦 = [𝑏](𝐺 ~QG 𝑆)) → (𝑥(+g‘𝐻)𝑦) = (𝑦(+g‘𝐻)𝑥)))
4321, 42biimtrrid 246 . . . 4 ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → ((∃𝑎 ∈ (Base‘𝐺)𝑥 = [𝑎](𝐺 ~QG 𝑆) ∧ ∃𝑏 ∈ (Base‘𝐺)𝑦 = [𝑏](𝐺 ~QG 𝑆)) → (𝑥(+g‘𝐻)𝑦) = (𝑦(+g‘𝐻)𝑥)))
4420, 43sylbird 263 . . 3 ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → ((𝑥 ∈ (Base‘𝐻) ∧ 𝑦 ∈ (Base‘𝐻)) → (𝑥(+g‘𝐻)𝑦) = (𝑦(+g‘𝐻)𝑥)))
4544ralrimivv 3207 . 2 ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → ∀𝑥 ∈ (Base‘𝐻)∀𝑦 ∈ (Base‘𝐻)(𝑥(+g‘𝐻)𝑦) = (𝑦(+g‘𝐻)𝑥))
46 eqid 2763 . . 3 (Base‘𝐻) = (Base‘𝐻)
4746, 31isabl2 20055 . 2 (𝐻 ∈ Abel ↔ (𝐻 ∈ Grp ∧ ∀𝑥 ∈ (Base‘𝐻)∀𝑦 ∈ (Base‘𝐻)(𝑥(+g‘𝐻)𝑦) = (𝑦(+g‘𝐻)𝑥)))
486, 45, 47sylanbrc 595 1 ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → 𝐻 ∈ Abel)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090  Vcvv 3454  ‘cfv 6566  (class class class)co 7451  [cec 8753   / cqs 8754  Basecbs 17431  +gcplusg 17472   /s cqus 17727  Grpcgrp 19194  SubGrpcsubg 19380  NrmSGrpcnsg 19381   ~QG cqg 19382  Abelcabl 20046
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-cnex 11295  ax-resscn 11296  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-addrcl 11300  ax-mulcl 11301  ax-mulrcl 11302  ax-mulcom 11303  ax-addass 11304  ax-mulass 11305  ax-distr 11306  ax-i2m1 11307  ax-1ne0 11308  ax-1rid 11309  ax-rnegex 11310  ax-rrecex 11311  ax-cnre 11312  ax-pre-lttri 11313  ax-pre-lttrn 11314  ax-pre-ltadd 11315  ax-pre-mulgt0 11316
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-tp 4593  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-1o 8514  df-er 8755  df-ec 8757  df-qs 8761  df-en 9012  df-dom 9013  df-sdom 9014  df-fin 9015  df-sup 9471  df-inf 9472  df-pnf 11384  df-mnf 11385  df-xr 11386  df-ltxr 11387  df-le 11388  df-sub 11582  df-neg 11583  df-nn 12376  df-2 12445  df-3 12446  df-4 12447  df-5 12448  df-6 12449  df-7 12450  df-8 12451  df-9 12452  df-n0 12647  df-z 12734  df-dec 12855  df-uz 13006  df-fz 13680  df-struct 17369  df-sets 17386  df-slot 17404  df-ndx 17416  df-base 17432  df-ress 17453  df-plusg 17486  df-mulr 17487  df-sca 17489  df-vsca 17490  df-ip 17491  df-tset 17492  df-ple 17493  df-ds 17495  df-0g 17662  df-imas 17730  df-qus 17731  df-mgm 18866  df-sgrp 18958  df-mnd 18974  df-grp 19197  df-minusg 19198  df-subg 19383  df-nsg 19384  df-eqg 19385  df-cmn 20047  df-abl 20048
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator