Users' Mathboxes Mathbox for Stefan O'Rear < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  hbtlem3 Structured version   Visualization version   GIF version

Theorem hbtlem3 39605
Description: The leading ideal function is monotone. (Contributed by Stefan O'Rear, 31-Mar-2015.)
Hypotheses
Ref Expression
hbtlem.p 𝑃 = (Poly1𝑅)
hbtlem.u 𝑈 = (LIdeal‘𝑃)
hbtlem.s 𝑆 = (ldgIdlSeq‘𝑅)
hbtlem3.r (𝜑𝑅 ∈ Ring)
hbtlem3.i (𝜑𝐼𝑈)
hbtlem3.j (𝜑𝐽𝑈)
hbtlem3.ij (𝜑𝐼𝐽)
hbtlem3.x (𝜑𝑋 ∈ ℕ0)
Assertion
Ref Expression
hbtlem3 (𝜑 → ((𝑆𝐼)‘𝑋) ⊆ ((𝑆𝐽)‘𝑋))

Proof of Theorem hbtlem3
Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 hbtlem3.ij . . . 4 (𝜑𝐼𝐽)
2 ssrexv 4031 . . . 4 (𝐼𝐽 → (∃𝑏𝐼 ((( deg1𝑅)‘𝑏) ≤ 𝑋𝑎 = ((coe1𝑏)‘𝑋)) → ∃𝑏𝐽 ((( deg1𝑅)‘𝑏) ≤ 𝑋𝑎 = ((coe1𝑏)‘𝑋))))
31, 2syl 17 . . 3 (𝜑 → (∃𝑏𝐼 ((( deg1𝑅)‘𝑏) ≤ 𝑋𝑎 = ((coe1𝑏)‘𝑋)) → ∃𝑏𝐽 ((( deg1𝑅)‘𝑏) ≤ 𝑋𝑎 = ((coe1𝑏)‘𝑋))))
43ss2abdv 4041 . 2 (𝜑 → {𝑎 ∣ ∃𝑏𝐼 ((( deg1𝑅)‘𝑏) ≤ 𝑋𝑎 = ((coe1𝑏)‘𝑋))} ⊆ {𝑎 ∣ ∃𝑏𝐽 ((( deg1𝑅)‘𝑏) ≤ 𝑋𝑎 = ((coe1𝑏)‘𝑋))})
5 hbtlem3.r . . 3 (𝜑𝑅 ∈ Ring)
6 hbtlem3.i . . 3 (𝜑𝐼𝑈)
7 hbtlem3.x . . 3 (𝜑𝑋 ∈ ℕ0)
8 hbtlem.p . . . 4 𝑃 = (Poly1𝑅)
9 hbtlem.u . . . 4 𝑈 = (LIdeal‘𝑃)
10 hbtlem.s . . . 4 𝑆 = (ldgIdlSeq‘𝑅)
11 eqid 2818 . . . 4 ( deg1𝑅) = ( deg1𝑅)
128, 9, 10, 11hbtlem1 39601 . . 3 ((𝑅 ∈ Ring ∧ 𝐼𝑈𝑋 ∈ ℕ0) → ((𝑆𝐼)‘𝑋) = {𝑎 ∣ ∃𝑏𝐼 ((( deg1𝑅)‘𝑏) ≤ 𝑋𝑎 = ((coe1𝑏)‘𝑋))})
135, 6, 7, 12syl3anc 1363 . 2 (𝜑 → ((𝑆𝐼)‘𝑋) = {𝑎 ∣ ∃𝑏𝐼 ((( deg1𝑅)‘𝑏) ≤ 𝑋𝑎 = ((coe1𝑏)‘𝑋))})
14 hbtlem3.j . . 3 (𝜑𝐽𝑈)
158, 9, 10, 11hbtlem1 39601 . . 3 ((𝑅 ∈ Ring ∧ 𝐽𝑈𝑋 ∈ ℕ0) → ((𝑆𝐽)‘𝑋) = {𝑎 ∣ ∃𝑏𝐽 ((( deg1𝑅)‘𝑏) ≤ 𝑋𝑎 = ((coe1𝑏)‘𝑋))})
165, 14, 7, 15syl3anc 1363 . 2 (𝜑 → ((𝑆𝐽)‘𝑋) = {𝑎 ∣ ∃𝑏𝐽 ((( deg1𝑅)‘𝑏) ≤ 𝑋𝑎 = ((coe1𝑏)‘𝑋))})
174, 13, 163sstr4d 4011 1 (𝜑 → ((𝑆𝐼)‘𝑋) ⊆ ((𝑆𝐽)‘𝑋))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1528  wcel 2105  {cab 2796  wrex 3136  wss 3933   class class class wbr 5057  cfv 6348  cle 10664  0cn0 11885  Ringcrg 19226  LIdealclidl 19871  Poly1cpl1 20273  coe1cco1 20274   deg1 cdg1 24575  ldgIdlSeqcldgis 39599
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1787  ax-4 1801  ax-5 1902  ax-6 1961  ax-7 2006  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2151  ax-12 2167  ax-ext 2790  ax-rep 5181  ax-sep 5194  ax-nul 5201  ax-pow 5257  ax-pr 5320  ax-un 7450  ax-cnex 10581  ax-1cn 10583  ax-addcl 10585
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 842  df-3or 1080  df-3an 1081  df-tru 1531  df-ex 1772  df-nf 1776  df-sb 2061  df-mo 2615  df-eu 2647  df-clab 2797  df-cleq 2811  df-clel 2890  df-nfc 2960  df-ne 3014  df-ral 3140  df-rex 3141  df-reu 3142  df-rab 3144  df-v 3494  df-sbc 3770  df-csb 3881  df-dif 3936  df-un 3938  df-in 3940  df-ss 3949  df-pss 3951  df-nul 4289  df-if 4464  df-pw 4537  df-sn 4558  df-pr 4560  df-tp 4562  df-op 4564  df-uni 4831  df-iun 4912  df-br 5058  df-opab 5120  df-mpt 5138  df-tr 5164  df-id 5453  df-eprel 5458  df-po 5467  df-so 5468  df-fr 5507  df-we 5509  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-rn 5559  df-res 5560  df-ima 5561  df-pred 6141  df-ord 6187  df-on 6188  df-lim 6189  df-suc 6190  df-iota 6307  df-fun 6350  df-fn 6351  df-f 6352  df-f1 6353  df-fo 6354  df-f1o 6355  df-fv 6356  df-ov 7148  df-om 7570  df-wrecs 7936  df-recs 7997  df-rdg 8035  df-nn 11627  df-n0 11886  df-ldgis 39600
This theorem is referenced by:  hbt  39608
  Copyright terms: Public domain W3C validator