Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > odzcllem | GIF version |
Description: - Lemma for odzcl 12171, 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 12169 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → ((odℤ‘𝑁)‘𝐴) = inf({𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝐴↑𝑛) − 1)}, ℝ, < )) | |
2 | 1zzd 9214 | . . . 4 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → 1 ∈ ℤ) | |
3 | nnuz 9497 | . . . . 5 ⊢ ℕ = (ℤ≥‘1) | |
4 | 3 | rabeqi 2718 | . . . 4 ⊢ {𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝐴↑𝑛) − 1)} = {𝑛 ∈ (ℤ≥‘1) ∣ 𝑁 ∥ ((𝐴↑𝑛) − 1)} |
5 | oveq2 5849 | . . . . . . 7 ⊢ (𝑛 = (ϕ‘𝑁) → (𝐴↑𝑛) = (𝐴↑(ϕ‘𝑁))) | |
6 | 5 | oveq1d 5856 | . . . . . 6 ⊢ (𝑛 = (ϕ‘𝑁) → ((𝐴↑𝑛) − 1) = ((𝐴↑(ϕ‘𝑁)) − 1)) |
7 | 6 | breq2d 3993 | . . . . 5 ⊢ (𝑛 = (ϕ‘𝑁) → (𝑁 ∥ ((𝐴↑𝑛) − 1) ↔ 𝑁 ∥ ((𝐴↑(ϕ‘𝑁)) − 1))) |
8 | phicl 12143 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → (ϕ‘𝑁) ∈ ℕ) | |
9 | 8 | 3ad2ant1 1008 | . . . . 5 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → (ϕ‘𝑁) ∈ ℕ) |
10 | eulerth 12161 | . . . . . 6 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → ((𝐴↑(ϕ‘𝑁)) mod 𝑁) = (1 mod 𝑁)) | |
11 | simp1 987 | . . . . . . 7 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → 𝑁 ∈ ℕ) | |
12 | simp2 988 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → 𝐴 ∈ ℤ) | |
13 | 9 | nnnn0d 9163 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → (ϕ‘𝑁) ∈ ℕ0) |
14 | zexpcl 10466 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℤ ∧ (ϕ‘𝑁) ∈ ℕ0) → (𝐴↑(ϕ‘𝑁)) ∈ ℤ) | |
15 | 12, 13, 14 | syl2anc 409 | . . . . . . 7 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → (𝐴↑(ϕ‘𝑁)) ∈ ℤ) |
16 | 1z 9213 | . . . . . . . 8 ⊢ 1 ∈ ℤ | |
17 | moddvds 11735 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℕ ∧ (𝐴↑(ϕ‘𝑁)) ∈ ℤ ∧ 1 ∈ ℤ) → (((𝐴↑(ϕ‘𝑁)) mod 𝑁) = (1 mod 𝑁) ↔ 𝑁 ∥ ((𝐴↑(ϕ‘𝑁)) − 1))) | |
18 | 16, 17 | mp3an3 1316 | . . . . . . 7 ⊢ ((𝑁 ∈ ℕ ∧ (𝐴↑(ϕ‘𝑁)) ∈ ℤ) → (((𝐴↑(ϕ‘𝑁)) mod 𝑁) = (1 mod 𝑁) ↔ 𝑁 ∥ ((𝐴↑(ϕ‘𝑁)) − 1))) |
19 | 11, 15, 18 | syl2anc 409 | . . . . . 6 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → (((𝐴↑(ϕ‘𝑁)) mod 𝑁) = (1 mod 𝑁) ↔ 𝑁 ∥ ((𝐴↑(ϕ‘𝑁)) − 1))) |
20 | 10, 19 | mpbid 146 | . . . . 5 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → 𝑁 ∥ ((𝐴↑(ϕ‘𝑁)) − 1)) |
21 | 7, 9, 20 | elrabd 2883 | . . . 4 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → (ϕ‘𝑁) ∈ {𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝐴↑𝑛) − 1)}) |
22 | elfznn 9985 | . . . . . . . . 9 ⊢ (𝑛 ∈ (1...(ϕ‘𝑁)) → 𝑛 ∈ ℕ) | |
23 | 22 | adantl 275 | . . . . . . . 8 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) ∧ 𝑛 ∈ (1...(ϕ‘𝑁))) → 𝑛 ∈ ℕ) |
24 | 23 | nnnn0d 9163 | . . . . . . 7 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) ∧ 𝑛 ∈ (1...(ϕ‘𝑁))) → 𝑛 ∈ ℕ0) |
25 | zexpcl 10466 | . . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ 𝑛 ∈ ℕ0) → (𝐴↑𝑛) ∈ ℤ) | |
26 | 12, 24, 25 | syl2an2r 585 | . . . . . 6 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) ∧ 𝑛 ∈ (1...(ϕ‘𝑁))) → (𝐴↑𝑛) ∈ ℤ) |
27 | peano2zm 9225 | . . . . . 6 ⊢ ((𝐴↑𝑛) ∈ ℤ → ((𝐴↑𝑛) − 1) ∈ ℤ) | |
28 | 26, 27 | syl 14 | . . . . 5 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) ∧ 𝑛 ∈ (1...(ϕ‘𝑁))) → ((𝐴↑𝑛) − 1) ∈ ℤ) |
29 | dvdsdc 11734 | . . . . 5 ⊢ ((𝑁 ∈ ℕ ∧ ((𝐴↑𝑛) − 1) ∈ ℤ) → DECID 𝑁 ∥ ((𝐴↑𝑛) − 1)) | |
30 | 11, 28, 29 | syl2an2r 585 | . . . 4 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) ∧ 𝑛 ∈ (1...(ϕ‘𝑁))) → DECID 𝑁 ∥ ((𝐴↑𝑛) − 1)) |
31 | 2, 4, 21, 30 | infssuzcldc 11880 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → inf({𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝐴↑𝑛) − 1)}, ℝ, < ) ∈ {𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝐴↑𝑛) − 1)}) |
32 | 1, 31 | eqeltrd 2242 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → ((odℤ‘𝑁)‘𝐴) ∈ {𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝐴↑𝑛) − 1)}) |
33 | oveq2 5849 | . . . . 5 ⊢ (𝑛 = ((odℤ‘𝑁)‘𝐴) → (𝐴↑𝑛) = (𝐴↑((odℤ‘𝑁)‘𝐴))) | |
34 | 33 | oveq1d 5856 | . . . 4 ⊢ (𝑛 = ((odℤ‘𝑁)‘𝐴) → ((𝐴↑𝑛) − 1) = ((𝐴↑((odℤ‘𝑁)‘𝐴)) − 1)) |
35 | 34 | breq2d 3993 | . . 3 ⊢ (𝑛 = ((odℤ‘𝑁)‘𝐴) → (𝑁 ∥ ((𝐴↑𝑛) − 1) ↔ 𝑁 ∥ ((𝐴↑((odℤ‘𝑁)‘𝐴)) − 1))) |
36 | 35 | elrab 2881 | . 2 ⊢ (((odℤ‘𝑁)‘𝐴) ∈ {𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝐴↑𝑛) − 1)} ↔ (((odℤ‘𝑁)‘𝐴) ∈ ℕ ∧ 𝑁 ∥ ((𝐴↑((odℤ‘𝑁)‘𝐴)) − 1))) |
37 | 32, 36 | sylib 121 | 1 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → (((odℤ‘𝑁)‘𝐴) ∈ ℕ ∧ 𝑁 ∥ ((𝐴↑((odℤ‘𝑁)‘𝐴)) − 1))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 DECID wdc 824 ∧ w3a 968 = wceq 1343 ∈ wcel 2136 {crab 2447 class class class wbr 3981 ‘cfv 5187 (class class class)co 5841 infcinf 6944 ℝcr 7748 1c1 7750 < clt 7929 − cmin 8065 ℕcn 8853 ℕ0cn0 9110 ℤcz 9187 ℤ≥cuz 9462 ...cfz 9940 mod cmo 10253 ↑cexp 10450 ∥ cdvds 11723 gcd cgcd 11871 odℤcodz 12136 ϕcphi 12137 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-13 2138 ax-14 2139 ax-ext 2147 ax-coll 4096 ax-sep 4099 ax-nul 4107 ax-pow 4152 ax-pr 4186 ax-un 4410 ax-setind 4513 ax-iinf 4564 ax-cnex 7840 ax-resscn 7841 ax-1cn 7842 ax-1re 7843 ax-icn 7844 ax-addcl 7845 ax-addrcl 7846 ax-mulcl 7847 ax-mulrcl 7848 ax-addcom 7849 ax-mulcom 7850 ax-addass 7851 ax-mulass 7852 ax-distr 7853 ax-i2m1 7854 ax-0lt1 7855 ax-1rid 7856 ax-0id 7857 ax-rnegex 7858 ax-precex 7859 ax-cnre 7860 ax-pre-ltirr 7861 ax-pre-ltwlin 7862 ax-pre-lttrn 7863 ax-pre-apti 7864 ax-pre-ltadd 7865 ax-pre-mulgt0 7866 ax-pre-mulext 7867 ax-arch 7868 ax-caucvg 7869 |
This theorem depends on definitions: df-bi 116 df-stab 821 df-dc 825 df-3or 969 df-3an 970 df-tru 1346 df-fal 1349 df-nf 1449 df-sb 1751 df-eu 2017 df-mo 2018 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2296 df-ne 2336 df-nel 2431 df-ral 2448 df-rex 2449 df-reu 2450 df-rmo 2451 df-rab 2452 df-v 2727 df-sbc 2951 df-csb 3045 df-dif 3117 df-un 3119 df-in 3121 df-ss 3128 df-nul 3409 df-if 3520 df-pw 3560 df-sn 3581 df-pr 3582 df-op 3584 df-uni 3789 df-int 3824 df-iun 3867 df-br 3982 df-opab 4043 df-mpt 4044 df-tr 4080 df-id 4270 df-po 4273 df-iso 4274 df-iord 4343 df-on 4345 df-ilim 4346 df-suc 4348 df-iom 4567 df-xp 4609 df-rel 4610 df-cnv 4611 df-co 4612 df-dm 4613 df-rn 4614 df-res 4615 df-ima 4616 df-iota 5152 df-fun 5189 df-fn 5190 df-f 5191 df-f1 5192 df-fo 5193 df-f1o 5194 df-fv 5195 df-isom 5196 df-riota 5797 df-ov 5844 df-oprab 5845 df-mpo 5846 df-1st 6105 df-2nd 6106 df-recs 6269 df-irdg 6334 df-frec 6355 df-1o 6380 df-oadd 6384 df-er 6497 df-en 6703 df-dom 6704 df-fin 6705 df-sup 6945 df-inf 6946 df-pnf 7931 df-mnf 7932 df-xr 7933 df-ltxr 7934 df-le 7935 df-sub 8067 df-neg 8068 df-reap 8469 df-ap 8476 df-div 8565 df-inn 8854 df-2 8912 df-3 8913 df-4 8914 df-n0 9111 df-z 9188 df-uz 9463 df-q 9554 df-rp 9586 df-fz 9941 df-fzo 10074 df-fl 10201 df-mod 10254 df-seqfrec 10377 df-exp 10451 df-ihash 10685 df-cj 10780 df-re 10781 df-im 10782 df-rsqrt 10936 df-abs 10937 df-clim 11216 df-proddc 11488 df-dvds 11724 df-gcd 11872 df-odz 12138 df-phi 12139 |
This theorem is referenced by: odzcl 12171 odzid 12172 |
Copyright terms: Public domain | W3C validator |