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

Theorem ostth1 21195
Description: - Lemma for ostth 21201: trivial case. (Not that the proof is trivial, but that we are proving that the function is trivial.) If  F is equal to  1 on the primes, then by complete induction and the multiplicative property abvmul 15845 of the absolute value,  F is equal to  1 on all the integers, and ostthlem1 21189 extends this to the other rational numbers. (Contributed by Mario Carneiro, 10-Sep-2014.)
Hypotheses
Ref Expression
qrng.q  |-  Q  =  (flds  QQ )
qabsabv.a  |-  A  =  (AbsVal `  Q )
padic.j  |-  J  =  ( q  e.  Prime  |->  ( x  e.  QQ  |->  if ( x  =  0 ,  0 ,  ( q ^ -u (
q  pCnt  x )
) ) ) )
ostth.k  |-  K  =  ( x  e.  QQ  |->  if ( x  =  0 ,  0 ,  1 ) )
ostth.1  |-  ( ph  ->  F  e.  A )
ostth1.2  |-  ( ph  ->  A. n  e.  NN  -.  1  <  ( F `
 n ) )
ostth1.3  |-  ( ph  ->  A. n  e.  Prime  -.  ( F `  n
)  <  1 )
Assertion
Ref Expression
ostth1  |-  ( ph  ->  F  =  K )
Distinct variable groups:    n, K    x, n, q, ph    A, n, q, x    Q, n, x    n, F, q, x
Allowed substitution hints:    Q( q)    J( x, n, q)    K( x, q)

Proof of Theorem ostth1
StepHypRef Expression
1 qrng.q . 2  |-  Q  =  (flds  QQ )
2 qabsabv.a . 2  |-  A  =  (AbsVal `  Q )
3 ostth.1 . 2  |-  ( ph  ->  F  e.  A )
41qdrng 21182 . . 3  |-  Q  e.  DivRing
51qrngbas 21181 . . . 4  |-  QQ  =  ( Base `  Q )
61qrng0 21183 . . . 4  |-  0  =  ( 0g `  Q )
7 ostth.k . . . 4  |-  K  =  ( x  e.  QQ  |->  if ( x  =  0 ,  0 ,  1 ) )
82, 5, 6, 7abvtriv 15857 . . 3  |-  ( Q  e.  DivRing  ->  K  e.  A
)
94, 8mp1i 12 . 2  |-  ( ph  ->  K  e.  A )
10 ostth1.3 . . . . 5  |-  ( ph  ->  A. n  e.  Prime  -.  ( F `  n
)  <  1 )
1110r19.21bi 2748 . . . 4  |-  ( (
ph  /\  n  e.  Prime )  ->  -.  ( F `  n )  <  1 )
12 prmnn 13010 . . . . 5  |-  ( n  e.  Prime  ->  n  e.  NN )
13 ostth1.2 . . . . . 6  |-  ( ph  ->  A. n  e.  NN  -.  1  <  ( F `
 n ) )
1413r19.21bi 2748 . . . . 5  |-  ( (
ph  /\  n  e.  NN )  ->  -.  1  <  ( F `  n
) )
1512, 14sylan2 461 . . . 4  |-  ( (
ph  /\  n  e.  Prime )  ->  -.  1  <  ( F `  n
) )
16 nnq 10520 . . . . . . 7  |-  ( n  e.  NN  ->  n  e.  QQ )
1712, 16syl 16 . . . . . 6  |-  ( n  e.  Prime  ->  n  e.  QQ )
182, 5abvcl 15840 . . . . . 6  |-  ( ( F  e.  A  /\  n  e.  QQ )  ->  ( F `  n
)  e.  RR )
193, 17, 18syl2an 464 . . . . 5  |-  ( (
ph  /\  n  e.  Prime )  ->  ( F `  n )  e.  RR )
20 1re 9024 . . . . 5  |-  1  e.  RR
21 lttri3 9092 . . . . 5  |-  ( ( ( F `  n
)  e.  RR  /\  1  e.  RR )  ->  ( ( F `  n )  =  1  <-> 
( -.  ( F `
 n )  <  1  /\  -.  1  <  ( F `  n
) ) ) )
2219, 20, 21sylancl 644 . . . 4  |-  ( (
ph  /\  n  e.  Prime )  ->  ( ( F `  n )  =  1  <->  ( -.  ( F `  n )  <  1  /\  -.  1  <  ( F `  n ) ) ) )
2311, 15, 22mpbir2and 889 . . 3  |-  ( (
ph  /\  n  e.  Prime )  ->  ( F `  n )  =  1 )
2412adantl 453 . . . 4  |-  ( (
ph  /\  n  e.  Prime )  ->  n  e.  NN )
25 eqeq1 2394 . . . . . . . 8  |-  ( x  =  n  ->  (
x  =  0  <->  n  =  0 ) )
2625ifbid 3701 . . . . . . 7  |-  ( x  =  n  ->  if ( x  =  0 ,  0 ,  1 )  =  if ( n  =  0 ,  0 ,  1 ) )
27 c0ex 9019 . . . . . . . 8  |-  0  e.  _V
28 1ex 9020 . . . . . . . 8  |-  1  e.  _V
2927, 28ifex 3741 . . . . . . 7  |-  if ( n  =  0 ,  0 ,  1 )  e.  _V
3026, 7, 29fvmpt 5746 . . . . . 6  |-  ( n  e.  QQ  ->  ( K `  n )  =  if ( n  =  0 ,  0 ,  1 ) )
3116, 30syl 16 . . . . 5  |-  ( n  e.  NN  ->  ( K `  n )  =  if ( n  =  0 ,  0 ,  1 ) )
32 nnne0 9965 . . . . . . 7  |-  ( n  e.  NN  ->  n  =/=  0 )
3332neneqd 2567 . . . . . 6  |-  ( n  e.  NN  ->  -.  n  =  0 )
34 iffalse 3690 . . . . . 6  |-  ( -.  n  =  0  ->  if ( n  =  0 ,  0 ,  1 )  =  1 )
3533, 34syl 16 . . . . 5  |-  ( n  e.  NN  ->  if ( n  =  0 ,  0 ,  1 )  =  1 )
3631, 35eqtrd 2420 . . . 4  |-  ( n  e.  NN  ->  ( K `  n )  =  1 )
3724, 36syl 16 . . 3  |-  ( (
ph  /\  n  e.  Prime )  ->  ( K `  n )  =  1 )
3823, 37eqtr4d 2423 . 2  |-  ( (
ph  /\  n  e.  Prime )  ->  ( F `  n )  =  ( K `  n ) )
391, 2, 3, 9, 38ostthlem2 21190 1  |-  ( ph  ->  F  =  K )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 177    /\ wa 359    = wceq 1649    e. wcel 1717   A.wral 2650   ifcif 3683   class class class wbr 4154    e. cmpt 4208   ` cfv 5395  (class class class)co 6021   RRcr 8923   0cc0 8924   1c1 8925    < clt 9054   -ucneg 9225   NNcn 9933   QQcq 10507   ^cexp 11310   Primecprime 13007    pCnt cpc 13138   ↾s cress 13398   DivRingcdr 15763  AbsValcabv 15832  ℂfldccnfld 16627
This theorem is referenced by:  ostth  21201
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1661  ax-8 1682  ax-13 1719  ax-14 1721  ax-6 1736  ax-7 1741  ax-11 1753  ax-12 1939  ax-ext 2369  ax-rep 4262  ax-sep 4272  ax-nul 4280  ax-pow 4319  ax-pr 4345  ax-un 4642  ax-cnex 8980  ax-resscn 8981  ax-1cn 8982  ax-icn 8983  ax-addcl 8984  ax-addrcl 8985  ax-mulcl 8986  ax-mulrcl 8987  ax-mulcom 8988  ax-addass 8989  ax-mulass 8990  ax-distr 8991  ax-i2m1 8992  ax-1ne0 8993  ax-1rid 8994  ax-rnegex 8995  ax-rrecex 8996  ax-cnre 8997  ax-pre-lttri 8998  ax-pre-lttrn 8999  ax-pre-ltadd 9000  ax-pre-mulgt0 9001  ax-addf 9003  ax-mulf 9004
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3or 937  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-eu 2243  df-mo 2244  df-clab 2375  df-cleq 2381  df-clel 2384  df-nfc 2513  df-ne 2553  df-nel 2554  df-ral 2655  df-rex 2656  df-reu 2657  df-rmo 2658  df-rab 2659  df-v 2902  df-sbc 3106  df-csb 3196  df-dif 3267  df-un 3269  df-in 3271  df-ss 3278  df-pss 3280  df-nul 3573  df-if 3684  df-pw 3745  df-sn 3764  df-pr 3765  df-tp 3766  df-op 3767  df-uni 3959  df-int 3994  df-iun 4038  df-br 4155  df-opab 4209  df-mpt 4210  df-tr 4245  df-eprel 4436  df-id 4440  df-po 4445  df-so 4446  df-fr 4483  df-we 4485  df-ord 4526  df-on 4527  df-lim 4528  df-suc 4529  df-om 4787  df-xp 4825  df-rel 4826  df-cnv 4827  df-co 4828  df-dm 4829  df-rn 4830  df-res 4831  df-ima 4832  df-iota 5359  df-fun 5397  df-fn 5398  df-f 5399  df-f1 5400  df-fo 5401  df-f1o 5402  df-fv 5403  df-ov 6024  df-oprab 6025  df-mpt2 6026  df-1st 6289  df-2nd 6290  df-tpos 6416  df-riota 6486  df-recs 6570  df-rdg 6605  df-1o 6661  df-2o 6662  df-oadd 6665  df-er 6842  df-map 6957  df-en 7047  df-dom 7048  df-sdom 7049  df-fin 7050  df-pnf 9056  df-mnf 9057  df-xr 9058  df-ltxr 9059  df-le 9060  df-sub 9226  df-neg 9227  df-div 9611  df-nn 9934  df-2 9991  df-3 9992  df-4 9993  df-5 9994  df-6 9995  df-7 9996  df-8 9997  df-9 9998  df-10 9999  df-n0 10155  df-z 10216  df-dec 10316  df-uz 10422  df-q 10508  df-rp 10546  df-ico 10855  df-fz 10977  df-seq 11252  df-exp 11311  df-dvds 12781  df-prm 13008  df-struct 13399  df-ndx 13400  df-slot 13401  df-base 13402  df-sets 13403  df-ress 13404  df-plusg 13470  df-mulr 13471  df-starv 13472  df-tset 13476  df-ple 13477  df-ds 13479  df-unif 13480  df-0g 13655  df-mnd 14618  df-grp 14740  df-minusg 14741  df-subg 14869  df-cmn 15342  df-mgp 15577  df-rng 15591  df-cring 15592  df-ur 15593  df-oppr 15656  df-dvdsr 15674  df-unit 15675  df-invr 15705  df-dvr 15716  df-drng 15765  df-subrg 15794  df-abv 15833  df-cnfld 16628
  Copyright terms: Public domain W3C validator