Theorem mxidlval 33610

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 6863	. . 3 ⊢ (𝑟 = 𝑅 → (LIdeal‘𝑟) = (LIdeal‘𝑅))
2		fveq2 6863	. . . . . 6 ⊢ (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
3		mxidlval.1	. . . . . 6 ⊢ 𝐵 = (Base‘𝑅)
4	2, 3	eqtr4di 2814	. . . . 5 ⊢ (𝑟 = 𝑅 → (Base‘𝑟) = 𝐵)
5	4	neeq2d 3016	. . . 4 ⊢ (𝑟 = 𝑅 → (𝑖 ≠ (Base‘𝑟) ↔ 𝑖 ≠ 𝐵))
6	4	eqeq2d 2772	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (𝑗 = (Base‘𝑟) ↔ 𝑗 = 𝐵))
7	6	orbi2d 926	. . . . . 6 ⊢ (𝑟 = 𝑅 → ((𝑗 = 𝑖 ∨ 𝑗 = (Base‘𝑟)) ↔ (𝑗 = 𝑖 ∨ 𝑗 = 𝐵)))
8	7	imbi2d 342	. . . . 5 ⊢ (𝑟 = 𝑅 → ((𝑖 ⊆ 𝑗 → (𝑗 = 𝑖 ∨ 𝑗 = (Base‘𝑟))) ↔ (𝑖 ⊆ 𝑗 → (𝑗 = 𝑖 ∨ 𝑗 = 𝐵))))
9	1, 8	raleqbidv 3335	. . . 4 ⊢ (𝑟 = 𝑅 → (∀𝑗 ∈ (LIdeal‘𝑟)(𝑖 ⊆ 𝑗 → (𝑗 = 𝑖 ∨ 𝑗 = (Base‘𝑟))) ↔ ∀𝑗 ∈ (LIdeal‘𝑅)(𝑖 ⊆ 𝑗 → (𝑗 = 𝑖 ∨ 𝑗 = 𝐵))))
10	5, 9	anbi12d 641	. . 3 ⊢ (𝑟 = 𝑅 → ((𝑖 ≠ (Base‘𝑟) ∧ ∀𝑗 ∈ (LIdeal‘𝑟)(𝑖 ⊆ 𝑗 → (𝑗 = 𝑖 ∨ 𝑗 = (Base‘𝑟)))) ↔ (𝑖 ≠ 𝐵 ∧ ∀𝑗 ∈ (LIdeal‘𝑅)(𝑖 ⊆ 𝑗 → (𝑗 = 𝑖 ∨ 𝑗 = 𝐵)))))
11	1, 10	rabeqbidv 3431	. 2 ⊢ (𝑟 = 𝑅 → {𝑖 ∈ (LIdeal‘𝑟) ∣ (𝑖 ≠ (Base‘𝑟) ∧ ∀𝑗 ∈ (LIdeal‘𝑟)(𝑖 ⊆ 𝑗 → (𝑗 = 𝑖 ∨ 𝑗 = (Base‘𝑟))))} = {𝑖 ∈ (LIdeal‘𝑅) ∣ (𝑖 ≠ 𝐵 ∧ ∀𝑗 ∈ (LIdeal‘𝑅)(𝑖 ⊆ 𝑗 → (𝑗 = 𝑖 ∨ 𝑗 = 𝐵)))})
12		df-mxidl 33609	. 2 ⊢ MaxIdeal = (𝑟 ∈ Ring ↦ {𝑖 ∈ (LIdeal‘𝑟) ∣ (𝑖 ≠ (Base‘𝑟) ∧ ∀𝑗 ∈ (LIdeal‘𝑟)(𝑖 ⊆ 𝑗 → (𝑗 = 𝑖 ∨ 𝑗 = (Base‘𝑟))))})
13		fvex 6876	. . 3 ⊢ (LIdeal‘𝑅) ∈ V
14	13	rabex 5294	. 2 ⊢ {𝑖 ∈ (LIdeal‘𝑅) ∣ (𝑖 ≠ 𝐵 ∧ ∀𝑗 ∈ (LIdeal‘𝑅)(𝑖 ⊆ 𝑗 → (𝑗 = 𝑖 ∨ 𝑗 = 𝐵)))} ∈ V
15	11, 12, 14	fvmpt 6971	1 ⊢ (𝑅 ∈ Ring → (MaxIdeal‘𝑅) = {𝑖 ∈ (LIdeal‘𝑅) ∣ (𝑖 ≠ 𝐵 ∧ ∀𝑗 ∈ (LIdeal‘𝑅)(𝑖 ⊆ 𝑗 → (𝑗 = 𝑖 ∨ 𝑗 = 𝐵)))})

Syntax hints:   → wi 4   ∧ wa 399   ∨ wo 858   = wceq 1559   ∈ wcel 2141   ≠ wne 2956  ∀wral 3075  {crab 3413   ⊆ wss 3904  ‘cfv 6517  Basecbs 17228  Ringcrg 20262  LIdealclidl 21256  MaxIdealcmxidl 33608

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5245  ax-nul 5255  ax-pr 5389

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-br 5100  df-opab 5162  df-mpt 5181  df-id 5540  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-iota 6473  df-fun 6519  df-fv 6525  df-mxidl 33609

This theorem is referenced by:  ismxidl  33611