Theorem rgspnval 42641

Description: Value of the ring-span of a set of elements in a ring. (Contributed by Stefan O'Rear, 7-Dec-2014.)

Hypotheses

Ref	Expression
rgspnval.r	⊢ (𝜑 → 𝑅 ∈ Ring)
rgspnval.b	⊢ (𝜑 → 𝐵 = (Base‘𝑅))
rgspnval.ss	⊢ (𝜑 → 𝐴 ⊆ 𝐵)
rgspnval.n	⊢ (𝜑 → 𝑁 = (RingSpan‘𝑅))
rgspnval.sp	⊢ (𝜑 → 𝑈 = (𝑁‘𝐴))

Assertion

Ref	Expression
rgspnval	⊢ (𝜑 → 𝑈 = ∩ {𝑡 ∈ (SubRing‘𝑅) ∣ 𝐴 ⊆ 𝑡})

Distinct variable groups:   𝜑,𝑡   𝑡,𝑅   𝑡,𝐵   𝑡,𝐴

Allowed substitution hints:   𝑈(𝑡)   𝑁(𝑡)

Proof of Theorem rgspnval

Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		rgspnval.sp	. 2 ⊢ (𝜑 → 𝑈 = (𝑁‘𝐴))
2		rgspnval.n	. . 3 ⊢ (𝜑 → 𝑁 = (RingSpan‘𝑅))
3	2	fveq1d 6904	. 2 ⊢ (𝜑 → (𝑁‘𝐴) = ((RingSpan‘𝑅)‘𝐴))
4		rgspnval.r	. . . . 5 ⊢ (𝜑 → 𝑅 ∈ Ring)
5		elex 3492	. . . . 5 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ V)
6		fveq2 6902	. . . . . . . 8 ⊢ (𝑎 = 𝑅 → (Base‘𝑎) = (Base‘𝑅))
7	6	pweqd 4623	. . . . . . 7 ⊢ (𝑎 = 𝑅 → 𝒫 (Base‘𝑎) = 𝒫 (Base‘𝑅))
8		fveq2 6902	. . . . . . . . 9 ⊢ (𝑎 = 𝑅 → (SubRing‘𝑎) = (SubRing‘𝑅))
9		rabeq 3445	. . . . . . . . 9 ⊢ ((SubRing‘𝑎) = (SubRing‘𝑅) → {𝑡 ∈ (SubRing‘𝑎) ∣ 𝑏 ⊆ 𝑡} = {𝑡 ∈ (SubRing‘𝑅) ∣ 𝑏 ⊆ 𝑡})
10	8, 9	syl 17	. . . . . . . 8 ⊢ (𝑎 = 𝑅 → {𝑡 ∈ (SubRing‘𝑎) ∣ 𝑏 ⊆ 𝑡} = {𝑡 ∈ (SubRing‘𝑅) ∣ 𝑏 ⊆ 𝑡})
11	10	inteqd 4958	. . . . . . 7 ⊢ (𝑎 = 𝑅 → ∩ {𝑡 ∈ (SubRing‘𝑎) ∣ 𝑏 ⊆ 𝑡} = ∩ {𝑡 ∈ (SubRing‘𝑅) ∣ 𝑏 ⊆ 𝑡})
12	7, 11	mpteq12dv 5243	. . . . . 6 ⊢ (𝑎 = 𝑅 → (𝑏 ∈ 𝒫 (Base‘𝑎) ↦ ∩ {𝑡 ∈ (SubRing‘𝑎) ∣ 𝑏 ⊆ 𝑡}) = (𝑏 ∈ 𝒫 (Base‘𝑅) ↦ ∩ {𝑡 ∈ (SubRing‘𝑅) ∣ 𝑏 ⊆ 𝑡}))
13		df-rgspn 20523	. . . . . 6 ⊢ RingSpan = (𝑎 ∈ V ↦ (𝑏 ∈ 𝒫 (Base‘𝑎) ↦ ∩ {𝑡 ∈ (SubRing‘𝑎) ∣ 𝑏 ⊆ 𝑡}))
14		fvex 6915	. . . . . . . 8 ⊢ (Base‘𝑅) ∈ V
15	14	pwex 5384	. . . . . . 7 ⊢ 𝒫 (Base‘𝑅) ∈ V
16	15	mptex 7241	. . . . . 6 ⊢ (𝑏 ∈ 𝒫 (Base‘𝑅) ↦ ∩ {𝑡 ∈ (SubRing‘𝑅) ∣ 𝑏 ⊆ 𝑡}) ∈ V
17	12, 13, 16	fvmpt 7010	. . . . 5 ⊢ (𝑅 ∈ V → (RingSpan‘𝑅) = (𝑏 ∈ 𝒫 (Base‘𝑅) ↦ ∩ {𝑡 ∈ (SubRing‘𝑅) ∣ 𝑏 ⊆ 𝑡}))
18	4, 5, 17	3syl 18	. . . 4 ⊢ (𝜑 → (RingSpan‘𝑅) = (𝑏 ∈ 𝒫 (Base‘𝑅) ↦ ∩ {𝑡 ∈ (SubRing‘𝑅) ∣ 𝑏 ⊆ 𝑡}))
19	18	fveq1d 6904	. . 3 ⊢ (𝜑 → ((RingSpan‘𝑅)‘𝐴) = ((𝑏 ∈ 𝒫 (Base‘𝑅) ↦ ∩ {𝑡 ∈ (SubRing‘𝑅) ∣ 𝑏 ⊆ 𝑡})‘𝐴))
20		eqid 2728	. . . 4 ⊢ (𝑏 ∈ 𝒫 (Base‘𝑅) ↦ ∩ {𝑡 ∈ (SubRing‘𝑅) ∣ 𝑏 ⊆ 𝑡}) = (𝑏 ∈ 𝒫 (Base‘𝑅) ↦ ∩ {𝑡 ∈ (SubRing‘𝑅) ∣ 𝑏 ⊆ 𝑡})
21		sseq1 4007	. . . . . 6 ⊢ (𝑏 = 𝐴 → (𝑏 ⊆ 𝑡 ↔ 𝐴 ⊆ 𝑡))
22	21	rabbidv 3438	. . . . 5 ⊢ (𝑏 = 𝐴 → {𝑡 ∈ (SubRing‘𝑅) ∣ 𝑏 ⊆ 𝑡} = {𝑡 ∈ (SubRing‘𝑅) ∣ 𝐴 ⊆ 𝑡})
23	22	inteqd 4958	. . . 4 ⊢ (𝑏 = 𝐴 → ∩ {𝑡 ∈ (SubRing‘𝑅) ∣ 𝑏 ⊆ 𝑡} = ∩ {𝑡 ∈ (SubRing‘𝑅) ∣ 𝐴 ⊆ 𝑡})
24		rgspnval.ss	. . . . . 6 ⊢ (𝜑 → 𝐴 ⊆ 𝐵)
25		rgspnval.b	. . . . . 6 ⊢ (𝜑 → 𝐵 = (Base‘𝑅))
26	24, 25	sseqtrd 4022	. . . . 5 ⊢ (𝜑 → 𝐴 ⊆ (Base‘𝑅))
27	14	elpw2 5351	. . . . 5 ⊢ (𝐴 ∈ 𝒫 (Base‘𝑅) ↔ 𝐴 ⊆ (Base‘𝑅))
28	26, 27	sylibr 233	. . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝒫 (Base‘𝑅))
29		eqid 2728	. . . . . . . . 9 ⊢ (Base‘𝑅) = (Base‘𝑅)
30	29	subrgid 20526	. . . . . . . 8 ⊢ (𝑅 ∈ Ring → (Base‘𝑅) ∈ (SubRing‘𝑅))
31	4, 30	syl 17	. . . . . . 7 ⊢ (𝜑 → (Base‘𝑅) ∈ (SubRing‘𝑅))
32	25, 31	eqeltrd 2829	. . . . . 6 ⊢ (𝜑 → 𝐵 ∈ (SubRing‘𝑅))
33		sseq2 4008	. . . . . . 7 ⊢ (𝑡 = 𝐵 → (𝐴 ⊆ 𝑡 ↔ 𝐴 ⊆ 𝐵))
34	33	rspcev 3611	. . . . . 6 ⊢ ((𝐵 ∈ (SubRing‘𝑅) ∧ 𝐴 ⊆ 𝐵) → ∃𝑡 ∈ (SubRing‘𝑅)𝐴 ⊆ 𝑡)
35	32, 24, 34	syl2anc 582	. . . . 5 ⊢ (𝜑 → ∃𝑡 ∈ (SubRing‘𝑅)𝐴 ⊆ 𝑡)
36		intexrab 5346	. . . . 5 ⊢ (∃𝑡 ∈ (SubRing‘𝑅)𝐴 ⊆ 𝑡 ↔ ∩ {𝑡 ∈ (SubRing‘𝑅) ∣ 𝐴 ⊆ 𝑡} ∈ V)
37	35, 36	sylib 217	. . . 4 ⊢ (𝜑 → ∩ {𝑡 ∈ (SubRing‘𝑅) ∣ 𝐴 ⊆ 𝑡} ∈ V)
38	20, 23, 28, 37	fvmptd3 7033	. . 3 ⊢ (𝜑 → ((𝑏 ∈ 𝒫 (Base‘𝑅) ↦ ∩ {𝑡 ∈ (SubRing‘𝑅) ∣ 𝑏 ⊆ 𝑡})‘𝐴) = ∩ {𝑡 ∈ (SubRing‘𝑅) ∣ 𝐴 ⊆ 𝑡})
39	19, 38	eqtrd 2768	. 2 ⊢ (𝜑 → ((RingSpan‘𝑅)‘𝐴) = ∩ {𝑡 ∈ (SubRing‘𝑅) ∣ 𝐴 ⊆ 𝑡})
40	1, 3, 39	3eqtrd 2772	1 ⊢ (𝜑 → 𝑈 = ∩ {𝑡 ∈ (SubRing‘𝑅) ∣ 𝐴 ⊆ 𝑡})

