| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > gex1 | Structured version Visualization version GIF version | ||
| Description: A group or monoid has exponent 1 iff it is trivial. (Contributed by Mario Carneiro, 24-Apr-2016.) |
| Ref | Expression |
|---|---|
| gexcl2.1 | ⊢ 𝑋 = (Base‘𝐺) |
| gexcl2.2 | ⊢ 𝐸 = (gEx‘𝐺) |
| Ref | Expression |
|---|---|
| gex1 | ⊢ (𝐺 ∈ Mnd → (𝐸 = 1 ↔ 𝑋 ≈ 1o)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simplr 769 | . . . . . . . . 9 ⊢ (((𝐺 ∈ Mnd ∧ 𝐸 = 1) ∧ 𝑥 ∈ 𝑋) → 𝐸 = 1) | |
| 2 | 1 | oveq1d 7375 | . . . . . . . 8 ⊢ (((𝐺 ∈ Mnd ∧ 𝐸 = 1) ∧ 𝑥 ∈ 𝑋) → (𝐸(.g‘𝐺)𝑥) = (1(.g‘𝐺)𝑥)) |
| 3 | gexcl2.1 | . . . . . . . . . 10 ⊢ 𝑋 = (Base‘𝐺) | |
| 4 | gexcl2.2 | . . . . . . . . . 10 ⊢ 𝐸 = (gEx‘𝐺) | |
| 5 | eqid 2737 | . . . . . . . . . 10 ⊢ (.g‘𝐺) = (.g‘𝐺) | |
| 6 | eqid 2737 | . . . . . . . . . 10 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
| 7 | 3, 4, 5, 6 | gexid 19547 | . . . . . . . . 9 ⊢ (𝑥 ∈ 𝑋 → (𝐸(.g‘𝐺)𝑥) = (0g‘𝐺)) |
| 8 | 7 | adantl 481 | . . . . . . . 8 ⊢ (((𝐺 ∈ Mnd ∧ 𝐸 = 1) ∧ 𝑥 ∈ 𝑋) → (𝐸(.g‘𝐺)𝑥) = (0g‘𝐺)) |
| 9 | 3, 5 | mulg1 19048 | . . . . . . . . 9 ⊢ (𝑥 ∈ 𝑋 → (1(.g‘𝐺)𝑥) = 𝑥) |
| 10 | 9 | adantl 481 | . . . . . . . 8 ⊢ (((𝐺 ∈ Mnd ∧ 𝐸 = 1) ∧ 𝑥 ∈ 𝑋) → (1(.g‘𝐺)𝑥) = 𝑥) |
| 11 | 2, 8, 10 | 3eqtr3rd 2781 | . . . . . . 7 ⊢ (((𝐺 ∈ Mnd ∧ 𝐸 = 1) ∧ 𝑥 ∈ 𝑋) → 𝑥 = (0g‘𝐺)) |
| 12 | velsn 4584 | . . . . . . 7 ⊢ (𝑥 ∈ {(0g‘𝐺)} ↔ 𝑥 = (0g‘𝐺)) | |
| 13 | 11, 12 | sylibr 234 | . . . . . 6 ⊢ (((𝐺 ∈ Mnd ∧ 𝐸 = 1) ∧ 𝑥 ∈ 𝑋) → 𝑥 ∈ {(0g‘𝐺)}) |
| 14 | 13 | ex 412 | . . . . 5 ⊢ ((𝐺 ∈ Mnd ∧ 𝐸 = 1) → (𝑥 ∈ 𝑋 → 𝑥 ∈ {(0g‘𝐺)})) |
| 15 | 14 | ssrdv 3928 | . . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 𝐸 = 1) → 𝑋 ⊆ {(0g‘𝐺)}) |
| 16 | 3, 6 | mndidcl 18708 | . . . . . 6 ⊢ (𝐺 ∈ Mnd → (0g‘𝐺) ∈ 𝑋) |
| 17 | 16 | adantr 480 | . . . . 5 ⊢ ((𝐺 ∈ Mnd ∧ 𝐸 = 1) → (0g‘𝐺) ∈ 𝑋) |
| 18 | 17 | snssd 4753 | . . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 𝐸 = 1) → {(0g‘𝐺)} ⊆ 𝑋) |
| 19 | 15, 18 | eqssd 3940 | . . 3 ⊢ ((𝐺 ∈ Mnd ∧ 𝐸 = 1) → 𝑋 = {(0g‘𝐺)}) |
| 20 | fvex 6847 | . . . 4 ⊢ (0g‘𝐺) ∈ V | |
| 21 | 20 | ensn1 8961 | . . 3 ⊢ {(0g‘𝐺)} ≈ 1o |
| 22 | 19, 21 | eqbrtrdi 5125 | . 2 ⊢ ((𝐺 ∈ Mnd ∧ 𝐸 = 1) → 𝑋 ≈ 1o) |
| 23 | simpl 482 | . . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 𝑋 ≈ 1o) → 𝐺 ∈ Mnd) | |
| 24 | 1nn 12176 | . . . . 5 ⊢ 1 ∈ ℕ | |
| 25 | 24 | a1i 11 | . . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 𝑋 ≈ 1o) → 1 ∈ ℕ) |
| 26 | 9 | adantl 481 | . . . . . 6 ⊢ (((𝐺 ∈ Mnd ∧ 𝑋 ≈ 1o) ∧ 𝑥 ∈ 𝑋) → (1(.g‘𝐺)𝑥) = 𝑥) |
| 27 | en1eqsn 9178 | . . . . . . . . . 10 ⊢ (((0g‘𝐺) ∈ 𝑋 ∧ 𝑋 ≈ 1o) → 𝑋 = {(0g‘𝐺)}) | |
| 28 | 16, 27 | sylan 581 | . . . . . . . . 9 ⊢ ((𝐺 ∈ Mnd ∧ 𝑋 ≈ 1o) → 𝑋 = {(0g‘𝐺)}) |
| 29 | 28 | eleq2d 2823 | . . . . . . . 8 ⊢ ((𝐺 ∈ Mnd ∧ 𝑋 ≈ 1o) → (𝑥 ∈ 𝑋 ↔ 𝑥 ∈ {(0g‘𝐺)})) |
| 30 | 29 | biimpa 476 | . . . . . . 7 ⊢ (((𝐺 ∈ Mnd ∧ 𝑋 ≈ 1o) ∧ 𝑥 ∈ 𝑋) → 𝑥 ∈ {(0g‘𝐺)}) |
| 31 | 30, 12 | sylib 218 | . . . . . 6 ⊢ (((𝐺 ∈ Mnd ∧ 𝑋 ≈ 1o) ∧ 𝑥 ∈ 𝑋) → 𝑥 = (0g‘𝐺)) |
| 32 | 26, 31 | eqtrd 2772 | . . . . 5 ⊢ (((𝐺 ∈ Mnd ∧ 𝑋 ≈ 1o) ∧ 𝑥 ∈ 𝑋) → (1(.g‘𝐺)𝑥) = (0g‘𝐺)) |
| 33 | 32 | ralrimiva 3130 | . . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 𝑋 ≈ 1o) → ∀𝑥 ∈ 𝑋 (1(.g‘𝐺)𝑥) = (0g‘𝐺)) |
| 34 | 3, 4, 5, 6 | gexlem2 19548 | . . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 1 ∈ ℕ ∧ ∀𝑥 ∈ 𝑋 (1(.g‘𝐺)𝑥) = (0g‘𝐺)) → 𝐸 ∈ (1...1)) |
| 35 | 23, 25, 33, 34 | syl3anc 1374 | . . 3 ⊢ ((𝐺 ∈ Mnd ∧ 𝑋 ≈ 1o) → 𝐸 ∈ (1...1)) |
| 36 | elfz1eq 13480 | . . 3 ⊢ (𝐸 ∈ (1...1) → 𝐸 = 1) | |
| 37 | 35, 36 | syl 17 | . 2 ⊢ ((𝐺 ∈ Mnd ∧ 𝑋 ≈ 1o) → 𝐸 = 1) |
| 38 | 22, 37 | impbida 801 | 1 ⊢ (𝐺 ∈ Mnd → (𝐸 = 1 ↔ 𝑋 ≈ 1o)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∀wral 3052 {csn 4568 class class class wbr 5086 ‘cfv 6492 (class class class)co 7360 1oc1o 8391 ≈ cen 8883 1c1 11030 ℕcn 12165 ...cfz 13452 Basecbs 17170 0gc0g 17393 Mndcmnd 18693 .gcmg 19034 gExcgex 19491 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8342 df-1o 8398 df-er 8636 df-en 8887 df-dom 8888 df-sdom 8889 df-sup 9348 df-inf 9349 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-nn 12166 df-n0 12429 df-z 12516 df-uz 12780 df-fz 13453 df-seq 13955 df-0g 17395 df-mgm 18599 df-sgrp 18678 df-mnd 18694 df-mulg 19035 df-gex 19495 |
| This theorem is referenced by: pgpfac1lem3a 20044 pgpfaclem3 20051 |
| Copyright terms: Public domain | W3C validator |