| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ostth1 | Structured version Visualization version GIF version | ||
| Description: - Lemma for ostth 27878: trivial case. (Not that the proof is trivial, but that we are proving that the function is trivial.) If 𝐹 is equal to 1 on the primes, then by complete induction and the multiplicative property abvmul 20990 of the absolute value, 𝐹 is equal to 1 on all the integers, and ostthlem1 27866 extends this to the other rational numbers. (Contributed by Mario Carneiro, 10-Sep-2014.) |
| Ref | Expression |
|---|---|
| qrng.q | ⊢ 𝑄 = (ℂfld ↾s ℚ) |
| qabsabv.a | ⊢ 𝐴 = (AbsVal‘𝑄) |
| padic.j | ⊢ 𝐽 = (𝑞 ∈ ℙ ↦ (𝑥 ∈ ℚ ↦ if(𝑥 = 0, 0, (𝑞↑-(𝑞 pCnt 𝑥))))) |
| ostth.k | ⊢ 𝐾 = (𝑥 ∈ ℚ ↦ if(𝑥 = 0, 0, 1)) |
| ostth.1 | ⊢ (𝜑 → 𝐹 ∈ 𝐴) |
| ostth1.2 | ⊢ (𝜑 → ∀𝑛 ∈ ℕ ¬ 1 < (𝐹‘𝑛)) |
| ostth1.3 | ⊢ (𝜑 → ∀𝑛 ∈ ℙ ¬ (𝐹‘𝑛) < 1) |
| Ref | Expression |
|---|---|
| ostth1 | ⊢ (𝜑 → 𝐹 = 𝐾) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | qrng.q | . 2 ⊢ 𝑄 = (ℂfld ↾s ℚ) | |
| 2 | qabsabv.a | . 2 ⊢ 𝐴 = (AbsVal‘𝑄) | |
| 3 | ostth.1 | . 2 ⊢ (𝜑 → 𝐹 ∈ 𝐴) | |
| 4 | 1 | qdrng 27859 | . . 3 ⊢ 𝑄 ∈ DivRing |
| 5 | 1 | qrngbas 27858 | . . . 4 ⊢ ℚ = (Base‘𝑄) |
| 6 | 1 | qrng0 27860 | . . . 4 ⊢ 0 = (0g‘𝑄) |
| 7 | ostth.k | . . . 4 ⊢ 𝐾 = (𝑥 ∈ ℚ ↦ if(𝑥 = 0, 0, 1)) | |
| 8 | 2, 5, 6, 7 | abvtriv 21003 | . . 3 ⊢ (𝑄 ∈ DivRing → 𝐾 ∈ 𝐴) |
| 9 | 4, 8 | mp1i 14 | . 2 ⊢ (𝜑 → 𝐾 ∈ 𝐴) |
| 10 | ostth1.3 | . . . . 5 ⊢ (𝜑 → ∀𝑛 ∈ ℙ ¬ (𝐹‘𝑛) < 1) | |
| 11 | 10 | r19.21bi 3254 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℙ) → ¬ (𝐹‘𝑛) < 1) |
| 12 | prmnn 16767 | . . . . 5 ⊢ (𝑛 ∈ ℙ → 𝑛 ∈ ℕ) | |
| 13 | ostth1.2 | . . . . . 6 ⊢ (𝜑 → ∀𝑛 ∈ ℕ ¬ 1 < (𝐹‘𝑛)) | |
| 14 | 13 | r19.21bi 3254 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ¬ 1 < (𝐹‘𝑛)) |
| 15 | 12, 14 | sylan2 605 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℙ) → ¬ 1 < (𝐹‘𝑛)) |
| 16 | nnq 13014 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℚ) | |
| 17 | 12, 16 | syl 18 | . . . . . 6 ⊢ (𝑛 ∈ ℙ → 𝑛 ∈ ℚ) |
| 18 | 2, 5 | abvcl 20985 | . . . . . 6 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑛 ∈ ℚ) → (𝐹‘𝑛) ∈ ℝ) |
| 19 | 3, 17, 18 | syl2an 608 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℙ) → (𝐹‘𝑛) ∈ ℝ) |
| 20 | 1re 11235 | . . . . 5 ⊢ 1 ∈ ℝ | |
| 21 | lttri3 11320 | . . . . 5 ⊢ (((𝐹‘𝑛) ∈ ℝ ∧ 1 ∈ ℝ) → ((𝐹‘𝑛) = 1 ↔ (¬ (𝐹‘𝑛) < 1 ∧ ¬ 1 < (𝐹‘𝑛)))) | |
| 22 | 19, 20, 21 | sylancl 598 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℙ) → ((𝐹‘𝑛) = 1 ↔ (¬ (𝐹‘𝑛) < 1 ∧ ¬ 1 < (𝐹‘𝑛)))) |
| 23 | 11, 15, 22 | mpbir2and 726 | . . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ ℙ) → (𝐹‘𝑛) = 1) |
| 24 | 12 | adantl 487 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℙ) → 𝑛 ∈ ℕ) |
| 25 | eqeq1 2764 | . . . . . . . 8 ⊢ (𝑥 = 𝑛 → (𝑥 = 0 ↔ 𝑛 = 0)) | |
| 26 | 25 | ifbid 4506 | . . . . . . 7 ⊢ (𝑥 = 𝑛 → if(𝑥 = 0, 0, 1) = if(𝑛 = 0, 0, 1)) |
| 27 | c0ex 11227 | . . . . . . . 8 ⊢ 0 ∈ V | |
| 28 | 1ex 11230 | . . . . . . . 8 ⊢ 1 ∈ V | |
| 29 | 27, 28 | ifex 4533 | . . . . . . 7 ⊢ if(𝑛 = 0, 0, 1) ∈ V |
| 30 | 26, 7, 29 | fvmpt 6987 | . . . . . 6 ⊢ (𝑛 ∈ ℚ → (𝐾‘𝑛) = if(𝑛 = 0, 0, 1)) |
| 31 | 16, 30 | syl 18 | . . . . 5 ⊢ (𝑛 ∈ ℕ → (𝐾‘𝑛) = if(𝑛 = 0, 0, 1)) |
| 32 | nnne0 12297 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ → 𝑛 ≠ 0) | |
| 33 | 32 | neneqd 2960 | . . . . . 6 ⊢ (𝑛 ∈ ℕ → ¬ 𝑛 = 0) |
| 34 | 33 | iffalsed 4493 | . . . . 5 ⊢ (𝑛 ∈ ℕ → if(𝑛 = 0, 0, 1) = 1) |
| 35 | 31, 34 | eqtrd 2795 | . . . 4 ⊢ (𝑛 ∈ ℕ → (𝐾‘𝑛) = 1) |
| 36 | 24, 35 | syl 18 | . . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ ℙ) → (𝐾‘𝑛) = 1) |
| 37 | 23, 36 | eqtr4d 2798 | . 2 ⊢ ((𝜑 ∧ 𝑛 ∈ ℙ) → (𝐹‘𝑛) = (𝐾‘𝑛)) |
| 38 | 1, 2, 3, 9, 37 | ostthlem2 27867 | 1 ⊢ (𝜑 → 𝐹 = 𝐾) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∀wral 3076 ifcif 4482 class class class wbr 5103 ↦ cmpt 5186 ‘cfv 6533 (class class class)co 7414 ℝcr 11126 0cc0 11127 1c1 11128 < clt 11270 -cneg 11469 ℕcn 12260 ℚcq 13000 ↑cexp 14128 ℙcprime 16764 pCnt cpc 16931 ↾s cress 17325 DivRingcdr 20893 AbsValcabv 20977 ℂfldccnfld 21588 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 ax-cnex 11183 ax-resscn 11184 ax-1cn 11185 ax-icn 11186 ax-addcl 11187 ax-addrcl 11188 ax-mulcl 11189 ax-mulrcl 11190 ax-mulcom 11191 ax-addass 11192 ax-mulass 11193 ax-distr 11194 ax-i2m1 11195 ax-1ne0 11196 ax-1rid 11197 ax-rnegex 11198 ax-rrecex 11199 ax-cnre 11200 ax-pre-lttri 11201 ax-pre-lttrn 11202 ax-pre-ltadd 11203 ax-pre-mulgt0 11204 ax-pre-sup 11205 ax-addf 11206 ax-mulf 11207 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7371 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7864 df-1st 7987 df-2nd 7988 df-tpos 8225 df-frecs 8281 df-wrecs 8312 df-recs 8361 df-rdg 8400 df-1o 8458 df-2o 8459 df-er 8699 df-map 8831 df-en 8956 df-dom 8957 df-sdom 8958 df-fin 8959 df-sup 9415 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11470 df-neg 11471 df-div 11899 df-nn 12261 df-2 12330 df-3 12331 df-4 12332 df-5 12333 df-6 12334 df-7 12335 df-8 12336 df-9 12337 df-n0 12532 df-z 12619 df-dec 12740 df-uz 12891 df-q 13001 df-rp 13046 df-ico 13407 df-fz 13565 df-seq 14069 df-exp 14129 df-cj 15189 df-re 15190 df-im 15191 df-sqrt 15325 df-abs 15326 df-dvds 16346 df-prm 16765 df-struct 17242 df-sets 17259 df-slot 17277 df-ndx 17289 df-base 17305 df-ress 17326 df-plusg 17358 df-mulr 17359 df-starv 17360 df-tset 17364 df-ple 17365 df-ds 17367 df-unif 17368 df-0g 17529 df-mgm 18733 df-sgrp 18824 df-mnd 18840 df-grp 19063 df-minusg 19064 df-subg 19249 df-cmn 19912 df-abl 19913 df-mgp 20277 df-rng 20291 df-ur 20324 df-ring 20377 df-cring 20378 df-oppr 20481 df-dvdsr 20501 df-unit 20502 df-invr 20532 df-dvr 20545 df-nzr 20676 df-subrng 20711 df-subrg 20735 df-rlreg 20859 df-domn 20860 df-drng 20895 df-abv 20978 df-cnfld 21589 |
| This theorem is used by: ostth 27878 |
| Copyright terms: Public domain | W3C validator |