Theorem dvdsrpropd 20497

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 472	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → (𝑥(.r‘𝐾)𝑦) = (𝑥(.r‘𝐿)𝑦))
3	2	eqeq1d 2771	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → ((𝑥(.r‘𝐾)𝑦) = 𝑧 ↔ (𝑥(.r‘𝐿)𝑦) = 𝑧))
4	3	an32s 664	. . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐵) ∧ 𝑥 ∈ 𝐵) → ((𝑥(.r‘𝐾)𝑦) = 𝑧 ↔ (𝑥(.r‘𝐿)𝑦) = 𝑧))
5	4	rexbidva 3193	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (∃𝑥 ∈ 𝐵 (𝑥(.r‘𝐾)𝑦) = 𝑧 ↔ ∃𝑥 ∈ 𝐵 (𝑥(.r‘𝐿)𝑦) = 𝑧))
6	5	pm5.32da 589	. . . 4 ⊢ (𝜑 → ((𝑦 ∈ 𝐵 ∧ ∃𝑥 ∈ 𝐵 (𝑥(.r‘𝐾)𝑦) = 𝑧) ↔ (𝑦 ∈ 𝐵 ∧ ∃𝑥 ∈ 𝐵 (𝑥(.r‘𝐿)𝑦) = 𝑧)))
7		rngidpropd.1	. . . . . 6 ⊢ (𝜑 → 𝐵 = (Base‘𝐾))
8	7	eleq2d 2855	. . . . 5 ⊢ (𝜑 → (𝑦 ∈ 𝐵 ↔ 𝑦 ∈ (Base‘𝐾)))
9	7	rexeqdv 3330	. . . . 5 ⊢ (𝜑 → (∃𝑥 ∈ 𝐵 (𝑥(.r‘𝐾)𝑦) = 𝑧 ↔ ∃𝑥 ∈ (Base‘𝐾)(𝑥(.r‘𝐾)𝑦) = 𝑧))
10	8, 9	anbi12d 643	. . . 4 ⊢ (𝜑 → ((𝑦 ∈ 𝐵 ∧ ∃𝑥 ∈ 𝐵 (𝑥(.r‘𝐾)𝑦) = 𝑧) ↔ (𝑦 ∈ (Base‘𝐾) ∧ ∃𝑥 ∈ (Base‘𝐾)(𝑥(.r‘𝐾)𝑦) = 𝑧)))
11		rngidpropd.2	. . . . . 6 ⊢ (𝜑 → 𝐵 = (Base‘𝐿))
12	11	eleq2d 2855	. . . . 5 ⊢ (𝜑 → (𝑦 ∈ 𝐵 ↔ 𝑦 ∈ (Base‘𝐿)))
13	11	rexeqdv 3330	. . . . 5 ⊢ (𝜑 → (∃𝑥 ∈ 𝐵 (𝑥(.r‘𝐿)𝑦) = 𝑧 ↔ ∃𝑥 ∈ (Base‘𝐿)(𝑥(.r‘𝐿)𝑦) = 𝑧))
14	12, 13	anbi12d 643	. . . 4 ⊢ (𝜑 → ((𝑦 ∈ 𝐵 ∧ ∃𝑥 ∈ 𝐵 (𝑥(.r‘𝐿)𝑦) = 𝑧) ↔ (𝑦 ∈ (Base‘𝐿) ∧ ∃𝑥 ∈ (Base‘𝐿)(𝑥(.r‘𝐿)𝑦) = 𝑧)))
15	6, 10, 14	3bitr3d 312	. . 3 ⊢ (𝜑 → ((𝑦 ∈ (Base‘𝐾) ∧ ∃𝑥 ∈ (Base‘𝐾)(𝑥(.r‘𝐾)𝑦) = 𝑧) ↔ (𝑦 ∈ (Base‘𝐿) ∧ ∃𝑥 ∈ (Base‘𝐿)(𝑥(.r‘𝐿)𝑦) = 𝑧)))
16	15	opabbidv 5181	. 2 ⊢ (𝜑 → {⟨𝑦, 𝑧⟩ ∣ (𝑦 ∈ (Base‘𝐾) ∧ ∃𝑥 ∈ (Base‘𝐾)(𝑥(.r‘𝐾)𝑦) = 𝑧)} = {⟨𝑦, 𝑧⟩ ∣ (𝑦 ∈ (Base‘𝐿) ∧ ∃𝑥 ∈ (Base‘𝐿)(𝑥(.r‘𝐿)𝑦) = 𝑧)})
17		eqid 2769	. . 3 ⊢ (Base‘𝐾) = (Base‘𝐾)
18		eqid 2769	. . 3 ⊢ (∥r‘𝐾) = (∥r‘𝐾)
19		eqid 2769	. . 3 ⊢ (.r‘𝐾) = (.r‘𝐾)
20	17, 18, 19	dvdsrval 20442	. 2 ⊢ (∥r‘𝐾) = {⟨𝑦, 𝑧⟩ ∣ (𝑦 ∈ (Base‘𝐾) ∧ ∃𝑥 ∈ (Base‘𝐾)(𝑥(.r‘𝐾)𝑦) = 𝑧)}
21		eqid 2769	. . 3 ⊢ (Base‘𝐿) = (Base‘𝐿)
22		eqid 2769	. . 3 ⊢ (∥r‘𝐿) = (∥r‘𝐿)
23		eqid 2769	. . 3 ⊢ (.r‘𝐿) = (.r‘𝐿)
24	21, 22, 23	dvdsrval 20442	. 2 ⊢ (∥r‘𝐿) = {⟨𝑦, 𝑧⟩ ∣ (𝑦 ∈ (Base‘𝐿) ∧ ∃𝑥 ∈ (Base‘𝐿)(𝑥(.r‘𝐿)𝑦) = 𝑧)}
25	16, 20, 24	3eqtr4g 2829	1 ⊢ (𝜑 → (∥r‘𝐾) = (∥r‘𝐿))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1567   ∈ wcel 2149  ∃wrex 3095  {copab 5177  ‘cfv 6537  (class class class)co 7411  Basecbs 17268  ._rcmulr 17310  ∥_rcdsr 20435

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5242  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-iun 4962  df-br 5114  df-opab 5178  df-mpt 5197  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-iota 6493  df-fun 6539  df-fv 6545  df-ov 7414  df-dvdsr 20438

This theorem is referenced by:  unitpropd  20498