Theorem mxidlmax 33876

Description: A maximal ideal is a maximal proper ideal. (Contributed by Jeff Madsen, 16-Jun-2011.) (Revised by Thierry Arnoux, 19-Jan-2024.)

Hypothesis

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

Assertion

Ref	Expression
mxidlmax	⊢ (((𝑅 ∈ Ring ∧ 𝑀 ∈ (MaxIdeal‘𝑅)) ∧ (𝐼 ∈ (LIdeal‘𝑅) ∧ 𝑀 ⊆ 𝐼)) → (𝐼 = 𝑀 ∨ 𝐼 = 𝐵))

Proof of Theorem mxidlmax

Dummy variable 𝑗 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		sseq2 3960	. . . 4 ⊢ (𝑗 = 𝐼 → (𝑀 ⊆ 𝑗 ↔ 𝑀 ⊆ 𝐼))
2		eqeq1 2766	. . . . 5 ⊢ (𝑗 = 𝐼 → (𝑗 = 𝑀 ↔ 𝐼 = 𝑀))
3		eqeq1 2766	. . . . 5 ⊢ (𝑗 = 𝐼 → (𝑗 = 𝐵 ↔ 𝐼 = 𝐵))
4	2, 3	orbi12d 932	. . . 4 ⊢ (𝑗 = 𝐼 → ((𝑗 = 𝑀 ∨ 𝑗 = 𝐵) ↔ (𝐼 = 𝑀 ∨ 𝐼 = 𝐵)))
5	1, 4	imbi12d 347	. . 3 ⊢ (𝑗 = 𝐼 → ((𝑀 ⊆ 𝑗 → (𝑗 = 𝑀 ∨ 𝑗 = 𝐵)) ↔ (𝑀 ⊆ 𝐼 → (𝐼 = 𝑀 ∨ 𝐼 = 𝐵))))
6		mxidlval.1	. . . . . . 7 ⊢ 𝐵 = (Base‘𝑅)
7	6	ismxidl 33873	. . . . . 6 ⊢ (𝑅 ∈ Ring → (𝑀 ∈ (MaxIdeal‘𝑅) ↔ (𝑀 ∈ (LIdeal‘𝑅) ∧ 𝑀 ≠ 𝐵 ∧ ∀𝑗 ∈ (LIdeal‘𝑅)(𝑀 ⊆ 𝑗 → (𝑗 = 𝑀 ∨ 𝑗 = 𝐵)))))
8	7	biimpa 482	. . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑀 ∈ (MaxIdeal‘𝑅)) → (𝑀 ∈ (LIdeal‘𝑅) ∧ 𝑀 ≠ 𝐵 ∧ ∀𝑗 ∈ (LIdeal‘𝑅)(𝑀 ⊆ 𝑗 → (𝑗 = 𝑀 ∨ 𝑗 = 𝐵))))
9	8	simp3d 1162	. . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑀 ∈ (MaxIdeal‘𝑅)) → ∀𝑗 ∈ (LIdeal‘𝑅)(𝑀 ⊆ 𝑗 → (𝑗 = 𝑀 ∨ 𝑗 = 𝐵)))
10	9	adantr 486	. . 3 ⊢ (((𝑅 ∈ Ring ∧ 𝑀 ∈ (MaxIdeal‘𝑅)) ∧ 𝐼 ∈ (LIdeal‘𝑅)) → ∀𝑗 ∈ (LIdeal‘𝑅)(𝑀 ⊆ 𝑗 → (𝑗 = 𝑀 ∨ 𝑗 = 𝐵)))
11		simpr 490	. . 3 ⊢ (((𝑅 ∈ Ring ∧ 𝑀 ∈ (MaxIdeal‘𝑅)) ∧ 𝐼 ∈ (LIdeal‘𝑅)) → 𝐼 ∈ (LIdeal‘𝑅))
12	5, 10, 11	rspcdva 3580	. 2 ⊢ (((𝑅 ∈ Ring ∧ 𝑀 ∈ (MaxIdeal‘𝑅)) ∧ 𝐼 ∈ (LIdeal‘𝑅)) → (𝑀 ⊆ 𝐼 → (𝐼 = 𝑀 ∨ 𝐼 = 𝐵)))
13	12	impr 460	1 ⊢ (((𝑅 ∈ Ring ∧ 𝑀 ∈ (MaxIdeal‘𝑅)) ∧ (𝐼 ∈ (LIdeal‘𝑅) ∧ 𝑀 ⊆ 𝐼)) → (𝐼 = 𝑀 ∨ 𝐼 = 𝐵))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∨ wo 861   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ≠ wne 2957  ∀wral 3078   ⊆ wss 3902  ‘cfv 6537  Basecbs 17307  Ringcrg 20378  LIdealclidl 21399  MaxIdealcmxidl 33870

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

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-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  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-iota 6493  df-fun 6539  df-fv 6545  df-mxidl 33871

This theorem is used by:  mxidlmaxv  33879  mxidlprm  33881  opprmxidlabs  33897  dflring3  33915  dflring4  33916  zarclssn  34391