Theorem dvdsrpropd 18519

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 678	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → (𝑥(.r‘𝐾)𝑦) = (𝑥(.r‘𝐿)𝑦))
3	2	eqeq1d 2612	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → ((𝑥(.r‘𝐾)𝑦) = 𝑧 ↔ (𝑥(.r‘𝐿)𝑦) = 𝑧))
4	3	an32s 842	. . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐵) ∧ 𝑥 ∈ 𝐵) → ((𝑥(.r‘𝐾)𝑦) = 𝑧 ↔ (𝑥(.r‘𝐿)𝑦) = 𝑧))
5	4	rexbidva 3031	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (∃𝑥 ∈ 𝐵 (𝑥(.r‘𝐾)𝑦) = 𝑧 ↔ ∃𝑥 ∈ 𝐵 (𝑥(.r‘𝐿)𝑦) = 𝑧))
6	5	pm5.32da 671	. . . 4 ⊢ (𝜑 → ((𝑦 ∈ 𝐵 ∧ ∃𝑥 ∈ 𝐵 (𝑥(.r‘𝐾)𝑦) = 𝑧) ↔ (𝑦 ∈ 𝐵 ∧ ∃𝑥 ∈ 𝐵 (𝑥(.r‘𝐿)𝑦) = 𝑧)))
7		rngidpropd.1	. . . . . 6 ⊢ (𝜑 → 𝐵 = (Base‘𝐾))
8	7	eleq2d 2673	. . . . 5 ⊢ (𝜑 → (𝑦 ∈ 𝐵 ↔ 𝑦 ∈ (Base‘𝐾)))
9	7	rexeqdv 3122	. . . . 5 ⊢ (𝜑 → (∃𝑥 ∈ 𝐵 (𝑥(.r‘𝐾)𝑦) = 𝑧 ↔ ∃𝑥 ∈ (Base‘𝐾)(𝑥(.r‘𝐾)𝑦) = 𝑧))
10	8, 9	anbi12d 743	. . . 4 ⊢ (𝜑 → ((𝑦 ∈ 𝐵 ∧ ∃𝑥 ∈ 𝐵 (𝑥(.r‘𝐾)𝑦) = 𝑧) ↔ (𝑦 ∈ (Base‘𝐾) ∧ ∃𝑥 ∈ (Base‘𝐾)(𝑥(.r‘𝐾)𝑦) = 𝑧)))
11		rngidpropd.2	. . . . . 6 ⊢ (𝜑 → 𝐵 = (Base‘𝐿))
12	11	eleq2d 2673	. . . . 5 ⊢ (𝜑 → (𝑦 ∈ 𝐵 ↔ 𝑦 ∈ (Base‘𝐿)))
13	11	rexeqdv 3122	. . . . 5 ⊢ (𝜑 → (∃𝑥 ∈ 𝐵 (𝑥(.r‘𝐿)𝑦) = 𝑧 ↔ ∃𝑥 ∈ (Base‘𝐿)(𝑥(.r‘𝐿)𝑦) = 𝑧))
14	12, 13	anbi12d 743	. . . 4 ⊢ (𝜑 → ((𝑦 ∈ 𝐵 ∧ ∃𝑥 ∈ 𝐵 (𝑥(.r‘𝐿)𝑦) = 𝑧) ↔ (𝑦 ∈ (Base‘𝐿) ∧ ∃𝑥 ∈ (Base‘𝐿)(𝑥(.r‘𝐿)𝑦) = 𝑧)))
15	6, 10, 14	3bitr3d 297	. . 3 ⊢ (𝜑 → ((𝑦 ∈ (Base‘𝐾) ∧ ∃𝑥 ∈ (Base‘𝐾)(𝑥(.r‘𝐾)𝑦) = 𝑧) ↔ (𝑦 ∈ (Base‘𝐿) ∧ ∃𝑥 ∈ (Base‘𝐿)(𝑥(.r‘𝐿)𝑦) = 𝑧)))
16	15	opabbidv 4648	. 2 ⊢ (𝜑 → {⟨𝑦, 𝑧⟩ ∣ (𝑦 ∈ (Base‘𝐾) ∧ ∃𝑥 ∈ (Base‘𝐾)(𝑥(.r‘𝐾)𝑦) = 𝑧)} = {⟨𝑦, 𝑧⟩ ∣ (𝑦 ∈ (Base‘𝐿) ∧ ∃𝑥 ∈ (Base‘𝐿)(𝑥(.r‘𝐿)𝑦) = 𝑧)})
17		eqid 2610	. . 3 ⊢ (Base‘𝐾) = (Base‘𝐾)
18		eqid 2610	. . 3 ⊢ (∥r‘𝐾) = (∥r‘𝐾)
19		eqid 2610	. . 3 ⊢ (.r‘𝐾) = (.r‘𝐾)
20	17, 18, 19	dvdsrval 18468	. 2 ⊢ (∥r‘𝐾) = {⟨𝑦, 𝑧⟩ ∣ (𝑦 ∈ (Base‘𝐾) ∧ ∃𝑥 ∈ (Base‘𝐾)(𝑥(.r‘𝐾)𝑦) = 𝑧)}
21		eqid 2610	. . 3 ⊢ (Base‘𝐿) = (Base‘𝐿)
22		eqid 2610	. . 3 ⊢ (∥r‘𝐿) = (∥r‘𝐿)
23		eqid 2610	. . 3 ⊢ (.r‘𝐿) = (.r‘𝐿)
24	21, 22, 23	dvdsrval 18468	. 2 ⊢ (∥r‘𝐿) = {⟨𝑦, 𝑧⟩ ∣ (𝑦 ∈ (Base‘𝐿) ∧ ∃𝑥 ∈ (Base‘𝐿)(𝑥(.r‘𝐿)𝑦) = 𝑧)}
25	16, 20, 24	3eqtr4g 2669	1 ⊢ (𝜑 → (∥r‘𝐾) = (∥r‘𝐿))

Syntax hints:   → wi 4   ↔ wb 195   ∧ wa 383   = wceq 1475   ∈ wcel 1977  ∃wrex 2897  {copab 4642  ‘cfv 5804  (class class class)co 6549  Basecbs 15695  ._rcmulr 15769  ∥_rcdsr 18461

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-ov 6552  df-dvdsr 18464

This theorem is referenced by:  unitpropd  18520