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

Theorem hbtlem1 43112
Description: Value of the leading coefficient sequence function. (Contributed by Stefan O'Rear, 31-Mar-2015.)
Hypotheses
Ref Expression
hbtlem.p 𝑃 = (Poly1𝑅)
hbtlem.u 𝑈 = (LIdeal‘𝑃)
hbtlem.s 𝑆 = (ldgIdlSeq‘𝑅)
hbtlem.d 𝐷 = (deg1𝑅)
Assertion
Ref Expression
hbtlem1 ((𝑅𝑉𝐼𝑈𝑋 ∈ ℕ0) → ((𝑆𝐼)‘𝑋) = {𝑗 ∣ ∃𝑘𝐼 ((𝐷𝑘) ≤ 𝑋𝑗 = ((coe1𝑘)‘𝑋))})
Distinct variable groups:   𝑗,𝐼,𝑘   𝑅,𝑗,𝑘   𝑗,𝑋,𝑘
Allowed substitution hints:   𝐷(𝑗,𝑘)   𝑃(𝑗,𝑘)   𝑆(𝑗,𝑘)   𝑈(𝑗,𝑘)   𝑉(𝑗,𝑘)

Proof of Theorem hbtlem1
Dummy variables 𝑖 𝑟 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 hbtlem.s . . . . . 6 𝑆 = (ldgIdlSeq‘𝑅)
2 elex 3499 . . . . . . 7 (𝑅𝑉𝑅 ∈ V)
3 fveq2 6907 . . . . . . . . . . . 12 (𝑟 = 𝑅 → (Poly1𝑟) = (Poly1𝑅))
4 hbtlem.p . . . . . . . . . . . 12 𝑃 = (Poly1𝑅)
53, 4eqtr4di 2793 . . . . . . . . . . 11 (𝑟 = 𝑅 → (Poly1𝑟) = 𝑃)
65fveq2d 6911 . . . . . . . . . 10 (𝑟 = 𝑅 → (LIdeal‘(Poly1𝑟)) = (LIdeal‘𝑃))
7 hbtlem.u . . . . . . . . . 10 𝑈 = (LIdeal‘𝑃)
86, 7eqtr4di 2793 . . . . . . . . 9 (𝑟 = 𝑅 → (LIdeal‘(Poly1𝑟)) = 𝑈)
9 fveq2 6907 . . . . . . . . . . . . . . . 16 (𝑟 = 𝑅 → (deg1𝑟) = (deg1𝑅))
10 hbtlem.d . . . . . . . . . . . . . . . 16 𝐷 = (deg1𝑅)
119, 10eqtr4di 2793 . . . . . . . . . . . . . . 15 (𝑟 = 𝑅 → (deg1𝑟) = 𝐷)
1211fveq1d 6909 . . . . . . . . . . . . . 14 (𝑟 = 𝑅 → ((deg1𝑟)‘𝑘) = (𝐷𝑘))
1312breq1d 5158 . . . . . . . . . . . . 13 (𝑟 = 𝑅 → (((deg1𝑟)‘𝑘) ≤ 𝑥 ↔ (𝐷𝑘) ≤ 𝑥))
1413anbi1d 631 . . . . . . . . . . . 12 (𝑟 = 𝑅 → ((((deg1𝑟)‘𝑘) ≤ 𝑥𝑗 = ((coe1𝑘)‘𝑥)) ↔ ((𝐷𝑘) ≤ 𝑥𝑗 = ((coe1𝑘)‘𝑥))))
1514rexbidv 3177 . . . . . . . . . . 11 (𝑟 = 𝑅 → (∃𝑘𝑖 (((deg1𝑟)‘𝑘) ≤ 𝑥𝑗 = ((coe1𝑘)‘𝑥)) ↔ ∃𝑘𝑖 ((𝐷𝑘) ≤ 𝑥𝑗 = ((coe1𝑘)‘𝑥))))
1615abbidv 2806 . . . . . . . . . 10 (𝑟 = 𝑅 → {𝑗 ∣ ∃𝑘𝑖 (((deg1𝑟)‘𝑘) ≤ 𝑥𝑗 = ((coe1𝑘)‘𝑥))} = {𝑗 ∣ ∃𝑘𝑖 ((𝐷𝑘) ≤ 𝑥𝑗 = ((coe1𝑘)‘𝑥))})
1716mpteq2dv 5250 . . . . . . . . 9 (𝑟 = 𝑅 → (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘𝑖 (((deg1𝑟)‘𝑘) ≤ 𝑥𝑗 = ((coe1𝑘)‘𝑥))}) = (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘𝑖 ((𝐷𝑘) ≤ 𝑥𝑗 = ((coe1𝑘)‘𝑥))}))
188, 17mpteq12dv 5239 . . . . . . . 8 (𝑟 = 𝑅 → (𝑖 ∈ (LIdeal‘(Poly1𝑟)) ↦ (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘𝑖 (((deg1𝑟)‘𝑘) ≤ 𝑥𝑗 = ((coe1𝑘)‘𝑥))})) = (𝑖𝑈 ↦ (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘𝑖 ((𝐷𝑘) ≤ 𝑥𝑗 = ((coe1𝑘)‘𝑥))})))
19 df-ldgis 43111 . . . . . . . 8 ldgIdlSeq = (𝑟 ∈ V ↦ (𝑖 ∈ (LIdeal‘(Poly1𝑟)) ↦ (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘𝑖 (((deg1𝑟)‘𝑘) ≤ 𝑥𝑗 = ((coe1𝑘)‘𝑥))})))
2018, 19, 7mptfvmpt 7248 . . . . . . 7 (𝑅 ∈ V → (ldgIdlSeq‘𝑅) = (𝑖𝑈 ↦ (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘𝑖 ((𝐷𝑘) ≤ 𝑥𝑗 = ((coe1𝑘)‘𝑥))})))
212, 20syl 17 . . . . . 6 (𝑅𝑉 → (ldgIdlSeq‘𝑅) = (𝑖𝑈 ↦ (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘𝑖 ((𝐷𝑘) ≤ 𝑥𝑗 = ((coe1𝑘)‘𝑥))})))
221, 21eqtrid 2787 . . . . 5 (𝑅𝑉𝑆 = (𝑖𝑈 ↦ (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘𝑖 ((𝐷𝑘) ≤ 𝑥𝑗 = ((coe1𝑘)‘𝑥))})))
2322fveq1d 6909 . . . 4 (𝑅𝑉 → (𝑆𝐼) = ((𝑖𝑈 ↦ (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘𝑖 ((𝐷𝑘) ≤ 𝑥𝑗 = ((coe1𝑘)‘𝑥))}))‘𝐼))
2423fveq1d 6909 . . 3 (𝑅𝑉 → ((𝑆𝐼)‘𝑋) = (((𝑖𝑈 ↦ (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘𝑖 ((𝐷𝑘) ≤ 𝑥𝑗 = ((coe1𝑘)‘𝑥))}))‘𝐼)‘𝑋))
25243ad2ant1 1132 . 2 ((𝑅𝑉𝐼𝑈𝑋 ∈ ℕ0) → ((𝑆𝐼)‘𝑋) = (((𝑖𝑈 ↦ (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘𝑖 ((𝐷𝑘) ≤ 𝑥𝑗 = ((coe1𝑘)‘𝑥))}))‘𝐼)‘𝑋))
26 rexeq 3320 . . . . . . 7 (𝑖 = 𝐼 → (∃𝑘𝑖 ((𝐷𝑘) ≤ 𝑥𝑗 = ((coe1𝑘)‘𝑥)) ↔ ∃𝑘𝐼 ((𝐷𝑘) ≤ 𝑥𝑗 = ((coe1𝑘)‘𝑥))))
2726abbidv 2806 . . . . . 6 (𝑖 = 𝐼 → {𝑗 ∣ ∃𝑘𝑖 ((𝐷𝑘) ≤ 𝑥𝑗 = ((coe1𝑘)‘𝑥))} = {𝑗 ∣ ∃𝑘𝐼 ((𝐷𝑘) ≤ 𝑥𝑗 = ((coe1𝑘)‘𝑥))})
2827mpteq2dv 5250 . . . . 5 (𝑖 = 𝐼 → (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘𝑖 ((𝐷𝑘) ≤ 𝑥𝑗 = ((coe1𝑘)‘𝑥))}) = (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘𝐼 ((𝐷𝑘) ≤ 𝑥𝑗 = ((coe1𝑘)‘𝑥))}))
29 eqid 2735 . . . . 5 (𝑖𝑈 ↦ (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘𝑖 ((𝐷𝑘) ≤ 𝑥𝑗 = ((coe1𝑘)‘𝑥))})) = (𝑖𝑈 ↦ (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘𝑖 ((𝐷𝑘) ≤ 𝑥𝑗 = ((coe1𝑘)‘𝑥))}))
30 nn0ex 12530 . . . . . 6 0 ∈ V
3130mptex 7243 . . . . 5 (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘𝐼 ((𝐷𝑘) ≤ 𝑥𝑗 = ((coe1𝑘)‘𝑥))}) ∈ V
3228, 29, 31fvmpt 7016 . . . 4 (𝐼𝑈 → ((𝑖𝑈 ↦ (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘𝑖 ((𝐷𝑘) ≤ 𝑥𝑗 = ((coe1𝑘)‘𝑥))}))‘𝐼) = (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘𝐼 ((𝐷𝑘) ≤ 𝑥𝑗 = ((coe1𝑘)‘𝑥))}))
3332fveq1d 6909 . . 3 (𝐼𝑈 → (((𝑖𝑈 ↦ (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘𝑖 ((𝐷𝑘) ≤ 𝑥𝑗 = ((coe1𝑘)‘𝑥))}))‘𝐼)‘𝑋) = ((𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘𝐼 ((𝐷𝑘) ≤ 𝑥𝑗 = ((coe1𝑘)‘𝑥))})‘𝑋))
34333ad2ant2 1133 . 2 ((𝑅𝑉𝐼𝑈𝑋 ∈ ℕ0) → (((𝑖𝑈 ↦ (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘𝑖 ((𝐷𝑘) ≤ 𝑥𝑗 = ((coe1𝑘)‘𝑥))}))‘𝐼)‘𝑋) = ((𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘𝐼 ((𝐷𝑘) ≤ 𝑥𝑗 = ((coe1𝑘)‘𝑥))})‘𝑋))
35 eqid 2735 . . 3 (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘𝐼 ((𝐷𝑘) ≤ 𝑥𝑗 = ((coe1𝑘)‘𝑥))}) = (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘𝐼 ((𝐷𝑘) ≤ 𝑥𝑗 = ((coe1𝑘)‘𝑥))})
36 breq2 5152 . . . . . 6 (𝑥 = 𝑋 → ((𝐷𝑘) ≤ 𝑥 ↔ (𝐷𝑘) ≤ 𝑋))
37 fveq2 6907 . . . . . . 7 (𝑥 = 𝑋 → ((coe1𝑘)‘𝑥) = ((coe1𝑘)‘𝑋))
3837eqeq2d 2746 . . . . . 6 (𝑥 = 𝑋 → (𝑗 = ((coe1𝑘)‘𝑥) ↔ 𝑗 = ((coe1𝑘)‘𝑋)))
3936, 38anbi12d 632 . . . . 5 (𝑥 = 𝑋 → (((𝐷𝑘) ≤ 𝑥𝑗 = ((coe1𝑘)‘𝑥)) ↔ ((𝐷𝑘) ≤ 𝑋𝑗 = ((coe1𝑘)‘𝑋))))
4039rexbidv 3177 . . . 4 (𝑥 = 𝑋 → (∃𝑘𝐼 ((𝐷𝑘) ≤ 𝑥𝑗 = ((coe1𝑘)‘𝑥)) ↔ ∃𝑘𝐼 ((𝐷𝑘) ≤ 𝑋𝑗 = ((coe1𝑘)‘𝑋))))
4140abbidv 2806 . . 3 (𝑥 = 𝑋 → {𝑗 ∣ ∃𝑘𝐼 ((𝐷𝑘) ≤ 𝑥𝑗 = ((coe1𝑘)‘𝑥))} = {𝑗 ∣ ∃𝑘𝐼 ((𝐷𝑘) ≤ 𝑋𝑗 = ((coe1𝑘)‘𝑋))})
42 simp3 1137 . . 3 ((𝑅𝑉𝐼𝑈𝑋 ∈ ℕ0) → 𝑋 ∈ ℕ0)
43 simpr 484 . . . . . 6 (((𝐷𝑘) ≤ 𝑋𝑗 = ((coe1𝑘)‘𝑋)) → 𝑗 = ((coe1𝑘)‘𝑋))
4443reximi 3082 . . . . 5 (∃𝑘𝐼 ((𝐷𝑘) ≤ 𝑋𝑗 = ((coe1𝑘)‘𝑋)) → ∃𝑘𝐼 𝑗 = ((coe1𝑘)‘𝑋))
4544ss2abi 4077 . . . 4 {𝑗 ∣ ∃𝑘𝐼 ((𝐷𝑘) ≤ 𝑋𝑗 = ((coe1𝑘)‘𝑋))} ⊆ {𝑗 ∣ ∃𝑘𝐼 𝑗 = ((coe1𝑘)‘𝑋)}
46 abrexexg 7984 . . . . 5 (𝐼𝑈 → {𝑗 ∣ ∃𝑘𝐼 𝑗 = ((coe1𝑘)‘𝑋)} ∈ V)
47463ad2ant2 1133 . . . 4 ((𝑅𝑉𝐼𝑈𝑋 ∈ ℕ0) → {𝑗 ∣ ∃𝑘𝐼 𝑗 = ((coe1𝑘)‘𝑋)} ∈ V)
48 ssexg 5329 . . . 4 (({𝑗 ∣ ∃𝑘𝐼 ((𝐷𝑘) ≤ 𝑋𝑗 = ((coe1𝑘)‘𝑋))} ⊆ {𝑗 ∣ ∃𝑘𝐼 𝑗 = ((coe1𝑘)‘𝑋)} ∧ {𝑗 ∣ ∃𝑘𝐼 𝑗 = ((coe1𝑘)‘𝑋)} ∈ V) → {𝑗 ∣ ∃𝑘𝐼 ((𝐷𝑘) ≤ 𝑋𝑗 = ((coe1𝑘)‘𝑋))} ∈ V)
4945, 47, 48sylancr 587 . . 3 ((𝑅𝑉𝐼𝑈𝑋 ∈ ℕ0) → {𝑗 ∣ ∃𝑘𝐼 ((𝐷𝑘) ≤ 𝑋𝑗 = ((coe1𝑘)‘𝑋))} ∈ V)
5035, 41, 42, 49fvmptd3 7039 . 2 ((𝑅𝑉𝐼𝑈𝑋 ∈ ℕ0) → ((𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘𝐼 ((𝐷𝑘) ≤ 𝑥𝑗 = ((coe1𝑘)‘𝑥))})‘𝑋) = {𝑗 ∣ ∃𝑘𝐼 ((𝐷𝑘) ≤ 𝑋𝑗 = ((coe1𝑘)‘𝑋))})
5125, 34, 503eqtrd 2779 1 ((𝑅𝑉𝐼𝑈𝑋 ∈ ℕ0) → ((𝑆𝐼)‘𝑋) = {𝑗 ∣ ∃𝑘𝐼 ((𝐷𝑘) ≤ 𝑋𝑗 = ((coe1𝑘)‘𝑋))})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1086   = wceq 1537  wcel 2106  {cab 2712  wrex 3068  Vcvv 3478  wss 3963   class class class wbr 5148  cmpt 5231  cfv 6563  cle 11294  0cn0 12524  LIdealclidl 21234  Poly1cpl1 22194  coe1cco1 22195  deg1cdg1 26108  ldgIdlSeqcldgis 43110
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 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pr 5438  ax-un 7754  ax-cnex 11209  ax-1cn 11211  ax-addcl 11213
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-pss 3983  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5583  df-eprel 5589  df-po 5597  df-so 5598  df-fr 5641  df-we 5643  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-pred 6323  df-ord 6389  df-on 6390  df-lim 6391  df-suc 6392  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-ov 7434  df-om 7888  df-2nd 8014  df-frecs 8305  df-wrecs 8336  df-recs 8410  df-rdg 8449  df-nn 12265  df-n0 12525  df-ldgis 43111
This theorem is referenced by:  hbtlem2  43113  hbtlem4  43115  hbtlem3  43116  hbtlem5  43117  hbtlem6  43118
  Copyright terms: Public domain W3C validator