| 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 7373 | . . . 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 19467 | . . . . 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 726 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑙 ∈ ℕ0) ∧ (𝑙(.g‘𝑅)𝑀) = (0g‘𝑅)) → ((od‘𝑅)‘𝑀) = 𝐾) |
| 13 | 12 | eqcomd 2742 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑙 ∈ ℕ0) ∧ (𝑙(.g‘𝑅)𝑀) = (0g‘𝑅)) → 𝐾 = ((od‘𝑅)‘𝑀)) |
| 14 | isprimroot2.1 | . . . . . . . . . . . 12 ⊢ (𝜑 → 𝑅 ∈ CMnd) | |
| 15 | 14 | cmnmndd 19733 | . . . . . . . . . . 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 19473 | . . . . . . . . . 10 ⊢ ((𝑅 ∈ Mnd ∧ 𝑀 ∈ (Base‘𝑅) ∧ 𝑙 ∈ ℕ0) → (((od‘𝑅)‘𝑀) ∥ 𝑙 ↔ (𝑙(.g‘𝑅)𝑀) = (0g‘𝑅))) |
| 20 | 16, 17, 18, 19 | syl3anc 1373 | . . . . . . . . 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 5120 | . . . . 5 ⊢ (((𝜑 ∧ 𝑙 ∈ ℕ0) ∧ (𝑙(.g‘𝑅)𝑀) = (0g‘𝑅)) → 𝐾 ∥ 𝑙) |
| 25 | 24 | ex 412 | . . . 4 ⊢ ((𝜑 ∧ 𝑙 ∈ ℕ0) → ((𝑙(.g‘𝑅)𝑀) = (0g‘𝑅) → 𝐾 ∥ 𝑙)) |
| 26 | 25 | ralrimiva 3128 | . . 3 ⊢ (𝜑 → ∀𝑙 ∈ ℕ0 ((𝑙(.g‘𝑅)𝑀) = (0g‘𝑅) → 𝐾 ∥ 𝑙)) |
| 27 | 1, 11, 26 | 3jca 1128 | . 2 ⊢ (𝜑 → (𝑀 ∈ (Base‘𝑅) ∧ (𝐾(.g‘𝑅)𝑀) = (0g‘𝑅) ∧ ∀𝑙 ∈ ℕ0 ((𝑙(.g‘𝑅)𝑀) = (0g‘𝑅) → 𝐾 ∥ 𝑙))) |
| 28 | isprimroot2.2 | . . . 4 ⊢ (𝜑 → 𝐾 ∈ ℕ) | |
| 29 | 28 | nnnn0d 12462 | . . 3 ⊢ (𝜑 → 𝐾 ∈ ℕ0) |
| 30 | 14, 29, 7 | isprimroot 42343 | . 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 1086 = wceq 1541 ∈ wcel 2113 ∀wral 3051 class class class wbr 5098 ‘cfv 6492 (class class class)co 7358 ℕcn 12145 ℕ0cn0 12401 ∥ cdvds 16179 Basecbs 17136 0gc0g 17359 Mndcmnd 18659 .gcmg 18997 odcod 19453 CMndccmn 19709 PrimRoots cprimroots 42341 |
| 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-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 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-iun 4948 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-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-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-er 8635 df-en 8884 df-dom 8885 df-sdom 8886 df-sup 9345 df-inf 9346 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-n0 12402 df-z 12489 df-uz 12752 df-rp 12906 df-fz 13424 df-fl 13712 df-mod 13790 df-seq 13925 df-dvds 16180 df-0g 17361 df-mgm 18565 df-sgrp 18644 df-mnd 18660 df-mulg 18998 df-od 19457 df-cmn 19711 df-primroots 42342 |
| This theorem is referenced by: unitscyglem5 42449 |
| Copyright terms: Public domain | W3C validator |