| 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 768 | . . . . . . . . 9 ⊢ (((𝐺 ∈ Mnd ∧ 𝐸 = 1) ∧ 𝑥 ∈ 𝑋) → 𝐸 = 1) | |
| 2 | 1 | oveq1d 7373 | . . . . . . . 8 ⊢ (((𝐺 ∈ Mnd ∧ 𝐸 = 1) ∧ 𝑥 ∈ 𝑋) → (𝐸(.g‘𝐺)𝑥) = (1(.g‘𝐺)𝑥)) |
| 3 | gexcl2.1 | . . . . . . . . . 10 ⊢ 𝑋 = (Base‘𝐺) | |
| 4 | gexcl2.2 | . . . . . . . . . 10 ⊢ 𝐸 = (gEx‘𝐺) | |
| 5 | eqid 2736 | . . . . . . . . . 10 ⊢ (.g‘𝐺) = (.g‘𝐺) | |
| 6 | eqid 2736 | . . . . . . . . . 10 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
| 7 | 3, 4, 5, 6 | gexid 19510 | . . . . . . . . 9 ⊢ (𝑥 ∈ 𝑋 → (𝐸(.g‘𝐺)𝑥) = (0g‘𝐺)) |
| 8 | 7 | adantl 481 | . . . . . . . 8 ⊢ (((𝐺 ∈ Mnd ∧ 𝐸 = 1) ∧ 𝑥 ∈ 𝑋) → (𝐸(.g‘𝐺)𝑥) = (0g‘𝐺)) |
| 9 | 3, 5 | mulg1 19011 | . . . . . . . . 9 ⊢ (𝑥 ∈ 𝑋 → (1(.g‘𝐺)𝑥) = 𝑥) |
| 10 | 9 | adantl 481 | . . . . . . . 8 ⊢ (((𝐺 ∈ Mnd ∧ 𝐸 = 1) ∧ 𝑥 ∈ 𝑋) → (1(.g‘𝐺)𝑥) = 𝑥) |
| 11 | 2, 8, 10 | 3eqtr3rd 2780 | . . . . . . 7 ⊢ (((𝐺 ∈ Mnd ∧ 𝐸 = 1) ∧ 𝑥 ∈ 𝑋) → 𝑥 = (0g‘𝐺)) |
| 12 | velsn 4596 | . . . . . . 7 ⊢ (𝑥 ∈ {(0g‘𝐺)} ↔ 𝑥 = (0g‘𝐺)) | |
| 13 | 11, 12 | sylibr 234 | . . . . . 6 ⊢ (((𝐺 ∈ Mnd ∧ 𝐸 = 1) ∧ 𝑥 ∈ 𝑋) → 𝑥 ∈ {(0g‘𝐺)}) |
| 14 | 13 | ex 412 | . . . . 5 ⊢ ((𝐺 ∈ Mnd ∧ 𝐸 = 1) → (𝑥 ∈ 𝑋 → 𝑥 ∈ {(0g‘𝐺)})) |
| 15 | 14 | ssrdv 3939 | . . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 𝐸 = 1) → 𝑋 ⊆ {(0g‘𝐺)}) |
| 16 | 3, 6 | mndidcl 18674 | . . . . . 6 ⊢ (𝐺 ∈ Mnd → (0g‘𝐺) ∈ 𝑋) |
| 17 | 16 | adantr 480 | . . . . 5 ⊢ ((𝐺 ∈ Mnd ∧ 𝐸 = 1) → (0g‘𝐺) ∈ 𝑋) |
| 18 | 17 | snssd 4765 | . . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 𝐸 = 1) → {(0g‘𝐺)} ⊆ 𝑋) |
| 19 | 15, 18 | eqssd 3951 | . . 3 ⊢ ((𝐺 ∈ Mnd ∧ 𝐸 = 1) → 𝑋 = {(0g‘𝐺)}) |
| 20 | fvex 6847 | . . . 4 ⊢ (0g‘𝐺) ∈ V | |
| 21 | 20 | ensn1 8958 | . . 3 ⊢ {(0g‘𝐺)} ≈ 1o |
| 22 | 19, 21 | eqbrtrdi 5137 | . 2 ⊢ ((𝐺 ∈ Mnd ∧ 𝐸 = 1) → 𝑋 ≈ 1o) |
| 23 | simpl 482 | . . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 𝑋 ≈ 1o) → 𝐺 ∈ Mnd) | |
| 24 | 1nn 12156 | . . . . 5 ⊢ 1 ∈ ℕ | |
| 25 | 24 | a1i 11 | . . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 𝑋 ≈ 1o) → 1 ∈ ℕ) |
| 26 | 9 | adantl 481 | . . . . . 6 ⊢ (((𝐺 ∈ Mnd ∧ 𝑋 ≈ 1o) ∧ 𝑥 ∈ 𝑋) → (1(.g‘𝐺)𝑥) = 𝑥) |
| 27 | en1eqsn 9175 | . . . . . . . . . 10 ⊢ (((0g‘𝐺) ∈ 𝑋 ∧ 𝑋 ≈ 1o) → 𝑋 = {(0g‘𝐺)}) | |
| 28 | 16, 27 | sylan 580 | . . . . . . . . 9 ⊢ ((𝐺 ∈ Mnd ∧ 𝑋 ≈ 1o) → 𝑋 = {(0g‘𝐺)}) |
| 29 | 28 | eleq2d 2822 | . . . . . . . 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 2771 | . . . . 5 ⊢ (((𝐺 ∈ Mnd ∧ 𝑋 ≈ 1o) ∧ 𝑥 ∈ 𝑋) → (1(.g‘𝐺)𝑥) = (0g‘𝐺)) |
| 33 | 32 | ralrimiva 3128 | . . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 𝑋 ≈ 1o) → ∀𝑥 ∈ 𝑋 (1(.g‘𝐺)𝑥) = (0g‘𝐺)) |
| 34 | 3, 4, 5, 6 | gexlem2 19511 | . . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 1 ∈ ℕ ∧ ∀𝑥 ∈ 𝑋 (1(.g‘𝐺)𝑥) = (0g‘𝐺)) → 𝐸 ∈ (1...1)) |
| 35 | 23, 25, 33, 34 | syl3anc 1373 | . . 3 ⊢ ((𝐺 ∈ Mnd ∧ 𝑋 ≈ 1o) → 𝐸 ∈ (1...1)) |
| 36 | elfz1eq 13451 | . . 3 ⊢ (𝐸 ∈ (1...1) → 𝐸 = 1) | |
| 37 | 35, 36 | syl 17 | . 2 ⊢ ((𝐺 ∈ Mnd ∧ 𝑋 ≈ 1o) → 𝐸 = 1) |
| 38 | 22, 37 | impbida 800 | 1 ⊢ (𝐺 ∈ Mnd → (𝐸 = 1 ↔ 𝑋 ≈ 1o)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ∀wral 3051 {csn 4580 class class class wbr 5098 ‘cfv 6492 (class class class)co 7358 1oc1o 8390 ≈ cen 8880 1c1 11027 ℕcn 12145 ...cfz 13423 Basecbs 17136 0gc0g 17359 Mndcmnd 18659 .gcmg 18997 gExcgex 19454 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 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 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-1o 8397 df-er 8635 df-en 8884 df-dom 8885 df-sdom 8886 df-sup 9345 df-inf 9346 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-nn 12146 df-n0 12402 df-z 12489 df-uz 12752 df-fz 13424 df-seq 13925 df-0g 17361 df-mgm 18565 df-sgrp 18644 df-mnd 18660 df-mulg 18998 df-gex 19458 |
| This theorem is referenced by: pgpfac1lem3a 20007 pgpfaclem3 20014 |
| Copyright terms: Public domain | W3C validator |