ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  dvdsrvald GIF version

Theorem dvdsrvald 14169
Description: Value of the divides relation. (Contributed by Mario Carneiro, 1-Dec-2014.) (Revised by Mario Carneiro, 6-Jan-2015.)
Hypotheses
Ref Expression
dvdsrvald.1 (𝜑𝐵 = (Base‘𝑅))
dvdsrvald.2 (𝜑 = (∥r𝑅))
dvdsrvald.r (𝜑𝑅 ∈ SRing)
dvdsrvald.3 (𝜑· = (.r𝑅))
Assertion
Ref Expression
dvdsrvald (𝜑 = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐵 ∧ ∃𝑧𝐵 (𝑧 · 𝑥) = 𝑦)})
Distinct variable groups:   𝑥,𝑦,   𝑥,𝑧,𝐵,𝑦   𝑥,𝑅,𝑦,𝑧   𝑥, · ,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧
Allowed substitution hint:   (𝑧)

Proof of Theorem dvdsrvald
Dummy variable 𝑟 is distinct from all other variables.
StepHypRef Expression
1 df-dvdsr 14164 . . 3 r = (𝑟 ∈ V ↦ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑟) ∧ ∃𝑧 ∈ (Base‘𝑟)(𝑧(.r𝑟)𝑥) = 𝑦)})
2 fveq2 5648 . . . . . 6 (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
32eleq2d 2301 . . . . 5 (𝑟 = 𝑅 → (𝑥 ∈ (Base‘𝑟) ↔ 𝑥 ∈ (Base‘𝑅)))
4 fveq2 5648 . . . . . . . 8 (𝑟 = 𝑅 → (.r𝑟) = (.r𝑅))
54oveqd 6045 . . . . . . 7 (𝑟 = 𝑅 → (𝑧(.r𝑟)𝑥) = (𝑧(.r𝑅)𝑥))
65eqeq1d 2240 . . . . . 6 (𝑟 = 𝑅 → ((𝑧(.r𝑟)𝑥) = 𝑦 ↔ (𝑧(.r𝑅)𝑥) = 𝑦))
72, 6rexeqbidv 2748 . . . . 5 (𝑟 = 𝑅 → (∃𝑧 ∈ (Base‘𝑟)(𝑧(.r𝑟)𝑥) = 𝑦 ↔ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r𝑅)𝑥) = 𝑦))
83, 7anbi12d 473 . . . 4 (𝑟 = 𝑅 → ((𝑥 ∈ (Base‘𝑟) ∧ ∃𝑧 ∈ (Base‘𝑟)(𝑧(.r𝑟)𝑥) = 𝑦) ↔ (𝑥 ∈ (Base‘𝑅) ∧ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r𝑅)𝑥) = 𝑦)))
98opabbidv 4160 . . 3 (𝑟 = 𝑅 → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑟) ∧ ∃𝑧 ∈ (Base‘𝑟)(𝑧(.r𝑟)𝑥) = 𝑦)} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑅) ∧ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r𝑅)𝑥) = 𝑦)})
10 dvdsrvald.r . . . 4 (𝜑𝑅 ∈ SRing)
1110elexd 2817 . . 3 (𝜑𝑅 ∈ V)
12 basfn 13202 . . . . . 6 Base Fn V
13 funfvex 5665 . . . . . . 7 ((Fun Base ∧ 𝑅 ∈ dom Base) → (Base‘𝑅) ∈ V)
1413funfni 5439 . . . . . 6 ((Base Fn V ∧ 𝑅 ∈ V) → (Base‘𝑅) ∈ V)
1512, 11, 14sylancr 414 . . . . 5 (𝜑 → (Base‘𝑅) ∈ V)
16 xpexg 4846 . . . . 5 (((Base‘𝑅) ∈ V ∧ (Base‘𝑅) ∈ V) → ((Base‘𝑅) × (Base‘𝑅)) ∈ V)
1715, 15, 16syl2anc 411 . . . 4 (𝜑 → ((Base‘𝑅) × (Base‘𝑅)) ∈ V)
18 simprr 533 . . . . . . . . 9 (((𝜑𝑥 ∈ (Base‘𝑅)) ∧ (𝑧 ∈ (Base‘𝑅) ∧ (𝑧(.r𝑅)𝑥) = 𝑦)) → (𝑧(.r𝑅)𝑥) = 𝑦)
1910ad2antrr 488 . . . . . . . . . 10 (((𝜑𝑥 ∈ (Base‘𝑅)) ∧ (𝑧 ∈ (Base‘𝑅) ∧ (𝑧(.r𝑅)𝑥) = 𝑦)) → 𝑅 ∈ SRing)
20 simprl 531 . . . . . . . . . 10 (((𝜑𝑥 ∈ (Base‘𝑅)) ∧ (𝑧 ∈ (Base‘𝑅) ∧ (𝑧(.r𝑅)𝑥) = 𝑦)) → 𝑧 ∈ (Base‘𝑅))
21 simplr 529 . . . . . . . . . 10 (((𝜑𝑥 ∈ (Base‘𝑅)) ∧ (𝑧 ∈ (Base‘𝑅) ∧ (𝑧(.r𝑅)𝑥) = 𝑦)) → 𝑥 ∈ (Base‘𝑅))
22 eqid 2231 . . . . . . . . . . 11 (Base‘𝑅) = (Base‘𝑅)
23 eqid 2231 . . . . . . . . . . 11 (.r𝑅) = (.r𝑅)
2422, 23srgcl 14045 . . . . . . . . . 10 ((𝑅 ∈ SRing ∧ 𝑧 ∈ (Base‘𝑅) ∧ 𝑥 ∈ (Base‘𝑅)) → (𝑧(.r𝑅)𝑥) ∈ (Base‘𝑅))
2519, 20, 21, 24syl3anc 1274 . . . . . . . . 9 (((𝜑𝑥 ∈ (Base‘𝑅)) ∧ (𝑧 ∈ (Base‘𝑅) ∧ (𝑧(.r𝑅)𝑥) = 𝑦)) → (𝑧(.r𝑅)𝑥) ∈ (Base‘𝑅))
2618, 25eqeltrrd 2309 . . . . . . . 8 (((𝜑𝑥 ∈ (Base‘𝑅)) ∧ (𝑧 ∈ (Base‘𝑅) ∧ (𝑧(.r𝑅)𝑥) = 𝑦)) → 𝑦 ∈ (Base‘𝑅))
2726rexlimdvaa 2652 . . . . . . 7 ((𝜑𝑥 ∈ (Base‘𝑅)) → (∃𝑧 ∈ (Base‘𝑅)(𝑧(.r𝑅)𝑥) = 𝑦𝑦 ∈ (Base‘𝑅)))
2827imdistanda 448 . . . . . 6 (𝜑 → ((𝑥 ∈ (Base‘𝑅) ∧ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r𝑅)𝑥) = 𝑦) → (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))))
2928ssopab2dv 4379 . . . . 5 (𝜑 → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑅) ∧ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r𝑅)𝑥) = 𝑦)} ⊆ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))})
30 df-xp 4737 . . . . 5 ((Base‘𝑅) × (Base‘𝑅)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))}
3129, 30sseqtrrdi 3277 . . . 4 (𝜑 → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑅) ∧ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r𝑅)𝑥) = 𝑦)} ⊆ ((Base‘𝑅) × (Base‘𝑅)))
3217, 31ssexd 4234 . . 3 (𝜑 → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑅) ∧ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r𝑅)𝑥) = 𝑦)} ∈ V)
331, 9, 11, 32fvmptd3 5749 . 2 (𝜑 → (∥r𝑅) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑅) ∧ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r𝑅)𝑥) = 𝑦)})
34 dvdsrvald.2 . 2 (𝜑 = (∥r𝑅))
35 dvdsrvald.1 . . . . 5 (𝜑𝐵 = (Base‘𝑅))
3635eleq2d 2301 . . . 4 (𝜑 → (𝑥𝐵𝑥 ∈ (Base‘𝑅)))
37 dvdsrvald.3 . . . . . . 7 (𝜑· = (.r𝑅))
3837oveqd 6045 . . . . . 6 (𝜑 → (𝑧 · 𝑥) = (𝑧(.r𝑅)𝑥))
3938eqeq1d 2240 . . . . 5 (𝜑 → ((𝑧 · 𝑥) = 𝑦 ↔ (𝑧(.r𝑅)𝑥) = 𝑦))
4035, 39rexeqbidv 2748 . . . 4 (𝜑 → (∃𝑧𝐵 (𝑧 · 𝑥) = 𝑦 ↔ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r𝑅)𝑥) = 𝑦))
4136, 40anbi12d 473 . . 3 (𝜑 → ((𝑥𝐵 ∧ ∃𝑧𝐵 (𝑧 · 𝑥) = 𝑦) ↔ (𝑥 ∈ (Base‘𝑅) ∧ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r𝑅)𝑥) = 𝑦)))
4241opabbidv 4160 . 2 (𝜑 → {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐵 ∧ ∃𝑧𝐵 (𝑧 · 𝑥) = 𝑦)} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑅) ∧ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r𝑅)𝑥) = 𝑦)})
4333, 34, 423eqtr4d 2274 1 (𝜑 = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐵 ∧ ∃𝑧𝐵 (𝑧 · 𝑥) = 𝑦)})
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1398  wcel 2202  wrex 2512  Vcvv 2803  {copab 4154   × cxp 4729   Fn wfn 5328  cfv 5333  (class class class)co 6028  Basecbs 13143  .rcmulr 13222  SRingcsrg 14038  rcdsr 14161
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8166  ax-resscn 8167  ax-1cn 8168  ax-1re 8169  ax-icn 8170  ax-addcl 8171  ax-addrcl 8172  ax-mulcl 8173  ax-addcom 8175  ax-addass 8177  ax-i2m1 8180  ax-0lt1 8181  ax-0id 8183  ax-rnegex 8184  ax-pre-ltirr 8187  ax-pre-ltadd 8191
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-iota 5293  df-fun 5335  df-fn 5336  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-pnf 8259  df-mnf 8260  df-ltxr 8262  df-inn 9187  df-2 9245  df-3 9246  df-ndx 13146  df-slot 13147  df-base 13149  df-sets 13150  df-plusg 13234  df-mulr 13235  df-0g 13402  df-mgm 13500  df-sgrp 13546  df-mnd 13561  df-mgp 13996  df-srg 14039  df-dvdsr 14164
This theorem is referenced by:  dvdsrd  14170  dvdsrex  14174  dvdsrpropdg  14223  dvdsrzring  14679
  Copyright terms: Public domain W3C validator