Theorem mxidlval 33424

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

Hypothesis

Ref	Expression
mxidlval.1	⊢ 𝐵 = (Base‘𝑅)

Assertion

Ref	Expression
mxidlval	⊢ (𝑅 ∈ Ring → (MaxIdeal‘𝑅) = {𝑖 ∈ (LIdeal‘𝑅) ∣ (𝑖 ≠ 𝐵 ∧ ∀𝑗 ∈ (LIdeal‘𝑅)(𝑖 ⊆ 𝑗 → (𝑗 = 𝑖 ∨ 𝑗 = 𝐵)))})

Distinct variable group:   𝑅,𝑖,𝑗

Allowed substitution hints:   𝐵(𝑖,𝑗)

Proof of Theorem mxidlval

Dummy variable 𝑟 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveq2 6822	. . 3 ⊢ (𝑟 = 𝑅 → (LIdeal‘𝑟) = (LIdeal‘𝑅))
2		fveq2 6822	. . . . . 6 ⊢ (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
3		mxidlval.1	. . . . . 6 ⊢ 𝐵 = (Base‘𝑅)
4	2, 3	eqtr4di 2784	. . . . 5 ⊢ (𝑟 = 𝑅 → (Base‘𝑟) = 𝐵)
5	4	neeq2d 2988	. . . 4 ⊢ (𝑟 = 𝑅 → (𝑖 ≠ (Base‘𝑟) ↔ 𝑖 ≠ 𝐵))
6	4	eqeq2d 2742	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (𝑗 = (Base‘𝑟) ↔ 𝑗 = 𝐵))
7	6	orbi2d 915	. . . . . 6 ⊢ (𝑟 = 𝑅 → ((𝑗 = 𝑖 ∨ 𝑗 = (Base‘𝑟)) ↔ (𝑗 = 𝑖 ∨ 𝑗 = 𝐵)))
8	7	imbi2d 340	. . . . 5 ⊢ (𝑟 = 𝑅 → ((𝑖 ⊆ 𝑗 → (𝑗 = 𝑖 ∨ 𝑗 = (Base‘𝑟))) ↔ (𝑖 ⊆ 𝑗 → (𝑗 = 𝑖 ∨ 𝑗 = 𝐵))))
9	1, 8	raleqbidv 3312	. . . 4 ⊢ (𝑟 = 𝑅 → (∀𝑗 ∈ (LIdeal‘𝑟)(𝑖 ⊆ 𝑗 → (𝑗 = 𝑖 ∨ 𝑗 = (Base‘𝑟))) ↔ ∀𝑗 ∈ (LIdeal‘𝑅)(𝑖 ⊆ 𝑗 → (𝑗 = 𝑖 ∨ 𝑗 = 𝐵))))
10	5, 9	anbi12d 632	. . 3 ⊢ (𝑟 = 𝑅 → ((𝑖 ≠ (Base‘𝑟) ∧ ∀𝑗 ∈ (LIdeal‘𝑟)(𝑖 ⊆ 𝑗 → (𝑗 = 𝑖 ∨ 𝑗 = (Base‘𝑟)))) ↔ (𝑖 ≠ 𝐵 ∧ ∀𝑗 ∈ (LIdeal‘𝑅)(𝑖 ⊆ 𝑗 → (𝑗 = 𝑖 ∨ 𝑗 = 𝐵)))))
11	1, 10	rabeqbidv 3413	. 2 ⊢ (𝑟 = 𝑅 → {𝑖 ∈ (LIdeal‘𝑟) ∣ (𝑖 ≠ (Base‘𝑟) ∧ ∀𝑗 ∈ (LIdeal‘𝑟)(𝑖 ⊆ 𝑗 → (𝑗 = 𝑖 ∨ 𝑗 = (Base‘𝑟))))} = {𝑖 ∈ (LIdeal‘𝑅) ∣ (𝑖 ≠ 𝐵 ∧ ∀𝑗 ∈ (LIdeal‘𝑅)(𝑖 ⊆ 𝑗 → (𝑗 = 𝑖 ∨ 𝑗 = 𝐵)))})
12		df-mxidl 33423	. 2 ⊢ MaxIdeal = (𝑟 ∈ Ring ↦ {𝑖 ∈ (LIdeal‘𝑟) ∣ (𝑖 ≠ (Base‘𝑟) ∧ ∀𝑗 ∈ (LIdeal‘𝑟)(𝑖 ⊆ 𝑗 → (𝑗 = 𝑖 ∨ 𝑗 = (Base‘𝑟))))})
13		fvex 6835	. . 3 ⊢ (LIdeal‘𝑅) ∈ V
14	13	rabex 5277	. 2 ⊢ {𝑖 ∈ (LIdeal‘𝑅) ∣ (𝑖 ≠ 𝐵 ∧ ∀𝑗 ∈ (LIdeal‘𝑅)(𝑖 ⊆ 𝑗 → (𝑗 = 𝑖 ∨ 𝑗 = 𝐵)))} ∈ V
15	11, 12, 14	fvmpt 6929	1 ⊢ (𝑅 ∈ Ring → (MaxIdeal‘𝑅) = {𝑖 ∈ (LIdeal‘𝑅) ∣ (𝑖 ≠ 𝐵 ∧ ∀𝑗 ∈ (LIdeal‘𝑅)(𝑖 ⊆ 𝑗 → (𝑗 = 𝑖 ∨ 𝑗 = 𝐵)))})

Syntax hints:   → wi 4   ∧ wa 395   ∨ wo 847   = wceq 1541   ∈ wcel 2111   ≠ wne 2928  ∀wral 3047  {crab 3395   ⊆ wss 3902  ‘cfv 6481  Basecbs 17120  Ringcrg 20152  LIdealclidl 21144  MaxIdealcmxidl 33422

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-sep 5234  ax-nul 5244  ax-pr 5370

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-rab 3396  df-v 3438  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4476  df-pw 4552  df-sn 4577  df-pr 4579  df-op 4583  df-uni 4860  df-br 5092  df-opab 5154  df-mpt 5173  df-id 5511  df-xp 5622  df-rel 5623  df-cnv 5624  df-co 5625  df-dm 5626  df-iota 6437  df-fun 6483  df-fv 6489  df-mxidl 33423

This theorem is referenced by:  ismxidl  33425