| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > padicfval | Structured version Visualization version GIF version | ||
| Description: Value of the p-adic absolute value. (Contributed by Mario Carneiro, 8-Sep-2014.) |
| Ref | Expression |
|---|---|
| padicval.j | ⊢ 𝐽 = (𝑞 ∈ ℙ ↦ (𝑥 ∈ ℚ ↦ if(𝑥 = 0, 0, (𝑞↑ -(𝑞 pCnt 𝑥))))) |
| Ref | Expression |
|---|---|
| padicfval | ⊢ (𝑃 ∈ ℙ → (𝐽‘𝑃) = (𝑥 ∈ ℚ ↦ if(𝑥 = 0, 0, (𝑃↑ -(𝑃 pCnt 𝑥))))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | id 23 | . . . . 5 ⊢ (𝑞 = 𝑃 → 𝑞 = 𝑃) | |
| 2 | oveq1 7434 | . . . . . 6 ⊢ (𝑞 = 𝑃 → (𝑞 pCnt 𝑥) = (𝑃 pCnt 𝑥)) | |
| 3 | 2 | negeqd 11561 | . . . . 5 ⊢ (𝑞 = 𝑃 → -(𝑞 pCnt 𝑥) = -(𝑃 pCnt 𝑥)) |
| 4 | 1, 3 | oveq12d 7445 | . . . 4 ⊢ (𝑞 = 𝑃 → (𝑞↑ -(𝑞 pCnt 𝑥)) = (𝑃↑ -(𝑃 pCnt 𝑥))) |
| 5 | 4 | ifeq2d 4505 | . . 3 ⊢ (𝑞 = 𝑃 → if(𝑥 = 0, 0, (𝑞↑ -(𝑞 pCnt 𝑥))) = if(𝑥 = 0, 0, (𝑃↑ -(𝑃 pCnt 𝑥)))) |
| 6 | 5 | mpteq2dv 5201 | . 2 ⊢ (𝑞 = 𝑃 → (𝑥 ∈ ℚ ↦ if(𝑥 = 0, 0, (𝑞↑ -(𝑞 pCnt 𝑥)))) = (𝑥 ∈ ℚ ↦ if(𝑥 = 0, 0, (𝑃↑ -(𝑃 pCnt 𝑥))))) |
| 7 | padicval.j | . 2 ⊢ 𝐽 = (𝑞 ∈ ℙ ↦ (𝑥 ∈ ℚ ↦ if(𝑥 = 0, 0, (𝑞↑ -(𝑞 pCnt 𝑥))))) | |
| 8 | qex 13098 | . . 3 ⊢ ℚ ∈ V | |
| 9 | 8 | mptex 7236 | . 2 ⊢ (𝑥 ∈ ℚ ↦ if(𝑥 = 0, 0, (𝑃↑ -(𝑃 pCnt 𝑥)))) ∈ V |
| 10 | 6, 7, 9 | fvmpt 7001 | 1 ⊢ (𝑃 ∈ ℙ → (𝐽‘𝑃) = (𝑥 ∈ ℚ ↦ if(𝑥 = 0, 0, (𝑃↑ -(𝑃 pCnt 𝑥))))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1569 ∈ wcel 2146 ifcif 4484 ↦ cmpt 5188 ‘cfv 6546 (class class class)co 7427 0cc0 11210 -cneg 11552 ℚcq 13085 ↑cexp 14214 ℙcprime 16858 pCnt cpc 17026 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-rep 5234 ax-sep 5251 ax-nul 5262 ax-pow 5330 ax-pr 5394 ax-un 7758 ax-cnex 11266 ax-resscn 11267 ax-1cn 11268 ax-icn 11269 ax-addcl 11270 ax-addrcl 11271 ax-mulcl 11272 ax-mulrcl 11273 ax-mulcom 11274 ax-addass 11275 ax-mulass 11276 ax-distr 11277 ax-i2m1 11278 ax-1ne0 11279 ax-1rid 11280 ax-rnegex 11281 ax-rrecex 11282 ax-cnre 11283 ax-pre-lttri 11284 ax-pre-lttrn 11285 ax-pre-ltadd 11286 ax-pre-mulgt0 11287 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4838 df-uni 4870 df-iun 4955 df-br 5106 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5549 df-eprel 5554 df-po 5562 df-so 5563 df-fr 5607 df-we 5609 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-pred 6310 df-ord 6371 df-on 6372 df-lim 6373 df-suc 6374 df-iota 6500 df-fun 6548 df-fn 6549 df-f 6550 df-f1 6551 df-fo 6552 df-f1o 6553 df-fv 6554 df-riota 7384 df-ov 7430 df-oprab 7431 df-mpo 7432 df-om 7885 df-1st 8008 df-2nd 8009 df-frecs 8310 df-wrecs 8341 df-recs 8390 df-rdg 8429 df-er 8728 df-en 8985 df-dom 8986 df-sdom 8987 df-pnf 11355 df-mnf 11356 df-xr 11357 df-ltxr 11358 df-le 11359 df-sub 11553 df-neg 11554 df-div 11984 df-nn 12346 df-z 12704 df-q 13086 |
| This theorem is used by: padicval 27956 padicabvf 27970 |
| Copyright terms: Public domain | W3C validator |