Theorem dvdsrpropd 20364

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.

Step	Hyp	Ref	Expression
1		rngidpropd.3	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(.r‘𝐾)𝑦) = (𝑥(.r‘𝐿)𝑦))
2	1	anassrs 467	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → (𝑥(.r‘𝐾)𝑦) = (𝑥(.r‘𝐿)𝑦))
3	2	eqeq1d 2739	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → ((𝑥(.r‘𝐾)𝑦) = 𝑧 ↔ (𝑥(.r‘𝐿)𝑦) = 𝑧))
4	3	an32s 653	. . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐵) ∧ 𝑥 ∈ 𝐵) → ((𝑥(.r‘𝐾)𝑦) = 𝑧 ↔ (𝑥(.r‘𝐿)𝑦) = 𝑧))
5	4	rexbidva 3160	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (∃𝑥 ∈ 𝐵 (𝑥(.r‘𝐾)𝑦) = 𝑧 ↔ ∃𝑥 ∈ 𝐵 (𝑥(.r‘𝐿)𝑦) = 𝑧))
6	5	pm5.32da 579	. . . 4 ⊢ (𝜑 → ((𝑦 ∈ 𝐵 ∧ ∃𝑥 ∈ 𝐵 (𝑥(.r‘𝐾)𝑦) = 𝑧) ↔ (𝑦 ∈ 𝐵 ∧ ∃𝑥 ∈ 𝐵 (𝑥(.r‘𝐿)𝑦) = 𝑧)))
7		rngidpropd.1	. . . . . 6 ⊢ (𝜑 → 𝐵 = (Base‘𝐾))
8	7	eleq2d 2823	. . . . 5 ⊢ (𝜑 → (𝑦 ∈ 𝐵 ↔ 𝑦 ∈ (Base‘𝐾)))
9	7	rexeqdv 3299	. . . . 5 ⊢ (𝜑 → (∃𝑥 ∈ 𝐵 (𝑥(.r‘𝐾)𝑦) = 𝑧 ↔ ∃𝑥 ∈ (Base‘𝐾)(𝑥(.r‘𝐾)𝑦) = 𝑧))
10	8, 9	anbi12d 633	. . . 4 ⊢ (𝜑 → ((𝑦 ∈ 𝐵 ∧ ∃𝑥 ∈ 𝐵 (𝑥(.r‘𝐾)𝑦) = 𝑧) ↔ (𝑦 ∈ (Base‘𝐾) ∧ ∃𝑥 ∈ (Base‘𝐾)(𝑥(.r‘𝐾)𝑦) = 𝑧)))
11		rngidpropd.2	. . . . . 6 ⊢ (𝜑 → 𝐵 = (Base‘𝐿))
12	11	eleq2d 2823	. . . . 5 ⊢ (𝜑 → (𝑦 ∈ 𝐵 ↔ 𝑦 ∈ (Base‘𝐿)))
13	11	rexeqdv 3299	. . . . 5 ⊢ (𝜑 → (∃𝑥 ∈ 𝐵 (𝑥(.r‘𝐿)𝑦) = 𝑧 ↔ ∃𝑥 ∈ (Base‘𝐿)(𝑥(.r‘𝐿)𝑦) = 𝑧))
14	12, 13	anbi12d 633	. . . 4 ⊢ (𝜑 → ((𝑦 ∈ 𝐵 ∧ ∃𝑥 ∈ 𝐵 (𝑥(.r‘𝐿)𝑦) = 𝑧) ↔ (𝑦 ∈ (Base‘𝐿) ∧ ∃𝑥 ∈ (Base‘𝐿)(𝑥(.r‘𝐿)𝑦) = 𝑧)))
15	6, 10, 14	3bitr3d 309	. . 3 ⊢ (𝜑 → ((𝑦 ∈ (Base‘𝐾) ∧ ∃𝑥 ∈ (Base‘𝐾)(𝑥(.r‘𝐾)𝑦) = 𝑧) ↔ (𝑦 ∈ (Base‘𝐿) ∧ ∃𝑥 ∈ (Base‘𝐿)(𝑥(.r‘𝐿)𝑦) = 𝑧)))
16	15	opabbidv 5166	. 2 ⊢ (𝜑 → {⟨𝑦, 𝑧⟩ ∣ (𝑦 ∈ (Base‘𝐾) ∧ ∃𝑥 ∈ (Base‘𝐾)(𝑥(.r‘𝐾)𝑦) = 𝑧)} = {⟨𝑦, 𝑧⟩ ∣ (𝑦 ∈ (Base‘𝐿) ∧ ∃𝑥 ∈ (Base‘𝐿)(𝑥(.r‘𝐿)𝑦) = 𝑧)})
17		eqid 2737	. . 3 ⊢ (Base‘𝐾) = (Base‘𝐾)
18		eqid 2737	. . 3 ⊢ (∥r‘𝐾) = (∥r‘𝐾)
19		eqid 2737	. . 3 ⊢ (.r‘𝐾) = (.r‘𝐾)
20	17, 18, 19	dvdsrval 20309	. 2 ⊢ (∥r‘𝐾) = {⟨𝑦, 𝑧⟩ ∣ (𝑦 ∈ (Base‘𝐾) ∧ ∃𝑥 ∈ (Base‘𝐾)(𝑥(.r‘𝐾)𝑦) = 𝑧)}
21		eqid 2737	. . 3 ⊢ (Base‘𝐿) = (Base‘𝐿)
22		eqid 2737	. . 3 ⊢ (∥r‘𝐿) = (∥r‘𝐿)
23		eqid 2737	. . 3 ⊢ (.r‘𝐿) = (.r‘𝐿)
24	21, 22, 23	dvdsrval 20309	. 2 ⊢ (∥r‘𝐿) = {⟨𝑦, 𝑧⟩ ∣ (𝑦 ∈ (Base‘𝐿) ∧ ∃𝑥 ∈ (Base‘𝐿)(𝑥(.r‘𝐿)𝑦) = 𝑧)}
25	16, 20, 24	3eqtr4g 2797	1 ⊢ (𝜑 → (∥r‘𝐾) = (∥r‘𝐿))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542   ∈ wcel 2114  ∃wrex 3062  {copab 5162  ‘cfv 6500  (class class class)co 7368  Basecbs 17148  ._rcmulr 17190  ∥_rcdsr 20302

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-iota 6456  df-fun 6502  df-fv 6508  df-ov 7371  df-dvdsr 20305

This theorem is referenced by:  unitpropd  20365