| 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 2769 | . . . . 5 ⊢ (𝜑 → 𝐾 = ((od‘𝑅)‘𝑀)) |
| 4 | 3 | oveq1d 7427 | . . . 4 ⊢ (𝜑 → (𝐾(.g‘𝑅)𝑀) = (((od‘𝑅)‘𝑀)(.g‘𝑅)𝑀)) |
| 5 | eqid 2763 | . . . . . 6 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 6 | eqid 2763 | . . . . . 6 ⊢ (od‘𝑅) = (od‘𝑅) | |
| 7 | eqid 2763 | . . . . . 6 ⊢ (.g‘𝑅) = (.g‘𝑅) | |
| 8 | eqid 2763 | . . . . . 6 ⊢ (0g‘𝑅) = (0g‘𝑅) | |
| 9 | 5, 6, 7, 8 | odid 19609 | . . . . 5 ⊢ (𝑀 ∈ (Base‘𝑅) → (((od‘𝑅)‘𝑀)(.g‘𝑅)𝑀) = (0g‘𝑅)) |
| 10 | 1, 9 | syl 18 | . . . 4 ⊢ (𝜑 → (((od‘𝑅)‘𝑀)(.g‘𝑅)𝑀) = (0g‘𝑅)) |
| 11 | 4, 10 | eqtrd 2798 | . . 3 ⊢ (𝜑 → (𝐾(.g‘𝑅)𝑀) = (0g‘𝑅)) |
| 12 | 2 | ad2antrr 738 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑙 ∈ ℕ0) ∧ (𝑙(.g‘𝑅)𝑀) = (0g‘𝑅)) → ((od‘𝑅)‘𝑀) = 𝐾) |
| 13 | 12 | eqcomd 2769 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑙 ∈ ℕ0) ∧ (𝑙(.g‘𝑅)𝑀) = (0g‘𝑅)) → 𝐾 = ((od‘𝑅)‘𝑀)) |
| 14 | isprimroot2.1 | . . . . . . . . . . . 12 ⊢ (𝜑 → 𝑅 ∈ CMnd) | |
| 15 | 14 | cmnmndd 19875 | . . . . . . . . . . 11 ⊢ (𝜑 → 𝑅 ∈ Mnd) |
| 16 | 15 | adantr 485 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑙 ∈ ℕ0) → 𝑅 ∈ Mnd) |
| 17 | 1 | adantr 485 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑙 ∈ ℕ0) → 𝑀 ∈ (Base‘𝑅)) |
| 18 | simpr 489 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑙 ∈ ℕ0) → 𝑙 ∈ ℕ0) | |
| 19 | 5, 6, 7, 8 | oddvdsnn0 19615 | . . . . . . . . . 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 411 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑙 ∈ ℕ0) ∧ (𝑙(.g‘𝑅)𝑀) = (0g‘𝑅)) → ((od‘𝑅)‘𝑀) ∥ 𝑙) |
| 24 | 13, 23 | eqbrtrd 5134 | . . . . 5 ⊢ (((𝜑 ∧ 𝑙 ∈ ℕ0) ∧ (𝑙(.g‘𝑅)𝑀) = (0g‘𝑅)) → 𝐾 ∥ 𝑙) |
| 25 | 24 | ex 417 | . . . 4 ⊢ ((𝜑 ∧ 𝑙 ∈ ℕ0) → ((𝑙(.g‘𝑅)𝑀) = (0g‘𝑅) → 𝐾 ∥ 𝑙)) |
| 26 | 25 | ralrimiva 3157 | . . 3 ⊢ (𝜑 → ∀𝑙 ∈ ℕ0 ((𝑙(.g‘𝑅)𝑀) = (0g‘𝑅) → 𝐾 ∥ 𝑙)) |
| 27 | 1, 11, 26 | 3jca 1146 | . 2 ⊢ (𝜑 → (𝑀 ∈ (Base‘𝑅) ∧ (𝐾(.g‘𝑅)𝑀) = (0g‘𝑅) ∧ ∀𝑙 ∈ ℕ0 ((𝑙(.g‘𝑅)𝑀) = (0g‘𝑅) → 𝐾 ∥ 𝑙))) |
| 28 | isprimroot2.2 | . . . 4 ⊢ (𝜑 → 𝐾 ∈ ℕ) | |
| 29 | 28 | nnnn0d 12566 | . . 3 ⊢ (𝜑 → 𝐾 ∈ ℕ0) |
| 30 | 14, 29, 7 | isprimroot 42838 | . 2 ⊢ (𝜑 → (𝑀 ∈ (𝑅 PrimRoots 𝐾) ↔ (𝑀 ∈ (Base‘𝑅) ∧ (𝐾(.g‘𝑅)𝑀) = (0g‘𝑅) ∧ ∀𝑙 ∈ ℕ0 ((𝑙(.g‘𝑅)𝑀) = (0g‘𝑅) → 𝐾 ∥ 𝑙)))) |
| 31 | 27, 30 | mpbird 260 | 1 ⊢ (𝜑 → 𝑀 ∈ (𝑅 PrimRoots 𝐾)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1103 = wceq 1570 ∈ wcel 2143 ∀wral 3079 class class class wbr 5110 ‘cfv 6538 (class class class)co 7412 ℕcn 12234 ℕ0cn0 12505 ∥ cdvds 16311 Basecbs 17270 0gc0g 17493 Mndcmnd 18793 .gcmg 19134 odcod 19595 CMndccmn 19851 PrimRoots cprimroots 42836 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 ax-cnex 11157 ax-resscn 11158 ax-1cn 11159 ax-icn 11160 ax-addcl 11161 ax-addrcl 11162 ax-mulcl 11163 ax-mulrcl 11164 ax-mulcom 11165 ax-addass 11166 ax-mulass 11167 ax-distr 11168 ax-i2m1 11169 ax-1ne0 11170 ax-1rid 11171 ax-rnegex 11172 ax-rrecex 11173 ax-cnre 11174 ax-pre-lttri 11175 ax-pre-lttrn 11176 ax-pre-ltadd 11177 ax-pre-mulgt0 11178 ax-pre-sup 11179 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8279 df-wrecs 8310 df-recs 8359 df-rdg 8398 df-er 8695 df-en 8945 df-dom 8946 df-sdom 8947 df-sup 9403 df-inf 9404 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11444 df-neg 11445 df-div 11873 df-nn 12235 df-n0 12506 df-z 12593 df-uz 12864 df-rp 13018 df-fz 13537 df-fl 13827 df-mod 13905 df-seq 14040 df-dvds 16312 df-0g 17495 df-mgm 18699 df-sgrp 18778 df-mnd 18794 df-mulg 19135 df-od 19599 df-cmn 19853 df-primroots 42837 |
| This theorem is referenced by: unitscyglem5 42944 |
| Copyright terms: Public domain | W3C validator |