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

Theorem dvdsrex 14515
Description: Existence of the divisibility relation. (Contributed by Jim Kingdon, 28-Jan-2025.)
Assertion
Ref Expression
dvdsrex (𝑅 ∈ SRing → (∥r‘𝑅) ∈ V)

Proof of Theorem dvdsrex
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqidd 2239 . . 3 (𝑅 ∈ SRing → (Base‘𝑅) = (Base‘𝑅))
2 eqidd 2239 . . 3 (𝑅 ∈ SRing → (∥r‘𝑅) = (∥r‘𝑅))
3 id 19 . . 3 (𝑅 ∈ SRing → 𝑅 ∈ SRing)
4 eqidd 2239 . . 3 (𝑅 ∈ SRing → (.r‘𝑅) = (.r‘𝑅))
51, 2, 3, 4dvdsrvald 14510 . 2 (𝑅 ∈ SRing → (∥r‘𝑅) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑅) ∧ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r‘𝑅)𝑥) = 𝑦)})
6 basfn 13470 . . . . 5 Base Fn V
7 elex 2833 . . . . 5 (𝑅 ∈ SRing → 𝑅 ∈ V)
8 funfvex 5715 . . . . . 6 ((Fun Base ∧ 𝑅 ∈ dom Base) → (Base‘𝑅) ∈ V)
98funfni 5486 . . . . 5 ((Base Fn V ∧ 𝑅 ∈ V) → (Base‘𝑅) ∈ V)
106, 7, 9sylancr 418 . . . 4 (𝑅 ∈ SRing → (Base‘𝑅) ∈ V)
11 xpexg 4891 . . . 4 (((Base‘𝑅) ∈ V ∧ (Base‘𝑅) ∈ V) → ((Base‘𝑅) × (Base‘𝑅)) ∈ V)
1210, 10, 11syl2anc 415 . . 3 (𝑅 ∈ SRing → ((Base‘𝑅) × (Base‘𝑅)) ∈ V)
13 simprr 537 . . . . . . . 8 (((𝑅 ∈ SRing ∧ 𝑥 ∈ (Base‘𝑅)) ∧ (𝑧 ∈ (Base‘𝑅) ∧ (𝑧(.r‘𝑅)𝑥) = 𝑦)) → (𝑧(.r‘𝑅)𝑥) = 𝑦)
14 simpll 531 . . . . . . . . 9 (((𝑅 ∈ SRing ∧ 𝑥 ∈ (Base‘𝑅)) ∧ (𝑧 ∈ (Base‘𝑅) ∧ (𝑧(.r‘𝑅)𝑥) = 𝑦)) → 𝑅 ∈ SRing)
15 simprl 535 . . . . . . . . 9 (((𝑅 ∈ SRing ∧ 𝑥 ∈ (Base‘𝑅)) ∧ (𝑧 ∈ (Base‘𝑅) ∧ (𝑧(.r‘𝑅)𝑥) = 𝑦)) → 𝑧 ∈ (Base‘𝑅))
16 simplr 533 . . . . . . . . 9 (((𝑅 ∈ SRing ∧ 𝑥 ∈ (Base‘𝑅)) ∧ (𝑧 ∈ (Base‘𝑅) ∧ (𝑧(.r‘𝑅)𝑥) = 𝑦)) → 𝑥 ∈ (Base‘𝑅))
17 eqid 2238 . . . . . . . . . 10 (Base‘𝑅) = (Base‘𝑅)
18 eqid 2238 . . . . . . . . . 10 (.r‘𝑅) = (.r‘𝑅)
1917, 18srgcl 14382 . . . . . . . . 9 ((𝑅 ∈ SRing ∧ 𝑧 ∈ (Base‘𝑅) ∧ 𝑥 ∈ (Base‘𝑅)) → (𝑧(.r‘𝑅)𝑥) ∈ (Base‘𝑅))
2014, 15, 16, 19syl3anc 1278 . . . . . . . 8 (((𝑅 ∈ SRing ∧ 𝑥 ∈ (Base‘𝑅)) ∧ (𝑧 ∈ (Base‘𝑅) ∧ (𝑧(.r‘𝑅)𝑥) = 𝑦)) → (𝑧(.r‘𝑅)𝑥) ∈ (Base‘𝑅))
2113, 20eqeltrrd 2316 . . . . . . 7 (((𝑅 ∈ SRing ∧ 𝑥 ∈ (Base‘𝑅)) ∧ (𝑧 ∈ (Base‘𝑅) ∧ (𝑧(.r‘𝑅)𝑥) = 𝑦)) → 𝑦 ∈ (Base‘𝑅))
2221rexlimdvaa 2669 . . . . . 6 ((𝑅 ∈ SRing ∧ 𝑥 ∈ (Base‘𝑅)) → (∃𝑧 ∈ (Base‘𝑅)(𝑧(.r‘𝑅)𝑥) = 𝑦 → 𝑦 ∈ (Base‘𝑅)))
2322imdistanda 452 . . . . 5 (𝑅 ∈ SRing → ((𝑥 ∈ (Base‘𝑅) ∧ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r‘𝑅)𝑥) = 𝑦) → (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))))
2423ssopab2dv 4423 . . . 4 (𝑅 ∈ SRing → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑅) ∧ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r‘𝑅)𝑥) = 𝑦)} ⊆ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))})
25 df-xp 4782 . . . 4 ((Base‘𝑅) × (Base‘𝑅)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))}
2624, 25sseqtrrdi 3297 . . 3 (𝑅 ∈ SRing → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑅) ∧ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r‘𝑅)𝑥) = 𝑦)} ⊆ ((Base‘𝑅) × (Base‘𝑅)))
2712, 26ssexd 4275 . 2 (𝑅 ∈ SRing → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑅) ∧ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r‘𝑅)𝑥) = 𝑦)} ∈ V)
285, 27eqeltrd 2315 1 (𝑅 ∈ SRing → (∥r‘𝑅) ∈ V)
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   = wceq 1402   ∈ wcel 2209  ∃wrex 2529  Vcvv 2821  {copab 4192   × cxp 4774   Fn wfn 5375  ‘cfv 5380  (class class class)co 6088  Basecbs 13411  .rcmulr 13492  SRingcsrg 14375  ∥rcdsr 14502
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-cnex 8277  ax-resscn 8278  ax-1cn 8279  ax-1re 8280  ax-icn 8281  ax-addcl 8282  ax-addrcl 8283  ax-mulcl 8284  ax-addcom 8286  ax-addass 8288  ax-i2m1 8291  ax-0lt1 8292  ax-0id 8294  ax-rnegex 8295  ax-pre-ltirr 8298  ax-pre-ltadd 8302
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-iota 5340  df-fun 5382  df-fn 5383  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-pnf 8369  df-mnf 8370  df-ltxr 8372  df-inn 9315  df-2 9373  df-3 9374  df-ndx 13414  df-slot 13415  df-base 13417  df-sets 13418  df-plusg 13504  df-mulr 13505  df-0g 13672  df-mgm 13736  df-sgrp 13777  df-mnd 13790  df-mgp 14326  df-srg 14376  df-dvdsr 14505
This theorem is used by:  isunitd  14523
  Copyright terms: Public domain W3C validator