| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > odinf | Structured version Visualization version GIF version | ||
| Description: The multiples of an element with infinite order form an infinite cyclic subgroup of 𝐺. (Contributed by Mario Carneiro, 14-Jan-2015.) |
| Ref | Expression |
|---|---|
| odf1.1 | ⊢ 𝑋 = (Base‘𝐺) |
| odf1.2 | ⊢ 𝑂 = (od‘𝐺) |
| odf1.3 | ⊢ · = (.g‘𝐺) |
| odf1.4 | ⊢ 𝐹 = (𝑥 ∈ ℤ ↦ (𝑥 · 𝐴)) |
| Ref | Expression |
|---|---|
| odinf | ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ (𝑂‘𝐴) = 0) → ¬ ran 𝐹 ∈ Fin) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | znnen 16258 | . . . . 5 ⊢ ℤ ≈ ℕ | |
| 2 | nnenom 14007 | . . . . 5 ⊢ ℕ ≈ ω | |
| 3 | 1, 2 | entr2i 8994 | . . . 4 ⊢ ω ≈ ℤ |
| 4 | odf1.1 | . . . . . . . 8 ⊢ 𝑋 = (Base‘𝐺) | |
| 5 | odf1.2 | . . . . . . . 8 ⊢ 𝑂 = (od‘𝐺) | |
| 6 | odf1.3 | . . . . . . . 8 ⊢ · = (.g‘𝐺) | |
| 7 | odf1.4 | . . . . . . . 8 ⊢ 𝐹 = (𝑥 ∈ ℤ ↦ (𝑥 · 𝐴)) | |
| 8 | 4, 5, 6, 7 | odf1 19623 | . . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → ((𝑂‘𝐴) = 0 ↔ 𝐹:ℤ–1-1→𝑋)) |
| 9 | 8 | biimp3a 1493 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ (𝑂‘𝐴) = 0) → 𝐹:ℤ–1-1→𝑋) |
| 10 | f1f 6764 | . . . . . 6 ⊢ (𝐹:ℤ–1-1→𝑋 → 𝐹:ℤ⟶𝑋) | |
| 11 | zex 12591 | . . . . . . 7 ⊢ ℤ ∈ V | |
| 12 | 4 | fvexi 6885 | . . . . . . 7 ⊢ 𝑋 ∈ V |
| 13 | fex2 7921 | . . . . . . 7 ⊢ ((𝐹:ℤ⟶𝑋 ∧ ℤ ∈ V ∧ 𝑋 ∈ V) → 𝐹 ∈ V) | |
| 14 | 11, 12, 13 | mp3an23 1477 | . . . . . 6 ⊢ (𝐹:ℤ⟶𝑋 → 𝐹 ∈ V) |
| 15 | 9, 10, 14 | 3syl 19 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ (𝑂‘𝐴) = 0) → 𝐹 ∈ V) |
| 16 | f1f1orn 6822 | . . . . . 6 ⊢ (𝐹:ℤ–1-1→𝑋 → 𝐹:ℤ–1-1-onto→ran 𝐹) | |
| 17 | 9, 16 | syl 18 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ (𝑂‘𝐴) = 0) → 𝐹:ℤ–1-1-onto→ran 𝐹) |
| 18 | f1oen3g 8951 | . . . . 5 ⊢ ((𝐹 ∈ V ∧ 𝐹:ℤ–1-1-onto→ran 𝐹) → ℤ ≈ ran 𝐹) | |
| 19 | 15, 17, 18 | syl2anc 595 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ (𝑂‘𝐴) = 0) → ℤ ≈ ran 𝐹) |
| 20 | entr 8991 | . . . 4 ⊢ ((ω ≈ ℤ ∧ ℤ ≈ ran 𝐹) → ω ≈ ran 𝐹) | |
| 21 | 3, 19, 20 | sylancr 598 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ (𝑂‘𝐴) = 0) → ω ≈ ran 𝐹) |
| 22 | endom 8964 | . . 3 ⊢ (ω ≈ ran 𝐹 → ω ≼ ran 𝐹) | |
| 23 | domnsym 9079 | . . 3 ⊢ (ω ≼ ran 𝐹 → ¬ ran 𝐹 ≺ ω) | |
| 24 | 21, 22, 23 | 3syl 19 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ (𝑂‘𝐴) = 0) → ¬ ran 𝐹 ≺ ω) |
| 25 | isfinite 9609 | . 2 ⊢ (ran 𝐹 ∈ Fin ↔ ran 𝐹 ≺ ω) | |
| 26 | 24, 25 | sylnibr 332 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ (𝑂‘𝐴) = 0) → ¬ ran 𝐹 ∈ Fin) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ w3a 1101 = wceq 1563 ∈ wcel 2145 Vcvv 3457 class class class wbr 5105 ↦ cmpt 5186 ran crn 5653 ⟶wf 6521 –1-1→wf1 6522 –1-1-onto→wf1o 6524 ‘cfv 6525 (class class class)co 7400 ωcom 7850 ≈ cen 8928 ≼ cdom 8929 ≺ csdm 8930 Fincfn 8931 0cc0 11088 ℕcn 12224 ℤcz 12582 Basecbs 17259 Grpcgrp 18990 .gcmg 19124 odcod 19585 |
| 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-rep 5232 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 ax-inf2 9598 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 ax-pre-sup 11166 |
| 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-int 4909 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-se 5606 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-isom 6534 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-1o 8441 df-oadd 8445 df-omul 8446 df-er 8682 df-map 8814 df-en 8932 df-dom 8933 df-sdom 8934 df-fin 8935 df-sup 9390 df-inf 9391 df-oi 9460 df-card 9913 df-acn 9916 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-div 11860 df-nn 12225 df-2 12294 df-3 12295 df-n0 12496 df-z 12583 df-uz 12854 df-rp 13008 df-fz 13527 df-fl 13816 df-mod 13894 df-seq 14029 df-exp 14089 df-cj 15140 df-re 15141 df-im 15142 df-sqrt 15276 df-abs 15277 df-dvds 16301 df-0g 17484 df-mgm 18688 df-sgrp 18767 df-mnd 18783 df-grp 18993 df-minusg 18994 df-sbg 18995 df-mulg 19125 df-od 19589 |
| This theorem is referenced by: dfod2 19625 odcl2 19626 |
| Copyright terms: Public domain | W3C validator |