Theorem odzval 16724

Description: Value of the order function. This is a function of functions; the inner argument selects the base (i.e., mod 𝑁 for some 𝑁, often prime) and the outer argument selects the integer or equivalence class (if you want to think about it that way) from the integers mod 𝑁. In order to ensure the supremum is well-defined, we only define the expression when 𝐴 and 𝑁 are coprime. (Contributed by Mario Carneiro, 23-Feb-2014.) (Revised by AV, 26-Sep-2020.)

Assertion

Ref	Expression
odzval	⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → ((odℤ‘𝑁)‘𝐴) = inf({𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝐴↑𝑛) − 1)}, ℝ, < ))

Distinct variable groups:   𝑛,𝑁   𝐴,𝑛

Proof of Theorem odzval

Dummy variables 𝑚 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		oveq2 7417	. . . . . . . . 9 ⊢ (𝑚 = 𝑁 → (𝑥 gcd 𝑚) = (𝑥 gcd 𝑁))
2	1	eqeq1d 2735	. . . . . . . 8 ⊢ (𝑚 = 𝑁 → ((𝑥 gcd 𝑚) = 1 ↔ (𝑥 gcd 𝑁) = 1))
3	2	rabbidv 3441	. . . . . . 7 ⊢ (𝑚 = 𝑁 → {𝑥 ∈ ℤ ∣ (𝑥 gcd 𝑚) = 1} = {𝑥 ∈ ℤ ∣ (𝑥 gcd 𝑁) = 1})
4		oveq1 7416	. . . . . . . . 9 ⊢ (𝑛 = 𝑥 → (𝑛 gcd 𝑁) = (𝑥 gcd 𝑁))
5	4	eqeq1d 2735	. . . . . . . 8 ⊢ (𝑛 = 𝑥 → ((𝑛 gcd 𝑁) = 1 ↔ (𝑥 gcd 𝑁) = 1))
6	5	cbvrabv 3443	. . . . . . 7 ⊢ {𝑛 ∈ ℤ ∣ (𝑛 gcd 𝑁) = 1} = {𝑥 ∈ ℤ ∣ (𝑥 gcd 𝑁) = 1}
7	3, 6	eqtr4di 2791	. . . . . 6 ⊢ (𝑚 = 𝑁 → {𝑥 ∈ ℤ ∣ (𝑥 gcd 𝑚) = 1} = {𝑛 ∈ ℤ ∣ (𝑛 gcd 𝑁) = 1})
8		breq1 5152	. . . . . . . 8 ⊢ (𝑚 = 𝑁 → (𝑚 ∥ ((𝑥↑𝑛) − 1) ↔ 𝑁 ∥ ((𝑥↑𝑛) − 1)))
9	8	rabbidv 3441	. . . . . . 7 ⊢ (𝑚 = 𝑁 → {𝑛 ∈ ℕ ∣ 𝑚 ∥ ((𝑥↑𝑛) − 1)} = {𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝑥↑𝑛) − 1)})
10	9	infeq1d 9472	. . . . . 6 ⊢ (𝑚 = 𝑁 → inf({𝑛 ∈ ℕ ∣ 𝑚 ∥ ((𝑥↑𝑛) − 1)}, ℝ, < ) = inf({𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝑥↑𝑛) − 1)}, ℝ, < ))
11	7, 10	mpteq12dv 5240	. . . . 5 ⊢ (𝑚 = 𝑁 → (𝑥 ∈ {𝑥 ∈ ℤ ∣ (𝑥 gcd 𝑚) = 1} ↦ inf({𝑛 ∈ ℕ ∣ 𝑚 ∥ ((𝑥↑𝑛) − 1)}, ℝ, < )) = (𝑥 ∈ {𝑛 ∈ ℤ ∣ (𝑛 gcd 𝑁) = 1} ↦ inf({𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝑥↑𝑛) − 1)}, ℝ, < )))
12		df-odz 16698	. . . . 5 ⊢ odℤ = (𝑚 ∈ ℕ ↦ (𝑥 ∈ {𝑥 ∈ ℤ ∣ (𝑥 gcd 𝑚) = 1} ↦ inf({𝑛 ∈ ℕ ∣ 𝑚 ∥ ((𝑥↑𝑛) − 1)}, ℝ, < )))
13		zex 12567	. . . . . 6 ⊢ ℤ ∈ V
14	13	mptrabex 7227	. . . . 5 ⊢ (𝑥 ∈ {𝑛 ∈ ℤ ∣ (𝑛 gcd 𝑁) = 1} ↦ inf({𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝑥↑𝑛) − 1)}, ℝ, < )) ∈ V
15	11, 12, 14	fvmpt 6999	. . . 4 ⊢ (𝑁 ∈ ℕ → (odℤ‘𝑁) = (𝑥 ∈ {𝑛 ∈ ℤ ∣ (𝑛 gcd 𝑁) = 1} ↦ inf({𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝑥↑𝑛) − 1)}, ℝ, < )))
16	15	fveq1d 6894	. . 3 ⊢ (𝑁 ∈ ℕ → ((odℤ‘𝑁)‘𝐴) = ((𝑥 ∈ {𝑛 ∈ ℤ ∣ (𝑛 gcd 𝑁) = 1} ↦ inf({𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝑥↑𝑛) − 1)}, ℝ, < ))‘𝐴))
17		oveq1 7416	. . . . . 6 ⊢ (𝑛 = 𝐴 → (𝑛 gcd 𝑁) = (𝐴 gcd 𝑁))
18	17	eqeq1d 2735	. . . . 5 ⊢ (𝑛 = 𝐴 → ((𝑛 gcd 𝑁) = 1 ↔ (𝐴 gcd 𝑁) = 1))
19	18	elrab 3684	. . . 4 ⊢ (𝐴 ∈ {𝑛 ∈ ℤ ∣ (𝑛 gcd 𝑁) = 1} ↔ (𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1))
20		oveq1 7416	. . . . . . . . 9 ⊢ (𝑥 = 𝐴 → (𝑥↑𝑛) = (𝐴↑𝑛))
21	20	oveq1d 7424	. . . . . . . 8 ⊢ (𝑥 = 𝐴 → ((𝑥↑𝑛) − 1) = ((𝐴↑𝑛) − 1))
22	21	breq2d 5161	. . . . . . 7 ⊢ (𝑥 = 𝐴 → (𝑁 ∥ ((𝑥↑𝑛) − 1) ↔ 𝑁 ∥ ((𝐴↑𝑛) − 1)))
23	22	rabbidv 3441	. . . . . 6 ⊢ (𝑥 = 𝐴 → {𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝑥↑𝑛) − 1)} = {𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝐴↑𝑛) − 1)})
24	23	infeq1d 9472	. . . . 5 ⊢ (𝑥 = 𝐴 → inf({𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝑥↑𝑛) − 1)}, ℝ, < ) = inf({𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝐴↑𝑛) − 1)}, ℝ, < ))
25		eqid 2733	. . . . 5 ⊢ (𝑥 ∈ {𝑛 ∈ ℤ ∣ (𝑛 gcd 𝑁) = 1} ↦ inf({𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝑥↑𝑛) − 1)}, ℝ, < )) = (𝑥 ∈ {𝑛 ∈ ℤ ∣ (𝑛 gcd 𝑁) = 1} ↦ inf({𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝑥↑𝑛) − 1)}, ℝ, < ))
26		ltso 11294	. . . . . 6 ⊢ < Or ℝ
27	26	infex 9488	. . . . 5 ⊢ inf({𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝐴↑𝑛) − 1)}, ℝ, < ) ∈ V
28	24, 25, 27	fvmpt 6999	. . . 4 ⊢ (𝐴 ∈ {𝑛 ∈ ℤ ∣ (𝑛 gcd 𝑁) = 1} → ((𝑥 ∈ {𝑛 ∈ ℤ ∣ (𝑛 gcd 𝑁) = 1} ↦ inf({𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝑥↑𝑛) − 1)}, ℝ, < ))‘𝐴) = inf({𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝐴↑𝑛) − 1)}, ℝ, < ))
29	19, 28	sylbir 234	. . 3 ⊢ ((𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → ((𝑥 ∈ {𝑛 ∈ ℤ ∣ (𝑛 gcd 𝑁) = 1} ↦ inf({𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝑥↑𝑛) − 1)}, ℝ, < ))‘𝐴) = inf({𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝐴↑𝑛) − 1)}, ℝ, < ))
30	16, 29	sylan9eq 2793	. 2 ⊢ ((𝑁 ∈ ℕ ∧ (𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1)) → ((odℤ‘𝑁)‘𝐴) = inf({𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝐴↑𝑛) − 1)}, ℝ, < ))
31	30	3impb 1116	1 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → ((odℤ‘𝑁)‘𝐴) = inf({𝑛 ∈ ℕ ∣ 𝑁 ∥ ((𝐴↑𝑛) − 1)}, ℝ, < ))

