MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  prmidlssidl Structured version   Visualization version   GIF version

Theorem prmidlssidl 21659
Description: Prime ideals as a subset of ideals. (Contributed by Thierry Arnoux, 2-Jun-2024.)
Assertion
Ref Expression
prmidlssidl (𝑅 ∈ Ring → (PrmIdeal‘𝑅) ⊆ (LIdeal‘𝑅))

Proof of Theorem prmidlssidl
Dummy variable 𝑖 is distinct from all other variables.
StepHypRef Expression
1 prmidlidl 21658 . . 3 ((𝑅 ∈ Ring ∧ 𝑖 ∈ (PrmIdeal‘𝑅)) → 𝑖 ∈ (LIdeal‘𝑅))
21ex 418 . 2 (𝑅 ∈ Ring → (𝑖 ∈ (PrmIdeal‘𝑅) → 𝑖 ∈ (LIdeal‘𝑅)))
32ssrdv 3919 1 (𝑅 ∈ Ring → (PrmIdeal‘𝑅) ⊆ (LIdeal‘𝑅))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∈ wcel 2147   ⊆ wss 3900  ‘cfv 6561  Ringcrg 20492  LIdealclidl 21517  PrmIdealcprmidl 21649
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 5253  ax-nul 5264  ax-pr 5396
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 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-iota 6515  df-fun 6563  df-fv 6569  df-ov 7449  df-prmidl 21650
This theorem is used by:  0ringprmidl  21666  rspecbas  34580  rspectopn  34582
  Copyright terms: Public domain W3C validator