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

Theorem abvfval 20782
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.
StepHypRef Expression
1 abvfval.a . 2 𝐴 = (AbsVal‘𝑅)
2 fveq2 6827 . . . . . 6 (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
3 abvfval.b . . . . . 6 𝐵 = (Base‘𝑅)
42, 3eqtr4di 2792 . . . . 5 (𝑟 = 𝑅 → (Base‘𝑟) = 𝐵)
54oveq2d 7372 . . . 4 (𝑟 = 𝑅 → ((0[,)+∞) ↑m (Base‘𝑟)) = ((0[,)+∞) ↑m 𝐵))
6 fveq2 6827 . . . . . . . . 9 (𝑟 = 𝑅 → (0g𝑟) = (0g𝑅))
7 abvfval.z . . . . . . . . 9 0 = (0g𝑅)
86, 7eqtr4di 2792 . . . . . . . 8 (𝑟 = 𝑅 → (0g𝑟) = 0 )
98eqeq2d 2750 . . . . . . 7 (𝑟 = 𝑅 → (𝑥 = (0g𝑟) ↔ 𝑥 = 0 ))
109bibi2d 343 . . . . . 6 (𝑟 = 𝑅 → (((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝑟)) ↔ ((𝑓𝑥) = 0 ↔ 𝑥 = 0 )))
11 fveq2 6827 . . . . . . . . . . 11 (𝑟 = 𝑅 → (.r𝑟) = (.r𝑅))
12 abvfval.t . . . . . . . . . . 11 · = (.r𝑅)
1311, 12eqtr4di 2792 . . . . . . . . . 10 (𝑟 = 𝑅 → (.r𝑟) = · )
1413oveqd 7373 . . . . . . . . 9 (𝑟 = 𝑅 → (𝑥(.r𝑟)𝑦) = (𝑥 · 𝑦))
1514fveqeq2d 6835 . . . . . . . 8 (𝑟 = 𝑅 → ((𝑓‘(𝑥(.r𝑟)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ↔ (𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) · (𝑓𝑦))))
16 fveq2 6827 . . . . . . . . . . . 12 (𝑟 = 𝑅 → (+g𝑟) = (+g𝑅))
17 abvfval.p . . . . . . . . . . . 12 + = (+g𝑅)
1816, 17eqtr4di 2792 . . . . . . . . . . 11 (𝑟 = 𝑅 → (+g𝑟) = + )
1918oveqd 7373 . . . . . . . . . 10 (𝑟 = 𝑅 → (𝑥(+g𝑟)𝑦) = (𝑥 + 𝑦))
2019fveq2d 6831 . . . . . . . . 9 (𝑟 = 𝑅 → (𝑓‘(𝑥(+g𝑟)𝑦)) = (𝑓‘(𝑥 + 𝑦)))
2120breq1d 5082 . . . . . . . 8 (𝑟 = 𝑅 → ((𝑓‘(𝑥(+g𝑟)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)) ↔ (𝑓‘(𝑥 + 𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))))
2215, 21anbi12d 638 . . . . . . 7 (𝑟 = 𝑅 → (((𝑓‘(𝑥(.r𝑟)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝑟)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))) ↔ ((𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥 + 𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))))
234, 22raleqbidv 3313 . . . . . 6 (𝑟 = 𝑅 → (∀𝑦 ∈ (Base‘𝑟)((𝑓‘(𝑥(.r𝑟)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝑟)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))) ↔ ∀𝑦𝐵 ((𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥 + 𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))))
2410, 23anbi12d 638 . . . . 5 (𝑟 = 𝑅 → ((((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝑟)) ∧ ∀𝑦 ∈ (Base‘𝑟)((𝑓‘(𝑥(.r𝑟)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝑟)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))) ↔ (((𝑓𝑥) = 0 ↔ 𝑥 = 0 ) ∧ ∀𝑦𝐵 ((𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥 + 𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))))))
254, 24raleqbidv 3313 . . . 4 (𝑟 = 𝑅 → (∀𝑥 ∈ (Base‘𝑟)(((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝑟)) ∧ ∀𝑦 ∈ (Base‘𝑟)((𝑓‘(𝑥(.r𝑟)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝑟)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))) ↔ ∀𝑥𝐵 (((𝑓𝑥) = 0 ↔ 𝑥 = 0 ) ∧ ∀𝑦𝐵 ((𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥 + 𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))))))
265, 25rabeqbidv 3409 . . 3 (𝑟 = 𝑅 → {𝑓 ∈ ((0[,)+∞) ↑m (Base‘𝑟)) ∣ ∀𝑥 ∈ (Base‘𝑟)(((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝑟)) ∧ ∀𝑦 ∈ (Base‘𝑟)((𝑓‘(𝑥(.r𝑟)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝑟)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))))} = {𝑓 ∈ ((0[,)+∞) ↑m 𝐵) ∣ ∀𝑥𝐵 (((𝑓𝑥) = 0 ↔ 𝑥 = 0 ) ∧ ∀𝑦𝐵 ((𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥 + 𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))))})
27 df-abv 20781 . . 3 AbsVal = (𝑟 ∈ Ring ↦ {𝑓 ∈ ((0[,)+∞) ↑m (Base‘𝑟)) ∣ ∀𝑥 ∈ (Base‘𝑟)(((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝑟)) ∧ ∀𝑦 ∈ (Base‘𝑟)((𝑓‘(𝑥(.r𝑟)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝑟)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))))})
28 ovex 7389 . . . 4 ((0[,)+∞) ↑m 𝐵) ∈ V
2928rabex 5267 . . 3 {𝑓 ∈ ((0[,)+∞) ↑m 𝐵) ∣ ∀𝑥𝐵 (((𝑓𝑥) = 0 ↔ 𝑥 = 0 ) ∧ ∀𝑦𝐵 ((𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥 + 𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))))} ∈ V
3026, 27, 29fvmpt 6935 . 2 (𝑅 ∈ Ring → (AbsVal‘𝑅) = {𝑓 ∈ ((0[,)+∞) ↑m 𝐵) ∣ ∀𝑥𝐵 (((𝑓𝑥) = 0 ↔ 𝑥 = 0 ) ∧ ∀𝑦𝐵 ((𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥 + 𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))))})
311, 30eqtrid 2786 1 (𝑅 ∈ Ring → 𝐴 = {𝑓 ∈ ((0[,)+∞) ↑m 𝐵) ∣ ∀𝑥𝐵 (((𝑓𝑥) = 0 ↔ 𝑥 = 0 ) ∧ ∀𝑦𝐵 ((𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥 + 𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))))})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396   = wceq 1547  wcel 2119  wral 3053  {crab 3391   class class class wbr 5072  cfv 6485  (class class class)co 7356  m cmap 8763  0cc0 11029   + caddc 11032   · cmul 11034  +∞cpnf 11167  cle 11171  [,)cico 13291  Basecbs 17170  +gcplusg 17211  .rcmulr 17212  0gc0g 17393  Ringcrg 20205  AbsValcabv 20780
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-sep 5218  ax-nul 5228  ax-pr 5362
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-br 5073  df-opab 5135  df-mpt 5154  df-id 5513  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-iota 6441  df-fun 6487  df-fv 6493  df-ov 7359  df-abv 20781
This theorem is referenced by:  isabv  20783
  Copyright terms: Public domain W3C validator