Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ostth1 | Structured version Visualization version GIF version |
Description: - Lemma for ostth 26692: 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 20004 of the absolute value, 𝐹 is equal to 1 on all the integers, and ostthlem1 26680 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 26673 | . . 3 ⊢ 𝑄 ∈ DivRing |
5 | 1 | qrngbas 26672 | . . . 4 ⊢ ℚ = (Base‘𝑄) |
6 | 1 | qrng0 26674 | . . . 4 ⊢ 0 = (0g‘𝑄) |
7 | ostth.k | . . . 4 ⊢ 𝐾 = (𝑥 ∈ ℚ ↦ if(𝑥 = 0, 0, 1)) | |
8 | 2, 5, 6, 7 | abvtriv 20016 | . . 3 ⊢ (𝑄 ∈ DivRing → 𝐾 ∈ 𝐴) |
9 | 4, 8 | mp1i 13 | . 2 ⊢ (𝜑 → 𝐾 ∈ 𝐴) |
10 | ostth1.3 | . . . . 5 ⊢ (𝜑 → ∀𝑛 ∈ ℙ ¬ (𝐹‘𝑛) < 1) | |
11 | 10 | r19.21bi 3132 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℙ) → ¬ (𝐹‘𝑛) < 1) |
12 | prmnn 16307 | . . . . 5 ⊢ (𝑛 ∈ ℙ → 𝑛 ∈ ℕ) | |
13 | ostth1.2 | . . . . . 6 ⊢ (𝜑 → ∀𝑛 ∈ ℕ ¬ 1 < (𝐹‘𝑛)) | |
14 | 13 | r19.21bi 3132 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ¬ 1 < (𝐹‘𝑛)) |
15 | 12, 14 | sylan2 592 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℙ) → ¬ 1 < (𝐹‘𝑛)) |
16 | nnq 12631 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℚ) | |
17 | 12, 16 | syl 17 | . . . . . 6 ⊢ (𝑛 ∈ ℙ → 𝑛 ∈ ℚ) |
18 | 2, 5 | abvcl 19999 | . . . . . 6 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑛 ∈ ℚ) → (𝐹‘𝑛) ∈ ℝ) |
19 | 3, 17, 18 | syl2an 595 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℙ) → (𝐹‘𝑛) ∈ ℝ) |
20 | 1re 10906 | . . . . 5 ⊢ 1 ∈ ℝ | |
21 | lttri3 10989 | . . . . 5 ⊢ (((𝐹‘𝑛) ∈ ℝ ∧ 1 ∈ ℝ) → ((𝐹‘𝑛) = 1 ↔ (¬ (𝐹‘𝑛) < 1 ∧ ¬ 1 < (𝐹‘𝑛)))) | |
22 | 19, 20, 21 | sylancl 585 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℙ) → ((𝐹‘𝑛) = 1 ↔ (¬ (𝐹‘𝑛) < 1 ∧ ¬ 1 < (𝐹‘𝑛)))) |
23 | 11, 15, 22 | mpbir2and 709 | . . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ ℙ) → (𝐹‘𝑛) = 1) |
24 | 12 | adantl 481 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℙ) → 𝑛 ∈ ℕ) |
25 | eqeq1 2742 | . . . . . . . 8 ⊢ (𝑥 = 𝑛 → (𝑥 = 0 ↔ 𝑛 = 0)) | |
26 | 25 | ifbid 4479 | . . . . . . 7 ⊢ (𝑥 = 𝑛 → if(𝑥 = 0, 0, 1) = if(𝑛 = 0, 0, 1)) |
27 | c0ex 10900 | . . . . . . . 8 ⊢ 0 ∈ V | |
28 | 1ex 10902 | . . . . . . . 8 ⊢ 1 ∈ V | |
29 | 27, 28 | ifex 4506 | . . . . . . 7 ⊢ if(𝑛 = 0, 0, 1) ∈ V |
30 | 26, 7, 29 | fvmpt 6857 | . . . . . 6 ⊢ (𝑛 ∈ ℚ → (𝐾‘𝑛) = if(𝑛 = 0, 0, 1)) |
31 | 16, 30 | syl 17 | . . . . 5 ⊢ (𝑛 ∈ ℕ → (𝐾‘𝑛) = if(𝑛 = 0, 0, 1)) |
32 | nnne0 11937 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ → 𝑛 ≠ 0) | |
33 | 32 | neneqd 2947 | . . . . . 6 ⊢ (𝑛 ∈ ℕ → ¬ 𝑛 = 0) |
34 | 33 | iffalsed 4467 | . . . . 5 ⊢ (𝑛 ∈ ℕ → if(𝑛 = 0, 0, 1) = 1) |
35 | 31, 34 | eqtrd 2778 | . . . 4 ⊢ (𝑛 ∈ ℕ → (𝐾‘𝑛) = 1) |
36 | 24, 35 | syl 17 | . . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ ℙ) → (𝐾‘𝑛) = 1) |
37 | 23, 36 | eqtr4d 2781 | . 2 ⊢ ((𝜑 ∧ 𝑛 ∈ ℙ) → (𝐹‘𝑛) = (𝐾‘𝑛)) |
38 | 1, 2, 3, 9, 37 | ostthlem2 26681 | 1 ⊢ (𝜑 → 𝐹 = 𝐾) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1539 ∈ wcel 2108 ∀wral 3063 ifcif 4456 class class class wbr 5070 ↦ cmpt 5153 ‘cfv 6418 (class class class)co 7255 ℝcr 10801 0cc0 10802 1c1 10803 < clt 10940 -cneg 11136 ℕcn 11903 ℚcq 12617 ↑cexp 13710 ℙcprime 16304 pCnt cpc 16465 ↾s cress 16867 DivRingcdr 19906 AbsValcabv 19991 ℂfldccnfld 20510 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 ax-pre-sup 10880 ax-addf 10881 ax-mulf 10882 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-1st 7804 df-2nd 7805 df-tpos 8013 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-1o 8267 df-2o 8268 df-er 8456 df-map 8575 df-en 8692 df-dom 8693 df-sdom 8694 df-fin 8695 df-sup 9131 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-div 11563 df-nn 11904 df-2 11966 df-3 11967 df-4 11968 df-5 11969 df-6 11970 df-7 11971 df-8 11972 df-9 11973 df-n0 12164 df-z 12250 df-dec 12367 df-uz 12512 df-q 12618 df-rp 12660 df-ico 13014 df-fz 13169 df-seq 13650 df-exp 13711 df-cj 14738 df-re 14739 df-im 14740 df-sqrt 14874 df-abs 14875 df-dvds 15892 df-prm 16305 df-struct 16776 df-sets 16793 df-slot 16811 df-ndx 16823 df-base 16841 df-ress 16868 df-plusg 16901 df-mulr 16902 df-starv 16903 df-tset 16907 df-ple 16908 df-ds 16910 df-unif 16911 df-0g 17069 df-mgm 18241 df-sgrp 18290 df-mnd 18301 df-grp 18495 df-minusg 18496 df-subg 18667 df-cmn 19303 df-mgp 19636 df-ur 19653 df-ring 19700 df-cring 19701 df-oppr 19777 df-dvdsr 19798 df-unit 19799 df-invr 19829 df-dvr 19840 df-drng 19908 df-subrg 19937 df-abv 19992 df-cnfld 20511 |
This theorem is referenced by: ostth 26692 |
Copyright terms: Public domain | W3C validator |