Theorem isabv 18642

Description: Elementhood in 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
isabv	⊢ (𝑅 ∈ Ring → (𝐹 ∈ 𝐴 ↔ (𝐹:𝐵⟶(0[,)+∞) ∧ ∀𝑥 ∈ 𝐵 (((𝐹‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)))))))

Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝐹,𝑦   𝑥,𝑅,𝑦

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

Proof of Theorem isabv

Dummy variable 𝑓 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		abvfval.a	. . . 4 ⊢ 𝐴 = (AbsVal‘𝑅)
2		abvfval.b	. . . 4 ⊢ 𝐵 = (Base‘𝑅)
3		abvfval.p	. . . 4 ⊢ + = (+g‘𝑅)
4		abvfval.t	. . . 4 ⊢ · = (.r‘𝑅)
5		abvfval.z	. . . 4 ⊢ 0 = (0g‘𝑅)
6	1, 2, 3, 4, 5	abvfval 18641	. . 3 ⊢ (𝑅 ∈ Ring → 𝐴 = {𝑓 ∈ ((0[,)+∞) ↑𝑚 𝐵) ∣ ∀𝑥 ∈ 𝐵 (((𝑓‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ ∀𝑦 ∈ 𝐵 ((𝑓‘(𝑥 · 𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥 + 𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦))))})
7	6	eleq2d 2673	. 2 ⊢ (𝑅 ∈ Ring → (𝐹 ∈ 𝐴 ↔ 𝐹 ∈ {𝑓 ∈ ((0[,)+∞) ↑𝑚 𝐵) ∣ ∀𝑥 ∈ 𝐵 (((𝑓‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ ∀𝑦 ∈ 𝐵 ((𝑓‘(𝑥 · 𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥 + 𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦))))}))
8		fveq1 6102	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑥) = (𝐹‘𝑥))
9	8	eqeq1d 2612	. . . . . . 7 ⊢ (𝑓 = 𝐹 → ((𝑓‘𝑥) = 0 ↔ (𝐹‘𝑥) = 0))
10	9	bibi1d 332	. . . . . 6 ⊢ (𝑓 = 𝐹 → (((𝑓‘𝑥) = 0 ↔ 𝑥 = 0 ) ↔ ((𝐹‘𝑥) = 0 ↔ 𝑥 = 0 )))
11		fveq1 6102	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → (𝑓‘(𝑥 · 𝑦)) = (𝐹‘(𝑥 · 𝑦)))
12		fveq1 6102	. . . . . . . . . 10 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑦) = (𝐹‘𝑦))
13	8, 12	oveq12d 6567	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → ((𝑓‘𝑥) · (𝑓‘𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)))
14	11, 13	eqeq12d 2625	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → ((𝑓‘(𝑥 · 𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ↔ (𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦))))
15		fveq1 6102	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → (𝑓‘(𝑥 + 𝑦)) = (𝐹‘(𝑥 + 𝑦)))
16	8, 12	oveq12d 6567	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → ((𝑓‘𝑥) + (𝑓‘𝑦)) = ((𝐹‘𝑥) + (𝐹‘𝑦)))
17	15, 16	breq12d 4596	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → ((𝑓‘(𝑥 + 𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦)) ↔ (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦))))
18	14, 17	anbi12d 743	. . . . . . 7 ⊢ (𝑓 = 𝐹 → (((𝑓‘(𝑥 · 𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥 + 𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦))) ↔ ((𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)))))
19	18	ralbidv 2969	. . . . . 6 ⊢ (𝑓 = 𝐹 → (∀𝑦 ∈ 𝐵 ((𝑓‘(𝑥 · 𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥 + 𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦))) ↔ ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)))))
20	10, 19	anbi12d 743	. . . . 5 ⊢ (𝑓 = 𝐹 → ((((𝑓‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ ∀𝑦 ∈ 𝐵 ((𝑓‘(𝑥 · 𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥 + 𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦)))) ↔ (((𝐹‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦))))))
21	20	ralbidv 2969	. . . 4 ⊢ (𝑓 = 𝐹 → (∀𝑥 ∈ 𝐵 (((𝑓‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ ∀𝑦 ∈ 𝐵 ((𝑓‘(𝑥 · 𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥 + 𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦)))) ↔ ∀𝑥 ∈ 𝐵 (((𝐹‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦))))))
22	21	elrab 3331	. . 3 ⊢ (𝐹 ∈ {𝑓 ∈ ((0[,)+∞) ↑𝑚 𝐵) ∣ ∀𝑥 ∈ 𝐵 (((𝑓‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ ∀𝑦 ∈ 𝐵 ((𝑓‘(𝑥 · 𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥 + 𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦))))} ↔ (𝐹 ∈ ((0[,)+∞) ↑𝑚 𝐵) ∧ ∀𝑥 ∈ 𝐵 (((𝐹‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦))))))
23		ovex 6577	. . . . 5 ⊢ (0[,)+∞) ∈ V
24		fvex 6113	. . . . . 6 ⊢ (Base‘𝑅) ∈ V
25	2, 24	eqeltri 2684	. . . . 5 ⊢ 𝐵 ∈ V
26	23, 25	elmap 7772	. . . 4 ⊢ (𝐹 ∈ ((0[,)+∞) ↑𝑚 𝐵) ↔ 𝐹:𝐵⟶(0[,)+∞))
27	26	anbi1i 727	. . 3 ⊢ ((𝐹 ∈ ((0[,)+∞) ↑𝑚 𝐵) ∧ ∀𝑥 ∈ 𝐵 (((𝐹‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦))))) ↔ (𝐹:𝐵⟶(0[,)+∞) ∧ ∀𝑥 ∈ 𝐵 (((𝐹‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦))))))
28	22, 27	bitri 263	. 2 ⊢ (𝐹 ∈ {𝑓 ∈ ((0[,)+∞) ↑𝑚 𝐵) ∣ ∀𝑥 ∈ 𝐵 (((𝑓‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ ∀𝑦 ∈ 𝐵 ((𝑓‘(𝑥 · 𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥 + 𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦))))} ↔ (𝐹:𝐵⟶(0[,)+∞) ∧ ∀𝑥 ∈ 𝐵 (((𝐹‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦))))))
29	7, 28	syl6bb 275	1 ⊢ (𝑅 ∈ Ring → (𝐹 ∈ 𝐴 ↔ (𝐹:𝐵⟶(0[,)+∞) ∧ ∀𝑥 ∈ 𝐵 (((𝐹‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)))))))

Syntax hints:   → wi 4   ↔ wb 195   ∧ wa 383   = wceq 1475   ∈ wcel 1977  ∀wral 2896  {crab 2900  Vcvv 3173   class class class wbr 4583  ⟶wf 5800  ‘cfv 5804  (class class class)co 6549   ↑_𝑚 cmap 7744  0cc0 9815   + caddc 9818   · cmul 9820  +∞cpnf 9950   ≤ cle 9954  [,)cico 12048  Basecbs 15695  +_gcplusg 15768  ._rcmulr 15769  0_gc0g 15923  Ringcrg 18370  AbsValcabv 18639

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-fv 5812  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-map 7746  df-abv 18640

This theorem is referenced by:  isabvd  18643  abvfge0  18645  abveq0  18649  abvmul  18652  abvtri  18653  abvpropd  18665