Theorem odzval 12169

Description: Value of the order function. This is a function of functions; the inner argument selects the base (i.e., mod N for some N, 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 N. In order to ensure the supremum is well-defined, we only define the expression when A and N are coprime. (Contributed by Mario Carneiro, 23-Feb-2014.) (Revised by AV, 26-Sep-2020.)

Assertion

Ref	Expression
odzval	|- ( ( N e. NN /\ A e. ZZ /\ ( A gcd N ) = 1 ) -> ( ( odZ ` N ) ` A ) = inf ( { n e. NN | N || ( ( A ^ n ) - 1 ) } , RR , < ) )

Distinct variable groups:   n, N   A, n

Proof of Theorem odzval

Dummy variables m x are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		oveq2 5849	. . . . . . . . 9 |- ( m = N -> ( x gcd m ) = ( x gcd N ) )
2	1	eqeq1d 2174	. . . . . . . 8 |- ( m = N -> ( ( x gcd m ) = 1 <-> ( x gcd N ) = 1 ) )
3	2	rabbidv 2714	. . . . . . 7 |- ( m = N -> { x e. ZZ | ( x gcd m ) = 1 } = { x e. ZZ | ( x gcd N ) = 1 } )
4		oveq1 5848	. . . . . . . . 9 |- ( n = x -> ( n gcd N ) = ( x gcd N ) )
5	4	eqeq1d 2174	. . . . . . . 8 |- ( n = x -> ( ( n gcd N ) = 1 <-> ( x gcd N ) = 1 ) )
6	5	cbvrabv 2724	. . . . . . 7 |- { n e. ZZ | ( n gcd N ) = 1 } = { x e. ZZ | ( x gcd N ) = 1 }
7	3, 6	eqtr4di 2216	. . . . . 6 |- ( m = N -> { x e. ZZ | ( x gcd m ) = 1 } = { n e. ZZ | ( n gcd N ) = 1 } )
8		breq1 3984	. . . . . . . 8 |- ( m = N -> ( m || ( ( x ^ n ) - 1 ) <-> N || ( ( x ^ n ) - 1 ) ) )
9	8	rabbidv 2714	. . . . . . 7 |- ( m = N -> { n e. NN | m || ( ( x ^ n ) - 1 ) } = { n e. NN | N || ( ( x ^ n ) - 1 ) } )
10	9	infeq1d 6973	. . . . . 6 |- ( m = N -> inf ( { n e. NN | m || ( ( x ^ n ) - 1 ) } , RR , < ) = inf ( { n e. NN | N || ( ( x ^ n ) - 1 ) } , RR , < ) )
11	7, 10	mpteq12dv 4063	. . . . 5 |- ( m = N -> ( x e. { x e. ZZ | ( x gcd m ) = 1 } |-> inf ( { n e. NN | m || ( ( x ^ n ) - 1 ) } , RR , < ) ) = ( x e. { n e. ZZ | ( n gcd N ) = 1 } |-> inf ( { n e. NN | N || ( ( x ^ n ) - 1 ) } , RR , < ) ) )
12		df-odz 12138	. . . . 5 |- odZ = ( m e. NN |-> ( x e. { x e. ZZ | ( x gcd m ) = 1 } |-> inf ( { n e. NN | m || ( ( x ^ n ) - 1 ) } , RR , < ) ) )
13		zex 9196	. . . . . 6 |- ZZ e. _V
14	13	mptrabex 5712	. . . . 5 |- ( x e. { n e. ZZ | ( n gcd N ) = 1 } |-> inf ( { n e. NN | N || ( ( x ^ n ) - 1 ) } , RR , < ) ) e. _V
15	11, 12, 14	fvmpt 5562	. . . 4 |- ( N e. NN -> ( odZ ` N ) = ( x e. { n e. ZZ | ( n gcd N ) = 1 } |-> inf ( { n e. NN | N || ( ( x ^ n ) - 1 ) } , RR , < ) ) )
16	15	fveq1d 5487	. . 3 |- ( N e. NN -> ( ( odZ ` N ) ` A ) = ( ( x e. { n e. ZZ | ( n gcd N ) = 1 } |-> inf ( { n e. NN | N || ( ( x ^ n ) - 1 ) } , RR , < ) ) ` A ) )
17		oveq1 5848	. . . . . 6 |- ( n = A -> ( n gcd N ) = ( A gcd N ) )
18	17	eqeq1d 2174	. . . . 5 |- ( n = A -> ( ( n gcd N ) = 1 <-> ( A gcd N ) = 1 ) )
19	18	elrab 2881	. . . 4 |- ( A e. { n e. ZZ | ( n gcd N ) = 1 } <-> ( A e. ZZ /\ ( A gcd N ) = 1 ) )
20		oveq1 5848	. . . . . . . . 9 |- ( x = A -> ( x ^ n ) = ( A ^ n ) )
21	20	oveq1d 5856	. . . . . . . 8 |- ( x = A -> ( ( x ^ n ) - 1 ) = ( ( A ^ n ) - 1 ) )
22	21	breq2d 3993	. . . . . . 7 |- ( x = A -> ( N || ( ( x ^ n ) - 1 ) <-> N || ( ( A ^ n ) - 1 ) ) )
23	22	rabbidv 2714	. . . . . 6 |- ( x = A -> { n e. NN | N || ( ( x ^ n ) - 1 ) } = { n e. NN | N || ( ( A ^ n ) - 1 ) } )
24	23	infeq1d 6973	. . . . 5 |- ( x = A -> inf ( { n e. NN | N || ( ( x ^ n ) - 1 ) } , RR , < ) = inf ( { n e. NN | N || ( ( A ^ n ) - 1 ) } , RR , < ) )
25		eqid 2165	. . . . 5 |- ( x e. { n e. ZZ | ( n gcd N ) = 1 } |-> inf ( { n e. NN | N || ( ( x ^ n ) - 1 ) } , RR , < ) ) = ( x e. { n e. ZZ | ( n gcd N ) = 1 } |-> inf ( { n e. NN | N || ( ( x ^ n ) - 1 ) } , RR , < ) )
26		reex 7883	. . . . . 6 |- RR e. _V
27		infex2g 6995	. . . . . 6 |- ( RR e. _V -> inf ( { n e. NN | N || ( ( A ^ n ) - 1 ) } , RR , < ) e. _V )
28	26, 27	ax-mp 5	. . . . 5 |- inf ( { n e. NN | N || ( ( A ^ n ) - 1 ) } , RR , < ) e. _V
29	24, 25, 28	fvmpt 5562	. . . 4 |- ( A e. { n e. ZZ | ( n gcd N ) = 1 } -> ( ( x e. { n e. ZZ | ( n gcd N ) = 1 } |-> inf ( { n e. NN | N || ( ( x ^ n ) - 1 ) } , RR , < ) ) ` A ) = inf ( { n e. NN | N || ( ( A ^ n ) - 1 ) } , RR , < ) )
30	19, 29	sylbir 134	. . 3 |- ( ( A e. ZZ /\ ( A gcd N ) = 1 ) -> ( ( x e. { n e. ZZ | ( n gcd N ) = 1 } |-> inf ( { n e. NN | N || ( ( x ^ n ) - 1 ) } , RR , < ) ) ` A ) = inf ( { n e. NN | N || ( ( A ^ n ) - 1 ) } , RR , < ) )
31	16, 30	sylan9eq 2218	. 2 |- ( ( N e. NN /\ ( A e. ZZ /\ ( A gcd N ) = 1 ) ) -> ( ( odZ ` N ) ` A ) = inf ( { n e. NN | N || ( ( A ^ n ) - 1 ) } , RR , < ) )
32	31	3impb 1189	1 |- ( ( N e. NN /\ A e. ZZ /\ ( A gcd N ) = 1 ) -> ( ( odZ ` N ) ` A ) = inf ( { n e. NN | N || ( ( A ^ n ) - 1 ) } , RR , < ) )

Syntax hints:   -> wi 4   /\ wa 103   /\ w3a 968   = wceq 1343   e. wcel 2136   {crab 2447   _Vcvv 2725   class class class wbr 3981   |-> cmpt 4042   ` cfv 5187  (class class class)co 5841  infcinf 6944   RRcr 7748   1c1 7750   < clt 7929   - cmin 8065   NNcn 8853   ZZcz 9187   ^cexp 10450   || cdvds 11723   gcd cgcd 11871   odZcodz 12136

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-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-pow 4152  ax-pr 4186  ax-un 4410  ax-cnex 7840  ax-resscn 7841

This theorem depends on definitions:  df-bi 116  df-3or 969  df-3an 970  df-tru 1346  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-ral 2448  df-rex 2449  df-reu 2450  df-rab 2452  df-v 2727  df-sbc 2951  df-csb 3045  df-un 3119  df-in 3121  df-ss 3128  df-pw 3560  df-sn 3581  df-pr 3582  df-op 3584  df-uni 3789  df-iun 3867  df-br 3982  df-opab 4043  df-mpt 4044  df-id 4270  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-ov 5844  df-sup 6945  df-inf 6946  df-neg 8068  df-z 9188  df-odz 12138

This theorem is referenced by:  odzcllem  12170  odzdvds  12173