Theorem lpival 21699

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.

Step	Hyp	Ref	Expression
1		fveq2 6916	. . . 4 ⊢ (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
2		fveq2 6916	. . . . . 6 ⊢ (𝑟 = 𝑅 → (RSpan‘𝑟) = (RSpan‘𝑅))
3	2	fveq1d 6918	. . . . 5 ⊢ (𝑟 = 𝑅 → ((RSpan‘𝑟)‘{𝑔}) = ((RSpan‘𝑅)‘{𝑔}))
4	3	sneqd 4596	. . . 4 ⊢ (𝑟 = 𝑅 → {((RSpan‘𝑟)‘{𝑔})} = {((RSpan‘𝑅)‘{𝑔})})
5	1, 4	iuneq12d 4985	. . 3 ⊢ (𝑟 = 𝑅 → ∪ 𝑔 ∈ (Base‘𝑟){((RSpan‘𝑟)‘{𝑔})} = ∪ 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})})
6		df-lpidl 21697	. . 3 ⊢ LPIdeal = (𝑟 ∈ Ring ↦ ∪ 𝑔 ∈ (Base‘𝑟){((RSpan‘𝑟)‘{𝑔})})
7		fvex 6929	. . . . . 6 ⊢ (RSpan‘𝑅) ∈ V
8	7	rnex 7956	. . . . 5 ⊢ ran (RSpan‘𝑅) ∈ V
9		snex 5404	. . . . 5 ⊢ {∅} ∈ V
10	8, 9	unex 7793	. . . 4 ⊢ (ran (RSpan‘𝑅) ∪ {∅}) ∈ V
11		iunss 5008	. . . . 5 ⊢ (∪ 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})} ⊆ (ran (RSpan‘𝑅) ∪ {∅}) ↔ ∀𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})} ⊆ (ran (RSpan‘𝑅) ∪ {∅}))
12		fvrn0 6944	. . . . . . 7 ⊢ ((RSpan‘𝑅)‘{𝑔}) ∈ (ran (RSpan‘𝑅) ∪ {∅})
13		snssi 4748	. . . . . . 7 ⊢ (((RSpan‘𝑅)‘{𝑔}) ∈ (ran (RSpan‘𝑅) ∪ {∅}) → {((RSpan‘𝑅)‘{𝑔})} ⊆ (ran (RSpan‘𝑅) ∪ {∅}))
14	12, 13	ax-mp 5	. . . . . 6 ⊢ {((RSpan‘𝑅)‘{𝑔})} ⊆ (ran (RSpan‘𝑅) ∪ {∅})
15	14	a1i 11	. . . . 5 ⊢ (𝑔 ∈ (Base‘𝑅) → {((RSpan‘𝑅)‘{𝑔})} ⊆ (ran (RSpan‘𝑅) ∪ {∅}))
16	11, 15	mprgbir 3087	. . . 4 ⊢ ∪ 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})} ⊆ (ran (RSpan‘𝑅) ∪ {∅})
17	10, 16	ssexi 5291	. . 3 ⊢ ∪ 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})} ∈ V
18	5, 6, 17	fvmpt 7024	. 2 ⊢ (𝑅 ∈ Ring → (LPIdeal‘𝑅) = ∪ 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})})
19		lpival.p	. 2 ⊢ 𝑃 = (LPIdeal‘𝑅)
20		lpival.b	. . . 4 ⊢ 𝐵 = (Base‘𝑅)
21		iuneq1 4973	. . . 4 ⊢ (𝐵 = (Base‘𝑅) → ∪ 𝑔 ∈ 𝐵 {(𝐾‘{𝑔})} = ∪ 𝑔 ∈ (Base‘𝑅){(𝐾‘{𝑔})})
22	20, 21	ax-mp 5	. . 3 ⊢ ∪ 𝑔 ∈ 𝐵 {(𝐾‘{𝑔})} = ∪ 𝑔 ∈ (Base‘𝑅){(𝐾‘{𝑔})}
23		lpival.k	. . . . . . 7 ⊢ 𝐾 = (RSpan‘𝑅)
24	23	fveq1i 6917	. . . . . 6 ⊢ (𝐾‘{𝑔}) = ((RSpan‘𝑅)‘{𝑔})
25	24	sneqi 4595	. . . . 5 ⊢ {(𝐾‘{𝑔})} = {((RSpan‘𝑅)‘{𝑔})}
26	25	a1i 11	. . . 4 ⊢ (𝑔 ∈ (Base‘𝑅) → {(𝐾‘{𝑔})} = {((RSpan‘𝑅)‘{𝑔})})
27	26	iuneq2i 4978	. . 3 ⊢ ∪ 𝑔 ∈ (Base‘𝑅){(𝐾‘{𝑔})} = ∪ 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})}
28	22, 27	eqtri 2786	. 2 ⊢ ∪ 𝑔 ∈ 𝐵 {(𝐾‘{𝑔})} = ∪ 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})}
29	18, 19, 28	3eqtr4g 2823	1 ⊢ (𝑅 ∈ Ring → 𝑃 = ∪ 𝑔 ∈ 𝐵 {(𝐾‘{𝑔})})

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147   ⊆ wss 3900   ∪ cun 4152  ∅c0 4281  {csn 4588  ∪ ciun 4956  ran crn 5659  ‘cfv 6566  Basecbs 17431  Ringcrg 20510  RSpancrsp 21536  LPIdealclpidl 21695

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-iota 6520  df-fun 6568  df-fv 6574  df-lpidl 21697

This theorem is used by:  islpidl  21700