| Mathbox for metakunt |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > isprimroot2 | Structured version Visualization version GIF version | ||
| Description: Alternative way of creating primitive roots. (Contributed by metakunt, 14-Jul-2025.) |
| Ref | Expression |
|---|---|
| isprimroot2.1 | ⊢ (𝜑 → 𝑅 ∈ CMnd) |
| isprimroot2.2 | ⊢ (𝜑 → 𝐾 ∈ ℕ) |
| isprimroot2.3 | ⊢ (𝜑 → 𝑀 ∈ (Base‘𝑅)) |
| isprimroot2.4 | ⊢ (𝜑 → ((od‘𝑅)‘𝑀) = 𝐾) |
| Ref | Expression |
|---|---|
| isprimroot2 | ⊢ (𝜑 → 𝑀 ∈ (𝑅 PrimRoots 𝐾)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | isprimroot2.3 | . . 3 ⊢ (𝜑 → 𝑀 ∈ (Base‘𝑅)) | |
| 2 | isprimroot2.4 | . . . . . 6 ⊢ (𝜑 → ((od‘𝑅)‘𝑀) = 𝐾) | |
| 3 | 2 | eqcomd 2742 | . . . . 5 ⊢ (𝜑 → 𝐾 = ((od‘𝑅)‘𝑀)) |
| 4 | 3 | oveq1d 7382 | . . . 4 ⊢ (𝜑 → (𝐾(.g‘𝑅)𝑀) = (((od‘𝑅)‘𝑀)(.g‘𝑅)𝑀)) |
| 5 | eqid 2736 | . . . . . 6 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 6 | eqid 2736 | . . . . . 6 ⊢ (od‘𝑅) = (od‘𝑅) | |
| 7 | eqid 2736 | . . . . . 6 ⊢ (.g‘𝑅) = (.g‘𝑅) | |
| 8 | eqid 2736 | . . . . . 6 ⊢ (0g‘𝑅) = (0g‘𝑅) | |
| 9 | 5, 6, 7, 8 | odid 19513 | . . . . 5 ⊢ (𝑀 ∈ (Base‘𝑅) → (((od‘𝑅)‘𝑀)(.g‘𝑅)𝑀) = (0g‘𝑅)) |
| 10 | 1, 9 | syl 17 | . . . 4 ⊢ (𝜑 → (((od‘𝑅)‘𝑀)(.g‘𝑅)𝑀) = (0g‘𝑅)) |
| 11 | 4, 10 | eqtrd 2771 | . . 3 ⊢ (𝜑 → (𝐾(.g‘𝑅)𝑀) = (0g‘𝑅)) |
| 12 | 2 | ad2antrr 727 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑙 ∈ ℕ0) ∧ (𝑙(.g‘𝑅)𝑀) = (0g‘𝑅)) → ((od‘𝑅)‘𝑀) = 𝐾) |
| 13 | 12 | eqcomd 2742 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑙 ∈ ℕ0) ∧ (𝑙(.g‘𝑅)𝑀) = (0g‘𝑅)) → 𝐾 = ((od‘𝑅)‘𝑀)) |
| 14 | isprimroot2.1 | . . . . . . . . . . . 12 ⊢ (𝜑 → 𝑅 ∈ CMnd) | |
| 15 | 14 | cmnmndd 19779 | . . . . . . . . . . 11 ⊢ (𝜑 → 𝑅 ∈ Mnd) |
| 16 | 15 | adantr 480 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑙 ∈ ℕ0) → 𝑅 ∈ Mnd) |
| 17 | 1 | adantr 480 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑙 ∈ ℕ0) → 𝑀 ∈ (Base‘𝑅)) |
| 18 | simpr 484 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑙 ∈ ℕ0) → 𝑙 ∈ ℕ0) | |
| 19 | 5, 6, 7, 8 | oddvdsnn0 19519 | . . . . . . . . . 10 ⊢ ((𝑅 ∈ Mnd ∧ 𝑀 ∈ (Base‘𝑅) ∧ 𝑙 ∈ ℕ0) → (((od‘𝑅)‘𝑀) ∥ 𝑙 ↔ (𝑙(.g‘𝑅)𝑀) = (0g‘𝑅))) |
| 20 | 16, 17, 18, 19 | syl3anc 1374 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑙 ∈ ℕ0) → (((od‘𝑅)‘𝑀) ∥ 𝑙 ↔ (𝑙(.g‘𝑅)𝑀) = (0g‘𝑅))) |
| 21 | 20 | bicomd 223 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑙 ∈ ℕ0) → ((𝑙(.g‘𝑅)𝑀) = (0g‘𝑅) ↔ ((od‘𝑅)‘𝑀) ∥ 𝑙)) |
| 22 | 21 | biimpd 229 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑙 ∈ ℕ0) → ((𝑙(.g‘𝑅)𝑀) = (0g‘𝑅) → ((od‘𝑅)‘𝑀) ∥ 𝑙)) |
| 23 | 22 | imp 406 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑙 ∈ ℕ0) ∧ (𝑙(.g‘𝑅)𝑀) = (0g‘𝑅)) → ((od‘𝑅)‘𝑀) ∥ 𝑙) |
| 24 | 13, 23 | eqbrtrd 5107 | . . . . 5 ⊢ (((𝜑 ∧ 𝑙 ∈ ℕ0) ∧ (𝑙(.g‘𝑅)𝑀) = (0g‘𝑅)) → 𝐾 ∥ 𝑙) |
| 25 | 24 | ex 412 | . . . 4 ⊢ ((𝜑 ∧ 𝑙 ∈ ℕ0) → ((𝑙(.g‘𝑅)𝑀) = (0g‘𝑅) → 𝐾 ∥ 𝑙)) |
| 26 | 25 | ralrimiva 3129 | . . 3 ⊢ (𝜑 → ∀𝑙 ∈ ℕ0 ((𝑙(.g‘𝑅)𝑀) = (0g‘𝑅) → 𝐾 ∥ 𝑙)) |
| 27 | 1, 11, 26 | 3jca 1129 | . 2 ⊢ (𝜑 → (𝑀 ∈ (Base‘𝑅) ∧ (𝐾(.g‘𝑅)𝑀) = (0g‘𝑅) ∧ ∀𝑙 ∈ ℕ0 ((𝑙(.g‘𝑅)𝑀) = (0g‘𝑅) → 𝐾 ∥ 𝑙))) |
| 28 | isprimroot2.2 | . . . 4 ⊢ (𝜑 → 𝐾 ∈ ℕ) | |
| 29 | 28 | nnnn0d 12498 | . . 3 ⊢ (𝜑 → 𝐾 ∈ ℕ0) |
| 30 | 14, 29, 7 | isprimroot 42532 | . 2 ⊢ (𝜑 → (𝑀 ∈ (𝑅 PrimRoots 𝐾) ↔ (𝑀 ∈ (Base‘𝑅) ∧ (𝐾(.g‘𝑅)𝑀) = (0g‘𝑅) ∧ ∀𝑙 ∈ ℕ0 ((𝑙(.g‘𝑅)𝑀) = (0g‘𝑅) → 𝐾 ∥ 𝑙)))) |
| 31 | 27, 30 | mpbird 257 | 1 ⊢ (𝜑 → 𝑀 ∈ (𝑅 PrimRoots 𝐾)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ∀wral 3051 class class class wbr 5085 ‘cfv 6498 (class class class)co 7367 ℕcn 12174 ℕ0cn0 12437 ∥ cdvds 16221 Basecbs 17179 0gc0g 17402 Mndcmnd 18702 .gcmg 19043 odcod 19499 CMndccmn 19755 PrimRoots cprimroots 42530 |
| 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 2708 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 ax-pre-sup 11116 |
| 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 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 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-1st 7942 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-er 8643 df-en 8894 df-dom 8895 df-sdom 8896 df-sup 9355 df-inf 9356 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-div 11808 df-nn 12175 df-n0 12438 df-z 12525 df-uz 12789 df-rp 12943 df-fz 13462 df-fl 13751 df-mod 13829 df-seq 13964 df-dvds 16222 df-0g 17404 df-mgm 18608 df-sgrp 18687 df-mnd 18703 df-mulg 19044 df-od 19503 df-cmn 19757 df-primroots 42531 |
| This theorem is referenced by: unitscyglem5 42638 |
| Copyright terms: Public domain | W3C validator |