| 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 2767 | . . . . 5 ⊢ (𝜑 → 𝐾 = ((od‘𝑅)‘𝑀)) |
| 4 | 3 | oveq1d 7427 | . . . 4 ⊢ (𝜑 → (𝐾(.g‘𝑅)𝑀) = (((od‘𝑅)‘𝑀)(.g‘𝑅)𝑀)) |
| 5 | eqid 2761 | . . . . . 6 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 6 | eqid 2761 | . . . . . 6 ⊢ (od‘𝑅) = (od‘𝑅) | |
| 7 | eqid 2761 | . . . . . 6 ⊢ (.g‘𝑅) = (.g‘𝑅) | |
| 8 | eqid 2761 | . . . . . 6 ⊢ (0g‘𝑅) = (0g‘𝑅) | |
| 9 | 5, 6, 7, 8 | odid 19732 | . . . . 5 ⊢ (𝑀 ∈ (Base‘𝑅) → (((od‘𝑅)‘𝑀)(.g‘𝑅)𝑀) = (0g‘𝑅)) |
| 10 | 1, 9 | syl 18 | . . . 4 ⊢ (𝜑 → (((od‘𝑅)‘𝑀)(.g‘𝑅)𝑀) = (0g‘𝑅)) |
| 11 | 4, 10 | eqtrd 2796 | . . 3 ⊢ (𝜑 → (𝐾(.g‘𝑅)𝑀) = (0g‘𝑅)) |
| 12 | 2 | ad2antrr 739 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑙 ∈ ℕ0) ∧ (𝑙(.g‘𝑅)𝑀) = (0g‘𝑅)) → ((od‘𝑅)‘𝑀) = 𝐾) |
| 13 | 12 | eqcomd 2767 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑙 ∈ ℕ0) ∧ (𝑙(.g‘𝑅)𝑀) = (0g‘𝑅)) → 𝐾 = ((od‘𝑅)‘𝑀)) |
| 14 | isprimroot2.1 | . . . . . . . . . . . 12 ⊢ (𝜑 → 𝑅 ∈ CMnd) | |
| 15 | 14 | cmnmndd 19998 | . . . . . . . . . . 11 ⊢ (𝜑 → 𝑅 ∈ Mnd) |
| 16 | 15 | adantr 486 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑙 ∈ ℕ0) → 𝑅 ∈ Mnd) |
| 17 | 1 | adantr 486 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑙 ∈ ℕ0) → 𝑀 ∈ (Base‘𝑅)) |
| 18 | simpr 490 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑙 ∈ ℕ0) → 𝑙 ∈ ℕ0) | |
| 19 | 5, 6, 7, 8 | oddvdsnn0 19738 | . . . . . . . . . 10 ⊢ ((𝑅 ∈ Mnd ∧ 𝑀 ∈ (Base‘𝑅) ∧ 𝑙 ∈ ℕ0) → (((od‘𝑅)‘𝑀) ∥ 𝑙 ↔ (𝑙(.g‘𝑅)𝑀) = (0g‘𝑅))) |
| 20 | 16, 17, 18, 19 | syl3anc 1398 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑙 ∈ ℕ0) → (((od‘𝑅)‘𝑀) ∥ 𝑙 ↔ (𝑙(.g‘𝑅)𝑀) = (0g‘𝑅))) |
| 21 | 20 | bicomd 226 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑙 ∈ ℕ0) → ((𝑙(.g‘𝑅)𝑀) = (0g‘𝑅) ↔ ((od‘𝑅)‘𝑀) ∥ 𝑙)) |
| 22 | 21 | biimpd 232 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑙 ∈ ℕ0) → ((𝑙(.g‘𝑅)𝑀) = (0g‘𝑅) → ((od‘𝑅)‘𝑀) ∥ 𝑙)) |
| 23 | 22 | imp 412 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑙 ∈ ℕ0) ∧ (𝑙(.g‘𝑅)𝑀) = (0g‘𝑅)) → ((od‘𝑅)‘𝑀) ∥ 𝑙) |
| 24 | 13, 23 | eqbrtrd 5127 | . . . . 5 ⊢ (((𝜑 ∧ 𝑙 ∈ ℕ0) ∧ (𝑙(.g‘𝑅)𝑀) = (0g‘𝑅)) → 𝐾 ∥ 𝑙) |
| 25 | 24 | ex 418 | . . . 4 ⊢ ((𝜑 ∧ 𝑙 ∈ ℕ0) → ((𝑙(.g‘𝑅)𝑀) = (0g‘𝑅) → 𝐾 ∥ 𝑙)) |
| 26 | 25 | ralrimiva 3155 | . . 3 ⊢ (𝜑 → ∀𝑙 ∈ ℕ0 ((𝑙(.g‘𝑅)𝑀) = (0g‘𝑅) → 𝐾 ∥ 𝑙)) |
| 27 | 1, 11, 26 | 3jca 1146 | . 2 ⊢ (𝜑 → (𝑀 ∈ (Base‘𝑅) ∧ (𝐾(.g‘𝑅)𝑀) = (0g‘𝑅) ∧ ∀𝑙 ∈ ℕ0 ((𝑙(.g‘𝑅)𝑀) = (0g‘𝑅) → 𝐾 ∥ 𝑙))) |
| 28 | isprimroot2.2 | . . . 4 ⊢ (𝜑 → 𝐾 ∈ ℕ) | |
| 29 | 28 | nnnn0d 12648 | . . 3 ⊢ (𝜑 → 𝐾 ∈ ℕ0) |
| 30 | 14, 29, 7 | isprimroot 43111 | . 2 ⊢ (𝜑 → (𝑀 ∈ (𝑅 PrimRoots 𝐾) ↔ (𝑀 ∈ (Base‘𝑅) ∧ (𝐾(.g‘𝑅)𝑀) = (0g‘𝑅) ∧ ∀𝑙 ∈ ℕ0 ((𝑙(.g‘𝑅)𝑀) = (0g‘𝑅) → 𝐾 ∥ 𝑙)))) |
| 31 | 27, 30 | mpbird 260 | 1 ⊢ (𝜑 → 𝑀 ∈ (𝑅 PrimRoots 𝐾)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ∀wral 3077 class class class wbr 5103 ‘cfv 6531 (class class class)co 7412 ℕcn 12316 ℕ0cn0 12587 ∥ cdvds 16402 Basecbs 17367 0gc0g 17590 Mndcmnd 18903 .gcmg 19257 odcod 19718 CMndccmn 19974 PrimRoots cprimroots 43109 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 ax-cnex 11237 ax-resscn 11238 ax-1cn 11239 ax-icn 11240 ax-addcl 11241 ax-addrcl 11242 ax-mulcl 11243 ax-mulrcl 11244 ax-mulcom 11245 ax-addass 11246 ax-mulass 11247 ax-distr 11248 ax-i2m1 11249 ax-1ne0 11250 ax-1rid 11251 ax-rnegex 11252 ax-rrecex 11253 ax-cnre 11254 ax-pre-lttri 11255 ax-pre-lttrn 11256 ax-pre-ltadd 11257 ax-pre-mulgt0 11258 ax-pre-sup 11259 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6297 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7867 df-1st 7990 df-2nd 7991 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-er 8701 df-en 8958 df-dom 8959 df-sdom 8960 df-sup 9418 df-inf 9419 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11524 df-neg 11525 df-div 11955 df-nn 12317 df-n0 12588 df-z 12675 df-uz 12947 df-rp 13102 df-fz 13621 df-fl 13912 df-mod 13990 df-seq 14125 df-dvds 16403 df-0g 17592 df-mgm 18796 df-sgrp 18888 df-mnd 18904 df-mulg 19258 df-od 19722 df-cmn 19976 df-primroots 43110 |
| This theorem is used by: unitscyglem5 43217 |
| Copyright terms: Public domain | W3C validator |