| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ostth1 | Structured version Visualization version GIF version | ||
| Description: - Lemma for ostth 27854: 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 20974 of the absolute value, 𝐹 is equal to 1 on all the integers, and ostthlem1 27842 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 27835 | . . 3 ⊢ 𝑄 ∈ DivRing |
| 5 | 1 | qrngbas 27834 | . . . 4 ⊢ ℚ = (Base‘𝑄) |
| 6 | 1 | qrng0 27836 | . . . 4 ⊢ 0 = (0g‘𝑄) |
| 7 | ostth.k | . . . 4 ⊢ 𝐾 = (𝑥 ∈ ℚ ↦ if(𝑥 = 0, 0, 1)) | |
| 8 | 2, 5, 6, 7 | abvtriv 20987 | . . 3 ⊢ (𝑄 ∈ DivRing → 𝐾 ∈ 𝐴) |
| 9 | 4, 8 | mp1i 14 | . 2 ⊢ (𝜑 → 𝐾 ∈ 𝐴) |
| 10 | ostth1.3 | . . . . 5 ⊢ (𝜑 → ∀𝑛 ∈ ℙ ¬ (𝐹‘𝑛) < 1) | |
| 11 | 10 | r19.21bi 3259 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℙ) → ¬ (𝐹‘𝑛) < 1) |
| 12 | prmnn 16754 | . . . . 5 ⊢ (𝑛 ∈ ℙ → 𝑛 ∈ ℕ) | |
| 13 | ostth1.2 | . . . . . 6 ⊢ (𝜑 → ∀𝑛 ∈ ℕ ¬ 1 < (𝐹‘𝑛)) | |
| 14 | 13 | r19.21bi 3259 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ¬ 1 < (𝐹‘𝑛)) |
| 15 | 12, 14 | sylan2 605 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℙ) → ¬ 1 < (𝐹‘𝑛)) |
| 16 | nnq 13002 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℚ) | |
| 17 | 12, 16 | syl 18 | . . . . . 6 ⊢ (𝑛 ∈ ℙ → 𝑛 ∈ ℚ) |
| 18 | 2, 5 | abvcl 20969 | . . . . . 6 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑛 ∈ ℚ) → (𝐹‘𝑛) ∈ ℝ) |
| 19 | 3, 17, 18 | syl2an 608 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℙ) → (𝐹‘𝑛) ∈ ℝ) |
| 20 | 1re 11223 | . . . . 5 ⊢ 1 ∈ ℝ | |
| 21 | lttri3 11308 | . . . . 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 2769 | . . . . . . . 8 ⊢ (𝑥 = 𝑛 → (𝑥 = 0 ↔ 𝑛 = 0)) | |
| 26 | 25 | ifbid 4513 | . . . . . . 7 ⊢ (𝑥 = 𝑛 → if(𝑥 = 0, 0, 1) = if(𝑛 = 0, 0, 1)) |
| 27 | c0ex 11215 | . . . . . . . 8 ⊢ 0 ∈ V | |
| 28 | 1ex 11218 | . . . . . . . 8 ⊢ 1 ∈ V | |
| 29 | 27, 28 | ifex 4540 | . . . . . . 7 ⊢ if(𝑛 = 0, 0, 1) ∈ V |
| 30 | 26, 7, 29 | fvmpt 6993 | . . . . . 6 ⊢ (𝑛 ∈ ℚ → (𝐾‘𝑛) = if(𝑛 = 0, 0, 1)) |
| 31 | 16, 30 | syl 18 | . . . . 5 ⊢ (𝑛 ∈ ℕ → (𝐾‘𝑛) = if(𝑛 = 0, 0, 1)) |
| 32 | nnne0 12285 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ → 𝑛 ≠ 0) | |
| 33 | 32 | neneqd 2965 | . . . . . 6 ⊢ (𝑛 ∈ ℕ → ¬ 𝑛 = 0) |
| 34 | 33 | iffalsed 4500 | . . . . 5 ⊢ (𝑛 ∈ ℕ → if(𝑛 = 0, 0, 1) = 1) |
| 35 | 31, 34 | eqtrd 2800 | . . . 4 ⊢ (𝑛 ∈ ℕ → (𝐾‘𝑛) = 1) |
| 36 | 24, 35 | syl 18 | . . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ ℙ) → (𝐾‘𝑛) = 1) |
| 37 | 23, 36 | eqtr4d 2803 | . 2 ⊢ ((𝜑 ∧ 𝑛 ∈ ℙ) → (𝐹‘𝑛) = (𝐾‘𝑛)) |
| 38 | 1, 2, 3, 9, 37 | ostthlem2 27843 | 1 ⊢ (𝜑 → 𝐹 = 𝐾) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ∀wral 3081 ifcif 4489 class class class wbr 5111 ↦ cmpt 5194 ‘cfv 6540 (class class class)co 7419 ℝcr 11114 0cc0 11115 1c1 11116 < clt 11258 -cneg 11457 ℕcn 12248 ℚcq 12988 ↑cexp 14115 ℙcprime 16751 pCnt cpc 16918 ↾s cress 17312 DivRingcdr 20877 AbsValcabv 20961 ℂfldccnfld 21572 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-cnex 11171 ax-resscn 11172 ax-1cn 11173 ax-icn 11174 ax-addcl 11175 ax-addrcl 11176 ax-mulcl 11177 ax-mulrcl 11178 ax-mulcom 11179 ax-addass 11180 ax-mulass 11181 ax-distr 11182 ax-i2m1 11183 ax-1ne0 11184 ax-1rid 11185 ax-rnegex 11186 ax-rrecex 11187 ax-cnre 11188 ax-pre-lttri 11189 ax-pre-lttrn 11190 ax-pre-ltadd 11191 ax-pre-mulgt0 11192 ax-pre-sup 11193 ax-addf 11194 ax-mulf 11195 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-tp 4596 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-om 7869 df-1st 7992 df-2nd 7993 df-tpos 8228 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-1o 8459 df-2o 8460 df-er 8700 df-map 8832 df-en 8950 df-dom 8951 df-sdom 8952 df-fin 8953 df-sup 9409 df-pnf 11260 df-mnf 11261 df-xr 11262 df-ltxr 11263 df-le 11264 df-sub 11458 df-neg 11459 df-div 11887 df-nn 12249 df-2 12318 df-3 12319 df-4 12320 df-5 12321 df-6 12322 df-7 12323 df-8 12324 df-9 12325 df-n0 12520 df-z 12607 df-dec 12728 df-uz 12879 df-q 12989 df-rp 13033 df-ico 13394 df-fz 13552 df-seq 14056 df-exp 14116 df-cj 15174 df-re 15175 df-im 15176 df-sqrt 15310 df-abs 15311 df-dvds 16333 df-prm 16752 df-struct 17229 df-sets 17246 df-slot 17264 df-ndx 17276 df-base 17292 df-ress 17313 df-plusg 17345 df-mulr 17346 df-starv 17347 df-tset 17351 df-ple 17352 df-ds 17354 df-unif 17355 df-0g 17516 df-mgm 18720 df-sgrp 18809 df-mnd 18825 df-grp 19047 df-minusg 19048 df-subg 19233 df-cmn 19896 df-abl 19897 df-mgp 20261 df-rng 20275 df-ur 20308 df-ring 20361 df-cring 20362 df-oppr 20465 df-dvdsr 20485 df-unit 20486 df-invr 20516 df-dvr 20529 df-nzr 20660 df-subrng 20695 df-subrg 20719 df-rlreg 20843 df-domn 20844 df-drng 20879 df-abv 20962 df-cnfld 21573 |
| This theorem is used by: ostth 27854 |
| Copyright terms: Public domain | W3C validator |