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

Theorem lpival 21317
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 6827 . . . 4 (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
2 fveq2 6827 . . . . . 6 (𝑟 = 𝑅 → (RSpan‘𝑟) = (RSpan‘𝑅))
32fveq1d 6829 . . . . 5 (𝑟 = 𝑅 → ((RSpan‘𝑟)‘{𝑔}) = ((RSpan‘𝑅)‘{𝑔}))
43sneqd 4567 . . . 4 (𝑟 = 𝑅 → {((RSpan‘𝑟)‘{𝑔})} = {((RSpan‘𝑅)‘{𝑔})})
51, 4iuneq12d 4951 . . 3 (𝑟 = 𝑅 𝑔 ∈ (Base‘𝑟){((RSpan‘𝑟)‘{𝑔})} = 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})})
6 df-lpidl 21315 . . 3 LPIdeal = (𝑟 ∈ Ring ↦ 𝑔 ∈ (Base‘𝑟){((RSpan‘𝑟)‘{𝑔})})
7 fvex 6840 . . . . . 6 (RSpan‘𝑅) ∈ V
87rnex 7850 . . . . 5 ran (RSpan‘𝑅) ∈ V
9 snex 5368 . . . . 5 {∅} ∈ V
108, 9unex 7687 . . . 4 (ran (RSpan‘𝑅) ∪ {∅}) ∈ V
11 iunss 4974 . . . . 5 ( 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})} ⊆ (ran (RSpan‘𝑅) ∪ {∅}) ↔ ∀𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})} ⊆ (ran (RSpan‘𝑅) ∪ {∅}))
12 fvrn0 6855 . . . . . . 7 ((RSpan‘𝑅)‘{𝑔}) ∈ (ran (RSpan‘𝑅) ∪ {∅})
13 snssi 4717 . . . . . . 7 (((RSpan‘𝑅)‘{𝑔}) ∈ (ran (RSpan‘𝑅) ∪ {∅}) → {((RSpan‘𝑅)‘{𝑔})} ⊆ (ran (RSpan‘𝑅) ∪ {∅}))
1412, 13ax-mp 5 . . . . . 6 {((RSpan‘𝑅)‘{𝑔})} ⊆ (ran (RSpan‘𝑅) ∪ {∅})
1514a1i 11 . . . . 5 (𝑔 ∈ (Base‘𝑅) → {((RSpan‘𝑅)‘{𝑔})} ⊆ (ran (RSpan‘𝑅) ∪ {∅}))
1611, 15mprgbir 3060 . . . 4 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})} ⊆ (ran (RSpan‘𝑅) ∪ {∅})
1710, 16ssexi 5250 . . 3 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})} ∈ V
185, 6, 17fvmpt 6935 . 2 (𝑅 ∈ Ring → (LPIdeal‘𝑅) = 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})})
19 lpival.p . 2 𝑃 = (LPIdeal‘𝑅)
20 lpival.b . . . 4 𝐵 = (Base‘𝑅)
21 iuneq1 4938 . . . 4 (𝐵 = (Base‘𝑅) → 𝑔𝐵 {(𝐾‘{𝑔})} = 𝑔 ∈ (Base‘𝑅){(𝐾‘{𝑔})})
2220, 21ax-mp 5 . . 3 𝑔𝐵 {(𝐾‘{𝑔})} = 𝑔 ∈ (Base‘𝑅){(𝐾‘{𝑔})}
23 lpival.k . . . . . . 7 𝐾 = (RSpan‘𝑅)
2423fveq1i 6828 . . . . . 6 (𝐾‘{𝑔}) = ((RSpan‘𝑅)‘{𝑔})
2524sneqi 4566 . . . . 5 {(𝐾‘{𝑔})} = {((RSpan‘𝑅)‘{𝑔})}
2625a1i 11 . . . 4 (𝑔 ∈ (Base‘𝑅) → {(𝐾‘{𝑔})} = {((RSpan‘𝑅)‘{𝑔})})
2726iuneq2i 4943 . . 3 𝑔 ∈ (Base‘𝑅){(𝐾‘{𝑔})} = 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})}
2822, 27eqtri 2762 . 2 𝑔𝐵 {(𝐾‘{𝑔})} = 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})}
2918, 19, 283eqtr4g 2799 1 (𝑅 ∈ Ring → 𝑃 = 𝑔𝐵 {(𝐾‘{𝑔})})
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1547  wcel 2119  cun 3881  wss 3883  c0 4261  {csn 4555   ciun 4921  ran crn 5619  cfv 6485  Basecbs 17170  Ringcrg 20205  RSpancrsp 21200  LPIdealclpidl 21313
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-sep 5218  ax-nul 5228  ax-pr 5362  ax-un 7678
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-iun 4923  df-br 5073  df-opab 5135  df-mpt 5154  df-id 5513  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-iota 6441  df-fun 6487  df-fv 6493  df-lpidl 21315
This theorem is referenced by:  islpidl  21318
  Copyright terms: Public domain W3C validator