padicabvf - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > padicabvf		Structured version Visualization version GIF version

Theorem padicabvf 25037

Description: The p-adic absolute value is an absolute value. (Contributed by Mario Carneiro, 9-Sep-2014.)

**Hypotheses**
Ref	Expression
qrng.q	⊢ 𝑄 = (ℂ_fld ↾_s ℚ)
qabsabv.a	⊢ 𝐴 = (AbsVal‘𝑄)
padic.j	⊢ 𝐽 = (𝑞 ∈ ℙ ↦ (𝑥 ∈ ℚ ↦ if(𝑥 = 0, 0, (𝑞↑-(𝑞 pCnt 𝑥)))))

**Assertion**
Ref	Expression
padicabvf	⊢ 𝐽:ℙ⟶𝐴

Distinct variable groups: 𝑥,𝑞,𝐴 𝑥,𝑄 Allowed substitution hints: 𝑄(𝑞) 𝐽(𝑥,𝑞)

Proof of Theorem padicabvf Dummy variable 𝑝 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		qex 11632	. . . 4 ⊢ ℚ ∈ V
2	1	mptex 6368	. . 3 ⊢ (𝑥 ∈ ℚ ↦ if(𝑥 = 0, 0, (𝑞↑-(𝑞 pCnt 𝑥)))) ∈ V
3		padic.j	. . 3 ⊢ 𝐽 = (𝑞 ∈ ℙ ↦ (𝑥 ∈ ℚ ↦ if(𝑥 = 0, 0, (𝑞↑-(𝑞 pCnt 𝑥)))))
4	2, 3	fnmpti 5921	. 2 ⊢ 𝐽 Fn ℙ
5	3	padicfval 25022	. . . . 5 ⊢ (𝑝 ∈ ℙ → (𝐽‘𝑝) = (𝑥 ∈ ℚ ↦ if(𝑥 = 0, 0, (𝑝↑-(𝑝 pCnt 𝑥)))))
6		prmnn 15172	. . . . . . . . . . 11 ⊢ (𝑝 ∈ ℙ → 𝑝 ∈ ℕ)
7	6	ad2antrr 757	. . . . . . . . . 10 ⊢ (((𝑝 ∈ ℙ ∧ 𝑥 ∈ ℚ) ∧ ¬ 𝑥 = 0) → 𝑝 ∈ ℕ)
8	7	nncnd 10883	. . . . . . . . 9 ⊢ (((𝑝 ∈ ℙ ∧ 𝑥 ∈ ℚ) ∧ ¬ 𝑥 = 0) → 𝑝 ∈ ℂ)
9	7	nnne0d 10912	. . . . . . . . 9 ⊢ (((𝑝 ∈ ℙ ∧ 𝑥 ∈ ℚ) ∧ ¬ 𝑥 = 0) → 𝑝 ≠ 0)
10		df-ne 2781	. . . . . . . . . 10 ⊢ (𝑥 ≠ 0 ↔ ¬ 𝑥 = 0)
11		pcqcl 15345	. . . . . . . . . . 11 ⊢ ((𝑝 ∈ ℙ ∧ (𝑥 ∈ ℚ ∧ 𝑥 ≠ 0)) → (𝑝 pCnt 𝑥) ∈ ℤ)
12	11	anassrs 677	. . . . . . . . . 10 ⊢ (((𝑝 ∈ ℙ ∧ 𝑥 ∈ ℚ) ∧ 𝑥 ≠ 0) → (𝑝 pCnt 𝑥) ∈ ℤ)
13	10, 12	sylan2br 491	. . . . . . . . 9 ⊢ (((𝑝 ∈ ℙ ∧ 𝑥 ∈ ℚ) ∧ ¬ 𝑥 = 0) → (𝑝 pCnt 𝑥) ∈ ℤ)
14	8, 9, 13	expnegd 12832	. . . . . . . 8 ⊢ (((𝑝 ∈ ℙ ∧ 𝑥 ∈ ℚ) ∧ ¬ 𝑥 = 0) → (𝑝↑-(𝑝 pCnt 𝑥)) = (1 / (𝑝↑(𝑝 pCnt 𝑥))))
15	8, 9, 13	exprecd 12833	. . . . . . . 8 ⊢ (((𝑝 ∈ ℙ ∧ 𝑥 ∈ ℚ) ∧ ¬ 𝑥 = 0) → ((1 / 𝑝)↑(𝑝 pCnt 𝑥)) = (1 / (𝑝↑(𝑝 pCnt 𝑥))))
16	14, 15	eqtr4d 2646	. . . . . . 7 ⊢ (((𝑝 ∈ ℙ ∧ 𝑥 ∈ ℚ) ∧ ¬ 𝑥 = 0) → (𝑝↑-(𝑝 pCnt 𝑥)) = ((1 / 𝑝)↑(𝑝 pCnt 𝑥)))
17	16	ifeq2da 4066	. . . . . 6 ⊢ ((𝑝 ∈ ℙ ∧ 𝑥 ∈ ℚ) → if(𝑥 = 0, 0, (𝑝↑-(𝑝 pCnt 𝑥))) = if(𝑥 = 0, 0, ((1 / 𝑝)↑(𝑝 pCnt 𝑥))))
18	17	mpteq2dva 4666	. . . . 5 ⊢ (𝑝 ∈ ℙ → (𝑥 ∈ ℚ ↦ if(𝑥 = 0, 0, (𝑝↑-(𝑝 pCnt 𝑥)))) = (𝑥 ∈ ℚ ↦ if(𝑥 = 0, 0, ((1 / 𝑝)↑(𝑝 pCnt 𝑥)))))
19	5, 18	eqtrd 2643	. . . 4 ⊢ (𝑝 ∈ ℙ → (𝐽‘𝑝) = (𝑥 ∈ ℚ ↦ if(𝑥 = 0, 0, ((1 / 𝑝)↑(𝑝 pCnt 𝑥)))))
20	6	nnrecred 10913	. . . . . 6 ⊢ (𝑝 ∈ ℙ → (1 / 𝑝) ∈ ℝ)
21	6	nnred 10882	. . . . . . . 8 ⊢ (𝑝 ∈ ℙ → 𝑝 ∈ ℝ)
22		prmgt1 15193	. . . . . . . 8 ⊢ (𝑝 ∈ ℙ → 1 < 𝑝)
23		recgt1i 10769	. . . . . . . 8 ⊢ ((𝑝 ∈ ℝ ∧ 1 < 𝑝) → (0 < (1 / 𝑝) ∧ (1 / 𝑝) < 1))
24	21, 22, 23	syl2anc 690	. . . . . . 7 ⊢ (𝑝 ∈ ℙ → (0 < (1 / 𝑝) ∧ (1 / 𝑝) < 1))
25	24	simpld 473	. . . . . 6 ⊢ (𝑝 ∈ ℙ → 0 < (1 / 𝑝))
26	24	simprd 477	. . . . . 6 ⊢ (𝑝 ∈ ℙ → (1 / 𝑝) < 1)
27		0xr 9942	. . . . . . 7 ⊢ 0 ∈ ℝ^*
28		1re 9895	. . . . . . . 8 ⊢ 1 ∈ ℝ
29	28	rexri 9948	. . . . . . 7 ⊢ 1 ∈ ℝ^*
30		elioo2 12043	. . . . . . 7 ⊢ ((0 ∈ ℝ^* ∧ 1 ∈ ℝ^*) → ((1 / 𝑝) ∈ (0(,)1) ↔ ((1 / 𝑝) ∈ ℝ ∧ 0 < (1 / 𝑝) ∧ (1 / 𝑝) < 1)))
31	27, 29, 30	mp2an 703	. . . . . 6 ⊢ ((1 / 𝑝) ∈ (0(,)1) ↔ ((1 / 𝑝) ∈ ℝ ∧ 0 < (1 / 𝑝) ∧ (1 / 𝑝) < 1))
32	20, 25, 26, 31	syl3anbrc 1238	. . . . 5 ⊢ (𝑝 ∈ ℙ → (1 / 𝑝) ∈ (0(,)1))
33		qrng.q	. . . . . 6 ⊢ 𝑄 = (ℂ_fld ↾_s ℚ)
34		qabsabv.a	. . . . . 6 ⊢ 𝐴 = (AbsVal‘𝑄)
35		eqid 2609	. . . . . 6 ⊢ (𝑥 ∈ ℚ ↦ if(𝑥 = 0, 0, ((1 / 𝑝)↑(𝑝 pCnt 𝑥)))) = (𝑥 ∈ ℚ ↦ if(𝑥 = 0, 0, ((1 / 𝑝)↑(𝑝 pCnt 𝑥))))
36	33, 34, 35	padicabv 25036	. . . . 5 ⊢ ((𝑝 ∈ ℙ ∧ (1 / 𝑝) ∈ (0(,)1)) → (𝑥 ∈ ℚ ↦ if(𝑥 = 0, 0, ((1 / 𝑝)↑(𝑝 pCnt 𝑥)))) ∈ 𝐴)
37	32, 36	mpdan 698	. . . 4 ⊢ (𝑝 ∈ ℙ → (𝑥 ∈ ℚ ↦ if(𝑥 = 0, 0, ((1 / 𝑝)↑(𝑝 pCnt 𝑥)))) ∈ 𝐴)
38	19, 37	eqeltrd 2687	. . 3 ⊢ (𝑝 ∈ ℙ → (𝐽‘𝑝) ∈ 𝐴)
39	38	rgen 2905	. 2 ⊢ ∀𝑝 ∈ ℙ (𝐽‘𝑝) ∈ 𝐴
40		ffnfv 6280	. 2 ⊢ (𝐽:ℙ⟶𝐴 ↔ (𝐽 Fn ℙ ∧ ∀𝑝 ∈ ℙ (𝐽‘𝑝) ∈ 𝐴))
41	4, 39, 40	mpbir2an 956	1 ⊢ 𝐽:ℙ⟶𝐴

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 ↔ wb 194 ∧ wa 382 ∧ w3a 1030 = wceq 1474 ∈ wcel 1976 ≠ wne 2779 ∀wral 2895 ifcif 4035 class class class wbr 4577 ↦ cmpt 4637 Fn wfn 5785 ⟶wf 5786 ‘cfv 5790 (class class class)co 6527 ℝcr 9791 0cc0 9792 1c1 9793 ℝ^*cxr 9929 < clt 9930 -cneg 10118 / cdiv 10533 ℕcn 10867 ℤcz 11210 ℚcq 11620 (,)cioo 12002 ↑cexp 12677 ℙcprime 15169 pCnt cpc 15325 ↾_s cress 15642 AbsValcabv 18585 ℂ_fldccnfld 19513

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1712 ax-4 1727 ax-5 1826 ax-6 1874 ax-7 1921 ax-8 1978 ax-9 1985 ax-10 2005 ax-11 2020 ax-12 2033 ax-13 2233 ax-ext 2589 ax-rep 4693 ax-sep 4703 ax-nul 4712 ax-pow 4764 ax-pr 4828 ax-un 6824 ax-cnex 9848 ax-resscn 9849 ax-1cn 9850 ax-icn 9851 ax-addcl 9852 ax-addrcl 9853 ax-mulcl 9854 ax-mulrcl 9855 ax-mulcom 9856 ax-addass 9857 ax-mulass 9858 ax-distr 9859 ax-i2m1 9860 ax-1ne0 9861 ax-1rid 9862 ax-rnegex 9863 ax-rrecex 9864 ax-cnre 9865 ax-pre-lttri 9866 ax-pre-lttrn 9867 ax-pre-ltadd 9868 ax-pre-mulgt0 9869 ax-pre-sup 9870 ax-addf 9871 ax-mulf 9872

This theorem depends on definitions: df-bi 195 df-or 383 df-an 384 df-3or 1031 df-3an 1032 df-tru 1477 df-ex 1695 df-nf 1700 df-sb 1867 df-eu 2461 df-mo 2462 df-clab 2596 df-cleq 2602 df-clel 2605 df-nfc 2739 df-ne 2781 df-nel 2782 df-ral 2900 df-rex 2901 df-reu 2902 df-rmo 2903 df-rab 2904 df-v 3174 df-sbc 3402 df-csb 3499 df-dif 3542 df-un 3544 df-in 3546 df-ss 3553 df-pss 3555 df-nul 3874 df-if 4036 df-pw 4109 df-sn 4125 df-pr 4127 df-tp 4129 df-op 4131 df-uni 4367 df-int 4405 df-iun 4451 df-br 4578 df-opab 4638 df-mpt 4639 df-tr 4675 df-eprel 4939 df-id 4943 df-po 4949 df-so 4950 df-fr 4987 df-we 4989 df-xp 5034 df-rel 5035 df-cnv 5036 df-co 5037 df-dm 5038 df-rn 5039 df-res 5040 df-ima 5041 df-pred 5583 df-ord 5629 df-on 5630 df-lim 5631 df-suc 5632 df-iota 5754 df-fun 5792 df-fn 5793 df-f 5794 df-f1 5795 df-fo 5796 df-f1o 5797 df-fv 5798 df-riota 6489 df-ov 6530 df-oprab 6531 df-mpt2 6532 df-om 6935 df-1st 7036 df-2nd 7037 df-tpos 7216 df-wrecs 7271 df-recs 7332 df-rdg 7370 df-1o 7424 df-2o 7425 df-oadd 7428 df-er 7606 df-map 7723 df-en 7819 df-dom 7820 df-sdom 7821 df-fin 7822 df-sup 8208 df-inf 8209 df-pnf 9932 df-mnf 9933 df-xr 9934 df-ltxr 9935 df-le 9936 df-sub 10119 df-neg 10120 df-div 10534 df-nn 10868 df-2 10926 df-3 10927 df-4 10928 df-5 10929 df-6 10930 df-7 10931 df-8 10932 df-9 10933 df-n0 11140 df-z 11211 df-dec 11326 df-uz 11520 df-q 11621 df-rp 11665 df-ioo 12006 df-ico 12008 df-fz 12153 df-fl 12410 df-mod 12486 df-seq 12619 df-exp 12678 df-cj 13633 df-re 13634 df-im 13635 df-sqrt 13769 df-abs 13770 df-dvds 14768 df-gcd 15001 df-prm 15170 df-pc 15326 df-struct 15643 df-ndx 15644 df-slot 15645 df-base 15646 df-sets 15647 df-ress 15648 df-plusg 15727 df-mulr 15728 df-starv 15729 df-tset 15733 df-ple 15734 df-ds 15737 df-unif 15738 df-0g 15871 df-mgm 17011 df-sgrp 17053 df-mnd 17064 df-grp 17194 df-minusg 17195 df-subg 17360 df-cmn 17964 df-mgp 18259 df-ur 18271 df-ring 18318 df-cring 18319 df-oppr 18392 df-dvdsr 18410 df-unit 18411 df-invr 18441 df-dvr 18452 df-drng 18518 df-subrg 18547 df-abv 18586 df-cnfld 19514

This theorem is referenced by: ostth 25045

W3C validator