Theorem abvfval 20913

Description: Value of the set of absolute values. (Contributed by Mario Carneiro, 8-Sep-2014.)

Hypotheses

Ref	Expression
abvfval.a	⊢ 𝐴 = (AbsVal‘𝑅)
abvfval.b	⊢ 𝐵 = (Base‘𝑅)
abvfval.p	⊢ + = (+g‘𝑅)
abvfval.t	⊢ · = (.r‘𝑅)
abvfval.z	⊢ 0 = (0g‘𝑅)

Assertion

Ref	Expression
abvfval	⊢ (𝑅 ∈ Ring → 𝐴 = {𝑓 ∈ ((0[,)+∞) ↑m 𝐵) ∣ ∀𝑥 ∈ 𝐵 (((𝑓‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ ∀𝑦 ∈ 𝐵 ((𝑓‘(𝑥 · 𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥 + 𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦))))})

Distinct variable groups:   𝑥,𝑓,𝑦,𝐵   + ,𝑓   𝑅,𝑓,𝑥,𝑦   · ,𝑓   0 ,𝑓

Allowed substitution hints:   𝐴(𝑥,𝑦,𝑓)   + (𝑥,𝑦)   · (𝑥,𝑦)   0 (𝑥,𝑦)

Proof of Theorem abvfval

Dummy variable 𝑟 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		abvfval.a	. 2 ⊢ 𝐴 = (AbsVal‘𝑅)
2		fveq2 6881	. . . . . 6 ⊢ (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
3		abvfval.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝑅)
4	2, 3	eqtr4di 2816	. . . . 5 ⊢ (𝑟 = 𝑅 → (Base‘𝑟) = 𝐵)
5	4	oveq2d 7426	. . . 4 ⊢ (𝑟 = 𝑅 → ((0[,)+∞) ↑m (Base‘𝑟)) = ((0[,)+∞) ↑m 𝐵))
6		fveq2 6881	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → (0g‘𝑟) = (0g‘𝑅))
7		abvfval.z	. . . . . . . . 9 ⊢ 0 = (0g‘𝑅)
8	6, 7	eqtr4di 2816	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (0g‘𝑟) = 0 )
9	8	eqeq2d 2774	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (𝑥 = (0g‘𝑟) ↔ 𝑥 = 0 ))
10	9	bibi2d 345	. . . . . 6 ⊢ (𝑟 = 𝑅 → (((𝑓‘𝑥) = 0 ↔ 𝑥 = (0g‘𝑟)) ↔ ((𝑓‘𝑥) = 0 ↔ 𝑥 = 0 )))
11		fveq2 6881	. . . . . . . . . . 11 ⊢ (𝑟 = 𝑅 → (.r‘𝑟) = (.r‘𝑅))
12		abvfval.t	. . . . . . . . . . 11 ⊢ · = (.r‘𝑅)
13	11, 12	eqtr4di 2816	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (.r‘𝑟) = · )
14	13	oveqd 7427	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → (𝑥(.r‘𝑟)𝑦) = (𝑥 · 𝑦))
15	14	fveqeq2d 6889	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → ((𝑓‘(𝑥(.r‘𝑟)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ↔ (𝑓‘(𝑥 · 𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦))))
16		fveq2 6881	. . . . . . . . . . . 12 ⊢ (𝑟 = 𝑅 → (+g‘𝑟) = (+g‘𝑅))
17		abvfval.p	. . . . . . . . . . . 12 ⊢ + = (+g‘𝑅)
18	16, 17	eqtr4di 2816	. . . . . . . . . . 11 ⊢ (𝑟 = 𝑅 → (+g‘𝑟) = + )
19	18	oveqd 7427	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (𝑥(+g‘𝑟)𝑦) = (𝑥 + 𝑦))
20	19	fveq2d 6885	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → (𝑓‘(𝑥(+g‘𝑟)𝑦)) = (𝑓‘(𝑥 + 𝑦)))
21	20	breq1d 5119	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → ((𝑓‘(𝑥(+g‘𝑟)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦)) ↔ (𝑓‘(𝑥 + 𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦))))
22	15, 21	anbi12d 643	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (((𝑓‘(𝑥(.r‘𝑟)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥(+g‘𝑟)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦))) ↔ ((𝑓‘(𝑥 · 𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥 + 𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦)))))
23	4, 22	raleqbidv 3338	. . . . . 6 ⊢ (𝑟 = 𝑅 → (∀𝑦 ∈ (Base‘𝑟)((𝑓‘(𝑥(.r‘𝑟)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥(+g‘𝑟)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦))) ↔ ∀𝑦 ∈ 𝐵 ((𝑓‘(𝑥 · 𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥 + 𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦)))))
24	10, 23	anbi12d 643	. . . . 5 ⊢ (𝑟 = 𝑅 → ((((𝑓‘𝑥) = 0 ↔ 𝑥 = (0g‘𝑟)) ∧ ∀𝑦 ∈ (Base‘𝑟)((𝑓‘(𝑥(.r‘𝑟)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥(+g‘𝑟)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦)))) ↔ (((𝑓‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ ∀𝑦 ∈ 𝐵 ((𝑓‘(𝑥 · 𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥 + 𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦))))))
25	4, 24	raleqbidv 3338	. . . 4 ⊢ (𝑟 = 𝑅 → (∀𝑥 ∈ (Base‘𝑟)(((𝑓‘𝑥) = 0 ↔ 𝑥 = (0g‘𝑟)) ∧ ∀𝑦 ∈ (Base‘𝑟)((𝑓‘(𝑥(.r‘𝑟)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥(+g‘𝑟)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦)))) ↔ ∀𝑥 ∈ 𝐵 (((𝑓‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ ∀𝑦 ∈ 𝐵 ((𝑓‘(𝑥 · 𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥 + 𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦))))))
26	5, 25	rabeqbidv 3434	. . 3 ⊢ (𝑟 = 𝑅 → {𝑓 ∈ ((0[,)+∞) ↑m (Base‘𝑟)) ∣ ∀𝑥 ∈ (Base‘𝑟)(((𝑓‘𝑥) = 0 ↔ 𝑥 = (0g‘𝑟)) ∧ ∀𝑦 ∈ (Base‘𝑟)((𝑓‘(𝑥(.r‘𝑟)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥(+g‘𝑟)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦))))} = {𝑓 ∈ ((0[,)+∞) ↑m 𝐵) ∣ ∀𝑥 ∈ 𝐵 (((𝑓‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ ∀𝑦 ∈ 𝐵 ((𝑓‘(𝑥 · 𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥 + 𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦))))})
27		df-abv 20912	. . 3 ⊢ AbsVal = (𝑟 ∈ Ring ↦ {𝑓 ∈ ((0[,)+∞) ↑m (Base‘𝑟)) ∣ ∀𝑥 ∈ (Base‘𝑟)(((𝑓‘𝑥) = 0 ↔ 𝑥 = (0g‘𝑟)) ∧ ∀𝑦 ∈ (Base‘𝑟)((𝑓‘(𝑥(.r‘𝑟)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥(+g‘𝑟)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦))))})
28		ovex 7443	. . . 4 ⊢ ((0[,)+∞) ↑m 𝐵) ∈ V
29	28	rabex 5309	. . 3 ⊢ {𝑓 ∈ ((0[,)+∞) ↑m 𝐵) ∣ ∀𝑥 ∈ 𝐵 (((𝑓‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ ∀𝑦 ∈ 𝐵 ((𝑓‘(𝑥 · 𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥 + 𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦))))} ∈ V
30	26, 27, 29	fvmpt 6989	. 2 ⊢ (𝑅 ∈ Ring → (AbsVal‘𝑅) = {𝑓 ∈ ((0[,)+∞) ↑m 𝐵) ∣ ∀𝑥 ∈ 𝐵 (((𝑓‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ ∀𝑦 ∈ 𝐵 ((𝑓‘(𝑥 · 𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥 + 𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦))))})
31	1, 30	eqtrid 2810	1 ⊢ (𝑅 ∈ Ring → 𝐴 = {𝑓 ∈ ((0[,)+∞) ↑m 𝐵) ∣ ∀𝑥 ∈ 𝐵 (((𝑓‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ ∀𝑦 ∈ 𝐵 ((𝑓‘(𝑥 · 𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥 + 𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦))))})

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1570   ∈ wcel 2143  ∀wral 3079  {crab 3416   class class class wbr 5109  ‘cfv 6536  (class class class)co 7410   ↑_m cmap 8820  0cc0 11095   + caddc 11098   · cmul 11100  +∞cpnf 11235   ≤ cle 11239  [,)cico 13369  Basecbs 17264  +_gcplusg 17305  ._rcmulr 17306  0_gc0g 17487  Ringcrg 20310  AbsValcabv 20911

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pr 5404

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-iota 6492  df-fun 6538  df-fv 6544  df-ov 7413  df-abv 20912

This theorem is referenced by:  isabv  20914