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

Theorem dvdsrex 14136
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 2231 . . 3 (𝑅 ∈ SRing → (Base‘𝑅) = (Base‘𝑅))
2 eqidd 2231 . . 3 (𝑅 ∈ SRing → (∥r𝑅) = (∥r𝑅))
3 id 19 . . 3 (𝑅 ∈ SRing → 𝑅 ∈ SRing)
4 eqidd 2231 . . 3 (𝑅 ∈ SRing → (.r𝑅) = (.r𝑅))
51, 2, 3, 4dvdsrvald 14131 . 2 (𝑅 ∈ SRing → (∥r𝑅) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑅) ∧ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r𝑅)𝑥) = 𝑦)})
6 basfn 13164 . . . . 5 Base Fn V
7 elex 2813 . . . . 5 (𝑅 ∈ SRing → 𝑅 ∈ V)
8 funfvex 5659 . . . . . 6 ((Fun Base ∧ 𝑅 ∈ dom Base) → (Base‘𝑅) ∈ V)
98funfni 5434 . . . . 5 ((Base Fn V ∧ 𝑅 ∈ V) → (Base‘𝑅) ∈ V)
106, 7, 9sylancr 414 . . . 4 (𝑅 ∈ SRing → (Base‘𝑅) ∈ V)
11 xpexg 4842 . . . 4 (((Base‘𝑅) ∈ V ∧ (Base‘𝑅) ∈ V) → ((Base‘𝑅) × (Base‘𝑅)) ∈ V)
1210, 10, 11syl2anc 411 . . 3 (𝑅 ∈ SRing → ((Base‘𝑅) × (Base‘𝑅)) ∈ V)
13 simprr 533 . . . . . . . 8 (((𝑅 ∈ SRing ∧ 𝑥 ∈ (Base‘𝑅)) ∧ (𝑧 ∈ (Base‘𝑅) ∧ (𝑧(.r𝑅)𝑥) = 𝑦)) → (𝑧(.r𝑅)𝑥) = 𝑦)
14 simpll 527 . . . . . . . . 9 (((𝑅 ∈ SRing ∧ 𝑥 ∈ (Base‘𝑅)) ∧ (𝑧 ∈ (Base‘𝑅) ∧ (𝑧(.r𝑅)𝑥) = 𝑦)) → 𝑅 ∈ SRing)
15 simprl 531 . . . . . . . . 9 (((𝑅 ∈ SRing ∧ 𝑥 ∈ (Base‘𝑅)) ∧ (𝑧 ∈ (Base‘𝑅) ∧ (𝑧(.r𝑅)𝑥) = 𝑦)) → 𝑧 ∈ (Base‘𝑅))
16 simplr 529 . . . . . . . . 9 (((𝑅 ∈ SRing ∧ 𝑥 ∈ (Base‘𝑅)) ∧ (𝑧 ∈ (Base‘𝑅) ∧ (𝑧(.r𝑅)𝑥) = 𝑦)) → 𝑥 ∈ (Base‘𝑅))
17 eqid 2230 . . . . . . . . . 10 (Base‘𝑅) = (Base‘𝑅)
18 eqid 2230 . . . . . . . . . 10 (.r𝑅) = (.r𝑅)
1917, 18srgcl 14007 . . . . . . . . 9 ((𝑅 ∈ SRing ∧ 𝑧 ∈ (Base‘𝑅) ∧ 𝑥 ∈ (Base‘𝑅)) → (𝑧(.r𝑅)𝑥) ∈ (Base‘𝑅))
2014, 15, 16, 19syl3anc 1273 . . . . . . . 8 (((𝑅 ∈ SRing ∧ 𝑥 ∈ (Base‘𝑅)) ∧ (𝑧 ∈ (Base‘𝑅) ∧ (𝑧(.r𝑅)𝑥) = 𝑦)) → (𝑧(.r𝑅)𝑥) ∈ (Base‘𝑅))
2113, 20eqeltrrd 2308 . . . . . . 7 (((𝑅 ∈ SRing ∧ 𝑥 ∈ (Base‘𝑅)) ∧ (𝑧 ∈ (Base‘𝑅) ∧ (𝑧(.r𝑅)𝑥) = 𝑦)) → 𝑦 ∈ (Base‘𝑅))
2221rexlimdvaa 2650 . . . . . 6 ((𝑅 ∈ SRing ∧ 𝑥 ∈ (Base‘𝑅)) → (∃𝑧 ∈ (Base‘𝑅)(𝑧(.r𝑅)𝑥) = 𝑦𝑦 ∈ (Base‘𝑅)))
2322imdistanda 448 . . . . 5 (𝑅 ∈ SRing → ((𝑥 ∈ (Base‘𝑅) ∧ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r𝑅)𝑥) = 𝑦) → (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))))
2423ssopab2dv 4375 . . . 4 (𝑅 ∈ SRing → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑅) ∧ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r𝑅)𝑥) = 𝑦)} ⊆ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))})
25 df-xp 4733 . . . 4 ((Base‘𝑅) × (Base‘𝑅)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))}
2624, 25sseqtrrdi 3275 . . 3 (𝑅 ∈ SRing → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑅) ∧ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r𝑅)𝑥) = 𝑦)} ⊆ ((Base‘𝑅) × (Base‘𝑅)))
2712, 26ssexd 4230 . 2 (𝑅 ∈ SRing → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑅) ∧ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r𝑅)𝑥) = 𝑦)} ∈ V)
285, 27eqeltrd 2307 1 (𝑅 ∈ SRing → (∥r𝑅) ∈ V)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1397  wcel 2201  wrex 2510  Vcvv 2801  {copab 4150   × cxp 4725   Fn wfn 5323  cfv 5328  (class class class)co 6023  Basecbs 13105  .rcmulr 13184  SRingcsrg 14000  rcdsr 14123
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2203  ax-14 2204  ax-ext 2212  ax-sep 4208  ax-pow 4266  ax-pr 4301  ax-un 4532  ax-setind 4637  ax-cnex 8128  ax-resscn 8129  ax-1cn 8130  ax-1re 8131  ax-icn 8132  ax-addcl 8133  ax-addrcl 8134  ax-mulcl 8135  ax-addcom 8137  ax-addass 8139  ax-i2m1 8142  ax-0lt1 8143  ax-0id 8145  ax-rnegex 8146  ax-pre-ltirr 8149  ax-pre-ltadd 8153
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1810  df-eu 2081  df-mo 2082  df-clab 2217  df-cleq 2223  df-clel 2226  df-nfc 2362  df-ne 2402  df-nel 2497  df-ral 2514  df-rex 2515  df-rab 2518  df-v 2803  df-sbc 3031  df-csb 3127  df-dif 3201  df-un 3203  df-in 3205  df-ss 3212  df-nul 3494  df-pw 3655  df-sn 3676  df-pr 3677  df-op 3679  df-uni 3895  df-int 3930  df-br 4090  df-opab 4152  df-mpt 4153  df-id 4392  df-xp 4733  df-rel 4734  df-cnv 4735  df-co 4736  df-dm 4737  df-rn 4738  df-res 4739  df-iota 5288  df-fun 5330  df-fn 5331  df-fv 5336  df-riota 5976  df-ov 6026  df-oprab 6027  df-mpo 6028  df-pnf 8221  df-mnf 8222  df-ltxr 8224  df-inn 9149  df-2 9207  df-3 9208  df-ndx 13108  df-slot 13109  df-base 13111  df-sets 13112  df-plusg 13196  df-mulr 13197  df-0g 13364  df-mgm 13462  df-sgrp 13508  df-mnd 13523  df-mgp 13958  df-srg 14001  df-dvdsr 14126
This theorem is referenced by:  isunitd  14144
  Copyright terms: Public domain W3C validator