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

Theorem qusabl 20079
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 20061 . . . . 5 (𝐺 ∈ Abel → (NrmSGrp‘𝐺) = (SubGrp‘𝐺))
21eleq2d 2847 . . . 4 (𝐺 ∈ Abel → (𝑆 ∈ (NrmSGrp‘𝐺) ↔ 𝑆 ∈ (SubGrp‘𝐺)))
32biimpar 483 . . 3 ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → 𝑆 ∈ (NrmSGrp‘𝐺))
4 qusabl.h . . . 4 𝐻 = (𝐺 /s (𝐺 ~QG 𝑆))
54qusgrp 19401 . . 3 (𝑆 ∈ (NrmSGrp‘𝐺) → 𝐻 ∈ Grp)
63, 5syl 18 . 2 ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → 𝐻 ∈ Grp)
7 vex 3455 . . . . . . 7 𝑥 ∈ V
87elqs 8785 . . . . . 6 (𝑥 ∈ ((Base‘𝐺) / (𝐺 ~QG 𝑆)) ↔ ∃𝑎 ∈ (Base‘𝐺)𝑥 = [𝑎](𝐺 ~QG 𝑆))
94a1i 11 . . . . . . . 8 ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → 𝐻 = (𝐺 /s (𝐺 ~QG 𝑆)))
10 eqidd 2762 . . . . . . . 8 ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → (Base‘𝐺) = (Base‘𝐺))
11 ovexd 7455 . . . . . . . 8 ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → (𝐺 ~QG 𝑆) ∈ V)
12 simpl 488 . . . . . . . 8 ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → 𝐺 ∈ Abel)
139, 10, 11, 12qusbas 17717 . . . . . . 7 ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → ((Base‘𝐺) / (𝐺 ~QG 𝑆)) = (Base‘𝐻))
1413eleq2d 2847 . . . . . 6 ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → (𝑥 ∈ ((Base‘𝐺) / (𝐺 ~QG 𝑆)) ↔ 𝑥 ∈ (Base‘𝐻)))
158, 14bitr3id 288 . . . . 5 ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → (∃𝑎 ∈ (Base‘𝐺)𝑥 = [𝑎](𝐺 ~QG 𝑆) ↔ 𝑥 ∈ (Base‘𝐻)))
16 vex 3455 . . . . . . 7 𝑦 ∈ V
1716elqs 8785 . . . . . 6 (𝑦 ∈ ((Base‘𝐺) / (𝐺 ~QG 𝑆)) ↔ ∃𝑏 ∈ (Base‘𝐺)𝑦 = [𝑏](𝐺 ~QG 𝑆))
1813eleq2d 2847 . . . . . 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 3235 . . . . 5 (∃𝑎 ∈ (Base‘𝐺)∃𝑏 ∈ (Base‘𝐺)(𝑥 = [𝑎](𝐺 ~QG 𝑆) ∧ 𝑦 = [𝑏](𝐺 ~QG 𝑆)) ↔ (∃𝑎 ∈ (Base‘𝐺)𝑥 = [𝑎](𝐺 ~QG 𝑆) ∧ ∃𝑏 ∈ (Base‘𝐺)𝑦 = [𝑏](𝐺 ~QG 𝑆)))
22 eqid 2761 . . . . . . . . . . . 12 (Base‘𝐺) = (Base‘𝐺)
23 eqid 2761 . . . . . . . . . . . 12 (+g‘𝐺) = (+g‘𝐺)
2422, 23ablcom 20013 . . . . . . . . . . 11 ((𝐺 ∈ Abel ∧ 𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺)) → (𝑎(+g‘𝐺)𝑏) = (𝑏(+g‘𝐺)𝑎))
25243expb 1138 . . . . . . . . . 10 ((𝐺 ∈ Abel ∧ (𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺))) → (𝑎(+g‘𝐺)𝑏) = (𝑏(+g‘𝐺)𝑎))
2625adantlr 728 . . . . . . . . 9 (((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ (𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺))) → (𝑎(+g‘𝐺)𝑏) = (𝑏(+g‘𝐺)𝑎))
2726eceq1d 8758 . . . . . . . 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 2761 . . . . . . . . . 10 (+g‘𝐻) = (+g‘𝐻)
324, 22, 23, 31qusadd 19403 . . . . . . . . 9 ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺)) → ([𝑎](𝐺 ~QG 𝑆)(+g‘𝐻)[𝑏](𝐺 ~QG 𝑆)) = [(𝑎(+g‘𝐺)𝑏)](𝐺 ~QG 𝑆))
3328, 29, 30, 32syl3anc 1398 . . . . . . . 8 (((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ (𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺))) → ([𝑎](𝐺 ~QG 𝑆)(+g‘𝐻)[𝑏](𝐺 ~QG 𝑆)) = [(𝑎(+g‘𝐺)𝑏)](𝐺 ~QG 𝑆))
344, 22, 23, 31qusadd 19403 . . . . . . . . 9 ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺) ∧ 𝑎 ∈ (Base‘𝐺)) → ([𝑏](𝐺 ~QG 𝑆)(+g‘𝐻)[𝑎](𝐺 ~QG 𝑆)) = [(𝑏(+g‘𝐺)𝑎)](𝐺 ~QG 𝑆))
3528, 30, 29, 34syl3anc 1398 . . . . . . . 8 (((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ (𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺))) → ([𝑏](𝐺 ~QG 𝑆)(+g‘𝐻)[𝑎](𝐺 ~QG 𝑆)) = [(𝑏(+g‘𝐺)𝑎)](𝐺 ~QG 𝑆))
3627, 33, 353eqtr4d 2806 . . . . . . 7 (((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ (𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺))) → ([𝑎](𝐺 ~QG 𝑆)(+g‘𝐻)[𝑏](𝐺 ~QG 𝑆)) = ([𝑏](𝐺 ~QG 𝑆)(+g‘𝐻)[𝑎](𝐺 ~QG 𝑆)))
37 oveq12 7429 . . . . . . . 8 ((𝑥 = [𝑎](𝐺 ~QG 𝑆) ∧ 𝑦 = [𝑏](𝐺 ~QG 𝑆)) → (𝑥(+g‘𝐻)𝑦) = ([𝑎](𝐺 ~QG 𝑆)(+g‘𝐻)[𝑏](𝐺 ~QG 𝑆)))
38 oveq12 7429 . . . . . . . . 9 ((𝑦 = [𝑏](𝐺 ~QG 𝑆) ∧ 𝑥 = [𝑎](𝐺 ~QG 𝑆)) → (𝑦(+g‘𝐻)𝑥) = ([𝑏](𝐺 ~QG 𝑆)(+g‘𝐻)[𝑎](𝐺 ~QG 𝑆)))
3938ancoms 464 . . . . . . . 8 ((𝑥 = [𝑎](𝐺 ~QG 𝑆) ∧ 𝑦 = [𝑏](𝐺 ~QG 𝑆)) → (𝑦(+g‘𝐻)𝑥) = ([𝑏](𝐺 ~QG 𝑆)(+g‘𝐻)[𝑎](𝐺 ~QG 𝑆)))
4037, 39eqeq12d 2777 . . . . . . 7 ((𝑥 = [𝑎](𝐺 ~QG 𝑆) ∧ 𝑦 = [𝑏](𝐺 ~QG 𝑆)) → ((𝑥(+g‘𝐻)𝑦) = (𝑦(+g‘𝐻)𝑥) ↔ ([𝑎](𝐺 ~QG 𝑆)(+g‘𝐻)[𝑏](𝐺 ~QG 𝑆)) = ([𝑏](𝐺 ~QG 𝑆)(+g‘𝐻)[𝑎](𝐺 ~QG 𝑆))))
4136, 40syl5ibrcom 250 . . . . . 6 (((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ (𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺))) → ((𝑥 = [𝑎](𝐺 ~QG 𝑆) ∧ 𝑦 = [𝑏](𝐺 ~QG 𝑆)) → (𝑥(+g‘𝐻)𝑦) = (𝑦(+g‘𝐻)𝑥)))
4241rexlimdvva 3220 . . . . 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 3204 . 2 ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → ∀𝑥 ∈ (Base‘𝐻)∀𝑦 ∈ (Base‘𝐻)(𝑥(+g‘𝐻)𝑦) = (𝑦(+g‘𝐻)𝑥))
46 eqid 2761 . . 3 (Base‘𝐻) = (Base‘𝐻)
4746, 31isabl2 20004 . 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 2145  ∀wral 3077  ∃wrex 3087  Vcvv 3451  ‘cfv 6538  (class class class)co 7420  [cec 8715   / cqs 8716  Basecbs 17387  +gcplusg 17428   /s cqus 17677  Grpcgrp 19144  SubGrpcsubg 19330  NrmSGrpcnsg 19331   ~QG cqg 19332  Abelcabl 19995
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751  ax-cnex 11256  ax-resscn 11257  ax-1cn 11258  ax-icn 11259  ax-addcl 11260  ax-addrcl 11261  ax-mulcl 11262  ax-mulrcl 11263  ax-mulcom 11264  ax-addass 11265  ax-mulass 11266  ax-distr 11267  ax-i2m1 11268  ax-1ne0 11269  ax-1rid 11270  ax-rnegex 11271  ax-rrecex 11272  ax-cnre 11273  ax-pre-lttri 11274  ax-pre-lttrn 11275  ax-pre-ltadd 11276  ax-pre-mulgt0 11277
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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-1st 8001  df-2nd 8002  df-frecs 8299  df-wrecs 8330  df-recs 8379  df-rdg 8418  df-1o 8476  df-er 8717  df-ec 8719  df-qs 8723  df-en 8974  df-dom 8975  df-sdom 8976  df-fin 8977  df-sup 9434  df-inf 9435  df-pnf 11345  df-mnf 11346  df-xr 11347  df-ltxr 11348  df-le 11349  df-sub 11543  df-neg 11544  df-nn 12336  df-2 12405  df-3 12406  df-4 12407  df-5 12408  df-6 12409  df-7 12410  df-8 12411  df-9 12412  df-n0 12607  df-z 12694  df-dec 12815  df-uz 12966  df-fz 13640  df-struct 17325  df-sets 17342  df-slot 17360  df-ndx 17372  df-base 17388  df-ress 17409  df-plusg 17441  df-mulr 17442  df-sca 17444  df-vsca 17445  df-ip 17446  df-tset 17447  df-ple 17448  df-ds 17450  df-0g 17612  df-imas 17680  df-qus 17681  df-mgm 18816  df-sgrp 18908  df-mnd 18924  df-grp 19147  df-minusg 19148  df-subg 19333  df-nsg 19334  df-eqg 19335  df-cmn 19996  df-abl 19997
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator