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

Theorem abvpropd 20810
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 20263 . . . 4 (𝜑 → (𝐾 ∈ Ring ↔ 𝐿 ∈ Ring))
61, 2eqtr3d 2778 . . . . . 6 (𝜑 → (Base‘𝐾) = (Base‘𝐿))
76feq2d 6642 . . . . 5 (𝜑 → (𝑓:(Base‘𝐾)⟶(0[,)+∞) ↔ 𝑓:(Base‘𝐿)⟶(0[,)+∞)))
81, 2, 3grpidpropd 18625 . . . . . . . . . . 11 (𝜑 → (0g𝐾) = (0g𝐿))
98adantr 482 . . . . . . . . . 10 ((𝜑𝑥𝐵) → (0g𝐾) = (0g𝐿))
109eqeq2d 2752 . . . . . . . . 9 ((𝜑𝑥𝐵) → (𝑥 = (0g𝐾) ↔ 𝑥 = (0g𝐿)))
1110bibi2d 344 . . . . . . . 8 ((𝜑𝑥𝐵) → (((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐾)) ↔ ((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐿))))
124fveqeq2d 6838 . . . . . . . . . . 11 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → ((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ↔ (𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦))))
133fveq2d 6834 . . . . . . . . . . . 12 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (𝑓‘(𝑥(+g𝐾)𝑦)) = (𝑓‘(𝑥(+g𝐿)𝑦)))
1413breq1d 5084 . . . . . . . . . . 11 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → ((𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)) ↔ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))))
1512, 14anbi12d 639 . . . . . . . . . 10 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))) ↔ ((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))))
1615anassrs 469 . . . . . . . . 9 (((𝜑𝑥𝐵) ∧ 𝑦𝐵) → (((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))) ↔ ((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))))
1716ralbidva 3162 . . . . . . . 8 ((𝜑𝑥𝐵) → (∀𝑦𝐵 ((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))) ↔ ∀𝑦𝐵 ((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))))
1811, 17anbi12d 639 . . . . . . 7 ((𝜑𝑥𝐵) → ((((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐾)) ∧ ∀𝑦𝐵 ((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))) ↔ (((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐿)) ∧ ∀𝑦𝐵 ((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))))))
1918ralbidva 3162 . . . . . 6 (𝜑 → (∀𝑥𝐵 (((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐾)) ∧ ∀𝑦𝐵 ((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))) ↔ ∀𝑥𝐵 (((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐿)) ∧ ∀𝑦𝐵 ((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))))))
201raleqdv 3299 . . . . . . . 8 (𝜑 → (∀𝑦𝐵 ((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))) ↔ ∀𝑦 ∈ (Base‘𝐾)((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))))
2120anbi2d 637 . . . . . . 7 (𝜑 → ((((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐾)) ∧ ∀𝑦𝐵 ((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))) ↔ (((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐾)) ∧ ∀𝑦 ∈ (Base‘𝐾)((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))))))
221, 21raleqbidv 3315 . . . . . 6 (𝜑 → (∀𝑥𝐵 (((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐾)) ∧ ∀𝑦𝐵 ((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))) ↔ ∀𝑥 ∈ (Base‘𝐾)(((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐾)) ∧ ∀𝑦 ∈ (Base‘𝐾)((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))))))
232raleqdv 3299 . . . . . . . 8 (𝜑 → (∀𝑦𝐵 ((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))) ↔ ∀𝑦 ∈ (Base‘𝐿)((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))))
2423anbi2d 637 . . . . . . 7 (𝜑 → ((((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐿)) ∧ ∀𝑦𝐵 ((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))) ↔ (((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐿)) ∧ ∀𝑦 ∈ (Base‘𝐿)((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))))))
252, 24raleqbidv 3315 . . . . . 6 (𝜑 → (∀𝑥𝐵 (((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐿)) ∧ ∀𝑦𝐵 ((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))) ↔ ∀𝑥 ∈ (Base‘𝐿)(((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐿)) ∧ ∀𝑦 ∈ (Base‘𝐿)((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))))))
2619, 22, 253bitr3d 311 . . . . 5 (𝜑 → (∀𝑥 ∈ (Base‘𝐾)(((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐾)) ∧ ∀𝑦 ∈ (Base‘𝐾)((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))) ↔ ∀𝑥 ∈ (Base‘𝐿)(((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐿)) ∧ ∀𝑦 ∈ (Base‘𝐿)((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))))))
277, 26anbi12d 639 . . . 4 (𝜑 → ((𝑓:(Base‘𝐾)⟶(0[,)+∞) ∧ ∀𝑥 ∈ (Base‘𝐾)(((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐾)) ∧ ∀𝑦 ∈ (Base‘𝐾)((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))))) ↔ (𝑓:(Base‘𝐿)⟶(0[,)+∞) ∧ ∀𝑥 ∈ (Base‘𝐿)(((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐿)) ∧ ∀𝑦 ∈ (Base‘𝐿)((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))))))
285, 27anbi12d 639 . . 3 (𝜑 → ((𝐾 ∈ Ring ∧ (𝑓:(Base‘𝐾)⟶(0[,)+∞) ∧ ∀𝑥 ∈ (Base‘𝐾)(((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐾)) ∧ ∀𝑦 ∈ (Base‘𝐾)((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))))) ↔ (𝐿 ∈ Ring ∧ (𝑓:(Base‘𝐿)⟶(0[,)+∞) ∧ ∀𝑥 ∈ (Base‘𝐿)(((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐿)) ∧ ∀𝑦 ∈ (Base‘𝐿)((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))))))))
29 eqid 2741 . . . . 5 (AbsVal‘𝐾) = (AbsVal‘𝐾)
3029abvrcl 20788 . . . 4 (𝑓 ∈ (AbsVal‘𝐾) → 𝐾 ∈ Ring)
31 eqid 2741 . . . . 5 (Base‘𝐾) = (Base‘𝐾)
32 eqid 2741 . . . . 5 (+g𝐾) = (+g𝐾)
33 eqid 2741 . . . . 5 (.r𝐾) = (.r𝐾)
34 eqid 2741 . . . . 5 (0g𝐾) = (0g𝐾)
3529, 31, 32, 33, 34isabv 20786 . . . 4 (𝐾 ∈ Ring → (𝑓 ∈ (AbsVal‘𝐾) ↔ (𝑓:(Base‘𝐾)⟶(0[,)+∞) ∧ ∀𝑥 ∈ (Base‘𝐾)(((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐾)) ∧ ∀𝑦 ∈ (Base‘𝐾)((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))))))
3630, 35biadanii 828 . . 3 (𝑓 ∈ (AbsVal‘𝐾) ↔ (𝐾 ∈ Ring ∧ (𝑓:(Base‘𝐾)⟶(0[,)+∞) ∧ ∀𝑥 ∈ (Base‘𝐾)(((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐾)) ∧ ∀𝑦 ∈ (Base‘𝐾)((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))))))
37 eqid 2741 . . . . 5 (AbsVal‘𝐿) = (AbsVal‘𝐿)
3837abvrcl 20788 . . . 4 (𝑓 ∈ (AbsVal‘𝐿) → 𝐿 ∈ Ring)
39 eqid 2741 . . . . 5 (Base‘𝐿) = (Base‘𝐿)
40 eqid 2741 . . . . 5 (+g𝐿) = (+g𝐿)
41 eqid 2741 . . . . 5 (.r𝐿) = (.r𝐿)
42 eqid 2741 . . . . 5 (0g𝐿) = (0g𝐿)
4337, 39, 40, 41, 42isabv 20786 . . . 4 (𝐿 ∈ Ring → (𝑓 ∈ (AbsVal‘𝐿) ↔ (𝑓:(Base‘𝐿)⟶(0[,)+∞) ∧ ∀𝑥 ∈ (Base‘𝐿)(((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐿)) ∧ ∀𝑦 ∈ (Base‘𝐿)((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))))))
4438, 43biadanii 828 . . 3 (𝑓 ∈ (AbsVal‘𝐿) ↔ (𝐿 ∈ Ring ∧ (𝑓:(Base‘𝐿)⟶(0[,)+∞) ∧ ∀𝑥 ∈ (Base‘𝐿)(((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐿)) ∧ ∀𝑦 ∈ (Base‘𝐿)((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))))))
4528, 36, 443bitr4g 316 . 2 (𝜑 → (𝑓 ∈ (AbsVal‘𝐾) ↔ 𝑓 ∈ (AbsVal‘𝐿)))
4645eqrdv 2739 1 (𝜑 → (AbsVal‘𝐾) = (AbsVal‘𝐿))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 397   = wceq 1548  wcel 2121  wral 3055   class class class wbr 5074  wf 6484  cfv 6488  (class class class)co 7359  0cc0 11034   + caddc 11037   · cmul 11039  +∞cpnf 11172  cle 11176  [,)cico 13295  Basecbs 17174  +gcplusg 17215  .rcmulr 17216  0gc0g 17397  Ringcrg 20208  AbsValcabv 20783
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-10 2154  ax-11 2170  ax-12 2191  ax-ext 2713  ax-sep 5220  ax-nul 5230  ax-pow 5296  ax-pr 5364  ax-un 7681  ax-cnex 11090  ax-resscn 11091  ax-1cn 11092  ax-icn 11093  ax-addcl 11094  ax-addrcl 11095  ax-mulcl 11096  ax-mulrcl 11097  ax-mulcom 11098  ax-addass 11099  ax-mulass 11100  ax-distr 11101  ax-i2m1 11102  ax-1ne0 11103  ax-1rid 11104  ax-rnegex 11105  ax-rrecex 11106  ax-cnre 11107  ax-pre-lttri 11108  ax-pre-lttrn 11109  ax-pre-ltadd 11110  ax-pre-mulgt0 11111
This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3or 1094  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-nf 1792  df-sb 2075  df-mo 2545  df-eu 2575  df-clab 2720  df-cleq 2733  df-clel 2816  df-nfc 2890  df-ne 2937  df-nel 3041  df-ral 3056  df-rex 3066  df-reu 3347  df-rab 3394  df-v 3435  df-sbc 3725  df-csb 3833  df-dif 3887  df-un 3889  df-in 3891  df-ss 3901  df-pss 3904  df-nul 4264  df-if 4457  df-pw 4533  df-sn 4558  df-pr 4560  df-op 4564  df-uni 4841  df-iun 4925  df-br 5075  df-opab 5137  df-mpt 5156  df-tr 5182  df-id 5515  df-eprel 5520  df-po 5528  df-so 5529  df-fr 5573  df-we 5575  df-xp 5626  df-rel 5627  df-cnv 5628  df-co 5629  df-dm 5630  df-rn 5631  df-res 5632  df-ima 5633  df-pred 6255  df-ord 6316  df-on 6317  df-lim 6318  df-suc 6319  df-iota 6444  df-fun 6490  df-fn 6491  df-f 6492  df-f1 6493  df-fo 6494  df-f1o 6495  df-fv 6496  df-riota 7316  df-ov 7362  df-oprab 7363  df-mpo 7364  df-om 7810  df-2nd 7934  df-frecs 8224  df-wrecs 8255  df-recs 8304  df-rdg 8343  df-er 8637  df-map 8769  df-en 8888  df-dom 8889  df-sdom 8890  df-pnf 11177  df-mnf 11178  df-xr 11179  df-ltxr 11180  df-le 11181  df-sub 11375  df-neg 11376  df-nn 12170  df-2 12239  df-sets 17129  df-slot 17147  df-ndx 17159  df-base 17175  df-plusg 17228  df-0g 17399  df-mgm 18603  df-sgrp 18682  df-mnd 18698  df-grp 18907  df-mgp 20116  df-ring 20210  df-abv 20784
This theorem is referenced by:  tngnrg  24660  abvpropd2  33046
  Copyright terms: Public domain W3C validator