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

Theorem lpival 21357
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 6920 . . . 4 (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
2 fveq2 6920 . . . . . 6 (𝑟 = 𝑅 → (RSpan‘𝑟) = (RSpan‘𝑅))
32fveq1d 6922 . . . . 5 (𝑟 = 𝑅 → ((RSpan‘𝑟)‘{𝑔}) = ((RSpan‘𝑅)‘{𝑔}))
43sneqd 4660 . . . 4 (𝑟 = 𝑅 → {((RSpan‘𝑟)‘{𝑔})} = {((RSpan‘𝑅)‘{𝑔})})
51, 4iuneq12d 5044 . . 3 (𝑟 = 𝑅 𝑔 ∈ (Base‘𝑟){((RSpan‘𝑟)‘{𝑔})} = 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})})
6 df-lpidl 21355 . . 3 LPIdeal = (𝑟 ∈ Ring ↦ 𝑔 ∈ (Base‘𝑟){((RSpan‘𝑟)‘{𝑔})})
7 fvex 6933 . . . . . 6 (RSpan‘𝑅) ∈ V
87rnex 7950 . . . . 5 ran (RSpan‘𝑅) ∈ V
9 p0ex 5402 . . . . 5 {∅} ∈ V
108, 9unex 7779 . . . 4 (ran (RSpan‘𝑅) ∪ {∅}) ∈ V
11 iunss 5068 . . . . 5 ( 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})} ⊆ (ran (RSpan‘𝑅) ∪ {∅}) ↔ ∀𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})} ⊆ (ran (RSpan‘𝑅) ∪ {∅}))
12 fvrn0 6950 . . . . . . 7 ((RSpan‘𝑅)‘{𝑔}) ∈ (ran (RSpan‘𝑅) ∪ {∅})
13 snssi 4833 . . . . . . 7 (((RSpan‘𝑅)‘{𝑔}) ∈ (ran (RSpan‘𝑅) ∪ {∅}) → {((RSpan‘𝑅)‘{𝑔})} ⊆ (ran (RSpan‘𝑅) ∪ {∅}))
1412, 13ax-mp 5 . . . . . 6 {((RSpan‘𝑅)‘{𝑔})} ⊆ (ran (RSpan‘𝑅) ∪ {∅})
1514a1i 11 . . . . 5 (𝑔 ∈ (Base‘𝑅) → {((RSpan‘𝑅)‘{𝑔})} ⊆ (ran (RSpan‘𝑅) ∪ {∅}))
1611, 15mprgbir 3074 . . . 4 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})} ⊆ (ran (RSpan‘𝑅) ∪ {∅})
1710, 16ssexi 5340 . . 3 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})} ∈ V
185, 6, 17fvmpt 7029 . 2 (𝑅 ∈ Ring → (LPIdeal‘𝑅) = 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})})
19 lpival.p . 2 𝑃 = (LPIdeal‘𝑅)
20 lpival.b . . . 4 𝐵 = (Base‘𝑅)
21 iuneq1 5031 . . . 4 (𝐵 = (Base‘𝑅) → 𝑔𝐵 {(𝐾‘{𝑔})} = 𝑔 ∈ (Base‘𝑅){(𝐾‘{𝑔})})
2220, 21ax-mp 5 . . 3 𝑔𝐵 {(𝐾‘{𝑔})} = 𝑔 ∈ (Base‘𝑅){(𝐾‘{𝑔})}
23 lpival.k . . . . . . 7 𝐾 = (RSpan‘𝑅)
2423fveq1i 6921 . . . . . 6 (𝐾‘{𝑔}) = ((RSpan‘𝑅)‘{𝑔})
2524sneqi 4659 . . . . 5 {(𝐾‘{𝑔})} = {((RSpan‘𝑅)‘{𝑔})}
2625a1i 11 . . . 4 (𝑔 ∈ (Base‘𝑅) → {(𝐾‘{𝑔})} = {((RSpan‘𝑅)‘{𝑔})})
2726iuneq2i 5036 . . 3 𝑔 ∈ (Base‘𝑅){(𝐾‘{𝑔})} = 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})}
2822, 27eqtri 2768 . 2 𝑔𝐵 {(𝐾‘{𝑔})} = 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})}
2918, 19, 283eqtr4g 2805 1 (𝑅 ∈ Ring → 𝑃 = 𝑔𝐵 {(𝐾‘{𝑔})})
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1537  wcel 2108  cun 3974  wss 3976  c0 4352  {csn 4648   ciun 5015  ran crn 5701  cfv 6573  Basecbs 17258  Ringcrg 20260  RSpancrsp 21240  LPIdealclpidl 21353
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-iota 6525  df-fun 6575  df-fv 6581  df-lpidl 21355
This theorem is referenced by:  islpidl  21358
  Copyright terms: Public domain W3C validator