Theorem lpival 21561

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 6882	. . . 4 ⊢ (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
2		fveq2 6882	. . . . . 6 ⊢ (𝑟 = 𝑅 → (RSpan‘𝑟) = (RSpan‘𝑅))
3	2	fveq1d 6884	. . . . 5 ⊢ (𝑟 = 𝑅 → ((RSpan‘𝑟)‘{𝑔}) = ((RSpan‘𝑅)‘{𝑔}))
4	3	sneqd 4599	. . . 4 ⊢ (𝑟 = 𝑅 → {((RSpan‘𝑟)‘{𝑔})} = {((RSpan‘𝑅)‘{𝑔})})
5	1, 4	iuneq12d 4984	. . 3 ⊢ (𝑟 = 𝑅 → ∪ 𝑔 ∈ (Base‘𝑟){((RSpan‘𝑟)‘{𝑔})} = ∪ 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})})
6		df-lpidl 21559	. . 3 ⊢ LPIdeal = (𝑟 ∈ Ring ↦ ∪ 𝑔 ∈ (Base‘𝑟){((RSpan‘𝑟)‘{𝑔})})
7		fvex 6895	. . . . . 6 ⊢ (RSpan‘𝑅) ∈ V
8	7	rnex 7911	. . . . 5 ⊢ ran (RSpan‘𝑅) ∈ V
9		snex 5408	. . . . 5 ⊢ {∅} ∈ V
10	8, 9	unex 7750	. . . 4 ⊢ (ran (RSpan‘𝑅) ∪ {∅}) ∈ V
11		iunss 5007	. . . . 5 ⊢ (∪ 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})} ⊆ (ran (RSpan‘𝑅) ∪ {∅}) ↔ ∀𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})} ⊆ (ran (RSpan‘𝑅) ∪ {∅}))
12		fvrn0 6910	. . . . . . 7 ⊢ ((RSpan‘𝑅)‘{𝑔}) ∈ (ran (RSpan‘𝑅) ∪ {∅})
13		snssi 4749	. . . . . . 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 3085	. . . 4 ⊢ ∪ 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})} ⊆ (ran (RSpan‘𝑅) ∪ {∅})
17	10, 16	ssexi 5291	. . 3 ⊢ ∪ 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})} ∈ V
18	5, 6, 17	fvmpt 6990	. 2 ⊢ (𝑅 ∈ Ring → (LPIdeal‘𝑅) = ∪ 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})})
19		lpival.p	. 2 ⊢ 𝑃 = (LPIdeal‘𝑅)
20		lpival.b	. . . 4 ⊢ 𝐵 = (Base‘𝑅)
21		iuneq1 4971	. . . 4 ⊢ (𝐵 = (Base‘𝑅) → ∪ 𝑔 ∈ 𝐵 {(𝐾‘{𝑔})} = ∪ 𝑔 ∈ (Base‘𝑅){(𝐾‘{𝑔})})
22	20, 21	ax-mp 5	. . 3 ⊢ ∪ 𝑔 ∈ 𝐵 {(𝐾‘{𝑔})} = ∪ 𝑔 ∈ (Base‘𝑅){(𝐾‘{𝑔})}
23		lpival.k	. . . . . . 7 ⊢ 𝐾 = (RSpan‘𝑅)
24	23	fveq1i 6883	. . . . . 6 ⊢ (𝐾‘{𝑔}) = ((RSpan‘𝑅)‘{𝑔})
25	24	sneqi 4598	. . . . 5 ⊢ {(𝐾‘{𝑔})} = {((RSpan‘𝑅)‘{𝑔})}
26	25	a1i 11	. . . 4 ⊢ (𝑔 ∈ (Base‘𝑅) → {(𝐾‘{𝑔})} = {((RSpan‘𝑅)‘{𝑔})})
27	26	iuneq2i 4976	. . 3 ⊢ ∪ 𝑔 ∈ (Base‘𝑅){(𝐾‘{𝑔})} = ∪ 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})}
28	22, 27	eqtri 2785	. 2 ⊢ ∪ 𝑔 ∈ 𝐵 {(𝐾‘{𝑔})} = ∪ 𝑔 ∈ (Base‘𝑅){((RSpan‘𝑅)‘{𝑔})}
29	18, 19, 28	3eqtr4g 2822	1 ⊢ (𝑅 ∈ Ring → 𝑃 = ∪ 𝑔 ∈ 𝐵 {(𝐾‘{𝑔})})

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145   ∪ cun 3900   ⊆ wss 3902  ∅c0 4282  {csn 4587  ∪ ciun 4954  ran crn 5660  ‘cfv 6537  Basecbs 17307  Ringcrg 20378  RSpancrsp 21400  LPIdealclpidl 21557

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402  ax-un 7740

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 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-iota 6493  df-fun 6539  df-fv 6545  df-lpidl 21559

This theorem is used by:  islpidl  21562