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

Theorem subrgpropd 19562
Description: If two structures have the same group components (properties), they have the same set of subrings. (Contributed by Mario Carneiro, 9-Feb-2015.)
Hypotheses
Ref Expression
subrgpropd.1 (𝜑𝐵 = (Base‘𝐾))
subrgpropd.2 (𝜑𝐵 = (Base‘𝐿))
subrgpropd.3 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(+g𝐾)𝑦) = (𝑥(+g𝐿)𝑦))
subrgpropd.4 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(.r𝐾)𝑦) = (𝑥(.r𝐿)𝑦))
Assertion
Ref Expression
subrgpropd (𝜑 → (SubRing‘𝐾) = (SubRing‘𝐿))
Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝐾,𝑦   𝜑,𝑥,𝑦   𝑥,𝐿,𝑦

Proof of Theorem subrgpropd
Dummy variable 𝑠 is distinct from all other variables.
StepHypRef Expression
1 subrgpropd.1 . . . . . 6 (𝜑𝐵 = (Base‘𝐾))
2 subrgpropd.2 . . . . . 6 (𝜑𝐵 = (Base‘𝐿))
3 subrgpropd.3 . . . . . 6 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(+g𝐾)𝑦) = (𝑥(+g𝐿)𝑦))
4 subrgpropd.4 . . . . . 6 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(.r𝐾)𝑦) = (𝑥(.r𝐿)𝑦))
51, 2, 3, 4ringpropd 19324 . . . . 5 (𝜑 → (𝐾 ∈ Ring ↔ 𝐿 ∈ Ring))
61ineq2d 4187 . . . . . . 7 (𝜑 → (𝑠𝐵) = (𝑠 ∩ (Base‘𝐾)))
7 eqid 2819 . . . . . . . . 9 (𝐾s 𝑠) = (𝐾s 𝑠)
8 eqid 2819 . . . . . . . . 9 (Base‘𝐾) = (Base‘𝐾)
97, 8ressbas 16546 . . . . . . . 8 (𝑠 ∈ V → (𝑠 ∩ (Base‘𝐾)) = (Base‘(𝐾s 𝑠)))
109elv 3498 . . . . . . 7 (𝑠 ∩ (Base‘𝐾)) = (Base‘(𝐾s 𝑠))
116, 10syl6eq 2870 . . . . . 6 (𝜑 → (𝑠𝐵) = (Base‘(𝐾s 𝑠)))
122ineq2d 4187 . . . . . . 7 (𝜑 → (𝑠𝐵) = (𝑠 ∩ (Base‘𝐿)))
13 eqid 2819 . . . . . . . . 9 (𝐿s 𝑠) = (𝐿s 𝑠)
14 eqid 2819 . . . . . . . . 9 (Base‘𝐿) = (Base‘𝐿)
1513, 14ressbas 16546 . . . . . . . 8 (𝑠 ∈ V → (𝑠 ∩ (Base‘𝐿)) = (Base‘(𝐿s 𝑠)))
1615elv 3498 . . . . . . 7 (𝑠 ∩ (Base‘𝐿)) = (Base‘(𝐿s 𝑠))
1712, 16syl6eq 2870 . . . . . 6 (𝜑 → (𝑠𝐵) = (Base‘(𝐿s 𝑠)))
18 elinel2 4171 . . . . . . . 8 (𝑥 ∈ (𝑠𝐵) → 𝑥𝐵)
19 elinel2 4171 . . . . . . . 8 (𝑦 ∈ (𝑠𝐵) → 𝑦𝐵)
2018, 19anim12i 614 . . . . . . 7 ((𝑥 ∈ (𝑠𝐵) ∧ 𝑦 ∈ (𝑠𝐵)) → (𝑥𝐵𝑦𝐵))
21 eqid 2819 . . . . . . . . . . 11 (+g𝐾) = (+g𝐾)
227, 21ressplusg 16604 . . . . . . . . . 10 (𝑠 ∈ V → (+g𝐾) = (+g‘(𝐾s 𝑠)))
2322elv 3498 . . . . . . . . 9 (+g𝐾) = (+g‘(𝐾s 𝑠))
2423oveqi 7161 . . . . . . . 8 (𝑥(+g𝐾)𝑦) = (𝑥(+g‘(𝐾s 𝑠))𝑦)
25 eqid 2819 . . . . . . . . . . 11 (+g𝐿) = (+g𝐿)
2613, 25ressplusg 16604 . . . . . . . . . 10 (𝑠 ∈ V → (+g𝐿) = (+g‘(𝐿s 𝑠)))
2726elv 3498 . . . . . . . . 9 (+g𝐿) = (+g‘(𝐿s 𝑠))
2827oveqi 7161 . . . . . . . 8 (𝑥(+g𝐿)𝑦) = (𝑥(+g‘(𝐿s 𝑠))𝑦)
293, 24, 283eqtr3g 2877 . . . . . . 7 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(+g‘(𝐾s 𝑠))𝑦) = (𝑥(+g‘(𝐿s 𝑠))𝑦))
3020, 29sylan2 594 . . . . . 6 ((𝜑 ∧ (𝑥 ∈ (𝑠𝐵) ∧ 𝑦 ∈ (𝑠𝐵))) → (𝑥(+g‘(𝐾s 𝑠))𝑦) = (𝑥(+g‘(𝐿s 𝑠))𝑦))
31 eqid 2819 . . . . . . . . . . 11 (.r𝐾) = (.r𝐾)
327, 31ressmulr 16617 . . . . . . . . . 10 (𝑠 ∈ V → (.r𝐾) = (.r‘(𝐾s 𝑠)))
3332elv 3498 . . . . . . . . 9 (.r𝐾) = (.r‘(𝐾s 𝑠))
3433oveqi 7161 . . . . . . . 8 (𝑥(.r𝐾)𝑦) = (𝑥(.r‘(𝐾s 𝑠))𝑦)
35 eqid 2819 . . . . . . . . . . 11 (.r𝐿) = (.r𝐿)
3613, 35ressmulr 16617 . . . . . . . . . 10 (𝑠 ∈ V → (.r𝐿) = (.r‘(𝐿s 𝑠)))
3736elv 3498 . . . . . . . . 9 (.r𝐿) = (.r‘(𝐿s 𝑠))
3837oveqi 7161 . . . . . . . 8 (𝑥(.r𝐿)𝑦) = (𝑥(.r‘(𝐿s 𝑠))𝑦)
394, 34, 383eqtr3g 2877 . . . . . . 7 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(.r‘(𝐾s 𝑠))𝑦) = (𝑥(.r‘(𝐿s 𝑠))𝑦))
4020, 39sylan2 594 . . . . . 6 ((𝜑 ∧ (𝑥 ∈ (𝑠𝐵) ∧ 𝑦 ∈ (𝑠𝐵))) → (𝑥(.r‘(𝐾s 𝑠))𝑦) = (𝑥(.r‘(𝐿s 𝑠))𝑦))
4111, 17, 30, 40ringpropd 19324 . . . . 5 (𝜑 → ((𝐾s 𝑠) ∈ Ring ↔ (𝐿s 𝑠) ∈ Ring))
425, 41anbi12d 632 . . . 4 (𝜑 → ((𝐾 ∈ Ring ∧ (𝐾s 𝑠) ∈ Ring) ↔ (𝐿 ∈ Ring ∧ (𝐿s 𝑠) ∈ Ring)))
431, 2eqtr3d 2856 . . . . . 6 (𝜑 → (Base‘𝐾) = (Base‘𝐿))
4443sseq2d 3997 . . . . 5 (𝜑 → (𝑠 ⊆ (Base‘𝐾) ↔ 𝑠 ⊆ (Base‘𝐿)))
451, 2, 4rngidpropd 19437 . . . . . 6 (𝜑 → (1r𝐾) = (1r𝐿))
4645eleq1d 2895 . . . . 5 (𝜑 → ((1r𝐾) ∈ 𝑠 ↔ (1r𝐿) ∈ 𝑠))
4744, 46anbi12d 632 . . . 4 (𝜑 → ((𝑠 ⊆ (Base‘𝐾) ∧ (1r𝐾) ∈ 𝑠) ↔ (𝑠 ⊆ (Base‘𝐿) ∧ (1r𝐿) ∈ 𝑠)))
4842, 47anbi12d 632 . . 3 (𝜑 → (((𝐾 ∈ Ring ∧ (𝐾s 𝑠) ∈ Ring) ∧ (𝑠 ⊆ (Base‘𝐾) ∧ (1r𝐾) ∈ 𝑠)) ↔ ((𝐿 ∈ Ring ∧ (𝐿s 𝑠) ∈ Ring) ∧ (𝑠 ⊆ (Base‘𝐿) ∧ (1r𝐿) ∈ 𝑠))))
49 eqid 2819 . . . 4 (1r𝐾) = (1r𝐾)
508, 49issubrg 19527 . . 3 (𝑠 ∈ (SubRing‘𝐾) ↔ ((𝐾 ∈ Ring ∧ (𝐾s 𝑠) ∈ Ring) ∧ (𝑠 ⊆ (Base‘𝐾) ∧ (1r𝐾) ∈ 𝑠)))
51 eqid 2819 . . . 4 (1r𝐿) = (1r𝐿)
5214, 51issubrg 19527 . . 3 (𝑠 ∈ (SubRing‘𝐿) ↔ ((𝐿 ∈ Ring ∧ (𝐿s 𝑠) ∈ Ring) ∧ (𝑠 ⊆ (Base‘𝐿) ∧ (1r𝐿) ∈ 𝑠)))
5348, 50, 523bitr4g 316 . 2 (𝜑 → (𝑠 ∈ (SubRing‘𝐾) ↔ 𝑠 ∈ (SubRing‘𝐿)))
5453eqrdv 2817 1 (𝜑 → (SubRing‘𝐾) = (SubRing‘𝐿))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398   = wceq 1531  wcel 2108  Vcvv 3493  cin 3933  wss 3934  cfv 6348  (class class class)co 7148  Basecbs 16475  s cress 16476  +gcplusg 16557  .rcmulr 16558  1rcur 19243  Ringcrg 19289  SubRingcsubrg 19523
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1905  ax-6 1964  ax-7 2009  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2154  ax-12 2170  ax-ext 2791  ax-sep 5194  ax-nul 5201  ax-pow 5257  ax-pr 5320  ax-un 7453  ax-cnex 10585  ax-resscn 10586  ax-1cn 10587  ax-icn 10588  ax-addcl 10589  ax-addrcl 10590  ax-mulcl 10591  ax-mulrcl 10592  ax-mulcom 10593  ax-addass 10594  ax-mulass 10595  ax-distr 10596  ax-i2m1 10597  ax-1ne0 10598  ax-1rid 10599  ax-rnegex 10600  ax-rrecex 10601  ax-cnre 10602  ax-pre-lttri 10603  ax-pre-lttrn 10604  ax-pre-ltadd 10605  ax-pre-mulgt0 10606
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1083  df-3an 1084  df-tru 1534  df-ex 1775  df-nf 1779  df-sb 2064  df-mo 2616  df-eu 2648  df-clab 2798  df-cleq 2812  df-clel 2891  df-nfc 2961  df-ne 3015  df-nel 3122  df-ral 3141  df-rex 3142  df-reu 3143  df-rab 3145  df-v 3495  df-sbc 3771  df-csb 3882  df-dif 3937  df-un 3939  df-in 3941  df-ss 3950  df-pss 3952  df-nul 4290  df-if 4466  df-pw 4539  df-sn 4560  df-pr 4562  df-tp 4564  df-op 4566  df-uni 4831  df-iun 4912  df-br 5058  df-opab 5120  df-mpt 5138  df-tr 5164  df-id 5453  df-eprel 5458  df-po 5467  df-so 5468  df-fr 5507  df-we 5509  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-rn 5559  df-res 5560  df-ima 5561  df-pred 6141  df-ord 6187  df-on 6188  df-lim 6189  df-suc 6190  df-iota 6307  df-fun 6350  df-fn 6351  df-f 6352  df-f1 6353  df-fo 6354  df-f1o 6355  df-fv 6356  df-riota 7106  df-ov 7151  df-oprab 7152  df-mpo 7153  df-om 7573  df-wrecs 7939  df-recs 8000  df-rdg 8038  df-er 8281  df-en 8502  df-dom 8503  df-sdom 8504  df-pnf 10669  df-mnf 10670  df-xr 10671  df-ltxr 10672  df-le 10673  df-sub 10864  df-neg 10865  df-nn 11631  df-2 11692  df-3 11693  df-ndx 16478  df-slot 16479  df-base 16481  df-sets 16482  df-ress 16483  df-plusg 16570  df-mulr 16571  df-0g 16707  df-mgm 17844  df-sgrp 17893  df-mnd 17904  df-grp 18098  df-mgp 19232  df-ur 19244  df-ring 19291  df-subrg 19525
This theorem is referenced by:  ply1subrg  20357  subrgply1  20393  srasubrg  30982
  Copyright terms: Public domain W3C validator