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

Theorem abvpropd 20766
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 20221 . . . 4 (𝜑 → (𝐾 ∈ Ring ↔ 𝐿 ∈ Ring))
61, 2eqtr3d 2771 . . . . . 6 (𝜑 → (Base‘𝐾) = (Base‘𝐿))
76feq2d 6644 . . . . 5 (𝜑 → (𝑓:(Base‘𝐾)⟶(0[,)+∞) ↔ 𝑓:(Base‘𝐿)⟶(0[,)+∞)))
81, 2, 3grpidpropd 18585 . . . . . . . . . . 11 (𝜑 → (0g𝐾) = (0g𝐿))
98adantr 480 . . . . . . . . . 10 ((𝜑𝑥𝐵) → (0g𝐾) = (0g𝐿))
109eqeq2d 2745 . . . . . . . . 9 ((𝜑𝑥𝐵) → (𝑥 = (0g𝐾) ↔ 𝑥 = (0g𝐿)))
1110bibi2d 342 . . . . . . . 8 ((𝜑𝑥𝐵) → (((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐾)) ↔ ((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐿))))
124fveqeq2d 6840 . . . . . . . . . . 11 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → ((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ↔ (𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦))))
133fveq2d 6836 . . . . . . . . . . . 12 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (𝑓‘(𝑥(+g𝐾)𝑦)) = (𝑓‘(𝑥(+g𝐿)𝑦)))
1413breq1d 5106 . . . . . . . . . . 11 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → ((𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)) ↔ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))))
1512, 14anbi12d 632 . . . . . . . . . 10 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))) ↔ ((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))))
1615anassrs 467 . . . . . . . . 9 (((𝜑𝑥𝐵) ∧ 𝑦𝐵) → (((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))) ↔ ((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))))
1716ralbidva 3155 . . . . . . . 8 ((𝜑𝑥𝐵) → (∀𝑦𝐵 ((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))) ↔ ∀𝑦𝐵 ((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))))
1811, 17anbi12d 632 . . . . . . 7 ((𝜑𝑥𝐵) → ((((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐾)) ∧ ∀𝑦𝐵 ((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))) ↔ (((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐿)) ∧ ∀𝑦𝐵 ((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))))))
1918ralbidva 3155 . . . . . 6 (𝜑 → (∀𝑥𝐵 (((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐾)) ∧ ∀𝑦𝐵 ((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))) ↔ ∀𝑥𝐵 (((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐿)) ∧ ∀𝑦𝐵 ((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))))))
201raleqdv 3294 . . . . . . . 8 (𝜑 → (∀𝑦𝐵 ((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))) ↔ ∀𝑦 ∈ (Base‘𝐾)((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))))
2120anbi2d 630 . . . . . . 7 (𝜑 → ((((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐾)) ∧ ∀𝑦𝐵 ((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))) ↔ (((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐾)) ∧ ∀𝑦 ∈ (Base‘𝐾)((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))))))
221, 21raleqbidv 3314 . . . . . 6 (𝜑 → (∀𝑥𝐵 (((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐾)) ∧ ∀𝑦𝐵 ((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))) ↔ ∀𝑥 ∈ (Base‘𝐾)(((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐾)) ∧ ∀𝑦 ∈ (Base‘𝐾)((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))))))
232raleqdv 3294 . . . . . . . 8 (𝜑 → (∀𝑦𝐵 ((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))) ↔ ∀𝑦 ∈ (Base‘𝐿)((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))))
2423anbi2d 630 . . . . . . 7 (𝜑 → ((((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐿)) ∧ ∀𝑦𝐵 ((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))) ↔ (((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐿)) ∧ ∀𝑦 ∈ (Base‘𝐿)((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))))))
252, 24raleqbidv 3314 . . . . . 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 632 . . . 4 (𝜑 → ((𝑓:(Base‘𝐾)⟶(0[,)+∞) ∧ ∀𝑥 ∈ (Base‘𝐾)(((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐾)) ∧ ∀𝑦 ∈ (Base‘𝐾)((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))))) ↔ (𝑓:(Base‘𝐿)⟶(0[,)+∞) ∧ ∀𝑥 ∈ (Base‘𝐿)(((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐿)) ∧ ∀𝑦 ∈ (Base‘𝐿)((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))))))
285, 27anbi12d 632 . . 3 (𝜑 → ((𝐾 ∈ Ring ∧ (𝑓:(Base‘𝐾)⟶(0[,)+∞) ∧ ∀𝑥 ∈ (Base‘𝐾)(((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐾)) ∧ ∀𝑦 ∈ (Base‘𝐾)((𝑓‘(𝑥(.r𝐾)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐾)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦)))))) ↔ (𝐿 ∈ Ring ∧ (𝑓:(Base‘𝐿)⟶(0[,)+∞) ∧ ∀𝑥 ∈ (Base‘𝐿)(((𝑓𝑥) = 0 ↔ 𝑥 = (0g𝐿)) ∧ ∀𝑦 ∈ (Base‘𝐿)((𝑓‘(𝑥(.r𝐿)𝑦)) = ((𝑓𝑥) · (𝑓𝑦)) ∧ (𝑓‘(𝑥(+g𝐿)𝑦)) ≤ ((𝑓𝑥) + (𝑓𝑦))))))))
29 eqid 2734 . . . . 5 (AbsVal‘𝐾) = (AbsVal‘𝐾)
3029abvrcl 20744 . . . 4 (𝑓 ∈ (AbsVal‘𝐾) → 𝐾 ∈ Ring)
31 eqid 2734 . . . . 5 (Base‘𝐾) = (Base‘𝐾)
32 eqid 2734 . . . . 5 (+g𝐾) = (+g𝐾)
33 eqid 2734 . . . . 5 (.r𝐾) = (.r𝐾)
34 eqid 2734 . . . . 5 (0g𝐾) = (0g𝐾)
3529, 31, 32, 33, 34isabv 20742 . . . 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 2734 . . . . 5 (AbsVal‘𝐿) = (AbsVal‘𝐿)
3837abvrcl 20744 . . . 4 (𝑓 ∈ (AbsVal‘𝐿) → 𝐿 ∈ Ring)
39 eqid 2734 . . . . 5 (Base‘𝐿) = (Base‘𝐿)
40 eqid 2734 . . . . 5 (+g𝐿) = (+g𝐿)
41 eqid 2734 . . . . 5 (.r𝐿) = (.r𝐿)
42 eqid 2734 . . . . 5 (0g𝐿) = (0g𝐿)
4337, 39, 40, 41, 42isabv 20742 . . . 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 2732 1 (𝜑 → (AbsVal‘𝐾) = (AbsVal‘𝐿))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1541  wcel 2113  wral 3049   class class class wbr 5096  wf 6486  cfv 6490  (class class class)co 7356  0cc0 11024   + caddc 11027   · cmul 11029  +∞cpnf 11161  cle 11165  [,)cico 13261  Basecbs 17134  +gcplusg 17175  .rcmulr 17176  0gc0g 17357  Ringcrg 20166  AbsValcabv 20739
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-sep 5239  ax-nul 5249  ax-pow 5308  ax-pr 5375  ax-un 7678  ax-cnex 11080  ax-resscn 11081  ax-1cn 11082  ax-icn 11083  ax-addcl 11084  ax-addrcl 11085  ax-mulcl 11086  ax-mulrcl 11087  ax-mulcom 11088  ax-addass 11089  ax-mulass 11090  ax-distr 11091  ax-i2m1 11092  ax-1ne0 11093  ax-1rid 11094  ax-rnegex 11095  ax-rrecex 11096  ax-cnre 11097  ax-pre-lttri 11098  ax-pre-lttrn 11099  ax-pre-ltadd 11100  ax-pre-mulgt0 11101
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-nel 3035  df-ral 3050  df-rex 3059  df-reu 3349  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-iun 4946  df-br 5097  df-opab 5159  df-mpt 5178  df-tr 5204  df-id 5517  df-eprel 5522  df-po 5530  df-so 5531  df-fr 5575  df-we 5577  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-pred 6257  df-ord 6318  df-on 6319  df-lim 6320  df-suc 6321  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498  df-riota 7313  df-ov 7359  df-oprab 7360  df-mpo 7361  df-om 7807  df-2nd 7932  df-frecs 8221  df-wrecs 8252  df-recs 8301  df-rdg 8339  df-er 8633  df-map 8763  df-en 8882  df-dom 8883  df-sdom 8884  df-pnf 11166  df-mnf 11167  df-xr 11168  df-ltxr 11169  df-le 11170  df-sub 11364  df-neg 11365  df-nn 12144  df-2 12206  df-sets 17089  df-slot 17107  df-ndx 17119  df-base 17135  df-plusg 17188  df-0g 17359  df-mgm 18563  df-sgrp 18642  df-mnd 18658  df-grp 18864  df-mgp 20074  df-ring 20168  df-abv 20740
This theorem is referenced by:  tngnrg  24616  abvpropd2  32996
  Copyright terms: Public domain W3C validator