Syntax hints:   → wi 4   ∧ wa 397   ∧ w3a 1088   = wceq 1542   ∈ wcel 2107  {crab 3433   class class class wbr 5149   ↦ cmpt 5232  ‘cfv 6544  (class class class)co 7409  infcinf 9436  ℝcr 11109  1c1 11111   < clt 11248   − cmin 11444  ℕcn 12212  ℤcz 12558  ↑cexp 14027   ∥ cdvds 16197   gcd cgcd 16435  od_ℤcodz 16696

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-rep 5286  ax-sep 5300  ax-nul 5307  ax-pow 5364  ax-pr 5428  ax-un 7725  ax-cnex 11166  ax-resscn 11167  ax-pre-lttri 11184  ax-pre-lttrn 11185

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-nel 3048  df-ral 3063  df-rex 3072  df-rmo 3377  df-reu 3378  df-rab 3434  df-v 3477  df-sbc 3779  df-csb 3895  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4910  df-iun 5000  df-br 5150  df-opab 5212  df-mpt 5233  df-id 5575  df-po 5589  df-so 5590  df-xp 5683  df-rel 5684  df-cnv 5685  df-co 5686  df-dm 5687  df-rn 5688  df-res 5689  df-ima 5690  df-iota 6496  df-fun 6546  df-fn 6547  df-f 6548  df-f1 6549  df-fo 6550  df-f1o 6551  df-fv 6552  df-ov 7412  df-er 8703  df-en 8940  df-dom 8941  df-sdom 8942  df-sup 9437  df-inf 9438  df-pnf 11250  df-mnf 11251  df-ltxr 11253  df-neg 11447  df-z 12559  df-odz 16698

This theorem is referenced by:  odzcllem  16725  odzdvds  16728