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

Theorem lpival 21261
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 6822 . . . 4 (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
2 fveq2 6822 . . . . . 6 (𝑟 = 𝑅 → (RSpan‘𝑟) = (RSpan‘𝑅))
32fveq1d 6824 . . . . 5 (𝑟 = 𝑅 → ((RSpan‘𝑟)‘{𝑔}) = ((RSpan‘𝑅)‘{𝑔}))
43sneqd 4585 . . . 4 (𝑟 = 𝑅 → {((RSpan‘𝑟)‘{𝑔})} = {((RSpan‘𝑅)‘{𝑔})})
51, 4iuneq12d 4969 . . 3 (𝑟 = 𝑅 𝑔 ∈ (Base‘𝑟){((RSpan‘𝑟)‘{𝑔})} = 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})})
6 df-lpidl 21259 . . 3 LPIdeal = (𝑟 ∈ Ring ↦ 𝑔 ∈ (Base‘𝑟){((RSpan‘𝑟)‘{𝑔})})
7 fvex 6835 . . . . . 6 (RSpan‘𝑅) ∈ V
87rnex 7840 . . . . 5 ran (RSpan‘𝑅) ∈ V
9 p0ex 5320 . . . . 5 {∅} ∈ V
108, 9unex 7677 . . . 4 (ran (RSpan‘𝑅) ∪ {∅}) ∈ V
11 iunss 4992 . . . . 5 ( 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})} ⊆ (ran (RSpan‘𝑅) ∪ {∅}) ↔ ∀𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})} ⊆ (ran (RSpan‘𝑅) ∪ {∅}))
12 fvrn0 6850 . . . . . . 7 ((RSpan‘𝑅)‘{𝑔}) ∈ (ran (RSpan‘𝑅) ∪ {∅})
13 snssi 4757 . . . . . . 7 (((RSpan‘𝑅)‘{𝑔}) ∈ (ran (RSpan‘𝑅) ∪ {∅}) → {((RSpan‘𝑅)‘{𝑔})} ⊆ (ran (RSpan‘𝑅) ∪ {∅}))
1412, 13ax-mp 5 . . . . . 6 {((RSpan‘𝑅)‘{𝑔})} ⊆ (ran (RSpan‘𝑅) ∪ {∅})
1514a1i 11 . . . . 5 (𝑔 ∈ (Base‘𝑅) → {((RSpan‘𝑅)‘{𝑔})} ⊆ (ran (RSpan‘𝑅) ∪ {∅}))
1611, 15mprgbir 3054 . . . 4 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})} ⊆ (ran (RSpan‘𝑅) ∪ {∅})
1710, 16ssexi 5258 . . 3 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})} ∈ V
185, 6, 17fvmpt 6929 . 2 (𝑅 ∈ Ring → (LPIdeal‘𝑅) = 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})})
19 lpival.p . 2 𝑃 = (LPIdeal‘𝑅)
20 lpival.b . . . 4 𝐵 = (Base‘𝑅)
21 iuneq1 4956 . . . 4 (𝐵 = (Base‘𝑅) → 𝑔𝐵 {(𝐾‘{𝑔})} = 𝑔 ∈ (Base‘𝑅){(𝐾‘{𝑔})})
2220, 21ax-mp 5 . . 3 𝑔𝐵 {(𝐾‘{𝑔})} = 𝑔 ∈ (Base‘𝑅){(𝐾‘{𝑔})}
23 lpival.k . . . . . . 7 𝐾 = (RSpan‘𝑅)
2423fveq1i 6823 . . . . . 6 (𝐾‘{𝑔}) = ((RSpan‘𝑅)‘{𝑔})
2524sneqi 4584 . . . . 5 {(𝐾‘{𝑔})} = {((RSpan‘𝑅)‘{𝑔})}
2625a1i 11 . . . 4 (𝑔 ∈ (Base‘𝑅) → {(𝐾‘{𝑔})} = {((RSpan‘𝑅)‘{𝑔})})
2726iuneq2i 4961 . . 3 𝑔 ∈ (Base‘𝑅){(𝐾‘{𝑔})} = 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})}
2822, 27eqtri 2754 . 2 𝑔𝐵 {(𝐾‘{𝑔})} = 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})}
2918, 19, 283eqtr4g 2791 1 (𝑅 ∈ Ring → 𝑃 = 𝑔𝐵 {(𝐾‘{𝑔})})
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1541  wcel 2111  cun 3895  wss 3897  c0 4280  {csn 4573   ciun 4939  ran crn 5615  cfv 6481  Basecbs 17120  Ringcrg 20151  RSpancrsp 21144  LPIdealclpidl 21257
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-sep 5232  ax-nul 5242  ax-pow 5301  ax-pr 5368  ax-un 7668
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-rab 3396  df-v 3438  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-nul 4281  df-if 4473  df-pw 4549  df-sn 4574  df-pr 4576  df-op 4580  df-uni 4857  df-iun 4941  df-br 5090  df-opab 5152  df-mpt 5171  df-id 5509  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-iota 6437  df-fun 6483  df-fv 6489  df-lpidl 21259
This theorem is referenced by:  islpidl  21262
  Copyright terms: Public domain W3C validator