odzcllem - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > odzcllem		GIF version

Theorem odzcllem 13021

Description: - Lemma for odzcl 13022, showing existence of a recurrent point for the exponential. (Contributed by Mario Carneiro, 28-Feb-2014.) (Proof shortened by AV, 26-Sep-2020.)

**Assertion**
Ref	Expression
odzcllem	⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → (((od_ℤ‘𝑁)‘𝐴) ∈ ℕ ∧ 𝑁 ∥ ((𝐴↑((od_ℤ‘𝑁)‘𝐴)) − 1)))

Proof of Theorem odzcllem Dummy variable 𝑛 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		odzval 13020	. . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → ((od_ℤ‘𝑁)‘𝐴) = inf({𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝐴↑𝑛) − 1)}, ℝ, < ))
2		1zzd 9671	. . . 4 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → 1 ∈ ℤ)
3		nnuz 9958	. . . . 5 ⊢ ℕ = (ℤ_≥‘1)
4	3	rabeqi 2814	. . . 4 ⊢ {𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝐴↑𝑛) − 1)} = {𝑛 ∈ (ℤ_≥‘1) ∣ 𝑁 ∥ ((𝐴↑𝑛) − 1)}
5		oveq2 6093	. . . . . . 7 ⊢ (𝑛 = (ϕ‘𝑁) → (𝐴↑𝑛) = (𝐴↑(ϕ‘𝑁)))
6	5	oveq1d 6100	. . . . . 6 ⊢ (𝑛 = (ϕ‘𝑁) → ((𝐴↑𝑛) − 1) = ((𝐴↑(ϕ‘𝑁)) − 1))
7	6	breq2d 4142	. . . . 5 ⊢ (𝑛 = (ϕ‘𝑁) → (𝑁 ∥ ((𝐴↑𝑛) − 1) ↔ 𝑁 ∥ ((𝐴↑(ϕ‘𝑁)) − 1)))
8		phicl 12993	. . . . . 6 ⊢ (𝑁 ∈ ℕ → (ϕ‘𝑁) ∈ ℕ)
9	8	3ad2ant1 1049	. . . . 5 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → (ϕ‘𝑁) ∈ ℕ)
10		eulerth 13011	. . . . . 6 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → ((𝐴↑(ϕ‘𝑁)) mod 𝑁) = (1 mod 𝑁))
11		simp1 1028	. . . . . . 7 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → 𝑁 ∈ ℕ)
12		simp2 1029	. . . . . . . 8 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → 𝐴 ∈ ℤ)
13	9	nnnn0d 9620	. . . . . . . 8 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → (ϕ‘𝑁) ∈ ℕ₀)
14		zexpcl 10991	. . . . . . . 8 ⊢ ((𝐴 ∈ ℤ ∧ (ϕ‘𝑁) ∈ ℕ₀) → (𝐴↑(ϕ‘𝑁)) ∈ ℤ)
15	12, 13, 14	syl2anc 415	. . . . . . 7 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → (𝐴↑(ϕ‘𝑁)) ∈ ℤ)
16		1z 9670	. . . . . . . 8 ⊢ 1 ∈ ℤ
17		moddvds 12566	. . . . . . . 8 ⊢ ((𝑁 ∈ ℕ ∧ (𝐴↑(ϕ‘𝑁)) ∈ ℤ ∧ 1 ∈ ℤ) → (((𝐴↑(ϕ‘𝑁)) mod 𝑁) = (1 mod 𝑁) ↔ 𝑁 ∥ ((𝐴↑(ϕ‘𝑁)) − 1)))
18	16, 17	mp3an3 1367	. . . . . . 7 ⊢ ((𝑁 ∈ ℕ ∧ (𝐴↑(ϕ‘𝑁)) ∈ ℤ) → (((𝐴↑(ϕ‘𝑁)) mod 𝑁) = (1 mod 𝑁) ↔ 𝑁 ∥ ((𝐴↑(ϕ‘𝑁)) − 1)))
19	11, 15, 18	syl2anc 415	. . . . . 6 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → (((𝐴↑(ϕ‘𝑁)) mod 𝑁) = (1 mod 𝑁) ↔ 𝑁 ∥ ((𝐴↑(ϕ‘𝑁)) − 1)))
20	10, 19	mpbid 147	. . . . 5 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → 𝑁 ∥ ((𝐴↑(ϕ‘𝑁)) − 1))
21	7, 9, 20	elrabd 2984	. . . 4 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → (ϕ‘𝑁) ∈ {𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝐴↑𝑛) − 1)})
22		elfznn 10460	. . . . . . . . 9 ⊢ (𝑛 ∈ (1...(ϕ‘𝑁)) → 𝑛 ∈ ℕ)
23	22	adantl 277	. . . . . . . 8 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) ∧ 𝑛 ∈ (1...(ϕ‘𝑁))) → 𝑛 ∈ ℕ)
24	23	nnnn0d 9620	. . . . . . 7 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) ∧ 𝑛 ∈ (1...(ϕ‘𝑁))) → 𝑛 ∈ ℕ₀)
25		zexpcl 10991	. . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ 𝑛 ∈ ℕ₀) → (𝐴↑𝑛) ∈ ℤ)
26	12, 24, 25	syl2an2r 603	. . . . . 6 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) ∧ 𝑛 ∈ (1...(ϕ‘𝑁))) → (𝐴↑𝑛) ∈ ℤ)
27		peano2zm 9682	. . . . . 6 ⊢ ((𝐴↑𝑛) ∈ ℤ → ((𝐴↑𝑛) − 1) ∈ ℤ)
28	26, 27	syl 14	. . . . 5 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) ∧ 𝑛 ∈ (1...(ϕ‘𝑁))) → ((𝐴↑𝑛) − 1) ∈ ℤ)
29		dvdsdc 12565	. . . . 5 ⊢ ((𝑁 ∈ ℕ ∧ ((𝐴↑𝑛) − 1) ∈ ℤ) → DECID 𝑁 ∥ ((𝐴↑𝑛) − 1))
30	11, 28, 29	syl2an2r 603	. . . 4 ⊢ (((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) ∧ 𝑛 ∈ (1...(ϕ‘𝑁))) → DECID 𝑁 ∥ ((𝐴↑𝑛) − 1))
31	2, 4, 21, 30	infssuzcldc 10668	. . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → inf({𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝐴↑𝑛) − 1)}, ℝ, < ) ∈ {𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝐴↑𝑛) − 1)})
32	1, 31	eqeltrd 2315	. 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → ((od_ℤ‘𝑁)‘𝐴) ∈ {𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝐴↑𝑛) − 1)})
33		oveq2 6093	. . . . 5 ⊢ (𝑛 = ((od_ℤ‘𝑁)‘𝐴) → (𝐴↑𝑛) = (𝐴↑((od_ℤ‘𝑁)‘𝐴)))
34	33	oveq1d 6100	. . . 4 ⊢ (𝑛 = ((od_ℤ‘𝑁)‘𝐴) → ((𝐴↑𝑛) − 1) = ((𝐴↑((od_ℤ‘𝑁)‘𝐴)) − 1))
35	34	breq2d 4142	. . 3 ⊢ (𝑛 = ((od_ℤ‘𝑁)‘𝐴) → (𝑁 ∥ ((𝐴↑𝑛) − 1) ↔ 𝑁 ∥ ((𝐴↑((od_ℤ‘𝑁)‘𝐴)) − 1)))
36	35	elrab 2982	. 2 ⊢ (((od_ℤ‘𝑁)‘𝐴) ∈ {𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝐴↑𝑛) − 1)} ↔ (((od_ℤ‘𝑁)‘𝐴) ∈ ℕ ∧ 𝑁 ∥ ((𝐴↑((od_ℤ‘𝑁)‘𝐴)) − 1)))
37	32, 36	sylib 122	1 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → (((od_ℤ‘𝑁)‘𝐴) ∈ ℕ ∧ 𝑁 ∥ ((𝐴↑((od_ℤ‘𝑁)‘𝐴)) − 1)))

