Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  rspectopn Structured version   Visualization version   GIF version

Theorem rspectopn 34385
Description: The topology component of the spectrum of a ring. (Contributed by Thierry Arnoux, 4-Jun-2024.)
Hypotheses
Ref Expression
rspecbas.1 𝑆 = (Spec‘𝑅)
rspectopn.1 𝐼 = (LIdeal‘𝑅)
rspectopn.2 𝑃 = (PrmIdeal‘𝑅)
rspectopn.3 𝐽 = ran (𝑖𝐼 ↦ {𝑗𝑃 ∣ ¬ 𝑖𝑗})
Assertion
Ref Expression
rspectopn (𝑅 ∈ Ring → 𝐽 = (TopOpen‘𝑆))
Distinct variable groups:   𝑖,𝐼,𝑗   𝑃,𝑖,𝑗   𝑅,𝑖,𝑗
Allowed substitution hints:   𝑆(𝑖, 𝑗)   𝐽(𝑖, 𝑗)

Proof of Theorem rspectopn
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 rspecval 34382 . . . . 5 (𝑅 ∈ Ring → (Spec‘𝑅) = ((IDLsrg‘𝑅) ↾s (PrmIdeal‘𝑅)))
2 rspecbas.1 . . . . 5 𝑆 = (Spec‘𝑅)
3 rspectopn.2 . . . . . 6 𝑃 = (PrmIdeal‘𝑅)
43oveq2i 7428 . . . . 5 ((IDLsrg‘𝑅) ↾s 𝑃) = ((IDLsrg‘𝑅) ↾s (PrmIdeal‘𝑅))
51, 2, 43eqtr4g 2822 . . . 4 (𝑅 ∈ Ring → 𝑆 = ((IDLsrg‘𝑅) ↾s 𝑃))
65fveq2d 6886 . . 3 (𝑅 ∈ Ring → (TopOpen‘𝑆) = (TopOpen‘((IDLsrg‘𝑅) ↾s 𝑃)))
7 eqid 2762 . . . 4 ((IDLsrg‘𝑅) ↾s 𝑃) = ((IDLsrg‘𝑅) ↾s 𝑃)
8 eqid 2762 . . . 4 (TopOpen‘(IDLsrg‘𝑅)) = (TopOpen‘(IDLsrg‘𝑅))
97, 8resstopn 23417 . . 3 ((TopOpen‘(IDLsrg‘𝑅)) ↾t 𝑃) = (TopOpen‘((IDLsrg‘𝑅) ↾s 𝑃))
106, 9eqtr4di 2815 . 2 (𝑅 ∈ Ring → (TopOpen‘𝑆) = ((TopOpen‘(IDLsrg‘𝑅)) ↾t 𝑃))
11 eqid 2762 . . . . 5 (IDLsrg‘𝑅) = (IDLsrg‘𝑅)
12 rspectopn.1 . . . . 5 𝐼 = (LIdeal‘𝑅)
13 eqid 2762 . . . . 5 ran (𝑖𝐼 ↦ {𝑗𝐼 ∣ ¬ 𝑖𝑗}) = ran (𝑖𝐼 ↦ {𝑗𝐼 ∣ ¬ 𝑖𝑗})
1411, 12, 13idlsrgtset 33926 . . . 4 (𝑅 ∈ Ring → ran (𝑖𝐼 ↦ {𝑗𝐼 ∣ ¬ 𝑖𝑗}) = (TopSet‘(IDLsrg‘𝑅)))
1512fvexi 6896 . . . . . . . . . . 11 𝐼 ∈ V
1615rabex 5307 . . . . . . . . . 10 {𝑗𝐼 ∣ ¬ 𝑖𝑗} ∈ V
1716a1i 11 . . . . . . . . 9 ((𝑅 ∈ Ring ∧ 𝑖𝐼) → {𝑗𝐼 ∣ ¬ 𝑖𝑗} ∈ V)
18 simp2 1155 . . . . . . . . . . 11 (((𝑅 ∈ Ring ∧ 𝑖𝐼) ∧ 𝑗𝐼 ∧ ¬ 𝑖𝑗) → 𝑗𝐼)
1911, 12idlsrgbas 33922 . . . . . . . . . . . . 13 (𝑅 ∈ Ring → 𝐼 = (Base‘(IDLsrg‘𝑅)))
2019adantr 486 . . . . . . . . . . . 12 ((𝑅 ∈ Ring ∧ 𝑖𝐼) → 𝐼 = (Base‘(IDLsrg‘𝑅)))
21203ad2ant1 1151 . . . . . . . . . . 11 (((𝑅 ∈ Ring ∧ 𝑖𝐼) ∧ 𝑗𝐼 ∧ ¬ 𝑖𝑗) → 𝐼 = (Base‘(IDLsrg‘𝑅)))
2218, 21eleqtrd 2864 . . . . . . . . . 10 (((𝑅 ∈ Ring ∧ 𝑖𝐼) ∧ 𝑗𝐼 ∧ ¬ 𝑖𝑗) → 𝑗 ∈ (Base‘(IDLsrg‘𝑅)))
2322rabssdv 4025 . . . . . . . . 9 ((𝑅 ∈ Ring ∧ 𝑖𝐼) → {𝑗𝐼 ∣ ¬ 𝑖𝑗} ⊆ (Base‘(IDLsrg‘𝑅)))
2417, 23elpwd 4566 . . . . . . . 8 ((𝑅 ∈ Ring ∧ 𝑖𝐼) → {𝑗𝐼 ∣ ¬ 𝑖𝑗} ∈ 𝒫 (Base‘(IDLsrg‘𝑅)))
2524ralrimiva 3156 . . . . . . 7 (𝑅 ∈ Ring → ∀𝑖𝐼 {𝑗𝐼 ∣ ¬ 𝑖𝑗} ∈ 𝒫 (Base‘(IDLsrg‘𝑅)))
26 eqid 2762 . . . . . . . 8 (𝑖𝐼 ↦ {𝑗𝐼 ∣ ¬ 𝑖𝑗}) = (𝑖𝐼 ↦ {𝑗𝐼 ∣ ¬ 𝑖𝑗})
2726rnmptss 7120 . . . . . . 7 (∀𝑖𝐼 {𝑗𝐼 ∣ ¬ 𝑖𝑗} ∈ 𝒫 (Base‘(IDLsrg‘𝑅)) → ran (𝑖𝐼 ↦ {𝑗𝐼 ∣ ¬ 𝑖𝑗}) ⊆ 𝒫 (Base‘(IDLsrg‘𝑅)))
2825, 27syl 18 . . . . . 6 (𝑅 ∈ Ring → ran (𝑖𝐼 ↦ {𝑗𝐼 ∣ ¬ 𝑖𝑗}) ⊆ 𝒫 (Base‘(IDLsrg‘𝑅)))
2914, 28eqsstrrd 3969 . . . . 5 (𝑅 ∈ Ring → (TopSet‘(IDLsrg‘𝑅)) ⊆ 𝒫 (Base‘(IDLsrg‘𝑅)))
30 eqid 2762 . . . . . 6 (Base‘(IDLsrg‘𝑅)) = (Base‘(IDLsrg‘𝑅))
31 eqid 2762 . . . . . 6 (TopSet‘(IDLsrg‘𝑅)) = (TopSet‘(IDLsrg‘𝑅))
3230, 31topnid 17526 . . . . 5 ((TopSet‘(IDLsrg‘𝑅)) ⊆ 𝒫 (Base‘(IDLsrg‘𝑅)) → (TopSet‘(IDLsrg‘𝑅)) = (TopOpen‘(IDLsrg‘𝑅)))
3329, 32syl 18 . . . 4 (𝑅 ∈ Ring → (TopSet‘(IDLsrg‘𝑅)) = (TopOpen‘(IDLsrg‘𝑅)))
3414, 33eqtrd 2797 . . 3 (𝑅 ∈ Ring → ran (𝑖𝐼 ↦ {𝑗𝐼 ∣ ¬ 𝑖𝑗}) = (TopOpen‘(IDLsrg‘𝑅)))
3534oveq1d 7432 . 2 (𝑅 ∈ Ring → (ran (𝑖𝐼 ↦ {𝑗𝐼 ∣ ¬ 𝑖𝑗}) ↾t 𝑃) = ((TopOpen‘(IDLsrg‘𝑅)) ↾t 𝑃))
3615mptex 7226 . . . . . . 7 (𝑖𝐼 ↦ {𝑗𝐼 ∣ ¬ 𝑖𝑗}) ∈ V
3736rnex 7911 . . . . . 6 ran (𝑖𝐼 ↦ {𝑗𝐼 ∣ ¬ 𝑖𝑗}) ∈ V
383fvexi 6896 . . . . . 6 𝑃 ∈ V
39 elrest 17518 . . . . . 6 ((ran (𝑖𝐼 ↦ {𝑗𝐼 ∣ ¬ 𝑖𝑗}) ∈ V ∧ 𝑃 ∈ V) → (𝑥 ∈ (ran (𝑖𝐼 ↦ {𝑗𝐼 ∣ ¬ 𝑖𝑗}) ↾t 𝑃) ↔ ∃𝑦 ∈ ran (𝑖𝐼 ↦ {𝑗𝐼 ∣ ¬ 𝑖𝑗})𝑥 = (𝑦𝑃)))
4037, 38, 39mp2an 705 . . . . 5 (𝑥 ∈ (ran (𝑖𝐼 ↦ {𝑗𝐼 ∣ ¬ 𝑖𝑗}) ↾t 𝑃) ↔ ∃𝑦 ∈ ran (𝑖𝐼 ↦ {𝑗𝐼 ∣ ¬ 𝑖𝑗})𝑥 = (𝑦𝑃))
4116rgenw 3082 . . . . . . 7 𝑖𝐼 {𝑗𝐼 ∣ ¬ 𝑖𝑗} ∈ V
42 ineq1 4162 . . . . . . . . 9 (𝑦 = {𝑗𝐼 ∣ ¬ 𝑖𝑗} → (𝑦𝑃) = ({𝑗𝐼 ∣ ¬ 𝑖𝑗} ∩ 𝑃))
4342eqeq2d 2773 . . . . . . . 8 (𝑦 = {𝑗𝐼 ∣ ¬ 𝑖𝑗} → (𝑥 = (𝑦𝑃) ↔ 𝑥 = ({𝑗𝐼 ∣ ¬ 𝑖𝑗} ∩ 𝑃)))
4426, 43rexrnmptw 7092 . . . . . . 7 (∀𝑖𝐼 {𝑗𝐼 ∣ ¬ 𝑖𝑗} ∈ V → (∃𝑦 ∈ ran (𝑖𝐼 ↦ {𝑗𝐼 ∣ ¬ 𝑖𝑗})𝑥 = (𝑦𝑃) ↔ ∃𝑖𝐼 𝑥 = ({𝑗𝐼 ∣ ¬ 𝑖𝑗} ∩ 𝑃)))
4541, 44ax-mp 5 . . . . . 6 (∃𝑦 ∈ ran (𝑖𝐼 ↦ {𝑗𝐼 ∣ ¬ 𝑖𝑗})𝑥 = (𝑦𝑃) ↔ ∃𝑖𝐼 𝑥 = ({𝑗𝐼 ∣ ¬ 𝑖𝑗} ∩ 𝑃))
46 inrab2 4266 . . . . . . . . 9 ({𝑗𝐼 ∣ ¬ 𝑖𝑗} ∩ 𝑃) = {𝑗 ∈ (𝐼𝑃) ∣ ¬ 𝑖𝑗}
47 prmidlssidl 21539 . . . . . . . . . . . 12 (𝑅 ∈ Ring → (PrmIdeal‘𝑅) ⊆ (LIdeal‘𝑅))
4847, 3, 123sstr4g 3987 . . . . . . . . . . 11 (𝑅 ∈ Ring → 𝑃𝐼)
49 sseqin2 4172 . . . . . . . . . . 11 (𝑃𝐼 ↔ (𝐼𝑃) = 𝑃)
5048, 49sylib 221 . . . . . . . . . 10 (𝑅 ∈ Ring → (𝐼𝑃) = 𝑃)
5150rabeqdv 3429 . . . . . . . . 9 (𝑅 ∈ Ring → {𝑗 ∈ (𝐼𝑃) ∣ ¬ 𝑖𝑗} = {𝑗𝑃 ∣ ¬ 𝑖𝑗})
5246, 51eqtrid 2809 . . . . . . . 8 (𝑅 ∈ Ring → ({𝑗𝐼 ∣ ¬ 𝑖𝑗} ∩ 𝑃) = {𝑗𝑃 ∣ ¬ 𝑖𝑗})
5352eqeq2d 2773 . . . . . . 7 (𝑅 ∈ Ring → (𝑥 = ({𝑗𝐼 ∣ ¬ 𝑖𝑗} ∩ 𝑃) ↔ 𝑥 = {𝑗𝑃 ∣ ¬ 𝑖𝑗}))
5453rexbidv 3188 . . . . . 6 (𝑅 ∈ Ring → (∃𝑖𝐼 𝑥 = ({𝑗𝐼 ∣ ¬ 𝑖𝑗} ∩ 𝑃) ↔ ∃𝑖𝐼 𝑥 = {𝑗𝑃 ∣ ¬ 𝑖𝑗}))
5545, 54bitrid 286 . . . . 5 (𝑅 ∈ Ring → (∃𝑦 ∈ ran (𝑖𝐼 ↦ {𝑗𝐼 ∣ ¬ 𝑖𝑗})𝑥 = (𝑦𝑃) ↔ ∃𝑖𝐼 𝑥 = {𝑗𝑃 ∣ ¬ 𝑖𝑗}))
5640, 55bitrid 286 . . . 4 (𝑅 ∈ Ring → (𝑥 ∈ (ran (𝑖𝐼 ↦ {𝑗𝐼 ∣ ¬ 𝑖𝑗}) ↾t 𝑃) ↔ ∃𝑖𝐼 𝑥 = {𝑗𝑃 ∣ ¬ 𝑖𝑗}))
57 rspectopn.3 . . . . . 6 𝐽 = ran (𝑖𝐼 ↦ {𝑗𝑃 ∣ ¬ 𝑖𝑗})
5857eleq2i 2854 . . . . 5 (𝑥𝐽𝑥 ∈ ran (𝑖𝐼 ↦ {𝑗𝑃 ∣ ¬ 𝑖𝑗}))
59 eqid 2762 . . . . . 6 (𝑖𝐼 ↦ {𝑗𝑃 ∣ ¬ 𝑖𝑗}) = (𝑖𝐼 ↦ {𝑗𝑃 ∣ ¬ 𝑖𝑗})
6038rabex 5307 . . . . . 6 {𝑗𝑃 ∣ ¬ 𝑖𝑗} ∈ V
6159, 60elrnmpti 5950 . . . . 5 (𝑥 ∈ ran (𝑖𝐼 ↦ {𝑗𝑃 ∣ ¬ 𝑖𝑗}) ↔ ∃𝑖𝐼 𝑥 = {𝑗𝑃 ∣ ¬ 𝑖𝑗})
6258, 61bitri 278 . . . 4 (𝑥𝐽 ↔ ∃𝑖𝐼 𝑥 = {𝑗𝑃 ∣ ¬ 𝑖𝑗})
6356, 62bitr4di 292 . . 3 (𝑅 ∈ Ring → (𝑥 ∈ (ran (𝑖𝐼 ↦ {𝑗𝐼 ∣ ¬ 𝑖𝑗}) ↾t 𝑃) ↔ 𝑥𝐽))
6463eqrdv 2760 . 2 (𝑅 ∈ Ring → (ran (𝑖𝐼 ↦ {𝑗𝐼 ∣ ¬ 𝑖𝑗}) ↾t 𝑃) = 𝐽)
6510, 35, 643eqtr2rd 2804 1 (𝑅 ∈ Ring → 𝐽 = (TopOpen‘𝑆))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wb 209  wa 401  w3a 1103   = wceq 1570  wcel 2145  wral 3078  wrex 3088  {crab 3414  Vcvv 3453  cin 3901  wss 3902  𝒫 cpw 4560  cmpt 5190  ran crn 5660  cfv 6537  (class class class)co 7417  Basecbs 17307  s cress 17328  TopSetcts 17354  t crest 17511  TopOpenctopn 17512  Ringcrg 20378  LIdealclidl 21399  PrmIdealcprmidl 21529  IDLsrgcidlsrg 33918  Speccrspec 34380
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7740  ax-cnex 11184  ax-resscn 11185  ax-1cn 11186  ax-icn 11187  ax-addcl 11188  ax-addrcl 11189  ax-mulcl 11190  ax-mulrcl 11191  ax-mulcom 11192  ax-addass 11193  ax-mulass 11194  ax-distr 11195  ax-i2m1 11196  ax-1ne0 11197  ax-1rid 11198  ax-rnegex 11199  ax-rrecex 11200  ax-cnre 11201  ax-pre-lttri 11202  ax-pre-lttrn 11203  ax-pre-ltadd 11204  ax-pre-mulgt0 11205
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3064  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-tp 4592  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7374  df-ov 7420  df-oprab 7421  df-mpo 7422  df-om 7867  df-1st 7990  df-2nd 7991  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-1o 8459  df-er 8700  df-en 8957  df-dom 8958  df-sdom 8959  df-fin 8960  df-pnf 11273  df-mnf 11274  df-xr 11275  df-ltxr 11276  df-le 11277  df-sub 11471  df-neg 11472  df-nn 12262  df-2 12331  df-3 12332  df-4 12333  df-5 12334  df-6 12335  df-7 12336  df-8 12337  df-9 12338  df-n0 12533  df-z 12620  df-dec 12741  df-uz 12892  df-fz 13566  df-struct 17245  df-sets 17262  df-slot 17280  df-ndx 17292  df-base 17308  df-ress 17329  df-plusg 17361  df-mulr 17362  df-tset 17367  df-ple 17368  df-rest 17513  df-topn 17514  df-prmidl 21530  df-idlsrg 33919  df-rspec 34381
This theorem is used by:  zarcls  34392  zar0ring  34396
  Copyright terms: Public domain W3C validator