| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ostth1 | Structured version Visualization version GIF version | ||
| Description: - Lemma for ostth 27618: 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 20766 of the absolute value, 𝐹 is equal to 1 on all the integers, and ostthlem1 27606 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 27599 | . . 3 ⊢ 𝑄 ∈ DivRing |
| 5 | 1 | qrngbas 27598 | . . . 4 ⊢ ℚ = (Base‘𝑄) |
| 6 | 1 | qrng0 27600 | . . . 4 ⊢ 0 = (0g‘𝑄) |
| 7 | ostth.k | . . . 4 ⊢ 𝐾 = (𝑥 ∈ ℚ ↦ if(𝑥 = 0, 0, 1)) | |
| 8 | 2, 5, 6, 7 | abvtriv 20779 | . . 3 ⊢ (𝑄 ∈ DivRing → 𝐾 ∈ 𝐴) |
| 9 | 4, 8 | mp1i 13 | . 2 ⊢ (𝜑 → 𝐾 ∈ 𝐴) |
| 10 | ostth1.3 | . . . . 5 ⊢ (𝜑 → ∀𝑛 ∈ ℙ ¬ (𝐹‘𝑛) < 1) | |
| 11 | 10 | r19.21bi 3230 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℙ) → ¬ (𝐹‘𝑛) < 1) |
| 12 | prmnn 16613 | . . . . 5 ⊢ (𝑛 ∈ ℙ → 𝑛 ∈ ℕ) | |
| 13 | ostth1.2 | . . . . . 6 ⊢ (𝜑 → ∀𝑛 ∈ ℕ ¬ 1 < (𝐹‘𝑛)) | |
| 14 | 13 | r19.21bi 3230 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ¬ 1 < (𝐹‘𝑛)) |
| 15 | 12, 14 | sylan2 594 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℙ) → ¬ 1 < (𝐹‘𝑛)) |
| 16 | nnq 12887 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℚ) | |
| 17 | 12, 16 | syl 17 | . . . . . 6 ⊢ (𝑛 ∈ ℙ → 𝑛 ∈ ℚ) |
| 18 | 2, 5 | abvcl 20761 | . . . . . 6 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑛 ∈ ℚ) → (𝐹‘𝑛) ∈ ℝ) |
| 19 | 3, 17, 18 | syl2an 597 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℙ) → (𝐹‘𝑛) ∈ ℝ) |
| 20 | 1re 11144 | . . . . 5 ⊢ 1 ∈ ℝ | |
| 21 | lttri3 11228 | . . . . 5 ⊢ (((𝐹‘𝑛) ∈ ℝ ∧ 1 ∈ ℝ) → ((𝐹‘𝑛) = 1 ↔ (¬ (𝐹‘𝑛) < 1 ∧ ¬ 1 < (𝐹‘𝑛)))) | |
| 22 | 19, 20, 21 | sylancl 587 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℙ) → ((𝐹‘𝑛) = 1 ↔ (¬ (𝐹‘𝑛) < 1 ∧ ¬ 1 < (𝐹‘𝑛)))) |
| 23 | 11, 15, 22 | mpbir2and 714 | . . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ ℙ) → (𝐹‘𝑛) = 1) |
| 24 | 12 | adantl 481 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℙ) → 𝑛 ∈ ℕ) |
| 25 | eqeq1 2741 | . . . . . . . 8 ⊢ (𝑥 = 𝑛 → (𝑥 = 0 ↔ 𝑛 = 0)) | |
| 26 | 25 | ifbid 4505 | . . . . . . 7 ⊢ (𝑥 = 𝑛 → if(𝑥 = 0, 0, 1) = if(𝑛 = 0, 0, 1)) |
| 27 | c0ex 11138 | . . . . . . . 8 ⊢ 0 ∈ V | |
| 28 | 1ex 11140 | . . . . . . . 8 ⊢ 1 ∈ V | |
| 29 | 27, 28 | ifex 4532 | . . . . . . 7 ⊢ if(𝑛 = 0, 0, 1) ∈ V |
| 30 | 26, 7, 29 | fvmpt 6949 | . . . . . 6 ⊢ (𝑛 ∈ ℚ → (𝐾‘𝑛) = if(𝑛 = 0, 0, 1)) |
| 31 | 16, 30 | syl 17 | . . . . 5 ⊢ (𝑛 ∈ ℕ → (𝐾‘𝑛) = if(𝑛 = 0, 0, 1)) |
| 32 | nnne0 12191 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ → 𝑛 ≠ 0) | |
| 33 | 32 | neneqd 2938 | . . . . . 6 ⊢ (𝑛 ∈ ℕ → ¬ 𝑛 = 0) |
| 34 | 33 | iffalsed 4492 | . . . . 5 ⊢ (𝑛 ∈ ℕ → if(𝑛 = 0, 0, 1) = 1) |
| 35 | 31, 34 | eqtrd 2772 | . . . 4 ⊢ (𝑛 ∈ ℕ → (𝐾‘𝑛) = 1) |
| 36 | 24, 35 | syl 17 | . . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ ℙ) → (𝐾‘𝑛) = 1) |
| 37 | 23, 36 | eqtr4d 2775 | . 2 ⊢ ((𝜑 ∧ 𝑛 ∈ ℙ) → (𝐹‘𝑛) = (𝐾‘𝑛)) |
| 38 | 1, 2, 3, 9, 37 | ostthlem2 27607 | 1 ⊢ (𝜑 → 𝐹 = 𝐾) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∀wral 3052 ifcif 4481 class class class wbr 5100 ↦ cmpt 5181 ‘cfv 6500 (class class class)co 7368 ℝcr 11037 0cc0 11038 1c1 11039 < clt 11178 -cneg 11377 ℕcn 12157 ℚcq 12873 ↑cexp 13996 ℙcprime 16610 pCnt cpc 16776 ↾s cress 17169 DivRingcdr 20674 AbsValcabv 20753 ℂfldccnfld 21321 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 ax-pre-sup 11116 ax-addf 11117 ax-mulf 11118 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-tp 4587 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-om 7819 df-1st 7943 df-2nd 7944 df-tpos 8178 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-1o 8407 df-2o 8408 df-er 8645 df-map 8777 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-sup 9357 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 df-sub 11378 df-neg 11379 df-div 11807 df-nn 12158 df-2 12220 df-3 12221 df-4 12222 df-5 12223 df-6 12224 df-7 12225 df-8 12226 df-9 12227 df-n0 12414 df-z 12501 df-dec 12620 df-uz 12764 df-q 12874 df-rp 12918 df-ico 13279 df-fz 13436 df-seq 13937 df-exp 13997 df-cj 15034 df-re 15035 df-im 15036 df-sqrt 15170 df-abs 15171 df-dvds 16192 df-prm 16611 df-struct 17086 df-sets 17103 df-slot 17121 df-ndx 17133 df-base 17149 df-ress 17170 df-plusg 17202 df-mulr 17203 df-starv 17204 df-tset 17208 df-ple 17209 df-ds 17211 df-unif 17212 df-0g 17373 df-mgm 18577 df-sgrp 18656 df-mnd 18672 df-grp 18878 df-minusg 18879 df-subg 19065 df-cmn 19723 df-abl 19724 df-mgp 20088 df-rng 20100 df-ur 20129 df-ring 20182 df-cring 20183 df-oppr 20285 df-dvdsr 20305 df-unit 20306 df-invr 20336 df-dvr 20349 df-nzr 20458 df-subrng 20491 df-subrg 20515 df-rlreg 20639 df-domn 20640 df-drng 20676 df-abv 20754 df-cnfld 21322 |
| This theorem is referenced by: ostth 27618 |
| Copyright terms: Public domain | W3C validator |