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 36505
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 36502 . . . . . 6 (𝑅 ∈ RingOps → (𝑀 ∈ (MaxIdl‘𝑅) ↔ (𝑀 ∈ (Idl‘𝑅) ∧ 𝑀𝑋 ∧ ∀𝑗 ∈ (Idl‘𝑅)(𝑀𝑗 → (𝑗 = 𝑀𝑗 = 𝑋)))))
43biimpa 478 . . . . 5 ((𝑅 ∈ RingOps ∧ 𝑀 ∈ (MaxIdl‘𝑅)) → (𝑀 ∈ (Idl‘𝑅) ∧ 𝑀𝑋 ∧ ∀𝑗 ∈ (Idl‘𝑅)(𝑀𝑗 → (𝑗 = 𝑀𝑗 = 𝑋))))
54simp3d 1145 . . . 4 ((𝑅 ∈ RingOps ∧ 𝑀 ∈ (MaxIdl‘𝑅)) → ∀𝑗 ∈ (Idl‘𝑅)(𝑀𝑗 → (𝑗 = 𝑀𝑗 = 𝑋)))
6 sseq2 3971 . . . . . 6 (𝑗 = 𝐼 → (𝑀𝑗𝑀𝐼))
7 eqeq1 2741 . . . . . . 7 (𝑗 = 𝐼 → (𝑗 = 𝑀𝐼 = 𝑀))
8 eqeq1 2741 . . . . . . 7 (𝑗 = 𝐼 → (𝑗 = 𝑋𝐼 = 𝑋))
97, 8orbi12d 918 . . . . . 6 (𝑗 = 𝐼 → ((𝑗 = 𝑀𝑗 = 𝑋) ↔ (𝐼 = 𝑀𝐼 = 𝑋)))
106, 9imbi12d 345 . . . . 5 (𝑗 = 𝐼 → ((𝑀𝑗 → (𝑗 = 𝑀𝑗 = 𝑋)) ↔ (𝑀𝐼 → (𝐼 = 𝑀𝐼 = 𝑋))))
1110rspcva 3580 . . . 4 ((𝐼 ∈ (Idl‘𝑅) ∧ ∀𝑗 ∈ (Idl‘𝑅)(𝑀𝑗 → (𝑗 = 𝑀𝑗 = 𝑋))) → (𝑀𝐼 → (𝐼 = 𝑀𝐼 = 𝑋)))
125, 11sylan2 594 . . 3 ((𝐼 ∈ (Idl‘𝑅) ∧ (𝑅 ∈ RingOps ∧ 𝑀 ∈ (MaxIdl‘𝑅))) → (𝑀𝐼 → (𝐼 = 𝑀𝐼 = 𝑋)))
1312ancoms 460 . 2 (((𝑅 ∈ RingOps ∧ 𝑀 ∈ (MaxIdl‘𝑅)) ∧ 𝐼 ∈ (Idl‘𝑅)) → (𝑀𝐼 → (𝐼 = 𝑀𝐼 = 𝑋)))
1413impr 456 1 (((𝑅 ∈ RingOps ∧ 𝑀 ∈ (MaxIdl‘𝑅)) ∧ (𝐼 ∈ (Idl‘𝑅) ∧ 𝑀𝐼)) → (𝐼 = 𝑀𝐼 = 𝑋))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 397  wo 846  w3a 1088   = wceq 1542  wcel 2107  wne 2944  wral 3065  wss 3911  ran crn 5635  cfv 6497  1st c1st 7920  RingOpscrngo 36356  Idlcidl 36469  MaxIdlcmaxidl 36471
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2708  ax-sep 5257  ax-nul 5264  ax-pr 5385
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2729  df-clel 2815  df-nfc 2890  df-ne 2945  df-ral 3066  df-rex 3075  df-rab 3409  df-v 3448  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-nul 4284  df-if 4488  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4867  df-br 5107  df-opab 5169  df-mpt 5190  df-id 5532  df-xp 5640  df-rel 5641  df-cnv 5642  df-co 5643  df-dm 5644  df-rn 5645  df-iota 6449  df-fun 6499  df-fv 6505  df-maxidl 36474
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator