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

Theorem oddvdsnn0 16695
Description: The only multiples of  A that are equal to the identity are the multiples of the order of  A. (Contributed by Mario Carneiro, 23-Sep-2015.)
Hypotheses
Ref Expression
odcl.1  |-  X  =  ( Base `  G
)
odcl.2  |-  O  =  ( od `  G
)
odid.3  |-  .x.  =  (.g
`  G )
odid.4  |-  .0.  =  ( 0g `  G )
Assertion
Ref Expression
oddvdsnn0  |-  ( ( G  e.  Mnd  /\  A  e.  X  /\  N  e.  NN0 )  -> 
( ( O `  A )  ||  N  <->  ( N  .x.  A )  =  .0.  ) )

Proof of Theorem oddvdsnn0
StepHypRef Expression
1 0nn0 10831 . . . . 5  |-  0  e.  NN0
2 odcl.1 . . . . . . 7  |-  X  =  ( Base `  G
)
3 odcl.2 . . . . . . 7  |-  O  =  ( od `  G
)
4 odid.3 . . . . . . 7  |-  .x.  =  (.g
`  G )
5 odid.4 . . . . . . 7  |-  .0.  =  ( 0g `  G )
62, 3, 4, 5mndodcong 16693 . . . . . 6  |-  ( ( ( G  e.  Mnd  /\  A  e.  X )  /\  ( N  e. 
NN0  /\  0  e.  NN0 )  /\  ( O `
 A )  e.  NN )  ->  (
( O `  A
)  ||  ( N  -  0 )  <->  ( N  .x.  A )  =  ( 0  .x.  A ) ) )
763expia 1198 . . . . 5  |-  ( ( ( G  e.  Mnd  /\  A  e.  X )  /\  ( N  e. 
NN0  /\  0  e.  NN0 ) )  ->  (
( O `  A
)  e.  NN  ->  ( ( O `  A
)  ||  ( N  -  0 )  <->  ( N  .x.  A )  =  ( 0  .x.  A ) ) ) )
81, 7mpanr2 684 . . . 4  |-  ( ( ( G  e.  Mnd  /\  A  e.  X )  /\  N  e.  NN0 )  ->  ( ( O `
 A )  e.  NN  ->  ( ( O `  A )  ||  ( N  -  0 )  <->  ( N  .x.  A )  =  ( 0  .x.  A ) ) ) )
983impa 1191 . . 3  |-  ( ( G  e.  Mnd  /\  A  e.  X  /\  N  e.  NN0 )  -> 
( ( O `  A )  e.  NN  ->  ( ( O `  A )  ||  ( N  -  0 )  <-> 
( N  .x.  A
)  =  ( 0 
.x.  A ) ) ) )
10 nn0cn 10826 . . . . . . 7  |-  ( N  e.  NN0  ->  N  e.  CC )
11103ad2ant3 1019 . . . . . 6  |-  ( ( G  e.  Mnd  /\  A  e.  X  /\  N  e.  NN0 )  ->  N  e.  CC )
1211subid1d 9939 . . . . 5  |-  ( ( G  e.  Mnd  /\  A  e.  X  /\  N  e.  NN0 )  -> 
( N  -  0 )  =  N )
1312breq2d 4468 . . . 4  |-  ( ( G  e.  Mnd  /\  A  e.  X  /\  N  e.  NN0 )  -> 
( ( O `  A )  ||  ( N  -  0 )  <-> 
( O `  A
)  ||  N )
)
142, 5, 4mulg0 16274 . . . . . 6  |-  ( A  e.  X  ->  (
0  .x.  A )  =  .0.  )
15143ad2ant2 1018 . . . . 5  |-  ( ( G  e.  Mnd  /\  A  e.  X  /\  N  e.  NN0 )  -> 
( 0  .x.  A
)  =  .0.  )
1615eqeq2d 2471 . . . 4  |-  ( ( G  e.  Mnd  /\  A  e.  X  /\  N  e.  NN0 )  -> 
( ( N  .x.  A )  =  ( 0  .x.  A )  <-> 
( N  .x.  A
)  =  .0.  )
)
1713, 16bibi12d 321 . . 3  |-  ( ( G  e.  Mnd  /\  A  e.  X  /\  N  e.  NN0 )  -> 
( ( ( O `
 A )  ||  ( N  -  0
)  <->  ( N  .x.  A )  =  ( 0  .x.  A ) )  <->  ( ( O `
 A )  ||  N 
<->  ( N  .x.  A
)  =  .0.  )
) )
189, 17sylibd 214 . 2  |-  ( ( G  e.  Mnd  /\  A  e.  X  /\  N  e.  NN0 )  -> 
( ( O `  A )  e.  NN  ->  ( ( O `  A )  ||  N  <->  ( N  .x.  A )  =  .0.  ) ) )
19 simpr 461 . . . . 5  |-  ( ( ( G  e.  Mnd  /\  A  e.  X  /\  N  e.  NN0 )  /\  ( O `  A )  =  0 )  -> 
( O `  A
)  =  0 )
2019breq1d 4466 . . . 4  |-  ( ( ( G  e.  Mnd  /\  A  e.  X  /\  N  e.  NN0 )  /\  ( O `  A )  =  0 )  -> 
( ( O `  A )  ||  N  <->  0 
||  N ) )
21 simpl3 1001 . . . . 5  |-  ( ( ( G  e.  Mnd  /\  A  e.  X  /\  N  e.  NN0 )  /\  ( O `  A )  =  0 )  ->  N  e.  NN0 )
22 nn0z 10908 . . . . 5  |-  ( N  e.  NN0  ->  N  e.  ZZ )
23 0dvds 14016 . . . . 5  |-  ( N  e.  ZZ  ->  (
0  ||  N  <->  N  = 
0 ) )
2421, 22, 233syl 20 . . . 4  |-  ( ( ( G  e.  Mnd  /\  A  e.  X  /\  N  e.  NN0 )  /\  ( O `  A )  =  0 )  -> 
( 0  ||  N  <->  N  =  0 ) )
2515adantr 465 . . . . . 6  |-  ( ( ( G  e.  Mnd  /\  A  e.  X  /\  N  e.  NN0 )  /\  ( O `  A )  =  0 )  -> 
( 0  .x.  A
)  =  .0.  )
26 oveq1 6303 . . . . . . 7  |-  ( N  =  0  ->  ( N  .x.  A )  =  ( 0  .x.  A
) )
2726eqeq1d 2459 . . . . . 6  |-  ( N  =  0  ->  (
( N  .x.  A
)  =  .0.  <->  ( 0 
.x.  A )  =  .0.  ) )
2825, 27syl5ibrcom 222 . . . . 5  |-  ( ( ( G  e.  Mnd  /\  A  e.  X  /\  N  e.  NN0 )  /\  ( O `  A )  =  0 )  -> 
( N  =  0  ->  ( N  .x.  A )  =  .0.  ) )
292, 3, 4, 5odlem2 16690 . . . . . . . . . . . 12  |-  ( ( A  e.  X  /\  N  e.  NN  /\  ( N  .x.  A )  =  .0.  )  ->  ( O `  A )  e.  ( 1 ... N
) )
30293com23 1202 . . . . . . . . . . 11  |-  ( ( A  e.  X  /\  ( N  .x.  A )  =  .0.  /\  N  e.  NN )  ->  ( O `  A )  e.  ( 1 ... N
) )
31 elfznn 11739 . . . . . . . . . . 11  |-  ( ( O `  A )  e.  ( 1 ... N )  ->  ( O `  A )  e.  NN )
32 nnne0 10589 . . . . . . . . . . 11  |-  ( ( O `  A )  e.  NN  ->  ( O `  A )  =/=  0 )
3330, 31, 323syl 20 . . . . . . . . . 10  |-  ( ( A  e.  X  /\  ( N  .x.  A )  =  .0.  /\  N  e.  NN )  ->  ( O `  A )  =/=  0 )
34333expia 1198 . . . . . . . . 9  |-  ( ( A  e.  X  /\  ( N  .x.  A )  =  .0.  )  -> 
( N  e.  NN  ->  ( O `  A
)  =/=  0 ) )
35343ad2antl2 1159 . . . . . . . 8  |-  ( ( ( G  e.  Mnd  /\  A  e.  X  /\  N  e.  NN0 )  /\  ( N  .x.  A )  =  .0.  )  -> 
( N  e.  NN  ->  ( O `  A
)  =/=  0 ) )
3635necon2bd 2672 . . . . . . 7  |-  ( ( ( G  e.  Mnd  /\  A  e.  X  /\  N  e.  NN0 )  /\  ( N  .x.  A )  =  .0.  )  -> 
( ( O `  A )  =  0  ->  -.  N  e.  NN ) )
37 simpl3 1001 . . . . . . . . 9  |-  ( ( ( G  e.  Mnd  /\  A  e.  X  /\  N  e.  NN0 )  /\  ( N  .x.  A )  =  .0.  )  ->  N  e.  NN0 )
38 elnn0 10818 . . . . . . . . 9  |-  ( N  e.  NN0  <->  ( N  e.  NN  \/  N  =  0 ) )
3937, 38sylib 196 . . . . . . . 8  |-  ( ( ( G  e.  Mnd  /\  A  e.  X  /\  N  e.  NN0 )  /\  ( N  .x.  A )  =  .0.  )  -> 
( N  e.  NN  \/  N  =  0
) )
4039ord 377 . . . . . . 7  |-  ( ( ( G  e.  Mnd  /\  A  e.  X  /\  N  e.  NN0 )  /\  ( N  .x.  A )  =  .0.  )  -> 
( -.  N  e.  NN  ->  N  = 
0 ) )
4136, 40syld 44 . . . . . 6  |-  ( ( ( G  e.  Mnd  /\  A  e.  X  /\  N  e.  NN0 )  /\  ( N  .x.  A )  =  .0.  )  -> 
( ( O `  A )  =  0  ->  N  =  0 ) )
4241impancom 440 . . . . 5  |-  ( ( ( G  e.  Mnd  /\  A  e.  X  /\  N  e.  NN0 )  /\  ( O `  A )  =  0 )  -> 
( ( N  .x.  A )  =  .0. 
->  N  =  0
) )
4328, 42impbid 191 . . . 4  |-  ( ( ( G  e.  Mnd  /\  A  e.  X  /\  N  e.  NN0 )  /\  ( O `  A )  =  0 )  -> 
( N  =  0  <-> 
( N  .x.  A
)  =  .0.  )
)
4420, 24, 433bitrd 279 . . 3  |-  ( ( ( G  e.  Mnd  /\  A  e.  X  /\  N  e.  NN0 )  /\  ( O `  A )  =  0 )  -> 
( ( O `  A )  ||  N  <->  ( N  .x.  A )  =  .0.  ) )
4544ex 434 . 2  |-  ( ( G  e.  Mnd  /\  A  e.  X  /\  N  e.  NN0 )  -> 
( ( O `  A )  =  0  ->  ( ( O `
 A )  ||  N 
<->  ( N  .x.  A
)  =  .0.  )
) )
462, 3odcl 16687 . . . 4  |-  ( A  e.  X  ->  ( O `  A )  e.  NN0 )
47463ad2ant2 1018 . . 3  |-  ( ( G  e.  Mnd  /\  A  e.  X  /\  N  e.  NN0 )  -> 
( O `  A
)  e.  NN0 )
48 elnn0 10818 . . 3  |-  ( ( O `  A )  e.  NN0  <->  ( ( O `
 A )  e.  NN  \/  ( O `
 A )  =  0 ) )
4947, 48sylib 196 . 2  |-  ( ( G  e.  Mnd  /\  A  e.  X  /\  N  e.  NN0 )  -> 
( ( O `  A )  e.  NN  \/  ( O `  A
)  =  0 ) )
5018, 45, 49mpjaod 381 1  |-  ( ( G  e.  Mnd  /\  A  e.  X  /\  N  e.  NN0 )  -> 
( ( O `  A )  ||  N  <->  ( N  .x.  A )  =  .0.  ) )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 184    \/ wo 368    /\ wa 369    /\ w3a 973    = wceq 1395    e. wcel 1819    =/= wne 2652   class class class wbr 4456   ` cfv 5594  (class class class)co 6296   CCcc 9507   0cc0 9509   1c1 9510    - cmin 9824   NNcn 10556   NN0cn0 10816   ZZcz 10885   ...cfz 11697    || cdvds 13998   Basecbs 14644   0gc0g 14857   Mndcmnd 16046  .gcmg 16183   odcod 16676
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1619  ax-4 1632  ax-5 1705  ax-6 1748  ax-7 1791  ax-8 1821  ax-9 1823  ax-10 1838  ax-11 1843  ax-12 1855  ax-13 2000  ax-ext 2435  ax-rep 4568  ax-sep 4578  ax-nul 4586  ax-pow 4634  ax-pr 4695  ax-un 6591  ax-inf2 8075  ax-cnex 9565  ax-resscn 9566  ax-1cn 9567  ax-icn 9568  ax-addcl 9569  ax-addrcl 9570  ax-mulcl 9571  ax-mulrcl 9572  ax-mulcom 9573  ax-addass 9574  ax-mulass 9575  ax-distr 9576  ax-i2m1 9577  ax-1ne0 9578  ax-1rid 9579  ax-rnegex 9580  ax-rrecex 9581  ax-cnre 9582  ax-pre-lttri 9583  ax-pre-lttrn 9584  ax-pre-ltadd 9585  ax-pre-mulgt0 9586  ax-pre-sup 9587
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 974  df-3an 975  df-tru 1398  df-ex 1614  df-nf 1618  df-sb 1741  df-eu 2287  df-mo 2288  df-clab 2443  df-cleq 2449  df-clel 2452  df-nfc 2607  df-ne 2654  df-nel 2655  df-ral 2812  df-rex 2813  df-reu 2814  df-rmo 2815  df-rab 2816  df-v 3111  df-sbc 3328  df-csb 3431  df-dif 3474  df-un 3476  df-in 3478  df-ss 3485  df-pss 3487  df-nul 3794  df-if 3945  df-pw 4017  df-sn 4033  df-pr 4035  df-tp 4037  df-op 4039  df-uni 4252  df-iun 4334  df-br 4457  df-opab 4516  df-mpt 4517  df-tr 4551  df-eprel 4800  df-id 4804  df-po 4809  df-so 4810  df-fr 4847  df-we 4849  df-ord 4890  df-on 4891  df-lim 4892  df-suc 4893  df-xp 5014  df-rel 5015  df-cnv 5016  df-co 5017  df-dm 5018  df-rn 5019  df-res 5020  df-ima 5021  df-iota 5557  df-fun 5596  df-fn 5597  df-f 5598  df-f1 5599  df-fo 5600  df-f1o 5601  df-fv 5602  df-riota 6258  df-ov 6299  df-oprab 6300  df-mpt2 6301  df-om 6700  df-1st 6799  df-2nd 6800  df-recs 7060  df-rdg 7094  df-er 7329  df-en 7536  df-dom 7537  df-sdom 7538  df-sup 7919  df-pnf 9647  df-mnf 9648  df-xr 9649  df-ltxr 9650  df-le 9651  df-sub 9826  df-neg 9827  df-div 10228  df-nn 10557  df-n0 10817  df-z 10886  df-uz 11107  df-rp 11246  df-fz 11698  df-fl 11932  df-mod 12000  df-seq 12111  df-dvds 13999  df-0g 14859  df-mgm 15999  df-sgrp 16038  df-mnd 16048  df-mulg 16187  df-od 16680
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator