| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > odhash3 | Structured version Visualization version GIF version | ||
| Description: An element which generates a finite subgroup has order the size of that subgroup. (Contributed by Stefan O'Rear, 12-Sep-2015.) |
| Ref | Expression |
|---|---|
| odhash.x | ⊢ 𝑋 = (Base‘𝐺) |
| odhash.o | ⊢ 𝑂 = (od‘𝐺) |
| odhash.k | ⊢ 𝐾 = (mrCls‘(SubGrp‘𝐺)) |
| Ref | Expression |
|---|---|
| odhash3 | ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ (𝐾‘{𝐴}) ∈ Fin) → (𝑂‘𝐴) = (♯‘(𝐾‘{𝐴}))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | odhash.x | . . . . . 6 ⊢ 𝑋 = (Base‘𝐺) | |
| 2 | odhash.o | . . . . . 6 ⊢ 𝑂 = (od‘𝐺) | |
| 3 | 1, 2 | odcl 19465 | . . . . 5 ⊢ (𝐴 ∈ 𝑋 → (𝑂‘𝐴) ∈ ℕ0) |
| 4 | 3 | 3ad2ant2 1134 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ (𝐾‘{𝐴}) ∈ Fin) → (𝑂‘𝐴) ∈ ℕ0) |
| 5 | hashcl 14279 | . . . . . . 7 ⊢ ((𝐾‘{𝐴}) ∈ Fin → (♯‘(𝐾‘{𝐴})) ∈ ℕ0) | |
| 6 | 5 | nn0red 12463 | . . . . . 6 ⊢ ((𝐾‘{𝐴}) ∈ Fin → (♯‘(𝐾‘{𝐴})) ∈ ℝ) |
| 7 | pnfnre 11173 | . . . . . . . . . 10 ⊢ +∞ ∉ ℝ | |
| 8 | 7 | neli 3038 | . . . . . . . . 9 ⊢ ¬ +∞ ∈ ℝ |
| 9 | odhash.k | . . . . . . . . . . 11 ⊢ 𝐾 = (mrCls‘(SubGrp‘𝐺)) | |
| 10 | 1, 2, 9 | odhash 19503 | . . . . . . . . . 10 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ (𝑂‘𝐴) = 0) → (♯‘(𝐾‘{𝐴})) = +∞) |
| 11 | 10 | eleq1d 2821 | . . . . . . . . 9 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ (𝑂‘𝐴) = 0) → ((♯‘(𝐾‘{𝐴})) ∈ ℝ ↔ +∞ ∈ ℝ)) |
| 12 | 8, 11 | mtbiri 327 | . . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ (𝑂‘𝐴) = 0) → ¬ (♯‘(𝐾‘{𝐴})) ∈ ℝ) |
| 13 | 12 | 3expia 1121 | . . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → ((𝑂‘𝐴) = 0 → ¬ (♯‘(𝐾‘{𝐴})) ∈ ℝ)) |
| 14 | 13 | necon2ad 2947 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → ((♯‘(𝐾‘{𝐴})) ∈ ℝ → (𝑂‘𝐴) ≠ 0)) |
| 15 | 6, 14 | syl5 34 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → ((𝐾‘{𝐴}) ∈ Fin → (𝑂‘𝐴) ≠ 0)) |
| 16 | 15 | 3impia 1117 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ (𝐾‘{𝐴}) ∈ Fin) → (𝑂‘𝐴) ≠ 0) |
| 17 | elnnne0 12415 | . . . 4 ⊢ ((𝑂‘𝐴) ∈ ℕ ↔ ((𝑂‘𝐴) ∈ ℕ0 ∧ (𝑂‘𝐴) ≠ 0)) | |
| 18 | 4, 16, 17 | sylanbrc 583 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ (𝐾‘{𝐴}) ∈ Fin) → (𝑂‘𝐴) ∈ ℕ) |
| 19 | 1, 2, 9 | odhash2 19504 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ (𝑂‘𝐴) ∈ ℕ) → (♯‘(𝐾‘{𝐴})) = (𝑂‘𝐴)) |
| 20 | 18, 19 | syld3an3 1411 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ (𝐾‘{𝐴}) ∈ Fin) → (♯‘(𝐾‘{𝐴})) = (𝑂‘𝐴)) |
| 21 | 20 | eqcomd 2742 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ (𝐾‘{𝐴}) ∈ Fin) → (𝑂‘𝐴) = (♯‘(𝐾‘{𝐴}))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 ≠ wne 2932 {csn 4580 ‘cfv 6492 Fincfn 8883 ℝcr 11025 0cc0 11026 +∞cpnf 11163 ℕcn 12145 ℕ0cn0 12401 ♯chash 14253 Basecbs 17136 mrClscmrc 17502 Grpcgrp 18863 SubGrpcsubg 19050 odcod 19453 |
| 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-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-inf2 9550 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 ax-pre-sup 11104 |
| 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-int 4903 df-iun 4948 df-iin 4949 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-se 5578 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-isom 6501 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-2o 8398 df-oadd 8401 df-omul 8402 df-er 8635 df-map 8765 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-sup 9345 df-inf 9346 df-oi 9415 df-card 9851 df-acn 9854 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-div 11795 df-nn 12146 df-2 12208 df-3 12209 df-n0 12402 df-z 12489 df-uz 12752 df-rp 12906 df-fz 13424 df-fzo 13571 df-fl 13712 df-mod 13790 df-seq 13925 df-exp 13985 df-hash 14254 df-cj 15022 df-re 15023 df-im 15024 df-sqrt 15158 df-abs 15159 df-dvds 16180 df-sets 17091 df-slot 17109 df-ndx 17121 df-base 17137 df-ress 17158 df-plusg 17190 df-0g 17361 df-mre 17505 df-mrc 17506 df-acs 17508 df-mgm 18565 df-sgrp 18644 df-mnd 18660 df-submnd 18709 df-grp 18866 df-minusg 18867 df-sbg 18868 df-mulg 18998 df-subg 19053 df-od 19457 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |