MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  lpival Structured version   Visualization version   GIF version

Theorem lpival 21461
Description: Value of the set of principal ideals. (Contributed by Stefan O'Rear, 3-Jan-2015.)
Hypotheses
Ref Expression
lpival.p 𝑃 = (LPIdeal‘𝑅)
lpival.k 𝐾 = (RSpan‘𝑅)
lpival.b 𝐵 = (Base‘𝑅)
Assertion
Ref Expression
lpival (𝑅 ∈ Ring → 𝑃 = 𝑔𝐵 {(𝐾‘{𝑔})})
Distinct variable groups:   𝑅,𝑔   𝑃,𝑔   𝐵,𝑔   𝑔,𝐾

Proof of Theorem lpival
Dummy variable 𝑟 is distinct from all other variables.
StepHypRef Expression
1 fveq2 6882 . . . 4 (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
2 fveq2 6882 . . . . . 6 (𝑟 = 𝑅 → (RSpan‘𝑟) = (RSpan‘𝑅))
32fveq1d 6884 . . . . 5 (𝑟 = 𝑅 → ((RSpan‘𝑟)‘{𝑔}) = ((RSpan‘𝑅)‘{𝑔}))
43sneqd 4606 . . . 4 (𝑟 = 𝑅 → {((RSpan‘𝑟)‘{𝑔})} = {((RSpan‘𝑅)‘{𝑔})})
51, 4iuneq12d 4990 . . 3 (𝑟 = 𝑅 𝑔 ∈ (Base‘𝑟){((RSpan‘𝑟)‘{𝑔})} = 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})})
6 df-lpidl 21459 . . 3 LPIdeal = (𝑟 ∈ Ring ↦ 𝑔 ∈ (Base‘𝑟){((RSpan‘𝑟)‘{𝑔})})
7 fvex 6895 . . . . . 6 (RSpan‘𝑅) ∈ V
87rnex 7907 . . . . 5 ran (RSpan‘𝑅) ∈ V
9 snex 5411 . . . . 5 {∅} ∈ V
108, 9unex 7743 . . . 4 (ran (RSpan‘𝑅) ∪ {∅}) ∈ V
11 iunss 5013 . . . . 5 ( 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})} ⊆ (ran (RSpan‘𝑅) ∪ {∅}) ↔ ∀𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})} ⊆ (ran (RSpan‘𝑅) ∪ {∅}))
12 fvrn0 6910 . . . . . . 7 ((RSpan‘𝑅)‘{𝑔}) ∈ (ran (RSpan‘𝑅) ∪ {∅})
13 snssi 4756 . . . . . . 7 (((RSpan‘𝑅)‘{𝑔}) ∈ (ran (RSpan‘𝑅) ∪ {∅}) → {((RSpan‘𝑅)‘{𝑔})} ⊆ (ran (RSpan‘𝑅) ∪ {∅}))
1412, 13ax-mp 5 . . . . . 6 {((RSpan‘𝑅)‘{𝑔})} ⊆ (ran (RSpan‘𝑅) ∪ {∅})
1514a1i 11 . . . . 5 (𝑔 ∈ (Base‘𝑅) → {((RSpan‘𝑅)‘{𝑔})} ⊆ (ran (RSpan‘𝑅) ∪ {∅}))
1611, 15mprgbir 3092 . . . 4 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})} ⊆ (ran (RSpan‘𝑅) ∪ {∅})
1710, 16ssexi 5293 . . 3 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})} ∈ V
185, 6, 17fvmpt 6990 . 2 (𝑅 ∈ Ring → (LPIdeal‘𝑅) = 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})})
19 lpival.p . 2 𝑃 = (LPIdeal‘𝑅)
20 lpival.b . . . 4 𝐵 = (Base‘𝑅)
21 iuneq1 4977 . . . 4 (𝐵 = (Base‘𝑅) → 𝑔𝐵 {(𝐾‘{𝑔})} = 𝑔 ∈ (Base‘𝑅){(𝐾‘{𝑔})})
2220, 21ax-mp 5 . . 3 𝑔𝐵 {(𝐾‘{𝑔})} = 𝑔 ∈ (Base‘𝑅){(𝐾‘{𝑔})}
23 lpival.k . . . . . . 7 𝐾 = (RSpan‘𝑅)
2423fveq1i 6883 . . . . . 6 (𝐾‘{𝑔}) = ((RSpan‘𝑅)‘{𝑔})
2524sneqi 4605 . . . . 5 {(𝐾‘{𝑔})} = {((RSpan‘𝑅)‘{𝑔})}
2625a1i 11 . . . 4 (𝑔 ∈ (Base‘𝑅) → {(𝐾‘{𝑔})} = {((RSpan‘𝑅)‘{𝑔})})
2726iuneq2i 4982 . . 3 𝑔 ∈ (Base‘𝑅){(𝐾‘{𝑔})} = 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})}
2822, 27eqtri 2792 . 2 𝑔𝐵 {(𝐾‘{𝑔})} = 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})}
2918, 19, 283eqtr4g 2829 1 (𝑅 ∈ Ring → 𝑃 = 𝑔𝐵 {(𝐾‘{𝑔})})
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1567  wcel 2149  cun 3911  wss 3913  c0 4294  {csn 4594   ciun 4960  ran crn 5663  cfv 6537  Basecbs 17269  Ringcrg 20315  RSpancrsp 21309  LPIdealclpidl 21457
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5261  ax-nul 5271  ax-pr 5405  ax-un 7733
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-iun 4962  df-br 5114  df-opab 5178  df-mpt 5197  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-iota 6493  df-fun 6539  df-fv 6545  df-lpidl 21459
This theorem is referenced by:  islpidl  21462
  Copyright terms: Public domain W3C validator