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

Theorem dvdsrvald 13899
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 13895 . . 3 r = (𝑟 ∈ V ↦ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑟) ∧ ∃𝑧 ∈ (Base‘𝑟)(𝑧(.r𝑟)𝑥) = 𝑦)})
2 fveq2 5583 . . . . . 6 (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
32eleq2d 2276 . . . . 5 (𝑟 = 𝑅 → (𝑥 ∈ (Base‘𝑟) ↔ 𝑥 ∈ (Base‘𝑅)))
4 fveq2 5583 . . . . . . . 8 (𝑟 = 𝑅 → (.r𝑟) = (.r𝑅))
54oveqd 5968 . . . . . . 7 (𝑟 = 𝑅 → (𝑧(.r𝑟)𝑥) = (𝑧(.r𝑅)𝑥))
65eqeq1d 2215 . . . . . 6 (𝑟 = 𝑅 → ((𝑧(.r𝑟)𝑥) = 𝑦 ↔ (𝑧(.r𝑅)𝑥) = 𝑦))
72, 6rexeqbidv 2720 . . . . 5 (𝑟 = 𝑅 → (∃𝑧 ∈ (Base‘𝑟)(𝑧(.r𝑟)𝑥) = 𝑦 ↔ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r𝑅)𝑥) = 𝑦))
83, 7anbi12d 473 . . . 4 (𝑟 = 𝑅 → ((𝑥 ∈ (Base‘𝑟) ∧ ∃𝑧 ∈ (Base‘𝑟)(𝑧(.r𝑟)𝑥) = 𝑦) ↔ (𝑥 ∈ (Base‘𝑅) ∧ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r𝑅)𝑥) = 𝑦)))
98opabbidv 4114 . . 3 (𝑟 = 𝑅 → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑟) ∧ ∃𝑧 ∈ (Base‘𝑟)(𝑧(.r𝑟)𝑥) = 𝑦)} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑅) ∧ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r𝑅)𝑥) = 𝑦)})
10 dvdsrvald.r . . . 4 (𝜑𝑅 ∈ SRing)
1110elexd 2786 . . 3 (𝜑𝑅 ∈ V)
12 basfn 12934 . . . . . 6 Base Fn V
13 funfvex 5600 . . . . . . 7 ((Fun Base ∧ 𝑅 ∈ dom Base) → (Base‘𝑅) ∈ V)
1413funfni 5381 . . . . . 6 ((Base Fn V ∧ 𝑅 ∈ V) → (Base‘𝑅) ∈ V)
1512, 11, 14sylancr 414 . . . . 5 (𝜑 → (Base‘𝑅) ∈ V)
16 xpexg 4793 . . . . 5 (((Base‘𝑅) ∈ V ∧ (Base‘𝑅) ∈ V) → ((Base‘𝑅) × (Base‘𝑅)) ∈ V)
1715, 15, 16syl2anc 411 . . . 4 (𝜑 → ((Base‘𝑅) × (Base‘𝑅)) ∈ V)
18 simprr 531 . . . . . . . . 9 (((𝜑𝑥 ∈ (Base‘𝑅)) ∧ (𝑧 ∈ (Base‘𝑅) ∧ (𝑧(.r𝑅)𝑥) = 𝑦)) → (𝑧(.r𝑅)𝑥) = 𝑦)
1910ad2antrr 488 . . . . . . . . . 10 (((𝜑𝑥 ∈ (Base‘𝑅)) ∧ (𝑧 ∈ (Base‘𝑅) ∧ (𝑧(.r𝑅)𝑥) = 𝑦)) → 𝑅 ∈ SRing)
20 simprl 529 . . . . . . . . . 10 (((𝜑𝑥 ∈ (Base‘𝑅)) ∧ (𝑧 ∈ (Base‘𝑅) ∧ (𝑧(.r𝑅)𝑥) = 𝑦)) → 𝑧 ∈ (Base‘𝑅))
21 simplr 528 . . . . . . . . . 10 (((𝜑𝑥 ∈ (Base‘𝑅)) ∧ (𝑧 ∈ (Base‘𝑅) ∧ (𝑧(.r𝑅)𝑥) = 𝑦)) → 𝑥 ∈ (Base‘𝑅))
22 eqid 2206 . . . . . . . . . . 11 (Base‘𝑅) = (Base‘𝑅)
23 eqid 2206 . . . . . . . . . . 11 (.r𝑅) = (.r𝑅)
2422, 23srgcl 13776 . . . . . . . . . 10 ((𝑅 ∈ SRing ∧ 𝑧 ∈ (Base‘𝑅) ∧ 𝑥 ∈ (Base‘𝑅)) → (𝑧(.r𝑅)𝑥) ∈ (Base‘𝑅))
2519, 20, 21, 24syl3anc 1250 . . . . . . . . 9 (((𝜑𝑥 ∈ (Base‘𝑅)) ∧ (𝑧 ∈ (Base‘𝑅) ∧ (𝑧(.r𝑅)𝑥) = 𝑦)) → (𝑧(.r𝑅)𝑥) ∈ (Base‘𝑅))
2618, 25eqeltrrd 2284 . . . . . . . 8 (((𝜑𝑥 ∈ (Base‘𝑅)) ∧ (𝑧 ∈ (Base‘𝑅) ∧ (𝑧(.r𝑅)𝑥) = 𝑦)) → 𝑦 ∈ (Base‘𝑅))
2726rexlimdvaa 2625 . . . . . . 7 ((𝜑𝑥 ∈ (Base‘𝑅)) → (∃𝑧 ∈ (Base‘𝑅)(𝑧(.r𝑅)𝑥) = 𝑦𝑦 ∈ (Base‘𝑅)))
2827imdistanda 448 . . . . . 6 (𝜑 → ((𝑥 ∈ (Base‘𝑅) ∧ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r𝑅)𝑥) = 𝑦) → (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))))
2928ssopab2dv 4329 . . . . 5 (𝜑 → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑅) ∧ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r𝑅)𝑥) = 𝑦)} ⊆ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))})
30 df-xp 4685 . . . . 5 ((Base‘𝑅) × (Base‘𝑅)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))}
3129, 30sseqtrrdi 3243 . . . 4 (𝜑 → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑅) ∧ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r𝑅)𝑥) = 𝑦)} ⊆ ((Base‘𝑅) × (Base‘𝑅)))
3217, 31ssexd 4188 . . 3 (𝜑 → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑅) ∧ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r𝑅)𝑥) = 𝑦)} ∈ V)
331, 9, 11, 32fvmptd3 5680 . 2 (𝜑 → (∥r𝑅) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑅) ∧ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r𝑅)𝑥) = 𝑦)})
34 dvdsrvald.2 . 2 (𝜑 = (∥r𝑅))
35 dvdsrvald.1 . . . . 5 (𝜑𝐵 = (Base‘𝑅))
3635eleq2d 2276 . . . 4 (𝜑 → (𝑥𝐵𝑥 ∈ (Base‘𝑅)))
37 dvdsrvald.3 . . . . . . 7 (𝜑· = (.r𝑅))
3837oveqd 5968 . . . . . 6 (𝜑 → (𝑧 · 𝑥) = (𝑧(.r𝑅)𝑥))
3938eqeq1d 2215 . . . . 5 (𝜑 → ((𝑧 · 𝑥) = 𝑦 ↔ (𝑧(.r𝑅)𝑥) = 𝑦))
4035, 39rexeqbidv 2720 . . . 4 (𝜑 → (∃𝑧𝐵 (𝑧 · 𝑥) = 𝑦 ↔ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r𝑅)𝑥) = 𝑦))
4136, 40anbi12d 473 . . 3 (𝜑 → ((𝑥𝐵 ∧ ∃𝑧𝐵 (𝑧 · 𝑥) = 𝑦) ↔ (𝑥 ∈ (Base‘𝑅) ∧ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r𝑅)𝑥) = 𝑦)))
4241opabbidv 4114 . 2 (𝜑 → {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐵 ∧ ∃𝑧𝐵 (𝑧 · 𝑥) = 𝑦)} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑅) ∧ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r𝑅)𝑥) = 𝑦)})
4333, 34, 423eqtr4d 2249 1 (𝜑 = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐵 ∧ ∃𝑧𝐵 (𝑧 · 𝑥) = 𝑦)})
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1373  wcel 2177  wrex 2486  Vcvv 2773  {copab 4108   × cxp 4677   Fn wfn 5271  cfv 5276  (class class class)co 5951  Basecbs 12876  .rcmulr 12954  SRingcsrg 13769  rcdsr 13892
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 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2179  ax-14 2180  ax-ext 2188  ax-sep 4166  ax-pow 4222  ax-pr 4257  ax-un 4484  ax-setind 4589  ax-cnex 8023  ax-resscn 8024  ax-1cn 8025  ax-1re 8026  ax-icn 8027  ax-addcl 8028  ax-addrcl 8029  ax-mulcl 8030  ax-addcom 8032  ax-addass 8034  ax-i2m1 8037  ax-0lt1 8038  ax-0id 8040  ax-rnegex 8041  ax-pre-ltirr 8044  ax-pre-ltadd 8048
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ne 2378  df-nel 2473  df-ral 2490  df-rex 2491  df-rab 2494  df-v 2775  df-sbc 3000  df-csb 3095  df-dif 3169  df-un 3171  df-in 3173  df-ss 3180  df-nul 3462  df-pw 3619  df-sn 3640  df-pr 3641  df-op 3643  df-uni 3853  df-int 3888  df-br 4048  df-opab 4110  df-mpt 4111  df-id 4344  df-xp 4685  df-rel 4686  df-cnv 4687  df-co 4688  df-dm 4689  df-rn 4690  df-res 4691  df-iota 5237  df-fun 5278  df-fn 5279  df-fv 5284  df-riota 5906  df-ov 5954  df-oprab 5955  df-mpo 5956  df-pnf 8116  df-mnf 8117  df-ltxr 8119  df-inn 9044  df-2 9102  df-3 9103  df-ndx 12879  df-slot 12880  df-base 12882  df-sets 12883  df-plusg 12966  df-mulr 12967  df-0g 13134  df-mgm 13232  df-sgrp 13278  df-mnd 13293  df-mgp 13727  df-srg 13770  df-dvdsr 13895
This theorem is referenced by:  dvdsrd  13900  dvdsrex  13904  dvdsrpropdg  13953  dvdsrzring  14409
  Copyright terms: Public domain W3C validator