Users' Mathboxes Mathbox for Jeff Madsen < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  maxidlmax Structured version   Visualization version   GIF version

Theorem maxidlmax 35320
Description: A maximal ideal is a maximal proper ideal. (Contributed by Jeff Madsen, 16-Jun-2011.)
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.
StepHypRef Expression
1 maxidlnr.1 . . . . . . 7 𝐺 = (1st𝑅)
2 maxidlnr.2 . . . . . . 7 𝑋 = ran 𝐺
31, 2ismaxidl 35317 . . . . . 6 (𝑅 ∈ RingOps → (𝑀 ∈ (MaxIdl‘𝑅) ↔ (𝑀 ∈ (Idl‘𝑅) ∧ 𝑀𝑋 ∧ ∀𝑗 ∈ (Idl‘𝑅)(𝑀𝑗 → (𝑗 = 𝑀𝑗 = 𝑋)))))
43biimpa 479 . . . . 5 ((𝑅 ∈ RingOps ∧ 𝑀 ∈ (MaxIdl‘𝑅)) → (𝑀 ∈ (Idl‘𝑅) ∧ 𝑀𝑋 ∧ ∀𝑗 ∈ (Idl‘𝑅)(𝑀𝑗 → (𝑗 = 𝑀𝑗 = 𝑋))))
54simp3d 1140 . . . 4 ((𝑅 ∈ RingOps ∧ 𝑀 ∈ (MaxIdl‘𝑅)) → ∀𝑗 ∈ (Idl‘𝑅)(𝑀𝑗 → (𝑗 = 𝑀𝑗 = 𝑋)))
6 sseq2 3992 . . . . . 6 (𝑗 = 𝐼 → (𝑀𝑗𝑀𝐼))
7 eqeq1 2825 . . . . . . 7 (𝑗 = 𝐼 → (𝑗 = 𝑀𝐼 = 𝑀))
8 eqeq1 2825 . . . . . . 7 (𝑗 = 𝐼 → (𝑗 = 𝑋𝐼 = 𝑋))
97, 8orbi12d 915 . . . . . 6 (𝑗 = 𝐼 → ((𝑗 = 𝑀𝑗 = 𝑋) ↔ (𝐼 = 𝑀𝐼 = 𝑋)))
106, 9imbi12d 347 . . . . 5 (𝑗 = 𝐼 → ((𝑀𝑗 → (𝑗 = 𝑀𝑗 = 𝑋)) ↔ (𝑀𝐼 → (𝐼 = 𝑀𝐼 = 𝑋))))
1110rspcva 3620 . . . 4 ((𝐼 ∈ (Idl‘𝑅) ∧ ∀𝑗 ∈ (Idl‘𝑅)(𝑀𝑗 → (𝑗 = 𝑀𝑗 = 𝑋))) → (𝑀𝐼 → (𝐼 = 𝑀𝐼 = 𝑋)))
125, 11sylan2 594 . . 3 ((𝐼 ∈ (Idl‘𝑅) ∧ (𝑅 ∈ RingOps ∧ 𝑀 ∈ (MaxIdl‘𝑅))) → (𝑀𝐼 → (𝐼 = 𝑀𝐼 = 𝑋)))
1312ancoms 461 . 2 (((𝑅 ∈ RingOps ∧ 𝑀 ∈ (MaxIdl‘𝑅)) ∧ 𝐼 ∈ (Idl‘𝑅)) → (𝑀𝐼 → (𝐼 = 𝑀𝐼 = 𝑋)))
1413impr 457 1 (((𝑅 ∈ RingOps ∧ 𝑀 ∈ (MaxIdl‘𝑅)) ∧ (𝐼 ∈ (Idl‘𝑅) ∧ 𝑀𝐼)) → (𝐼 = 𝑀𝐼 = 𝑋))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398  wo 843  w3a 1083   = wceq 1533  wcel 2110  wne 3016  wral 3138  wss 3935  ran crn 5555  cfv 6354  1st c1st 7686  RingOpscrngo 35171  Idlcidl 35284  MaxIdlcmaxidl 35286
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5202  ax-nul 5209  ax-pr 5329
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3772  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4567  df-pr 4569  df-op 4573  df-uni 4838  df-br 5066  df-opab 5128  df-mpt 5146  df-id 5459  df-xp 5560  df-rel 5561  df-cnv 5562  df-co 5563  df-dm 5564  df-rn 5565  df-iota 6313  df-fun 6356  df-fv 6362  df-maxidl 35289
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator