Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ismxidl Structured version   Visualization version   GIF version

Theorem ismxidl 31361
Description: The predicate "is a maximal ideal". (Contributed by Jeff Madsen, 5-Jan-2011.) (Revised by Thierry Arnoux, 19-Jan-2024.)
Hypothesis
Ref Expression
mxidlval.1 𝐵 = (Base‘𝑅)
Assertion
Ref Expression
ismxidl (𝑅 ∈ Ring → (𝑀 ∈ (MaxIdeal‘𝑅) ↔ (𝑀 ∈ (LIdeal‘𝑅) ∧ 𝑀𝐵 ∧ ∀𝑗 ∈ (LIdeal‘𝑅)(𝑀𝑗 → (𝑗 = 𝑀𝑗 = 𝐵)))))
Distinct variable groups:   𝑅,𝑗   𝑗,𝑀
Allowed substitution hint:   𝐵(𝑗)

Proof of Theorem ismxidl
Dummy variable 𝑖 is distinct from all other variables.
StepHypRef Expression
1 mxidlval.1 . . . 4 𝐵 = (Base‘𝑅)
21mxidlval 31360 . . 3 (𝑅 ∈ Ring → (MaxIdeal‘𝑅) = {𝑖 ∈ (LIdeal‘𝑅) ∣ (𝑖𝐵 ∧ ∀𝑗 ∈ (LIdeal‘𝑅)(𝑖𝑗 → (𝑗 = 𝑖𝑗 = 𝐵)))})
32eleq2d 2824 . 2 (𝑅 ∈ Ring → (𝑀 ∈ (MaxIdeal‘𝑅) ↔ 𝑀 ∈ {𝑖 ∈ (LIdeal‘𝑅) ∣ (𝑖𝐵 ∧ ∀𝑗 ∈ (LIdeal‘𝑅)(𝑖𝑗 → (𝑗 = 𝑖𝑗 = 𝐵)))}))
4 neeq1 3004 . . . . 5 (𝑖 = 𝑀 → (𝑖𝐵𝑀𝐵))
5 sseq1 3935 . . . . . . 7 (𝑖 = 𝑀 → (𝑖𝑗𝑀𝑗))
6 eqeq2 2750 . . . . . . . 8 (𝑖 = 𝑀 → (𝑗 = 𝑖𝑗 = 𝑀))
76orbi1d 917 . . . . . . 7 (𝑖 = 𝑀 → ((𝑗 = 𝑖𝑗 = 𝐵) ↔ (𝑗 = 𝑀𝑗 = 𝐵)))
85, 7imbi12d 348 . . . . . 6 (𝑖 = 𝑀 → ((𝑖𝑗 → (𝑗 = 𝑖𝑗 = 𝐵)) ↔ (𝑀𝑗 → (𝑗 = 𝑀𝑗 = 𝐵))))
98ralbidv 3119 . . . . 5 (𝑖 = 𝑀 → (∀𝑗 ∈ (LIdeal‘𝑅)(𝑖𝑗 → (𝑗 = 𝑖𝑗 = 𝐵)) ↔ ∀𝑗 ∈ (LIdeal‘𝑅)(𝑀𝑗 → (𝑗 = 𝑀𝑗 = 𝐵))))
104, 9anbi12d 634 . . . 4 (𝑖 = 𝑀 → ((𝑖𝐵 ∧ ∀𝑗 ∈ (LIdeal‘𝑅)(𝑖𝑗 → (𝑗 = 𝑖𝑗 = 𝐵))) ↔ (𝑀𝐵 ∧ ∀𝑗 ∈ (LIdeal‘𝑅)(𝑀𝑗 → (𝑗 = 𝑀𝑗 = 𝐵)))))
1110elrab 3609 . . 3 (𝑀 ∈ {𝑖 ∈ (LIdeal‘𝑅) ∣ (𝑖𝐵 ∧ ∀𝑗 ∈ (LIdeal‘𝑅)(𝑖𝑗 → (𝑗 = 𝑖𝑗 = 𝐵)))} ↔ (𝑀 ∈ (LIdeal‘𝑅) ∧ (𝑀𝐵 ∧ ∀𝑗 ∈ (LIdeal‘𝑅)(𝑀𝑗 → (𝑗 = 𝑀𝑗 = 𝐵)))))
12 3anass 1097 . . 3 ((𝑀 ∈ (LIdeal‘𝑅) ∧ 𝑀𝐵 ∧ ∀𝑗 ∈ (LIdeal‘𝑅)(𝑀𝑗 → (𝑗 = 𝑀𝑗 = 𝐵))) ↔ (𝑀 ∈ (LIdeal‘𝑅) ∧ (𝑀𝐵 ∧ ∀𝑗 ∈ (LIdeal‘𝑅)(𝑀𝑗 → (𝑗 = 𝑀𝑗 = 𝐵)))))
1311, 12bitr4i 281 . 2 (𝑀 ∈ {𝑖 ∈ (LIdeal‘𝑅) ∣ (𝑖𝐵 ∧ ∀𝑗 ∈ (LIdeal‘𝑅)(𝑖𝑗 → (𝑗 = 𝑖𝑗 = 𝐵)))} ↔ (𝑀 ∈ (LIdeal‘𝑅) ∧ 𝑀𝐵 ∧ ∀𝑗 ∈ (LIdeal‘𝑅)(𝑀𝑗 → (𝑗 = 𝑀𝑗 = 𝐵))))
143, 13bitrdi 290 1 (𝑅 ∈ Ring → (𝑀 ∈ (MaxIdeal‘𝑅) ↔ (𝑀 ∈ (LIdeal‘𝑅) ∧ 𝑀𝐵 ∧ ∀𝑗 ∈ (LIdeal‘𝑅)(𝑀𝑗 → (𝑗 = 𝑀𝑗 = 𝐵)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 399  wo 847  w3a 1089   = wceq 1543  wcel 2111  wne 2941  wral 3062  {crab 3066  wss 3875  cfv 6389  Basecbs 16773  Ringcrg 19575  LIdealclidl 20220  MaxIdealcmxidl 31358
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2016  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2159  ax-12 2176  ax-ext 2709  ax-sep 5201  ax-nul 5208  ax-pr 5331
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2072  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2887  df-ne 2942  df-ral 3067  df-rex 3068  df-rab 3071  df-v 3417  df-dif 3878  df-un 3880  df-in 3882  df-ss 3892  df-nul 4247  df-if 4449  df-sn 4551  df-pr 4553  df-op 4557  df-uni 4829  df-br 5063  df-opab 5125  df-mpt 5145  df-id 5464  df-xp 5566  df-rel 5567  df-cnv 5568  df-co 5569  df-dm 5570  df-iota 6347  df-fun 6391  df-fv 6397  df-mxidl 31359
This theorem is referenced by:  mxidlidl  31362  mxidlnr  31363  mxidlmax  31364  ssmxidl  31369  zarclssn  31550
  Copyright terms: Public domain W3C validator