MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  znval Structured version   Visualization version   Unicode version

Theorem znval 19883
Description: The value of the ℤ/nℤ structure. It is defined as the quotient ring  ZZ  /  n ZZ, with an "artificial" ordering added to make it a Toset. (In other words, ℤ/nℤ is a ring with an order , but it is not an ordered ring , which as a term implies that the order is compatible with the ring operations in some way.) (Contributed by Mario Carneiro, 14-Jun-2015.) (Revised by Mario Carneiro, 2-May-2016.) (Revised by AV, 13-Jun-2019.)
Hypotheses
Ref Expression
znval.s  |-  S  =  (RSpan ` ring )
znval.u  |-  U  =  (ring 
/.s  (ring ~QG  ( S `  { N } ) ) )
znval.y  |-  Y  =  (ℤ/n `  N )
znval.f  |-  F  =  ( ( ZRHom `  U )  |`  W )
znval.w  |-  W  =  if ( N  =  0 ,  ZZ , 
( 0..^ N ) )
znval.l  |-  .<_  =  ( ( F  o.  <_  )  o.  `' F )
Assertion
Ref Expression
znval  |-  ( N  e.  NN0  ->  Y  =  ( U sSet  <. ( le `  ndx ) , 
.<_  >. ) )

Proof of Theorem znval
Dummy variables  f  n  s  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 znval.y . 2  |-  Y  =  (ℤ/n `  N )
2 zringring 19821 . . . . 5  |-ring  e.  Ring
32a1i 11 . . . 4  |-  ( n  =  N  ->ring  e.  Ring )
4 ovexd 6680 . . . . 5  |-  ( ( n  =  N  /\  z  =ring )  ->  ( z 
/.s  ( z ~QG  ( (RSpan `  z
) `  { n } ) ) )  e.  _V )
5 id 22 . . . . . . 7  |-  ( s  =  ( z  /.s  (
z ~QG 
( (RSpan `  z
) `  { n } ) ) )  ->  s  =  ( z  /.s  ( z ~QG  ( (RSpan `  z
) `  { n } ) ) ) )
6 simpr 477 . . . . . . . . 9  |-  ( ( n  =  N  /\  z  =ring )  ->  z  =ring )
76fveq2d 6195 . . . . . . . . . . . 12  |-  ( ( n  =  N  /\  z  =ring )  ->  (RSpan `  z )  =  (RSpan ` ring ) )
8 znval.s . . . . . . . . . . . 12  |-  S  =  (RSpan ` ring )
97, 8syl6eqr 2674 . . . . . . . . . . 11  |-  ( ( n  =  N  /\  z  =ring )  ->  (RSpan `  z )  =  S )
10 simpl 473 . . . . . . . . . . . 12  |-  ( ( n  =  N  /\  z  =ring )  ->  n  =  N )
1110sneqd 4189 . . . . . . . . . . 11  |-  ( ( n  =  N  /\  z  =ring )  ->  { n }  =  { N } )
129, 11fveq12d 6197 . . . . . . . . . 10  |-  ( ( n  =  N  /\  z  =ring )  ->  ( (RSpan `  z ) `  {
n } )  =  ( S `  { N } ) )
136, 12oveq12d 6668 . . . . . . . . 9  |-  ( ( n  =  N  /\  z  =ring )  ->  ( z ~QG  ( (RSpan `  z ) `  { n } ) )  =  (ring ~QG  ( S `  { N } ) ) )
146, 13oveq12d 6668 . . . . . . . 8  |-  ( ( n  =  N  /\  z  =ring )  ->  ( z 
/.s  ( z ~QG  ( (RSpan `  z
) `  { n } ) ) )  =  (ring 
/.s  (ring ~QG  ( S `  { N } ) ) ) )
15 znval.u . . . . . . . 8  |-  U  =  (ring 
/.s  (ring ~QG  ( S `  { N } ) ) )
1614, 15syl6eqr 2674 . . . . . . 7  |-  ( ( n  =  N  /\  z  =ring )  ->  ( z 
/.s  ( z ~QG  ( (RSpan `  z
) `  { n } ) ) )  =  U )
175, 16sylan9eqr 2678 . . . . . 6  |-  ( ( ( n  =  N  /\  z  =ring )  /\  s  =  ( z  /.s  ( z ~QG  ( (RSpan `  z
) `  { n } ) ) ) )  ->  s  =  U )
18 fvex 6201 . . . . . . . . . 10  |-  ( ZRHom `  s )  e.  _V
1918resex 5443 . . . . . . . . 9  |-  ( ( ZRHom `  s )  |`  if ( n  =  0 ,  ZZ , 
( 0..^ n ) ) )  e.  _V
2019a1i 11 . . . . . . . 8  |-  ( ( ( n  =  N  /\  z  =ring )  /\  s  =  ( z  /.s  ( z ~QG  ( (RSpan `  z
) `  { n } ) ) ) )  ->  ( ( ZRHom `  s )  |`  if ( n  =  0 ,  ZZ ,  ( 0..^ n ) ) )  e.  _V )
21 id 22 . . . . . . . . . . . 12  |-  ( f  =  ( ( ZRHom `  s )  |`  if ( n  =  0 ,  ZZ ,  ( 0..^ n ) ) )  ->  f  =  ( ( ZRHom `  s
)  |`  if ( n  =  0 ,  ZZ ,  ( 0..^ n ) ) ) )
2217fveq2d 6195 . . . . . . . . . . . . . 14  |-  ( ( ( n  =  N  /\  z  =ring )  /\  s  =  ( z  /.s  ( z ~QG  ( (RSpan `  z
) `  { n } ) ) ) )  ->  ( ZRHom `  s )  =  ( ZRHom `  U )
)
23 simpll 790 . . . . . . . . . . . . . . . . 17  |-  ( ( ( n  =  N  /\  z  =ring )  /\  s  =  ( z  /.s  ( z ~QG  ( (RSpan `  z
) `  { n } ) ) ) )  ->  n  =  N )
2423eqeq1d 2624 . . . . . . . . . . . . . . . 16  |-  ( ( ( n  =  N  /\  z  =ring )  /\  s  =  ( z  /.s  ( z ~QG  ( (RSpan `  z
) `  { n } ) ) ) )  ->  ( n  =  0  <->  N  = 
0 ) )
2523oveq2d 6666 . . . . . . . . . . . . . . . 16  |-  ( ( ( n  =  N  /\  z  =ring )  /\  s  =  ( z  /.s  ( z ~QG  ( (RSpan `  z
) `  { n } ) ) ) )  ->  ( 0..^ n )  =  ( 0..^ N ) )
2624, 25ifbieq2d 4111 . . . . . . . . . . . . . . 15  |-  ( ( ( n  =  N  /\  z  =ring )  /\  s  =  ( z  /.s  ( z ~QG  ( (RSpan `  z
) `  { n } ) ) ) )  ->  if (
n  =  0 ,  ZZ ,  ( 0..^ n ) )  =  if ( N  =  0 ,  ZZ , 
( 0..^ N ) ) )
27 znval.w . . . . . . . . . . . . . . 15  |-  W  =  if ( N  =  0 ,  ZZ , 
( 0..^ N ) )
2826, 27syl6eqr 2674 . . . . . . . . . . . . . 14  |-  ( ( ( n  =  N  /\  z  =ring )  /\  s  =  ( z  /.s  ( z ~QG  ( (RSpan `  z
) `  { n } ) ) ) )  ->  if (
n  =  0 ,  ZZ ,  ( 0..^ n ) )  =  W )
2922, 28reseq12d 5397 . . . . . . . . . . . . 13  |-  ( ( ( n  =  N  /\  z  =ring )  /\  s  =  ( z  /.s  ( z ~QG  ( (RSpan `  z
) `  { n } ) ) ) )  ->  ( ( ZRHom `  s )  |`  if ( n  =  0 ,  ZZ ,  ( 0..^ n ) ) )  =  ( ( ZRHom `  U )  |`  W ) )
30 znval.f . . . . . . . . . . . . 13  |-  F  =  ( ( ZRHom `  U )  |`  W )
3129, 30syl6eqr 2674 . . . . . . . . . . . 12  |-  ( ( ( n  =  N  /\  z  =ring )  /\  s  =  ( z  /.s  ( z ~QG  ( (RSpan `  z
) `  { n } ) ) ) )  ->  ( ( ZRHom `  s )  |`  if ( n  =  0 ,  ZZ ,  ( 0..^ n ) ) )  =  F )
3221, 31sylan9eqr 2678 . . . . . . . . . . 11  |-  ( ( ( ( n  =  N  /\  z  =ring )  /\  s  =  ( z  /.s  ( z ~QG  ( (RSpan `  z
) `  { n } ) ) ) )  /\  f  =  ( ( ZRHom `  s )  |`  if ( n  =  0 ,  ZZ ,  ( 0..^ n ) ) ) )  ->  f  =  F )
3332coeq1d 5283 . . . . . . . . . 10  |-  ( ( ( ( n  =  N  /\  z  =ring )  /\  s  =  ( z  /.s  ( z ~QG  ( (RSpan `  z
) `  { n } ) ) ) )  /\  f  =  ( ( ZRHom `  s )  |`  if ( n  =  0 ,  ZZ ,  ( 0..^ n ) ) ) )  ->  ( f  o.  <_  )  =  ( F  o.  <_  )
)
3432cnveqd 5298 . . . . . . . . . 10  |-  ( ( ( ( n  =  N  /\  z  =ring )  /\  s  =  ( z  /.s  ( z ~QG  ( (RSpan `  z
) `  { n } ) ) ) )  /\  f  =  ( ( ZRHom `  s )  |`  if ( n  =  0 ,  ZZ ,  ( 0..^ n ) ) ) )  ->  `' f  =  `' F )
3533, 34coeq12d 5286 . . . . . . . . 9  |-  ( ( ( ( n  =  N  /\  z  =ring )  /\  s  =  ( z  /.s  ( z ~QG  ( (RSpan `  z
) `  { n } ) ) ) )  /\  f  =  ( ( ZRHom `  s )  |`  if ( n  =  0 ,  ZZ ,  ( 0..^ n ) ) ) )  ->  ( (
f  o.  <_  )  o.  `' f )  =  ( ( F  o.  <_  )  o.  `' F
) )
36 znval.l . . . . . . . . 9  |-  .<_  =  ( ( F  o.  <_  )  o.  `' F )
3735, 36syl6eqr 2674 . . . . . . . 8  |-  ( ( ( ( n  =  N  /\  z  =ring )  /\  s  =  ( z  /.s  ( z ~QG  ( (RSpan `  z
) `  { n } ) ) ) )  /\  f  =  ( ( ZRHom `  s )  |`  if ( n  =  0 ,  ZZ ,  ( 0..^ n ) ) ) )  ->  ( (
f  o.  <_  )  o.  `' f )  = 
.<_  )
3820, 37csbied 3560 . . . . . . 7  |-  ( ( ( n  =  N  /\  z  =ring )  /\  s  =  ( z  /.s  ( z ~QG  ( (RSpan `  z
) `  { n } ) ) ) )  ->  [_ ( ( ZRHom `  s )  |`  if ( n  =  0 ,  ZZ , 
( 0..^ n ) ) )  /  f ]_ ( ( f  o. 
<_  )  o.  `' f )  =  .<_  )
3938opeq2d 4409 . . . . . 6  |-  ( ( ( n  =  N  /\  z  =ring )  /\  s  =  ( z  /.s  ( z ~QG  ( (RSpan `  z
) `  { n } ) ) ) )  ->  <. ( le
`  ndx ) ,  [_ ( ( ZRHom `  s )  |`  if ( n  =  0 ,  ZZ ,  ( 0..^ n ) ) )  /  f ]_ (
( f  o.  <_  )  o.  `' f )
>.  =  <. ( le
`  ndx ) ,  .<_  >.
)
4017, 39oveq12d 6668 . . . . 5  |-  ( ( ( n  =  N  /\  z  =ring )  /\  s  =  ( z  /.s  ( z ~QG  ( (RSpan `  z
) `  { n } ) ) ) )  ->  ( s sSet  <.
( le `  ndx ) ,  [_ ( ( ZRHom `  s )  |`  if ( n  =  0 ,  ZZ , 
( 0..^ n ) ) )  /  f ]_ ( ( f  o. 
<_  )  o.  `' f ) >. )  =  ( U sSet  <. ( le `  ndx ) ,  .<_  >. ) )
414, 40csbied 3560 . . . 4  |-  ( ( n  =  N  /\  z  =ring )  ->  [_ (
z  /.s  ( z ~QG  ( (RSpan `  z
) `  { n } ) ) )  /  s ]_ (
s sSet  <. ( le `  ndx ) ,  [_ (
( ZRHom `  s
)  |`  if ( n  =  0 ,  ZZ ,  ( 0..^ n ) ) )  / 
f ]_ ( ( f  o.  <_  )  o.  `' f ) >.
)  =  ( U sSet  <. ( le `  ndx ) ,  .<_  >. )
)
423, 41csbied 3560 . . 3  |-  ( n  =  N  ->  [_ring  /  z ]_ [_ (
z  /.s  ( z ~QG  ( (RSpan `  z
) `  { n } ) ) )  /  s ]_ (
s sSet  <. ( le `  ndx ) ,  [_ (
( ZRHom `  s
)  |`  if ( n  =  0 ,  ZZ ,  ( 0..^ n ) ) )  / 
f ]_ ( ( f  o.  <_  )  o.  `' f ) >.
)  =  ( U sSet  <. ( le `  ndx ) ,  .<_  >. )
)
43 df-zn 19855 . . 3  |- ℤ/n =  ( n  e. 
NN0  |->  [_ring  /  z ]_ [_ (
z  /.s  ( z ~QG  ( (RSpan `  z
) `  { n } ) ) )  /  s ]_ (
s sSet  <. ( le `  ndx ) ,  [_ (
( ZRHom `  s
)  |`  if ( n  =  0 ,  ZZ ,  ( 0..^ n ) ) )  / 
f ]_ ( ( f  o.  <_  )  o.  `' f ) >.
) )
44 ovex 6678 . . 3  |-  ( U sSet  <. ( le `  ndx ) ,  .<_  >. )  e.  _V
4542, 43, 44fvmpt 6282 . 2  |-  ( N  e.  NN0  ->  (ℤ/n `  N
)  =  ( U sSet  <. ( le `  ndx ) ,  .<_  >. )
)
461, 45syl5eq 2668 1  |-  ( N  e.  NN0  ->  Y  =  ( U sSet  <. ( le `  ndx ) , 
.<_  >. ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 384    = wceq 1483    e. wcel 1990   _Vcvv 3200   [_csb 3533   ifcif 4086   {csn 4177   <.cop 4183   `'ccnv 5113    |` cres 5116    o. ccom 5118   ` cfv 5888  (class class class)co 6650   0cc0 9936    <_ cle 10075   NN0cn0 11292   ZZcz 11377  ..^cfzo 12465   ndxcnx 15854   sSet csts 15855   lecple 15948    /.s cqus 16165   ~QG cqg 17590   Ringcrg 18547  RSpancrsp 19171  ℤringzring 19818   ZRHomczrh 19848  ℤ/nczn 19851
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949  ax-cnex 9992  ax-resscn 9993  ax-1cn 9994  ax-icn 9995  ax-addcl 9996  ax-addrcl 9997  ax-mulcl 9998  ax-mulrcl 9999  ax-mulcom 10000  ax-addass 10001  ax-mulass 10002  ax-distr 10003  ax-i2m1 10004  ax-1ne0 10005  ax-1rid 10006  ax-rnegex 10007  ax-rrecex 10008  ax-cnre 10009  ax-pre-lttri 10010  ax-pre-lttrn 10011  ax-pre-ltadd 10012  ax-pre-mulgt0 10013  ax-addf 10015  ax-mulf 10016
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-nel 2898  df-ral 2917  df-rex 2918  df-reu 2919  df-rmo 2920  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-int 4476  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-pred 5680  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-riota 6611  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-om 7066  df-1st 7168  df-2nd 7169  df-wrecs 7407  df-recs 7468  df-rdg 7506  df-1o 7560  df-oadd 7564  df-er 7742  df-en 7956  df-dom 7957  df-sdom 7958  df-fin 7959  df-pnf 10076  df-mnf 10077  df-xr 10078  df-ltxr 10079  df-le 10080  df-sub 10268  df-neg 10269  df-nn 11021  df-2 11079  df-3 11080  df-4 11081  df-5 11082  df-6 11083  df-7 11084  df-8 11085  df-9 11086  df-n0 11293  df-z 11378  df-dec 11494  df-uz 11688  df-fz 12327  df-struct 15859  df-ndx 15860  df-slot 15861  df-base 15863  df-sets 15864  df-ress 15865  df-plusg 15954  df-mulr 15955  df-starv 15956  df-tset 15960  df-ple 15961  df-ds 15964  df-unif 15965  df-0g 16102  df-mgm 17242  df-sgrp 17284  df-mnd 17295  df-grp 17425  df-minusg 17426  df-subg 17591  df-cmn 18195  df-mgp 18490  df-ur 18502  df-ring 18549  df-cring 18550  df-subrg 18778  df-cnfld 19747  df-zring 19819  df-zn 19855
This theorem is referenced by:  znle  19884  znval2  19885
  Copyright terms: Public domain W3C validator