Theorem mxidlmax 34060

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 3939	. . . 4 ⊢ (𝑗 = 𝐼 → (𝑀 ⊆ 𝑗 ↔ 𝑀 ⊆ 𝐼))
2		eqeq1 2767	. . . . 5 ⊢ (𝑗 = 𝐼 → (𝑗 = 𝑀 ↔ 𝐼 = 𝑀))
3		eqeq1 2767	. . . . 5 ⊢ (𝑗 = 𝐼 → (𝑗 = 𝐵 ↔ 𝐼 = 𝐵))
4	2, 3	orbi12d 932	. . . 4 ⊢ (𝑗 = 𝐼 → ((𝑗 = 𝑀 ∨ 𝑗 = 𝐵) ↔ (𝐼 = 𝑀 ∨ 𝐼 = 𝐵)))
5	1, 4	imbi12d 347	. . 3 ⊢ (𝑗 = 𝐼 → ((𝑀 ⊆ 𝑗 → (𝑗 = 𝑀 ∨ 𝑗 = 𝐵)) ↔ (𝑀 ⊆ 𝐼 → (𝐼 = 𝑀 ∨ 𝐼 = 𝐵))))
6		mxidlval.1	. . . . . . 7 ⊢ 𝐵 = (Base‘𝑅)
7	6	ismxidl 34057	. . . . . 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 3581	. 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 2147   ≠ wne 2959  ∀wral 3080   ⊆ wss 3900  ‘cfv 6558  Basecbs 17416  Ringcrg 20489  LIdealclidl 21514  MaxIdealcmxidl 34054

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-iota 6512  df-fun 6560  df-fv 6566  df-mxidl 34055

This theorem is used by:  mxidlmaxv  34063  mxidlprm  34065  opprmxidlabs  34081  dflring3  34099  dflring4  34100  zarclssn  34575