Theorem lpival 21657

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 6890	. . . 4 ⊢ (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
2		fveq2 6890	. . . . . 6 ⊢ (𝑟 = 𝑅 → (RSpan‘𝑟) = (RSpan‘𝑅))
3	2	fveq1d 6892	. . . . 5 ⊢ (𝑟 = 𝑅 → ((RSpan‘𝑟)‘{𝑔}) = ((RSpan‘𝑅)‘{𝑔}))
4	3	sneqd 4592	. . . 4 ⊢ (𝑟 = 𝑅 → {((RSpan‘𝑟)‘{𝑔})} = {((RSpan‘𝑅)‘{𝑔})})
5	1, 4	iuneq12d 4979	. . 3 ⊢ (𝑟 = 𝑅 → ∪ 𝑔 ∈ (Base‘𝑟){((RSpan‘𝑟)‘{𝑔})} = ∪ 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})})
6		df-lpidl 21655	. . 3 ⊢ LPIdeal = (𝑟 ∈ Ring ↦ ∪ 𝑔 ∈ (Base‘𝑟){((RSpan‘𝑟)‘{𝑔})})
7		fvex 6903	. . . . . 6 ⊢ (RSpan‘𝑅) ∈ V
8	7	rnex 7926	. . . . 5 ⊢ ran (RSpan‘𝑅) ∈ V
9		snex 5397	. . . . 5 ⊢ {∅} ∈ V
10	8, 9	unex 7765	. . . 4 ⊢ (ran (RSpan‘𝑅) ∪ {∅}) ∈ V
11		iunss 5002	. . . . 5 ⊢ (∪ 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})} ⊆ (ran (RSpan‘𝑅) ∪ {∅}) ↔ ∀𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})} ⊆ (ran (RSpan‘𝑅) ∪ {∅}))
12		fvrn0 6918	. . . . . . 7 ⊢ ((RSpan‘𝑅)‘{𝑔}) ∈ (ran (RSpan‘𝑅) ∪ {∅})
13		snssi 4742	. . . . . . 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 3083	. . . 4 ⊢ ∪ 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})} ⊆ (ran (RSpan‘𝑅) ∪ {∅})
17	10, 16	ssexi 5284	. . 3 ⊢ ∪ 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})} ∈ V
18	5, 6, 17	fvmpt 6998	. 2 ⊢ (𝑅 ∈ Ring → (LPIdeal‘𝑅) = ∪ 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})})
19		lpival.p	. 2 ⊢ 𝑃 = (LPIdeal‘𝑅)
20		lpival.b	. . . 4 ⊢ 𝐵 = (Base‘𝑅)
21		iuneq1 4967	. . . 4 ⊢ (𝐵 = (Base‘𝑅) → ∪ 𝑔 ∈ 𝐵 {(𝐾‘{𝑔})} = ∪ 𝑔 ∈ (Base‘𝑅){(𝐾‘{𝑔})})
22	20, 21	ax-mp 5	. . 3 ⊢ ∪ 𝑔 ∈ 𝐵 {(𝐾‘{𝑔})} = ∪ 𝑔 ∈ (Base‘𝑅){(𝐾‘{𝑔})}
23		lpival.k	. . . . . . 7 ⊢ 𝐾 = (RSpan‘𝑅)
24	23	fveq1i 6891	. . . . . 6 ⊢ (𝐾‘{𝑔}) = ((RSpan‘𝑅)‘{𝑔})
25	24	sneqi 4591	. . . . 5 ⊢ {(𝐾‘{𝑔})} = {((RSpan‘𝑅)‘{𝑔})}
26	25	a1i 11	. . . 4 ⊢ (𝑔 ∈ (Base‘𝑅) → {(𝐾‘{𝑔})} = {((RSpan‘𝑅)‘{𝑔})})
27	26	iuneq2i 4972	. . 3 ⊢ ∪ 𝑔 ∈ (Base‘𝑅){(𝐾‘{𝑔})} = ∪ 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})}
28	22, 27	eqtri 2783	. 2 ⊢ ∪ 𝑔 ∈ 𝐵 {(𝐾‘{𝑔})} = ∪ 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})}
29	18, 19, 28	3eqtr4g 2820	1 ⊢ (𝑅 ∈ Ring → 𝑃 = ∪ 𝑔 ∈ 𝐵 {(𝐾‘{𝑔})})

This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∈ wcel 2144   ⊆ wss 3896   ∪ cun 4148  ∅c0 4277  {csn 4584  ∪ ciun 4950  ran crn 5652  ‘cfv 6543  Basecbs 17396  Ringcrg 20468  RSpancrsp 21494  LPIdealclpidl 21653

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5391  ax-un 7755

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-iota 6497  df-fun 6545  df-fv 6551  df-lpidl 21655

This theorem is used by:  islpidl  21658