![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > odzcllem | Structured version Visualization version GIF version |
Description: - Lemma for odzcl 15959, showing existence of a recurrent point for the exponential. (Contributed by Mario Carneiro, 28-Feb-2014.) (Proof shortened by AV, 26-Sep-2020.) |
Ref | Expression |
---|---|
odzcllem | ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → (((odℤ‘𝑁)‘𝐴) ∈ ℕ ∧ 𝑁 ∥ ((𝐴↑((odℤ‘𝑁)‘𝐴)) − 1))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | odzval 15957 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → ((odℤ‘𝑁)‘𝐴) = inf({𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝐴↑𝑛) − 1)}, ℝ, < )) | |
2 | ssrab2 3979 | . . . . 5 ⊢ {𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝐴↑𝑛) − 1)} ⊆ ℕ | |
3 | nnuz 12130 | . . . . 5 ⊢ ℕ = (ℤ≥‘1) | |
4 | 2, 3 | sseqtri 3926 | . . . 4 ⊢ {𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝐴↑𝑛) − 1)} ⊆ (ℤ≥‘1) |
5 | phicl 15935 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ → (ϕ‘𝑁) ∈ ℕ) | |
6 | 5 | 3ad2ant1 1126 | . . . . . 6 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → (ϕ‘𝑁) ∈ ℕ) |
7 | eulerth 15949 | . . . . . . 7 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → ((𝐴↑(ϕ‘𝑁)) mod 𝑁) = (1 mod 𝑁)) | |
8 | simp1 1129 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → 𝑁 ∈ ℕ) | |
9 | simp2 1130 | . . . . . . . . 9 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → 𝐴 ∈ ℤ) | |
10 | 6 | nnnn0d 11805 | . . . . . . . . 9 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → (ϕ‘𝑁) ∈ ℕ0) |
11 | zexpcl 13294 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℤ ∧ (ϕ‘𝑁) ∈ ℕ0) → (𝐴↑(ϕ‘𝑁)) ∈ ℤ) | |
12 | 9, 10, 11 | syl2anc 584 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → (𝐴↑(ϕ‘𝑁)) ∈ ℤ) |
13 | 1z 11862 | . . . . . . . . 9 ⊢ 1 ∈ ℤ | |
14 | moddvds 15451 | . . . . . . . . 9 ⊢ ((𝑁 ∈ ℕ ∧ (𝐴↑(ϕ‘𝑁)) ∈ ℤ ∧ 1 ∈ ℤ) → (((𝐴↑(ϕ‘𝑁)) mod 𝑁) = (1 mod 𝑁) ↔ 𝑁 ∥ ((𝐴↑(ϕ‘𝑁)) − 1))) | |
15 | 13, 14 | mp3an3 1442 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℕ ∧ (𝐴↑(ϕ‘𝑁)) ∈ ℤ) → (((𝐴↑(ϕ‘𝑁)) mod 𝑁) = (1 mod 𝑁) ↔ 𝑁 ∥ ((𝐴↑(ϕ‘𝑁)) − 1))) |
16 | 8, 12, 15 | syl2anc 584 | . . . . . . 7 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → (((𝐴↑(ϕ‘𝑁)) mod 𝑁) = (1 mod 𝑁) ↔ 𝑁 ∥ ((𝐴↑(ϕ‘𝑁)) − 1))) |
17 | 7, 16 | mpbid 233 | . . . . . 6 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → 𝑁 ∥ ((𝐴↑(ϕ‘𝑁)) − 1)) |
18 | oveq2 7027 | . . . . . . . . 9 ⊢ (𝑛 = (ϕ‘𝑁) → (𝐴↑𝑛) = (𝐴↑(ϕ‘𝑁))) | |
19 | 18 | oveq1d 7034 | . . . . . . . 8 ⊢ (𝑛 = (ϕ‘𝑁) → ((𝐴↑𝑛) − 1) = ((𝐴↑(ϕ‘𝑁)) − 1)) |
20 | 19 | breq2d 4976 | . . . . . . 7 ⊢ (𝑛 = (ϕ‘𝑁) → (𝑁 ∥ ((𝐴↑𝑛) − 1) ↔ 𝑁 ∥ ((𝐴↑(ϕ‘𝑁)) − 1))) |
21 | 20 | rspcev 3557 | . . . . . 6 ⊢ (((ϕ‘𝑁) ∈ ℕ ∧ 𝑁 ∥ ((𝐴↑(ϕ‘𝑁)) − 1)) → ∃𝑛 ∈ ℕ 𝑁 ∥ ((𝐴↑𝑛) − 1)) |
22 | 6, 17, 21 | syl2anc 584 | . . . . 5 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → ∃𝑛 ∈ ℕ 𝑁 ∥ ((𝐴↑𝑛) − 1)) |
23 | rabn0 4261 | . . . . 5 ⊢ ({𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝐴↑𝑛) − 1)} ≠ ∅ ↔ ∃𝑛 ∈ ℕ 𝑁 ∥ ((𝐴↑𝑛) − 1)) | |
24 | 22, 23 | sylibr 235 | . . . 4 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → {𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝐴↑𝑛) − 1)} ≠ ∅) |
25 | infssuzcl 12181 | . . . 4 ⊢ (({𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝐴↑𝑛) − 1)} ⊆ (ℤ≥‘1) ∧ {𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝐴↑𝑛) − 1)} ≠ ∅) → inf({𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝐴↑𝑛) − 1)}, ℝ, < ) ∈ {𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝐴↑𝑛) − 1)}) | |
26 | 4, 24, 25 | sylancr 587 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → inf({𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝐴↑𝑛) − 1)}, ℝ, < ) ∈ {𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝐴↑𝑛) − 1)}) |
27 | 1, 26 | eqeltrd 2882 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → ((odℤ‘𝑁)‘𝐴) ∈ {𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝐴↑𝑛) − 1)}) |
28 | oveq2 7027 | . . . . 5 ⊢ (𝑛 = ((odℤ‘𝑁)‘𝐴) → (𝐴↑𝑛) = (𝐴↑((odℤ‘𝑁)‘𝐴))) | |
29 | 28 | oveq1d 7034 | . . . 4 ⊢ (𝑛 = ((odℤ‘𝑁)‘𝐴) → ((𝐴↑𝑛) − 1) = ((𝐴↑((odℤ‘𝑁)‘𝐴)) − 1)) |
30 | 29 | breq2d 4976 | . . 3 ⊢ (𝑛 = ((odℤ‘𝑁)‘𝐴) → (𝑁 ∥ ((𝐴↑𝑛) − 1) ↔ 𝑁 ∥ ((𝐴↑((odℤ‘𝑁)‘𝐴)) − 1))) |
31 | 30 | elrab 3617 | . 2 ⊢ (((odℤ‘𝑁)‘𝐴) ∈ {𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝐴↑𝑛) − 1)} ↔ (((odℤ‘𝑁)‘𝐴) ∈ ℕ ∧ 𝑁 ∥ ((𝐴↑((odℤ‘𝑁)‘𝐴)) − 1))) |
32 | 27, 31 | sylib 219 | 1 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → (((odℤ‘𝑁)‘𝐴) ∈ ℕ ∧ 𝑁 ∥ ((𝐴↑((odℤ‘𝑁)‘𝐴)) − 1))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 ∧ w3a 1080 = wceq 1522 ∈ wcel 2080 ≠ wne 2983 ∃wrex 3105 {crab 3108 ⊆ wss 3861 ∅c0 4213 class class class wbr 4964 ‘cfv 6228 (class class class)co 7019 infcinf 8754 ℝcr 10385 1c1 10387 < clt 10524 − cmin 10719 ℕcn 11488 ℕ0cn0 11747 ℤcz 11831 ℤ≥cuz 12093 mod cmo 13087 ↑cexp 13279 ∥ cdvds 15440 gcd cgcd 15676 odℤcodz 15929 ϕcphi 15930 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1778 ax-4 1792 ax-5 1889 ax-6 1948 ax-7 1993 ax-8 2082 ax-9 2090 ax-10 2111 ax-11 2125 ax-12 2140 ax-13 2343 ax-ext 2768 ax-rep 5084 ax-sep 5097 ax-nul 5104 ax-pow 5160 ax-pr 5224 ax-un 7322 ax-cnex 10442 ax-resscn 10443 ax-1cn 10444 ax-icn 10445 ax-addcl 10446 ax-addrcl 10447 ax-mulcl 10448 ax-mulrcl 10449 ax-mulcom 10450 ax-addass 10451 ax-mulass 10452 ax-distr 10453 ax-i2m1 10454 ax-1ne0 10455 ax-1rid 10456 ax-rnegex 10457 ax-rrecex 10458 ax-cnre 10459 ax-pre-lttri 10460 ax-pre-lttrn 10461 ax-pre-ltadd 10462 ax-pre-mulgt0 10463 ax-pre-sup 10464 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 843 df-3or 1081 df-3an 1082 df-tru 1525 df-ex 1763 df-nf 1767 df-sb 2042 df-mo 2575 df-eu 2611 df-clab 2775 df-cleq 2787 df-clel 2862 df-nfc 2934 df-ne 2984 df-nel 3090 df-ral 3109 df-rex 3110 df-reu 3111 df-rmo 3112 df-rab 3113 df-v 3438 df-sbc 3708 df-csb 3814 df-dif 3864 df-un 3866 df-in 3868 df-ss 3876 df-pss 3878 df-nul 4214 df-if 4384 df-pw 4457 df-sn 4475 df-pr 4477 df-tp 4479 df-op 4481 df-uni 4748 df-int 4785 df-iun 4829 df-br 4965 df-opab 5027 df-mpt 5044 df-tr 5067 df-id 5351 df-eprel 5356 df-po 5365 df-so 5366 df-fr 5405 df-we 5407 df-xp 5452 df-rel 5453 df-cnv 5454 df-co 5455 df-dm 5456 df-rn 5457 df-res 5458 df-ima 5459 df-pred 6026 df-ord 6072 df-on 6073 df-lim 6074 df-suc 6075 df-iota 6192 df-fun 6230 df-fn 6231 df-f 6232 df-f1 6233 df-fo 6234 df-f1o 6235 df-fv 6236 df-riota 6980 df-ov 7022 df-oprab 7023 df-mpo 7024 df-om 7440 df-1st 7548 df-2nd 7549 df-wrecs 7801 df-recs 7863 df-rdg 7901 df-1o 7956 df-oadd 7960 df-er 8142 df-map 8261 df-en 8361 df-dom 8362 df-sdom 8363 df-fin 8364 df-sup 8755 df-inf 8756 df-card 9217 df-pnf 10526 df-mnf 10527 df-xr 10528 df-ltxr 10529 df-le 10530 df-sub 10721 df-neg 10722 df-div 11148 df-nn 11489 df-2 11550 df-3 11551 df-n0 11748 df-xnn0 11818 df-z 11832 df-uz 12094 df-rp 12240 df-fz 12743 df-fzo 12884 df-fl 13012 df-mod 13088 df-seq 13220 df-exp 13280 df-hash 13541 df-cj 14292 df-re 14293 df-im 14294 df-sqrt 14428 df-abs 14429 df-dvds 15441 df-gcd 15677 df-odz 15931 df-phi 15932 |
This theorem is referenced by: odzcl 15959 odzid 15960 |
Copyright terms: Public domain | W3C validator |