Colors of variables: wff set class

This proof depends on syntax axioms: → wi 4 ∧ wa 104 ↔ wb 105 DECID wdc 846 ∧ w3a 1009 = wceq 1402 ∈ wcel 2209 {crab 2532 class class class wbr 4130 ‘cfv 5377 (class class class)co 6085 infcinf 7323 ℝcr 8178 1c1 8180 < clt 8360 − cmin 8497 ℕcn 9304 ℕ₀cn0 9563 ℤcz 9644 ℤ_≥cuz 9921 ...cfz 10411 mod cmo 10759 ↑cexp 10975 ∥ cdvds 12554 gcd cgcd 12730 od_ℤcodz 12986 ϕcphi 12987

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4246 ax-sep 4249 ax-nul 4259 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-iinf 4735 ax-cnex 8270 ax-resscn 8271 ax-1cn 8272 ax-1re 8273 ax-icn 8274 ax-addcl 8275 ax-addrcl 8276 ax-mulcl 8277 ax-mulrcl 8278 ax-addcom 8279 ax-mulcom 8280 ax-addass 8281 ax-mulass 8282 ax-distr 8283 ax-i2m1 8284 ax-0lt1 8285 ax-1rid 8286 ax-0id 8287 ax-rnegex 8288 ax-precex 8289 ax-cnre 8290 ax-pre-ltirr 8291 ax-pre-ltwlin 8292 ax-pre-lttrn 8293 ax-pre-apti 8294 ax-pre-ltadd 8295 ax-pre-mulgt0 8296 ax-pre-mulext 8297 ax-arch 8298 ax-caucvg 8299

This proof depends on definitions: df-bi 117 df-stab 843 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3639 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 df-tr 4230 df-id 4438 df-po 4441 df-iso 4442 df-iord 4511 df-on 4513 df-ilim 4514 df-suc 4516 df-iom 4738 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-isom 5386 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-1st 6374 df-2nd 6375 df-recs 6576 df-irdg 6641 df-frec 6662 df-1o 6687 df-oadd 6691 df-er 6807 df-en 7023 df-dom 7024 df-fin 7025 df-sup 7324 df-inf 7325 df-pnf 8362 df-mnf 8363 df-xr 8364 df-ltxr 8365 df-le 8366 df-sub 8499 df-neg 8500 df-reap 8903 df-ap 8910 df-div 9003 df-inn 9305 df-2 9363 df-3 9364 df-4 9365 df-n0 9564 df-z 9645 df-uz 9922 df-q 10020 df-rp 10055 df-fz 10412 df-fzo 10550 df-fl 10705 df-mod 10760 df-seqfrec 10885 df-exp 10976 df-ihash 11215 df-cj 11607 df-re 11608 df-im 11609 df-rsqrt 11764 df-abs 11765 df-clim 12045 df-proddc 12318 df-dvds 12555 df-gcd 12731 df-odz 12988 df-phi 12989

This theorem is used by: odzcl 13022 odzid 13023

W3C validator