maxidlval - Mathbox for Jeff Madsen

	Mathbox for Jeff Madsen		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > maxidlval		Structured version Visualization version GIF version

Theorem maxidlval 38279

Description: The set of maximal ideals of a ring. (Contributed by Jeff Madsen, 5-Jan-2011.)

**Hypotheses**
Ref	Expression
maxidlval.1	⊢ 𝐺 = (1^st ‘𝑅)
maxidlval.2	⊢ 𝑋 = ran 𝐺

**Assertion**
Ref	Expression
maxidlval	⊢ (𝑅 ∈ RingOps → (MaxIdl‘𝑅) = {𝑖 ∈ (Idl‘𝑅) ∣ (𝑖 ≠ 𝑋 ∧ ∀𝑗 ∈ (Idl‘𝑅)(𝑖 ⊆ 𝑗 → (𝑗 = 𝑖 ∨ 𝑗 = 𝑋)))})

Distinct variable group: 𝑅,𝑖,𝑗 Allowed substitution hints: 𝐺(𝑖,𝑗) 𝑋(𝑖,𝑗)

Proof of Theorem maxidlval Dummy variable 𝑟 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveq2 6842	. . 3 ⊢ (𝑟 = 𝑅 → (Idl‘𝑟) = (Idl‘𝑅))
2		fveq2 6842	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (1^st ‘𝑟) = (1^st ‘𝑅))
3		maxidlval.1	. . . . . . . 8 ⊢ 𝐺 = (1^st ‘𝑅)
4	2, 3	eqtr4di 2790	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (1^st ‘𝑟) = 𝐺)
5	4	rneqd 5895	. . . . . 6 ⊢ (𝑟 = 𝑅 → ran (1^st ‘𝑟) = ran 𝐺)
6		maxidlval.2	. . . . . 6 ⊢ 𝑋 = ran 𝐺
7	5, 6	eqtr4di 2790	. . . . 5 ⊢ (𝑟 = 𝑅 → ran (1^st ‘𝑟) = 𝑋)
8	7	neeq2d 2993	. . . 4 ⊢ (𝑟 = 𝑅 → (𝑖 ≠ ran (1^st ‘𝑟) ↔ 𝑖 ≠ 𝑋))
9	7	eqeq2d 2748	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (𝑗 = ran (1^st ‘𝑟) ↔ 𝑗 = 𝑋))
10	9	orbi2d 916	. . . . . 6 ⊢ (𝑟 = 𝑅 → ((𝑗 = 𝑖 ∨ 𝑗 = ran (1^st ‘𝑟)) ↔ (𝑗 = 𝑖 ∨ 𝑗 = 𝑋)))
11	10	imbi2d 340	. . . . 5 ⊢ (𝑟 = 𝑅 → ((𝑖 ⊆ 𝑗 → (𝑗 = 𝑖 ∨ 𝑗 = ran (1^st ‘𝑟))) ↔ (𝑖 ⊆ 𝑗 → (𝑗 = 𝑖 ∨ 𝑗 = 𝑋))))
12	1, 11	raleqbidv 3318	. . . 4 ⊢ (𝑟 = 𝑅 → (∀𝑗 ∈ (Idl‘𝑟)(𝑖 ⊆ 𝑗 → (𝑗 = 𝑖 ∨ 𝑗 = ran (1^st ‘𝑟))) ↔ ∀𝑗 ∈ (Idl‘𝑅)(𝑖 ⊆ 𝑗 → (𝑗 = 𝑖 ∨ 𝑗 = 𝑋))))
13	8, 12	anbi12d 633	. . 3 ⊢ (𝑟 = 𝑅 → ((𝑖 ≠ ran (1^st ‘𝑟) ∧ ∀𝑗 ∈ (Idl‘𝑟)(𝑖 ⊆ 𝑗 → (𝑗 = 𝑖 ∨ 𝑗 = ran (1^st ‘𝑟)))) ↔ (𝑖 ≠ 𝑋 ∧ ∀𝑗 ∈ (Idl‘𝑅)(𝑖 ⊆ 𝑗 → (𝑗 = 𝑖 ∨ 𝑗 = 𝑋)))))
14	1, 13	rabeqbidv 3419	. 2 ⊢ (𝑟 = 𝑅 → {𝑖 ∈ (Idl‘𝑟) ∣ (𝑖 ≠ ran (1^st ‘𝑟) ∧ ∀𝑗 ∈ (Idl‘𝑟)(𝑖 ⊆ 𝑗 → (𝑗 = 𝑖 ∨ 𝑗 = ran (1^st ‘𝑟))))} = {𝑖 ∈ (Idl‘𝑅) ∣ (𝑖 ≠ 𝑋 ∧ ∀𝑗 ∈ (Idl‘𝑅)(𝑖 ⊆ 𝑗 → (𝑗 = 𝑖 ∨ 𝑗 = 𝑋)))})
15		df-maxidl 38252	. 2 ⊢ MaxIdl = (𝑟 ∈ RingOps ↦ {𝑖 ∈ (Idl‘𝑟) ∣ (𝑖 ≠ ran (1^st ‘𝑟) ∧ ∀𝑗 ∈ (Idl‘𝑟)(𝑖 ⊆ 𝑗 → (𝑗 = 𝑖 ∨ 𝑗 = ran (1^st ‘𝑟))))})
16		fvex 6855	. . 3 ⊢ (Idl‘𝑅) ∈ V
17	16	rabex 5286	. 2 ⊢ {𝑖 ∈ (Idl‘𝑅) ∣ (𝑖 ≠ 𝑋 ∧ ∀𝑗 ∈ (Idl‘𝑅)(𝑖 ⊆ 𝑗 → (𝑗 = 𝑖 ∨ 𝑗 = 𝑋)))} ∈ V
18	14, 15, 17	fvmpt 6949	1 ⊢ (𝑅 ∈ RingOps → (MaxIdl‘𝑅) = {𝑖 ∈ (Idl‘𝑅) ∣ (𝑖 ≠ 𝑋 ∧ ∀𝑗 ∈ (Idl‘𝑅)(𝑖 ⊆ 𝑗 → (𝑗 = 𝑖 ∨ 𝑗 = 𝑋)))})

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∨ wo 848 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 ∀wral 3052 {crab 3401 ⊆ wss 3903 ran crn 5633 ‘cfv 6500 1^st c1st 7941 RingOpscrngo 38134 Idlcidl 38247 MaxIdlcmaxidl 38249

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5243 ax-nul 5253 ax-pr 5379

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5527 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-iota 6456 df-fun 6502 df-fv 6508 df-maxidl 38252

This theorem is referenced by: ismaxidl 38280

W3C validator