Theorem maxidlmax 38780

Description: Obsolete theorem, use mxidlmax 33855 instead. A maximal ideal is a maximal proper ideal. (Contributed by Jeff Madsen, 16-Jun-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

Hypotheses

Ref	Expression
maxidlnr.1	⊢ 𝐺 = (1st ‘𝑅)
maxidlnr.2	⊢ 𝑋 = ran 𝐺

Assertion

Ref	Expression
maxidlmax	⊢ (((𝑅 ∈ RingOps ∧ 𝑀 ∈ (MaxIdl‘𝑅)) ∧ (𝐼 ∈ (Idl‘𝑅) ∧ 𝑀 ⊆ 𝐼)) → (𝐼 = 𝑀 ∨ 𝐼 = 𝑋))

Proof of Theorem maxidlmax

Dummy variable 𝑗 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		maxidlnr.1	. . . . . . 7 ⊢ 𝐺 = (1st ‘𝑅)
2		maxidlnr.2	. . . . . . 7 ⊢ 𝑋 = ran 𝐺
3	1, 2	ismaxidl 38777	. . . . . 6 ⊢ (𝑅 ∈ RingOps → (𝑀 ∈ (MaxIdl‘𝑅) ↔ (𝑀 ∈ (Idl‘𝑅) ∧ 𝑀 ≠ 𝑋 ∧ ∀𝑗 ∈ (Idl‘𝑅)(𝑀 ⊆ 𝑗 → (𝑗 = 𝑀 ∨ 𝑗 = 𝑋)))))
4	3	biimpa 482	. . . . 5 ⊢ ((𝑅 ∈ RingOps ∧ 𝑀 ∈ (MaxIdl‘𝑅)) → (𝑀 ∈ (Idl‘𝑅) ∧ 𝑀 ≠ 𝑋 ∧ ∀𝑗 ∈ (Idl‘𝑅)(𝑀 ⊆ 𝑗 → (𝑗 = 𝑀 ∨ 𝑗 = 𝑋))))
5	4	simp3d 1162	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ 𝑀 ∈ (MaxIdl‘𝑅)) → ∀𝑗 ∈ (Idl‘𝑅)(𝑀 ⊆ 𝑗 → (𝑗 = 𝑀 ∨ 𝑗 = 𝑋)))
6		sseq2 3960	. . . . . 6 ⊢ (𝑗 = 𝐼 → (𝑀 ⊆ 𝑗 ↔ 𝑀 ⊆ 𝐼))
7		eqeq1 2766	. . . . . . 7 ⊢ (𝑗 = 𝐼 → (𝑗 = 𝑀 ↔ 𝐼 = 𝑀))
8		eqeq1 2766	. . . . . . 7 ⊢ (𝑗 = 𝐼 → (𝑗 = 𝑋 ↔ 𝐼 = 𝑋))
9	7, 8	orbi12d 932	. . . . . 6 ⊢ (𝑗 = 𝐼 → ((𝑗 = 𝑀 ∨ 𝑗 = 𝑋) ↔ (𝐼 = 𝑀 ∨ 𝐼 = 𝑋)))
10	6, 9	imbi12d 347	. . . . 5 ⊢ (𝑗 = 𝐼 → ((𝑀 ⊆ 𝑗 → (𝑗 = 𝑀 ∨ 𝑗 = 𝑋)) ↔ (𝑀 ⊆ 𝐼 → (𝐼 = 𝑀 ∨ 𝐼 = 𝑋))))
11	10	rspcva 3577	. . . 4 ⊢ ((𝐼 ∈ (Idl‘𝑅) ∧ ∀𝑗 ∈ (Idl‘𝑅)(𝑀 ⊆ 𝑗 → (𝑗 = 𝑀 ∨ 𝑗 = 𝑋))) → (𝑀 ⊆ 𝐼 → (𝐼 = 𝑀 ∨ 𝐼 = 𝑋)))
12	5, 11	sylan2 605	. . 3 ⊢ ((𝐼 ∈ (Idl‘𝑅) ∧ (𝑅 ∈ RingOps ∧ 𝑀 ∈ (MaxIdl‘𝑅))) → (𝑀 ⊆ 𝐼 → (𝐼 = 𝑀 ∨ 𝐼 = 𝑋)))
13	12	ancoms 464	. 2 ⊢ (((𝑅 ∈ RingOps ∧ 𝑀 ∈ (MaxIdl‘𝑅)) ∧ 𝐼 ∈ (Idl‘𝑅)) → (𝑀 ⊆ 𝐼 → (𝐼 = 𝑀 ∨ 𝐼 = 𝑋)))
14	13	impr 460	1 ⊢ (((𝑅 ∈ RingOps ∧ 𝑀 ∈ (MaxIdl‘𝑅)) ∧ (𝐼 ∈ (Idl‘𝑅) ∧ 𝑀 ⊆ 𝐼)) → (𝐼 = 𝑀 ∨ 𝐼 = 𝑋))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∨ wo 861   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ≠ wne 2957  ∀wral 3078   ⊆ wss 3902  ran crn 5660  ‘cfv 6537  1^st c1st 7987  RingOpscrngo 38631  Idlcidl 38744  MaxIdlcmaxidl 38746

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-rn 5670  df-iota 6493  df-fun 6539  df-fv 6545  df-maxidl 38749

This theorem is used by: (None)