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

Theorem reldvdsrsrg 13724
Description: The divides relation is a relation. (Contributed by Mario Carneiro, 1-Dec-2014.) (Revised by Jim Kingdon, 24-Jan-2025.)
Assertion
Ref Expression
reldvdsrsrg (𝑅 ∈ SRing → Rel (∥r𝑅))

Proof of Theorem reldvdsrsrg
Dummy variables 𝑥 𝑤 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-dvdsr 13721 . . . . 5 r = (𝑤 ∈ V ↦ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑤) ∧ ∃𝑧 ∈ (Base‘𝑤)(𝑧(.r𝑤)𝑥) = 𝑦)})
2 fveq2 5561 . . . . . . . 8 (𝑤 = 𝑅 → (Base‘𝑤) = (Base‘𝑅))
32eleq2d 2266 . . . . . . 7 (𝑤 = 𝑅 → (𝑥 ∈ (Base‘𝑤) ↔ 𝑥 ∈ (Base‘𝑅)))
4 fveq2 5561 . . . . . . . . . 10 (𝑤 = 𝑅 → (.r𝑤) = (.r𝑅))
54oveqd 5942 . . . . . . . . 9 (𝑤 = 𝑅 → (𝑧(.r𝑤)𝑥) = (𝑧(.r𝑅)𝑥))
65eqeq1d 2205 . . . . . . . 8 (𝑤 = 𝑅 → ((𝑧(.r𝑤)𝑥) = 𝑦 ↔ (𝑧(.r𝑅)𝑥) = 𝑦))
72, 6rexeqbidv 2710 . . . . . . 7 (𝑤 = 𝑅 → (∃𝑧 ∈ (Base‘𝑤)(𝑧(.r𝑤)𝑥) = 𝑦 ↔ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r𝑅)𝑥) = 𝑦))
83, 7anbi12d 473 . . . . . 6 (𝑤 = 𝑅 → ((𝑥 ∈ (Base‘𝑤) ∧ ∃𝑧 ∈ (Base‘𝑤)(𝑧(.r𝑤)𝑥) = 𝑦) ↔ (𝑥 ∈ (Base‘𝑅) ∧ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r𝑅)𝑥) = 𝑦)))
98opabbidv 4100 . . . . 5 (𝑤 = 𝑅 → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑤) ∧ ∃𝑧 ∈ (Base‘𝑤)(𝑧(.r𝑤)𝑥) = 𝑦)} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑅) ∧ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r𝑅)𝑥) = 𝑦)})
10 elex 2774 . . . . 5 (𝑅 ∈ SRing → 𝑅 ∈ V)
11 basfn 12761 . . . . . . . 8 Base Fn V
12 funfvex 5578 . . . . . . . . 9 ((Fun Base ∧ 𝑅 ∈ dom Base) → (Base‘𝑅) ∈ V)
1312funfni 5361 . . . . . . . 8 ((Base Fn V ∧ 𝑅 ∈ V) → (Base‘𝑅) ∈ V)
1411, 10, 13sylancr 414 . . . . . . 7 (𝑅 ∈ SRing → (Base‘𝑅) ∈ V)
15 xpexg 4778 . . . . . . 7 (((Base‘𝑅) ∈ V ∧ (Base‘𝑅) ∈ V) → ((Base‘𝑅) × (Base‘𝑅)) ∈ V)
1614, 14, 15syl2anc 411 . . . . . 6 (𝑅 ∈ SRing → ((Base‘𝑅) × (Base‘𝑅)) ∈ V)
17 simpr 110 . . . . . . . . . . 11 ((((𝑅 ∈ SRing ∧ 𝑥 ∈ (Base‘𝑅)) ∧ 𝑧 ∈ (Base‘𝑅)) ∧ (𝑧(.r𝑅)𝑥) = 𝑦) → (𝑧(.r𝑅)𝑥) = 𝑦)
18 simplll 533 . . . . . . . . . . . 12 ((((𝑅 ∈ SRing ∧ 𝑥 ∈ (Base‘𝑅)) ∧ 𝑧 ∈ (Base‘𝑅)) ∧ (𝑧(.r𝑅)𝑥) = 𝑦) → 𝑅 ∈ SRing)
19 simplr 528 . . . . . . . . . . . 12 ((((𝑅 ∈ SRing ∧ 𝑥 ∈ (Base‘𝑅)) ∧ 𝑧 ∈ (Base‘𝑅)) ∧ (𝑧(.r𝑅)𝑥) = 𝑦) → 𝑧 ∈ (Base‘𝑅))
20 simpllr 534 . . . . . . . . . . . 12 ((((𝑅 ∈ SRing ∧ 𝑥 ∈ (Base‘𝑅)) ∧ 𝑧 ∈ (Base‘𝑅)) ∧ (𝑧(.r𝑅)𝑥) = 𝑦) → 𝑥 ∈ (Base‘𝑅))
21 eqid 2196 . . . . . . . . . . . . 13 (Base‘𝑅) = (Base‘𝑅)
22 eqid 2196 . . . . . . . . . . . . 13 (.r𝑅) = (.r𝑅)
2321, 22srgcl 13602 . . . . . . . . . . . 12 ((𝑅 ∈ SRing ∧ 𝑧 ∈ (Base‘𝑅) ∧ 𝑥 ∈ (Base‘𝑅)) → (𝑧(.r𝑅)𝑥) ∈ (Base‘𝑅))
2418, 19, 20, 23syl3anc 1249 . . . . . . . . . . 11 ((((𝑅 ∈ SRing ∧ 𝑥 ∈ (Base‘𝑅)) ∧ 𝑧 ∈ (Base‘𝑅)) ∧ (𝑧(.r𝑅)𝑥) = 𝑦) → (𝑧(.r𝑅)𝑥) ∈ (Base‘𝑅))
2517, 24eqeltrrd 2274 . . . . . . . . . 10 ((((𝑅 ∈ SRing ∧ 𝑥 ∈ (Base‘𝑅)) ∧ 𝑧 ∈ (Base‘𝑅)) ∧ (𝑧(.r𝑅)𝑥) = 𝑦) → 𝑦 ∈ (Base‘𝑅))
2625rexlimdva2 2617 . . . . . . . . 9 ((𝑅 ∈ SRing ∧ 𝑥 ∈ (Base‘𝑅)) → (∃𝑧 ∈ (Base‘𝑅)(𝑧(.r𝑅)𝑥) = 𝑦𝑦 ∈ (Base‘𝑅)))
2726imdistanda 448 . . . . . . . 8 (𝑅 ∈ SRing → ((𝑥 ∈ (Base‘𝑅) ∧ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r𝑅)𝑥) = 𝑦) → (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))))
2827ssopab2dv 4314 . . . . . . 7 (𝑅 ∈ SRing → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑅) ∧ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r𝑅)𝑥) = 𝑦)} ⊆ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))})
29 df-xp 4670 . . . . . . 7 ((Base‘𝑅) × (Base‘𝑅)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))}
3028, 29sseqtrrdi 3233 . . . . . 6 (𝑅 ∈ SRing → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑅) ∧ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r𝑅)𝑥) = 𝑦)} ⊆ ((Base‘𝑅) × (Base‘𝑅)))
3116, 30ssexd 4174 . . . . 5 (𝑅 ∈ SRing → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑅) ∧ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r𝑅)𝑥) = 𝑦)} ∈ V)
321, 9, 10, 31fvmptd3 5658 . . . 4 (𝑅 ∈ SRing → (∥r𝑅) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑅) ∧ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r𝑅)𝑥) = 𝑦)})
3332, 30eqsstrd 3220 . . 3 (𝑅 ∈ SRing → (∥r𝑅) ⊆ ((Base‘𝑅) × (Base‘𝑅)))
34 xpss 4772 . . 3 ((Base‘𝑅) × (Base‘𝑅)) ⊆ (V × V)
3533, 34sstrdi 3196 . 2 (𝑅 ∈ SRing → (∥r𝑅) ⊆ (V × V))
36 df-rel 4671 . 2 (Rel (∥r𝑅) ↔ (∥r𝑅) ⊆ (V × V))
3735, 36sylibr 134 1 (𝑅 ∈ SRing → Rel (∥r𝑅))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1364  wcel 2167  wrex 2476  Vcvv 2763  wss 3157  {copab 4094   × cxp 4662  Rel wrel 4669   Fn wfn 5254  cfv 5259  (class class class)co 5925  Basecbs 12703  .rcmulr 12781  SRingcsrg 13595  rcdsr 13718
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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-cnex 7987  ax-resscn 7988  ax-1cn 7989  ax-1re 7990  ax-icn 7991  ax-addcl 7992  ax-addrcl 7993  ax-mulcl 7994  ax-addcom 7996  ax-addass 7998  ax-i2m1 8001  ax-0lt1 8002  ax-0id 8004  ax-rnegex 8005  ax-pre-ltirr 8008  ax-pre-ltadd 8012
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3452  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-iota 5220  df-fun 5261  df-fn 5262  df-fv 5267  df-riota 5880  df-ov 5928  df-oprab 5929  df-mpo 5930  df-pnf 8080  df-mnf 8081  df-ltxr 8083  df-inn 9008  df-2 9066  df-3 9067  df-ndx 12706  df-slot 12707  df-base 12709  df-sets 12710  df-plusg 12793  df-mulr 12794  df-0g 12960  df-mgm 13058  df-sgrp 13104  df-mnd 13119  df-mgp 13553  df-srg 13596  df-dvdsr 13721
This theorem is referenced by:  dvdsrd  13726  isunitd  13738  subrgdvds  13867
  Copyright terms: Public domain W3C validator