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

Theorem dvdsrpropd 20357
Description: The divisibility relation depends only on the ring's base set and multiplication operation. (Contributed by Mario Carneiro, 26-Dec-2014.)
Hypotheses
Ref Expression
rngidpropd.1 (𝜑𝐵 = (Base‘𝐾))
rngidpropd.2 (𝜑𝐵 = (Base‘𝐿))
rngidpropd.3 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(.r𝐾)𝑦) = (𝑥(.r𝐿)𝑦))
Assertion
Ref Expression
dvdsrpropd (𝜑 → (∥r𝐾) = (∥r𝐿))
Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝐾,𝑦   𝑥,𝐿,𝑦   𝜑,𝑥,𝑦

Proof of Theorem dvdsrpropd
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 rngidpropd.3 . . . . . . . . 9 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(.r𝐾)𝑦) = (𝑥(.r𝐿)𝑦))
21anassrs 466 . . . . . . . 8 (((𝜑𝑥𝐵) ∧ 𝑦𝐵) → (𝑥(.r𝐾)𝑦) = (𝑥(.r𝐿)𝑦))
32eqeq1d 2727 . . . . . . 7 (((𝜑𝑥𝐵) ∧ 𝑦𝐵) → ((𝑥(.r𝐾)𝑦) = 𝑧 ↔ (𝑥(.r𝐿)𝑦) = 𝑧))
43an32s 650 . . . . . 6 (((𝜑𝑦𝐵) ∧ 𝑥𝐵) → ((𝑥(.r𝐾)𝑦) = 𝑧 ↔ (𝑥(.r𝐿)𝑦) = 𝑧))
54rexbidva 3167 . . . . 5 ((𝜑𝑦𝐵) → (∃𝑥𝐵 (𝑥(.r𝐾)𝑦) = 𝑧 ↔ ∃𝑥𝐵 (𝑥(.r𝐿)𝑦) = 𝑧))
65pm5.32da 577 . . . 4 (𝜑 → ((𝑦𝐵 ∧ ∃𝑥𝐵 (𝑥(.r𝐾)𝑦) = 𝑧) ↔ (𝑦𝐵 ∧ ∃𝑥𝐵 (𝑥(.r𝐿)𝑦) = 𝑧)))
7 rngidpropd.1 . . . . . 6 (𝜑𝐵 = (Base‘𝐾))
87eleq2d 2811 . . . . 5 (𝜑 → (𝑦𝐵𝑦 ∈ (Base‘𝐾)))
97rexeqdv 3316 . . . . 5 (𝜑 → (∃𝑥𝐵 (𝑥(.r𝐾)𝑦) = 𝑧 ↔ ∃𝑥 ∈ (Base‘𝐾)(𝑥(.r𝐾)𝑦) = 𝑧))
108, 9anbi12d 630 . . . 4 (𝜑 → ((𝑦𝐵 ∧ ∃𝑥𝐵 (𝑥(.r𝐾)𝑦) = 𝑧) ↔ (𝑦 ∈ (Base‘𝐾) ∧ ∃𝑥 ∈ (Base‘𝐾)(𝑥(.r𝐾)𝑦) = 𝑧)))
11 rngidpropd.2 . . . . . 6 (𝜑𝐵 = (Base‘𝐿))
1211eleq2d 2811 . . . . 5 (𝜑 → (𝑦𝐵𝑦 ∈ (Base‘𝐿)))
1311rexeqdv 3316 . . . . 5 (𝜑 → (∃𝑥𝐵 (𝑥(.r𝐿)𝑦) = 𝑧 ↔ ∃𝑥 ∈ (Base‘𝐿)(𝑥(.r𝐿)𝑦) = 𝑧))
1412, 13anbi12d 630 . . . 4 (𝜑 → ((𝑦𝐵 ∧ ∃𝑥𝐵 (𝑥(.r𝐿)𝑦) = 𝑧) ↔ (𝑦 ∈ (Base‘𝐿) ∧ ∃𝑥 ∈ (Base‘𝐿)(𝑥(.r𝐿)𝑦) = 𝑧)))
156, 10, 143bitr3d 308 . . 3 (𝜑 → ((𝑦 ∈ (Base‘𝐾) ∧ ∃𝑥 ∈ (Base‘𝐾)(𝑥(.r𝐾)𝑦) = 𝑧) ↔ (𝑦 ∈ (Base‘𝐿) ∧ ∃𝑥 ∈ (Base‘𝐿)(𝑥(.r𝐿)𝑦) = 𝑧)))
1615opabbidv 5209 . 2 (𝜑 → {⟨𝑦, 𝑧⟩ ∣ (𝑦 ∈ (Base‘𝐾) ∧ ∃𝑥 ∈ (Base‘𝐾)(𝑥(.r𝐾)𝑦) = 𝑧)} = {⟨𝑦, 𝑧⟩ ∣ (𝑦 ∈ (Base‘𝐿) ∧ ∃𝑥 ∈ (Base‘𝐿)(𝑥(.r𝐿)𝑦) = 𝑧)})
17 eqid 2725 . . 3 (Base‘𝐾) = (Base‘𝐾)
18 eqid 2725 . . 3 (∥r𝐾) = (∥r𝐾)
19 eqid 2725 . . 3 (.r𝐾) = (.r𝐾)
2017, 18, 19dvdsrval 20302 . 2 (∥r𝐾) = {⟨𝑦, 𝑧⟩ ∣ (𝑦 ∈ (Base‘𝐾) ∧ ∃𝑥 ∈ (Base‘𝐾)(𝑥(.r𝐾)𝑦) = 𝑧)}
21 eqid 2725 . . 3 (Base‘𝐿) = (Base‘𝐿)
22 eqid 2725 . . 3 (∥r𝐿) = (∥r𝐿)
23 eqid 2725 . . 3 (.r𝐿) = (.r𝐿)
2421, 22, 23dvdsrval 20302 . 2 (∥r𝐿) = {⟨𝑦, 𝑧⟩ ∣ (𝑦 ∈ (Base‘𝐿) ∧ ∃𝑥 ∈ (Base‘𝐿)(𝑥(.r𝐿)𝑦) = 𝑧)}
2516, 20, 243eqtr4g 2790 1 (𝜑 → (∥r𝐾) = (∥r𝐿))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 394   = wceq 1533  wcel 2098  wrex 3060  {copab 5205  cfv 6542  (class class class)co 7415  Basecbs 17177  .rcmulr 17231  rcdsr 20295
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2696  ax-rep 5280  ax-sep 5294  ax-nul 5301  ax-pow 5359  ax-pr 5423  ax-un 7737
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2703  df-cleq 2717  df-clel 2802  df-nfc 2877  df-ne 2931  df-ral 3052  df-rex 3061  df-rab 3420  df-v 3465  df-dif 3943  df-un 3945  df-in 3947  df-ss 3957  df-nul 4319  df-if 4525  df-pw 4600  df-sn 4625  df-pr 4627  df-op 4631  df-uni 4904  df-iun 4993  df-br 5144  df-opab 5206  df-mpt 5227  df-id 5570  df-xp 5678  df-rel 5679  df-cnv 5680  df-co 5681  df-dm 5682  df-iota 6494  df-fun 6544  df-fv 6550  df-ov 7418  df-dvdsr 20298
This theorem is referenced by:  unitpropd  20358
  Copyright terms: Public domain W3C validator