| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ostth1 | Structured version Visualization version GIF version | ||
| Description: - Lemma for ostth 27623: 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 20796 of the absolute value, 𝐹 is equal to 1 on all the integers, and ostthlem1 27611 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 27604 | . . 3 ⊢ 𝑄 ∈ DivRing |
| 5 | 1 | qrngbas 27603 | . . . 4 ⊢ ℚ = (Base‘𝑄) |
| 6 | 1 | qrng0 27605 | . . . 4 ⊢ 0 = (0g‘𝑄) |
| 7 | ostth.k | . . . 4 ⊢ 𝐾 = (𝑥 ∈ ℚ ↦ if(𝑥 = 0, 0, 1)) | |
| 8 | 2, 5, 6, 7 | abvtriv 20809 | . . 3 ⊢ (𝑄 ∈ DivRing → 𝐾 ∈ 𝐴) |
| 9 | 4, 8 | mp1i 13 | . 2 ⊢ (𝜑 → 𝐾 ∈ 𝐴) |
| 10 | ostth1.3 | . . . . 5 ⊢ (𝜑 → ∀𝑛 ∈ ℙ ¬ (𝐹‘𝑛) < 1) | |
| 11 | 10 | r19.21bi 3233 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℙ) → ¬ (𝐹‘𝑛) < 1) |
| 12 | prmnn 16638 | . . . . 5 ⊢ (𝑛 ∈ ℙ → 𝑛 ∈ ℕ) | |
| 13 | ostth1.2 | . . . . . 6 ⊢ (𝜑 → ∀𝑛 ∈ ℕ ¬ 1 < (𝐹‘𝑛)) | |
| 14 | 13 | r19.21bi 3233 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ¬ 1 < (𝐹‘𝑛)) |
| 15 | 12, 14 | sylan2 600 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℙ) → ¬ 1 < (𝐹‘𝑛)) |
| 16 | nnq 12907 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℚ) | |
| 17 | 12, 16 | syl 17 | . . . . . 6 ⊢ (𝑛 ∈ ℙ → 𝑛 ∈ ℚ) |
| 18 | 2, 5 | abvcl 20791 | . . . . . 6 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑛 ∈ ℚ) → (𝐹‘𝑛) ∈ ℝ) |
| 19 | 3, 17, 18 | syl2an 603 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℙ) → (𝐹‘𝑛) ∈ ℝ) |
| 20 | 1re 11140 | . . . . 5 ⊢ 1 ∈ ℝ | |
| 21 | lttri3 11225 | . . . . 5 ⊢ (((𝐹‘𝑛) ∈ ℝ ∧ 1 ∈ ℝ) → ((𝐹‘𝑛) = 1 ↔ (¬ (𝐹‘𝑛) < 1 ∧ ¬ 1 < (𝐹‘𝑛)))) | |
| 22 | 19, 20, 21 | sylancl 593 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℙ) → ((𝐹‘𝑛) = 1 ↔ (¬ (𝐹‘𝑛) < 1 ∧ ¬ 1 < (𝐹‘𝑛)))) |
| 23 | 11, 15, 22 | mpbir2and 720 | . . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ ℙ) → (𝐹‘𝑛) = 1) |
| 24 | 12 | adantl 483 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℙ) → 𝑛 ∈ ℕ) |
| 25 | eqeq1 2745 | . . . . . . . 8 ⊢ (𝑥 = 𝑛 → (𝑥 = 0 ↔ 𝑛 = 0)) | |
| 26 | 25 | ifbid 4480 | . . . . . . 7 ⊢ (𝑥 = 𝑛 → if(𝑥 = 0, 0, 1) = if(𝑛 = 0, 0, 1)) |
| 27 | c0ex 11134 | . . . . . . . 8 ⊢ 0 ∈ V | |
| 28 | 1ex 11136 | . . . . . . . 8 ⊢ 1 ∈ V | |
| 29 | 27, 28 | ifex 4507 | . . . . . . 7 ⊢ if(𝑛 = 0, 0, 1) ∈ V |
| 30 | 26, 7, 29 | fvmpt 6938 | . . . . . 6 ⊢ (𝑛 ∈ ℚ → (𝐾‘𝑛) = if(𝑛 = 0, 0, 1)) |
| 31 | 16, 30 | syl 17 | . . . . 5 ⊢ (𝑛 ∈ ℕ → (𝐾‘𝑛) = if(𝑛 = 0, 0, 1)) |
| 32 | nnne0 12206 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ → 𝑛 ≠ 0) | |
| 33 | 32 | neneqd 2941 | . . . . . 6 ⊢ (𝑛 ∈ ℕ → ¬ 𝑛 = 0) |
| 34 | 33 | iffalsed 4467 | . . . . 5 ⊢ (𝑛 ∈ ℕ → if(𝑛 = 0, 0, 1) = 1) |
| 35 | 31, 34 | eqtrd 2776 | . . . 4 ⊢ (𝑛 ∈ ℕ → (𝐾‘𝑛) = 1) |
| 36 | 24, 35 | syl 17 | . . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ ℙ) → (𝐾‘𝑛) = 1) |
| 37 | 23, 36 | eqtr4d 2779 | . 2 ⊢ ((𝜑 ∧ 𝑛 ∈ ℙ) → (𝐹‘𝑛) = (𝐾‘𝑛)) |
| 38 | 1, 2, 3, 9, 37 | ostthlem2 27612 | 1 ⊢ (𝜑 → 𝐹 = 𝐾) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 397 = wceq 1548 ∈ wcel 2121 ∀wral 3055 ifcif 4456 class class class wbr 5074 ↦ cmpt 5155 ‘cfv 6488 (class class class)co 7359 ℝcr 11033 0cc0 11034 1c1 11035 < clt 11175 -cneg 11374 ℕcn 12169 ℚcq 12893 ↑cexp 14018 ℙcprime 16635 pCnt cpc 16802 ↾s cress 17195 DivRingcdr 20704 AbsValcabv 20783 ℂfldccnfld 21350 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-rep 5201 ax-sep 5220 ax-nul 5230 ax-pow 5296 ax-pr 5364 ax-un 7681 ax-cnex 11090 ax-resscn 11091 ax-1cn 11092 ax-icn 11093 ax-addcl 11094 ax-addrcl 11095 ax-mulcl 11096 ax-mulrcl 11097 ax-mulcom 11098 ax-addass 11099 ax-mulass 11100 ax-distr 11101 ax-i2m1 11102 ax-1ne0 11103 ax-1rid 11104 ax-rnegex 11105 ax-rrecex 11106 ax-cnre 11107 ax-pre-lttri 11108 ax-pre-lttrn 11109 ax-pre-ltadd 11110 ax-pre-mulgt0 11111 ax-pre-sup 11112 ax-addf 11113 ax-mulf 11114 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3or 1094 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-nel 3041 df-ral 3056 df-rex 3066 df-rmo 3346 df-reu 3347 df-rab 3394 df-v 3435 df-sbc 3725 df-csb 3833 df-dif 3887 df-un 3889 df-in 3891 df-ss 3901 df-pss 3904 df-nul 4264 df-if 4457 df-pw 4533 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-uni 4841 df-iun 4925 df-br 5075 df-opab 5137 df-mpt 5156 df-tr 5182 df-id 5515 df-eprel 5520 df-po 5528 df-so 5529 df-fr 5573 df-we 5575 df-xp 5626 df-rel 5627 df-cnv 5628 df-co 5629 df-dm 5630 df-rn 5631 df-res 5632 df-ima 5633 df-pred 6255 df-ord 6316 df-on 6317 df-lim 6318 df-suc 6319 df-iota 6444 df-fun 6490 df-fn 6491 df-f 6492 df-f1 6493 df-fo 6494 df-f1o 6495 df-fv 6496 df-riota 7316 df-ov 7362 df-oprab 7363 df-mpo 7364 df-om 7810 df-1st 7933 df-2nd 7934 df-tpos 8168 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8343 df-1o 8399 df-2o 8400 df-er 8637 df-map 8769 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-sup 9349 df-pnf 11177 df-mnf 11178 df-xr 11179 df-ltxr 11180 df-le 11181 df-sub 11375 df-neg 11376 df-div 11804 df-nn 12170 df-2 12239 df-3 12240 df-4 12241 df-5 12242 df-6 12243 df-7 12244 df-8 12245 df-9 12246 df-n0 12433 df-z 12520 df-dec 12640 df-uz 12784 df-q 12894 df-rp 12938 df-ico 13299 df-fz 13457 df-seq 13959 df-exp 14019 df-cj 15056 df-re 15057 df-im 15058 df-sqrt 15192 df-abs 15193 df-dvds 16217 df-prm 16636 df-struct 17112 df-sets 17129 df-slot 17147 df-ndx 17159 df-base 17175 df-ress 17196 df-plusg 17228 df-mulr 17229 df-starv 17230 df-tset 17234 df-ple 17235 df-ds 17237 df-unif 17238 df-0g 17399 df-mgm 18603 df-sgrp 18682 df-mnd 18698 df-grp 18907 df-minusg 18908 df-subg 19094 df-cmn 19751 df-abl 19752 df-mgp 20116 df-rng 20128 df-ur 20157 df-ring 20210 df-cring 20211 df-oppr 20311 df-dvdsr 20331 df-unit 20332 df-invr 20362 df-dvr 20375 df-nzr 20488 df-subrng 20521 df-subrg 20545 df-rlreg 20669 df-domn 20670 df-drng 20706 df-abv 20784 df-cnfld 21351 |
| This theorem is referenced by: ostth 27623 |
| Copyright terms: Public domain | W3C validator |