Syntax hints:   → wi 4   = wceq 1533   ∈ wcel 2098  ∃wrex 3067  {crab 3430  Vcvv 3473   ⊆ wss 3949  𝒫 cpw 4606  ∩ cint 4953   ↦ cmpt 5235  ‘cfv 6553  Basecbs 17189  Ringcrg 20187  SubRingcsubrg 20520  RingSpancrgspn 20521

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2699  ax-rep 5289  ax-sep 5303  ax-nul 5310  ax-pow 5369  ax-pr 5433  ax-un 7748  ax-cnex 11204  ax-resscn 11205  ax-1cn 11206  ax-icn 11207  ax-addcl 11208  ax-addrcl 11209  ax-mulcl 11210  ax-mulrcl 11211  ax-mulcom 11212  ax-addass 11213  ax-mulass 11214  ax-distr 11215  ax-i2m1 11216  ax-1ne0 11217  ax-1rid 11218  ax-rnegex 11219  ax-rrecex 11220  ax-cnre 11221  ax-pre-lttri 11222  ax-pre-lttrn 11223  ax-pre-ltadd 11224  ax-pre-mulgt0 11225

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3or 1085  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2529  df-eu 2558  df-clab 2706  df-cleq 2720  df-clel 2806  df-nfc 2881  df-ne 2938  df-nel 3044  df-ral 3059  df-rex 3068  df-rmo 3374  df-reu 3375  df-rab 3431  df-v 3475  df-sbc 3779  df-csb 3895  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-pss 3968  df-nul 4327  df-if 4533  df-pw 4608  df-sn 4633  df-pr 4635  df-op 4639  df-uni 4913  df-int 4954  df-iun 5002  df-br 5153  df-opab 5215  df-mpt 5236  df-tr 5270  df-id 5580  df-eprel 5586  df-po 5594  df-so 5595  df-fr 5637  df-we 5639  df-xp 5688  df-rel 5689  df-cnv 5690  df-co 5691  df-dm 5692  df-rn 5693  df-res 5694  df-ima 5695  df-pred 6310  df-ord 6377  df-on 6378  df-lim 6379  df-suc 6380  df-iota 6505  df-fun 6555  df-fn 6556  df-f 6557  df-f1 6558  df-fo 6559  df-f1o 6560  df-fv 6561  df-riota 7382  df-ov 7429  df-oprab 7430  df-mpo 7431  df-om 7879  df-2nd 8002  df-frecs 8295  df-wrecs 8326  df-recs 8400  df-rdg 8439  df-er 8733  df-en 8973  df-dom 8974  df-sdom 8975  df-pnf 11290  df-mnf 11291  df-xr 11292  df-ltxr 11293  df-le 11294  df-sub 11486  df-neg 11487  df-nn 12253  df-2 12315  df-sets 17142  df-slot 17160  df-ndx 17172  df-base 17190  df-ress 17219  df-plusg 17255  df-0g 17432  df-mgm 18609  df-sgrp 18688  df-mnd 18704  df-mgp 20089  df-ur 20136  df-ring 20189  df-subrg 20522  df-rgspn 20523

This theorem is referenced by:  rgspncl  42642  rgspnssid  42643  rgspnmin  42644