| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > gexdvdsi | Structured version Visualization version GIF version | ||
| Description: Any group element is annihilated by any multiple of the group exponent. (Contributed by Mario Carneiro, 24-Apr-2016.) |
| Ref | Expression |
|---|---|
| gexcl.1 | ⊢ 𝑋 = (Base‘𝐺) |
| gexcl.2 | ⊢ 𝐸 = (gEx‘𝐺) |
| gexid.3 | ⊢ · = (.g‘𝐺) |
| gexid.4 | ⊢ 0 = (0g‘𝐺) |
| Ref | Expression |
|---|---|
| gexdvdsi | ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ 𝐸 ∥ 𝑁) → (𝑁 · 𝐴) = 0 ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp3 1154 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ 𝐸 ∥ 𝑁) → 𝐸 ∥ 𝑁) | |
| 2 | dvdszrcl 16305 | . . . . 5 ⊢ (𝐸 ∥ 𝑁 → (𝐸 ∈ ℤ ∧ 𝑁 ∈ ℤ)) | |
| 3 | divides 16302 | . . . . 5 ⊢ ((𝐸 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐸 ∥ 𝑁 ↔ ∃𝑥 ∈ ℤ (𝑥 · 𝐸) = 𝑁)) | |
| 4 | 2, 3 | biadanii 833 | . . . 4 ⊢ (𝐸 ∥ 𝑁 ↔ ((𝐸 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ∃𝑥 ∈ ℤ (𝑥 · 𝐸) = 𝑁)) |
| 5 | 1, 4 | sylib 221 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ 𝐸 ∥ 𝑁) → ((𝐸 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ∃𝑥 ∈ ℤ (𝑥 · 𝐸) = 𝑁)) |
| 6 | 5 | simprd 500 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ 𝐸 ∥ 𝑁) → ∃𝑥 ∈ ℤ (𝑥 · 𝐸) = 𝑁) |
| 7 | simpl1 1208 | . . . . . 6 ⊢ (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ 𝐸 ∥ 𝑁) ∧ 𝑥 ∈ ℤ) → 𝐺 ∈ Grp) | |
| 8 | simpr 489 | . . . . . 6 ⊢ (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ 𝐸 ∥ 𝑁) ∧ 𝑥 ∈ ℤ) → 𝑥 ∈ ℤ) | |
| 9 | 5 | simplld 779 | . . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ 𝐸 ∥ 𝑁) → 𝐸 ∈ ℤ) |
| 10 | 9 | adantr 485 | . . . . . 6 ⊢ (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ 𝐸 ∥ 𝑁) ∧ 𝑥 ∈ ℤ) → 𝐸 ∈ ℤ) |
| 11 | simpl2 1209 | . . . . . 6 ⊢ (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ 𝐸 ∥ 𝑁) ∧ 𝑥 ∈ ℤ) → 𝐴 ∈ 𝑋) | |
| 12 | gexcl.1 | . . . . . . 7 ⊢ 𝑋 = (Base‘𝐺) | |
| 13 | gexid.3 | . . . . . . 7 ⊢ · = (.g‘𝐺) | |
| 14 | 12, 13 | mulgass 19168 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ ℤ ∧ 𝐸 ∈ ℤ ∧ 𝐴 ∈ 𝑋)) → ((𝑥 · 𝐸) · 𝐴) = (𝑥 · (𝐸 · 𝐴))) |
| 15 | 7, 8, 10, 11, 14 | syl13anc 1395 | . . . . 5 ⊢ (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ 𝐸 ∥ 𝑁) ∧ 𝑥 ∈ ℤ) → ((𝑥 · 𝐸) · 𝐴) = (𝑥 · (𝐸 · 𝐴))) |
| 16 | gexcl.2 | . . . . . . . 8 ⊢ 𝐸 = (gEx‘𝐺) | |
| 17 | gexid.4 | . . . . . . . 8 ⊢ 0 = (0g‘𝐺) | |
| 18 | 12, 16, 13, 17 | gexid 19642 | . . . . . . 7 ⊢ (𝐴 ∈ 𝑋 → (𝐸 · 𝐴) = 0 ) |
| 19 | 11, 18 | syl 18 | . . . . . 6 ⊢ (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ 𝐸 ∥ 𝑁) ∧ 𝑥 ∈ ℤ) → (𝐸 · 𝐴) = 0 ) |
| 20 | 19 | oveq2d 7416 | . . . . 5 ⊢ (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ 𝐸 ∥ 𝑁) ∧ 𝑥 ∈ ℤ) → (𝑥 · (𝐸 · 𝐴)) = (𝑥 · 0 )) |
| 21 | 12, 13, 17 | mulgz 19159 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ ℤ) → (𝑥 · 0 ) = 0 ) |
| 22 | 21 | 3ad2antl1 1202 | . . . . 5 ⊢ (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ 𝐸 ∥ 𝑁) ∧ 𝑥 ∈ ℤ) → (𝑥 · 0 ) = 0 ) |
| 23 | 15, 20, 22 | 3eqtrd 2804 | . . . 4 ⊢ (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ 𝐸 ∥ 𝑁) ∧ 𝑥 ∈ ℤ) → ((𝑥 · 𝐸) · 𝐴) = 0 ) |
| 24 | oveq1 7407 | . . . . 5 ⊢ ((𝑥 · 𝐸) = 𝑁 → ((𝑥 · 𝐸) · 𝐴) = (𝑁 · 𝐴)) | |
| 25 | 24 | eqeq1d 2767 | . . . 4 ⊢ ((𝑥 · 𝐸) = 𝑁 → (((𝑥 · 𝐸) · 𝐴) = 0 ↔ (𝑁 · 𝐴) = 0 )) |
| 26 | 23, 25 | syl5ibcom 248 | . . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ 𝐸 ∥ 𝑁) ∧ 𝑥 ∈ ℤ) → ((𝑥 · 𝐸) = 𝑁 → (𝑁 · 𝐴) = 0 )) |
| 27 | 26 | rexlimdva 3166 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ 𝐸 ∥ 𝑁) → (∃𝑥 ∈ ℤ (𝑥 · 𝐸) = 𝑁 → (𝑁 · 𝐴) = 0 )) |
| 28 | 6, 27 | mpd 16 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ 𝐸 ∥ 𝑁) → (𝑁 · 𝐴) = 0 ) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∧ w3a 1101 = wceq 1563 ∈ wcel 2145 ∃wrex 3089 class class class wbr 5105 ‘cfv 6525 (class class class)co 7400 · cmul 11093 ℤcz 12582 ∥ cdvds 16300 Basecbs 17259 0gc0g 17482 Grpcgrp 18990 .gcmg 19124 gExcgex 19586 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 ax-pre-mulgt0 11165 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3370 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-iun 4954 df-br 5106 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5547 df-eprel 5552 df-po 5560 df-so 5561 df-fr 5605 df-we 5607 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-pred 6292 df-ord 6353 df-on 6354 df-lim 6355 df-suc 6356 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-om 7851 df-1st 7974 df-2nd 7975 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-er 8682 df-en 8932 df-dom 8933 df-sdom 8934 df-sup 9390 df-inf 9391 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-nn 12225 df-n0 12496 df-z 12583 df-uz 12854 df-fz 13527 df-seq 14029 df-dvds 16301 df-0g 17484 df-mgm 18688 df-sgrp 18767 df-mnd 18783 df-grp 18993 df-minusg 18994 df-mulg 19125 df-gex 19590 |
| This theorem is referenced by: gexdvds 19645 gex2abl 19912 |
| Copyright terms: Public domain | W3C validator |