| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > odlem1 | Structured version Visualization version GIF version | ||
| Description: The group element order is either zero or a nonzero multiplier that annihilates the element. (Contributed by Mario Carneiro, 14-Jan-2015.) (Revised by Stefan O'Rear, 5-Sep-2015.) (Revised by AV, 5-Oct-2020.) |
| Ref | Expression |
|---|---|
| odval.1 | ⊢ 𝑋 = (Base‘𝐺) |
| odval.2 | ⊢ · = (.g‘𝐺) |
| odval.3 | ⊢ 0 = (0g‘𝐺) |
| odval.4 | ⊢ 𝑂 = (od‘𝐺) |
| odval.i | ⊢ 𝐼 = {𝑦 ∈ ℕ ∣ (𝑦 · 𝐴) = 0 } |
| Ref | Expression |
|---|---|
| odlem1 | ⊢ (𝐴 ∈ 𝑋 → (((𝑂‘𝐴) = 0 ∧ 𝐼 = ∅) ∨ (𝑂‘𝐴) ∈ 𝐼)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | odval.1 | . . 3 ⊢ 𝑋 = (Base‘𝐺) | |
| 2 | odval.2 | . . 3 ⊢ · = (.g‘𝐺) | |
| 3 | odval.3 | . . 3 ⊢ 0 = (0g‘𝐺) | |
| 4 | odval.4 | . . 3 ⊢ 𝑂 = (od‘𝐺) | |
| 5 | odval.i | . . 3 ⊢ 𝐼 = {𝑦 ∈ ℕ ∣ (𝑦 · 𝐴) = 0 } | |
| 6 | 1, 2, 3, 4, 5 | odval 19461 | . 2 ⊢ (𝐴 ∈ 𝑋 → (𝑂‘𝐴) = if(𝐼 = ∅, 0, inf(𝐼, ℝ, < ))) |
| 7 | eqeq2 2746 | . . . 4 ⊢ (0 = if(𝐼 = ∅, 0, inf(𝐼, ℝ, < )) → ((𝑂‘𝐴) = 0 ↔ (𝑂‘𝐴) = if(𝐼 = ∅, 0, inf(𝐼, ℝ, < )))) | |
| 8 | 7 | imbi1d 341 | . . 3 ⊢ (0 = if(𝐼 = ∅, 0, inf(𝐼, ℝ, < )) → (((𝑂‘𝐴) = 0 → (((𝑂‘𝐴) = 0 ∧ 𝐼 = ∅) ∨ (𝑂‘𝐴) ∈ 𝐼)) ↔ ((𝑂‘𝐴) = if(𝐼 = ∅, 0, inf(𝐼, ℝ, < )) → (((𝑂‘𝐴) = 0 ∧ 𝐼 = ∅) ∨ (𝑂‘𝐴) ∈ 𝐼)))) |
| 9 | eqeq2 2746 | . . . 4 ⊢ (inf(𝐼, ℝ, < ) = if(𝐼 = ∅, 0, inf(𝐼, ℝ, < )) → ((𝑂‘𝐴) = inf(𝐼, ℝ, < ) ↔ (𝑂‘𝐴) = if(𝐼 = ∅, 0, inf(𝐼, ℝ, < )))) | |
| 10 | 9 | imbi1d 341 | . . 3 ⊢ (inf(𝐼, ℝ, < ) = if(𝐼 = ∅, 0, inf(𝐼, ℝ, < )) → (((𝑂‘𝐴) = inf(𝐼, ℝ, < ) → (((𝑂‘𝐴) = 0 ∧ 𝐼 = ∅) ∨ (𝑂‘𝐴) ∈ 𝐼)) ↔ ((𝑂‘𝐴) = if(𝐼 = ∅, 0, inf(𝐼, ℝ, < )) → (((𝑂‘𝐴) = 0 ∧ 𝐼 = ∅) ∨ (𝑂‘𝐴) ∈ 𝐼)))) |
| 11 | orc 867 | . . . . 5 ⊢ (((𝑂‘𝐴) = 0 ∧ 𝐼 = ∅) → (((𝑂‘𝐴) = 0 ∧ 𝐼 = ∅) ∨ (𝑂‘𝐴) ∈ 𝐼)) | |
| 12 | 11 | expcom 413 | . . . 4 ⊢ (𝐼 = ∅ → ((𝑂‘𝐴) = 0 → (((𝑂‘𝐴) = 0 ∧ 𝐼 = ∅) ∨ (𝑂‘𝐴) ∈ 𝐼))) |
| 13 | 12 | adantl 481 | . . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐼 = ∅) → ((𝑂‘𝐴) = 0 → (((𝑂‘𝐴) = 0 ∧ 𝐼 = ∅) ∨ (𝑂‘𝐴) ∈ 𝐼))) |
| 14 | ssrab2 4030 | . . . . . . 7 ⊢ {𝑦 ∈ ℕ ∣ (𝑦 · 𝐴) = 0 } ⊆ ℕ | |
| 15 | nnuz 12788 | . . . . . . . 8 ⊢ ℕ = (ℤ≥‘1) | |
| 16 | 15 | eqcomi 2743 | . . . . . . 7 ⊢ (ℤ≥‘1) = ℕ |
| 17 | 14, 5, 16 | 3sstr4i 3983 | . . . . . 6 ⊢ 𝐼 ⊆ (ℤ≥‘1) |
| 18 | neqne 2938 | . . . . . . 7 ⊢ (¬ 𝐼 = ∅ → 𝐼 ≠ ∅) | |
| 19 | 18 | adantl 481 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑋 ∧ ¬ 𝐼 = ∅) → 𝐼 ≠ ∅) |
| 20 | infssuzcl 12843 | . . . . . 6 ⊢ ((𝐼 ⊆ (ℤ≥‘1) ∧ 𝐼 ≠ ∅) → inf(𝐼, ℝ, < ) ∈ 𝐼) | |
| 21 | 17, 19, 20 | sylancr 587 | . . . . 5 ⊢ ((𝐴 ∈ 𝑋 ∧ ¬ 𝐼 = ∅) → inf(𝐼, ℝ, < ) ∈ 𝐼) |
| 22 | eleq1a 2829 | . . . . 5 ⊢ (inf(𝐼, ℝ, < ) ∈ 𝐼 → ((𝑂‘𝐴) = inf(𝐼, ℝ, < ) → (𝑂‘𝐴) ∈ 𝐼)) | |
| 23 | 21, 22 | syl 17 | . . . 4 ⊢ ((𝐴 ∈ 𝑋 ∧ ¬ 𝐼 = ∅) → ((𝑂‘𝐴) = inf(𝐼, ℝ, < ) → (𝑂‘𝐴) ∈ 𝐼)) |
| 24 | olc 868 | . . . 4 ⊢ ((𝑂‘𝐴) ∈ 𝐼 → (((𝑂‘𝐴) = 0 ∧ 𝐼 = ∅) ∨ (𝑂‘𝐴) ∈ 𝐼)) | |
| 25 | 23, 24 | syl6 35 | . . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ ¬ 𝐼 = ∅) → ((𝑂‘𝐴) = inf(𝐼, ℝ, < ) → (((𝑂‘𝐴) = 0 ∧ 𝐼 = ∅) ∨ (𝑂‘𝐴) ∈ 𝐼))) |
| 26 | 8, 10, 13, 25 | ifbothda 4516 | . 2 ⊢ (𝐴 ∈ 𝑋 → ((𝑂‘𝐴) = if(𝐼 = ∅, 0, inf(𝐼, ℝ, < )) → (((𝑂‘𝐴) = 0 ∧ 𝐼 = ∅) ∨ (𝑂‘𝐴) ∈ 𝐼))) |
| 27 | 6, 26 | mpd 15 | 1 ⊢ (𝐴 ∈ 𝑋 → (((𝑂‘𝐴) = 0 ∧ 𝐼 = ∅) ∨ (𝑂‘𝐴) ∈ 𝐼)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∨ wo 847 = wceq 1541 ∈ wcel 2113 ≠ wne 2930 {crab 3397 ⊆ wss 3899 ∅c0 4283 ifcif 4477 ‘cfv 6490 (class class class)co 7356 infcinf 9342 ℝcr 11023 0cc0 11024 1c1 11025 < clt 11164 ℕcn 12143 ℤ≥cuz 12749 Basecbs 17134 0gc0g 17357 .gcmg 18995 odcod 19451 |
| 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 2182 ax-ext 2706 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 ax-cnex 11080 ax-resscn 11081 ax-1cn 11082 ax-icn 11083 ax-addcl 11084 ax-addrcl 11085 ax-mulcl 11086 ax-mulrcl 11087 ax-mulcom 11088 ax-addass 11089 ax-mulass 11090 ax-distr 11091 ax-i2m1 11092 ax-1ne0 11093 ax-1rid 11094 ax-rnegex 11095 ax-rrecex 11096 ax-cnre 11097 ax-pre-lttri 11098 ax-pre-lttrn 11099 ax-pre-ltadd 11100 ax-pre-mulgt0 11101 |
| 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 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3059 df-rmo 3348 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-iun 4946 df-br 5097 df-opab 5159 df-mpt 5178 df-tr 5204 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-er 8633 df-en 8882 df-dom 8883 df-sdom 8884 df-sup 9343 df-inf 9344 df-pnf 11166 df-mnf 11167 df-xr 11168 df-ltxr 11169 df-le 11170 df-sub 11364 df-neg 11365 df-nn 12144 df-n0 12400 df-z 12487 df-uz 12750 df-od 19455 |
| This theorem is referenced by: odcl 19463 odid 19465 |
| Copyright terms: Public domain | W3C validator |