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

Theorem abvpropd 20858
Description: If two structures have the same ring components, they have the same collection of absolute values. (Contributed by Mario Carneiro, 4-Oct-2015.)
Hypotheses
Ref Expression
abvpropd.1 (𝜑𝐵 = (Base‘𝐾))
abvpropd.2 (𝜑𝐵 = (Base‘𝐿))
abvpropd.3 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(+g𝐾)𝑦) = (𝑥(+g𝐿)𝑦))
abvpropd.4 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(.r𝐾)𝑦) = (𝑥(.r𝐿)𝑦))
Assertion
Ref Expression
abvpropd (𝜑 → (AbsVal‘𝐾) = (AbsVal‘𝐿))
Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝐾,𝑦   𝑥,𝐿,𝑦   𝜑,𝑥,𝑦

Proof of Theorem abvpropd
Dummy variable 𝑓 is distinct from all other variables.
StepHypRef Expression
1 abvpropd.1 . . . . 5 (𝜑𝐵 = (Base‘𝐾))
2 abvpropd.2 . . . . 5 (𝜑𝐵 = (Base‘𝐿))
3 abvpropd.3 . . . . 5 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(+g𝐾)𝑦) = (𝑥(+g𝐿)𝑦))
4 abvpropd.4 . . . . 5 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(.r𝐾)𝑦) = (𝑥(.r𝐿)𝑦))
51, 2, 3, 4ringpropd 20311 . . . 4 (𝜑 → (𝐾 ∈ Ring ↔ 𝐿 ∈ Ring))
61, 2eqtr3d 2782 . . . . . 6 (𝜑 → (Base‘𝐾) = (Base‘𝐿))
76feq2d 6733 . . . . 5 (𝜑 → (𝑓:(Base‘𝐾)⟶(0[,)+∞) ↔ 𝑓:(Base‘𝐿)⟶(0[,)+∞)))
81, 2, 3grpidpropd 18700 . . . . . . . . . . 11 (𝜑 → (0g𝐾) = (0g𝐿))
98adantr 480 . . . . . . . . . 10 ((𝜑𝑥𝐵) → (0g𝐾) = (0g𝐿))
109eqeq2d 2751 . . . . . . . . 9 ((𝜑𝑥𝐵) → (𝑥 = (0g𝐾) ↔ 𝑥 = (0g𝐿)))
1110bibi2d 342 . . . . . . . 8 ((𝜑𝑥𝐵) → (((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐾)) ↔ ((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐿))))
124fveqeq2d 6928 . . . . . . . . . . 11 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → ((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ↔ (𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦))))
133fveq2d 6924 . . . . . . . . . . . 12 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (𝑓‘(𝑥(+g𝐾)𝑦)) = (𝑓‘(𝑥(+g𝐿)𝑦)))
1413breq1d 5176 . . . . . . . . . . 11 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → ((𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)) ↔ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))))
1512, 14anbi12d 631 . . . . . . . . . 10 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))) ↔ ((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))))
1615anassrs 467 . . . . . . . . 9 (((𝜑𝑥𝐵) ∧ 𝑦𝐵) → (((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))) ↔ ((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))))
1716ralbidva 3182 . . . . . . . 8 ((𝜑𝑥𝐵) → (∀𝑦𝐵 ((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))) ↔ ∀𝑦𝐵 ((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))))
1811, 17anbi12d 631 . . . . . . 7 ((𝜑𝑥𝐵) → ((((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐾)) ∧ ∀𝑦𝐵 ((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))) ↔ (((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐿)) ∧ ∀𝑦𝐵 ((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))))))
1918ralbidva 3182 . . . . . 6 (𝜑 → (∀𝑥𝐵 (((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐾)) ∧ ∀𝑦𝐵 ((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))) ↔ ∀𝑥𝐵 (((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐿)) ∧ ∀𝑦𝐵 ((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))))))
201raleqdv 3334 . . . . . . . 8 (𝜑 → (∀𝑦𝐵 ((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))) ↔ ∀𝑦 ∈ (Base‘𝐾)((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))))
2120anbi2d 629 . . . . . . 7 (𝜑 → ((((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐾)) ∧ ∀𝑦𝐵 ((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))) ↔ (((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐾)) ∧ ∀𝑦 ∈ (Base‘𝐾)((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))))))
221, 21raleqbidv 3354 . . . . . 6 (𝜑 → (∀𝑥𝐵 (((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐾)) ∧ ∀𝑦𝐵 ((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))) ↔ ∀𝑥 ∈ (Base‘𝐾)(((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐾)) ∧ ∀𝑦 ∈ (Base‘𝐾)((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))))))
232raleqdv 3334 . . . . . . . 8 (𝜑 → (∀𝑦𝐵 ((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))) ↔ ∀𝑦 ∈ (Base‘𝐿)((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))))
2423anbi2d 629 . . . . . . 7 (𝜑 → ((((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐿)) ∧ ∀𝑦𝐵 ((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))) ↔ (((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐿)) ∧ ∀𝑦 ∈ (Base‘𝐿)((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))))))
252, 24raleqbidv 3354 . . . . . 6 (𝜑 → (∀𝑥𝐵 (((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐿)) ∧ ∀𝑦𝐵 ((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))) ↔ ∀𝑥 ∈ (Base‘𝐿)(((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐿)) ∧ ∀𝑦 ∈ (Base‘𝐿)((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))))))
2619, 22, 253bitr3d 309 . . . . 5 (𝜑 → (∀𝑥 ∈ (Base‘𝐾)(((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐾)) ∧ ∀𝑦 ∈ (Base‘𝐾)((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))) ↔ ∀𝑥 ∈ (Base‘𝐿)(((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐿)) ∧ ∀𝑦 ∈ (Base‘𝐿)((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))))))
277, 26anbi12d 631 . . . 4 (𝜑 → ((𝑓:(Base‘𝐾)⟶(0[,)+∞) ∧ ∀𝑥 ∈ (Base‘𝐾)(((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐾)) ∧ ∀𝑦 ∈ (Base‘𝐾)((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))))) ↔ (𝑓:(Base‘𝐿)⟶(0[,)+∞) ∧ ∀𝑥 ∈ (Base‘𝐿)(((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐿)) ∧ ∀𝑦 ∈ (Base‘𝐿)((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))))))
285, 27anbi12d 631 . . 3 (𝜑 → ((𝐾 ∈ Ring ∧ (𝑓:(Base‘𝐾)⟶(0[,)+∞) ∧ ∀𝑥 ∈ (Base‘𝐾)(((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐾)) ∧ ∀𝑦 ∈ (Base‘𝐾)((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))))) ↔ (𝐿 ∈ Ring ∧ (𝑓:(Base‘𝐿)⟶(0[,)+∞) ∧ ∀𝑥 ∈ (Base‘𝐿)(((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐿)) ∧ ∀𝑦 ∈ (Base‘𝐿)((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))))))))
29 eqid 2740 . . . . 5 (AbsVal‘𝐾) = (AbsVal‘𝐾)
3029abvrcl 20836 . . . 4 (𝑓 ∈ (AbsVal‘𝐾) → 𝐾 ∈ Ring)
31 eqid 2740 . . . . 5 (Base‘𝐾) = (Base‘𝐾)
32 eqid 2740 . . . . 5 (+g𝐾) = (+g𝐾)
33 eqid 2740 . . . . 5 (.r𝐾) = (.r𝐾)
34 eqid 2740 . . . . 5 (0g𝐾) = (0g𝐾)
3529, 31, 32, 33, 34isabv 20834 . . . 4 (𝐾 ∈ Ring → (𝑓 ∈ (AbsVal‘𝐾) ↔ (𝑓:(Base‘𝐾)⟶(0[,)+∞) ∧ ∀𝑥 ∈ (Base‘𝐾)(((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐾)) ∧ ∀𝑦 ∈ (Base‘𝐾)((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))))))
3630, 35biadanii 821 . . 3 (𝑓 ∈ (AbsVal‘𝐾) ↔ (𝐾 ∈ Ring ∧ (𝑓:(Base‘𝐾)⟶(0[,)+∞) ∧ ∀𝑥 ∈ (Base‘𝐾)(((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐾)) ∧ ∀𝑦 ∈ (Base‘𝐾)((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))))))
37 eqid 2740 . . . . 5 (AbsVal‘𝐿) = (AbsVal‘𝐿)
3837abvrcl 20836 . . . 4 (𝑓 ∈ (AbsVal‘𝐿) → 𝐿 ∈ Ring)
39 eqid 2740 . . . . 5 (Base‘𝐿) = (Base‘𝐿)
40 eqid 2740 . . . . 5 (+g𝐿) = (+g𝐿)
41 eqid 2740 . . . . 5 (.r𝐿) = (.r𝐿)
42 eqid 2740 . . . . 5 (0g𝐿) = (0g𝐿)
4337, 39, 40, 41, 42isabv 20834 . . . 4 (𝐿 ∈ Ring → (𝑓 ∈ (AbsVal‘𝐿) ↔ (𝑓:(Base‘𝐿)⟶(0[,)+∞) ∧ ∀𝑥 ∈ (Base‘𝐿)(((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐿)) ∧ ∀𝑦 ∈ (Base‘𝐿)((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))))))
4438, 43biadanii 821 . . 3 (𝑓 ∈ (AbsVal‘𝐿) ↔ (𝐿 ∈ Ring ∧ (𝑓:(Base‘𝐿)⟶(0[,)+∞) ∧ ∀𝑥 ∈ (Base‘𝐿)(((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐿)) ∧ ∀𝑦 ∈ (Base‘𝐿)((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))))))
4528, 36, 443bitr4g 314 . 2 (𝜑 → (𝑓 ∈ (AbsVal‘𝐾) ↔ 𝑓 ∈ (AbsVal‘𝐿)))
4645eqrdv 2738 1 (𝜑 → (AbsVal‘𝐾) = (AbsVal‘𝐿))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1537  wcel 2108  wral 3067   class class class wbr 5166  wf 6569  cfv 6573  (class class class)co 7448  0cc0 11184   + caddc 11187   · cmul 11189  +∞cpnf 11321  cle 11325  [,)cico 13409  Basecbs 17258  +gcplusg 17311  .rcmulr 17312  0gc0g 17499  Ringcrg 20260  AbsValcabv 20831
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770  ax-cnex 11240  ax-resscn 11241  ax-1cn 11242  ax-icn 11243  ax-addcl 11244  ax-addrcl 11245  ax-mulcl 11246  ax-mulrcl 11247  ax-mulcom 11248  ax-addass 11249  ax-mulass 11250  ax-distr 11251  ax-i2m1 11252  ax-1ne0 11253  ax-1rid 11254  ax-rnegex 11255  ax-rrecex 11256  ax-cnre 11257  ax-pre-lttri 11258  ax-pre-lttrn 11259  ax-pre-ltadd 11260  ax-pre-mulgt0 11261
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-nel 3053  df-ral 3068  df-rex 3077  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-tr 5284  df-id 5593  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-we 5654  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-pred 6332  df-ord 6398  df-on 6399  df-lim 6400  df-suc 6401  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-riota 7404  df-ov 7451  df-oprab 7452  df-mpo 7453  df-om 7904  df-2nd 8031  df-frecs 8322  df-wrecs 8353  df-recs 8427  df-rdg 8466  df-er 8763  df-map 8886  df-en 9004  df-dom 9005  df-sdom 9006  df-pnf 11326  df-mnf 11327  df-xr 11328  df-ltxr 11329  df-le 11330  df-sub 11522  df-neg 11523  df-nn 12294  df-2 12356  df-sets 17211  df-slot 17229  df-ndx 17241  df-base 17259  df-plusg 17324  df-0g 17501  df-mgm 18678  df-sgrp 18757  df-mnd 18773  df-grp 18976  df-mgp 20162  df-ring 20262  df-abv 20832
This theorem is referenced by:  tngnrg  24716  abvpropd2  32932
  Copyright terms: Public domain W3C validator