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

Theorem itgoss 44004
Description: An integral element is integral over a subset. (Contributed by Stefan O'Rear, 27-Nov-2014.)
Assertion
Ref Expression
itgoss ((𝑆𝑇𝑇 ⊆ ℂ) → (IntgOver‘𝑆) ⊆ (IntgOver‘𝑇))

Proof of Theorem itgoss
Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 plyss 26424 . . . . 5 ((𝑆𝑇𝑇 ⊆ ℂ) → (Poly‘𝑆) ⊆ (Poly‘𝑇))
2 ssrexv 4001 . . . . 5 ((Poly‘𝑆) ⊆ (Poly‘𝑇) → (∃𝑏 ∈ (Poly‘𝑆)((𝑏𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1) → ∃𝑏 ∈ (Poly‘𝑇)((𝑏𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)))
31, 2syl 18 . . . 4 ((𝑆𝑇𝑇 ⊆ ℂ) → (∃𝑏 ∈ (Poly‘𝑆)((𝑏𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1) → ∃𝑏 ∈ (Poly‘𝑇)((𝑏𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)))
43adantr 486 . . 3 (((𝑆𝑇𝑇 ⊆ ℂ) ∧ 𝑎 ∈ ℂ) → (∃𝑏 ∈ (Poly‘𝑆)((𝑏𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1) → ∃𝑏 ∈ (Poly‘𝑇)((𝑏𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)))
54ss2rabdv 4023 . 2 ((𝑆𝑇𝑇 ⊆ ℂ) → {𝑎 ∈ ℂ ∣ ∃𝑏 ∈ (Poly‘𝑆)((𝑏𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)} ⊆ {𝑎 ∈ ℂ ∣ ∃𝑏 ∈ (Poly‘𝑇)((𝑏𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)})
6 sstr 3939 . . 3 ((𝑆𝑇𝑇 ⊆ ℂ) → 𝑆 ⊆ ℂ)
7 itgoval 44002 . . 3 (𝑆 ⊆ ℂ → (IntgOver‘𝑆) = {𝑎 ∈ ℂ ∣ ∃𝑏 ∈ (Poly‘𝑆)((𝑏𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)})
86, 7syl 18 . 2 ((𝑆𝑇𝑇 ⊆ ℂ) → (IntgOver‘𝑆) = {𝑎 ∈ ℂ ∣ ∃𝑏 ∈ (Poly‘𝑆)((𝑏𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)})
9 itgoval 44002 . . 3 (𝑇 ⊆ ℂ → (IntgOver‘𝑇) = {𝑎 ∈ ℂ ∣ ∃𝑏 ∈ (Poly‘𝑇)((𝑏𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)})
109adantl 487 . 2 ((𝑆𝑇𝑇 ⊆ ℂ) → (IntgOver‘𝑇) = {𝑎 ∈ ℂ ∣ ∃𝑏 ∈ (Poly‘𝑇)((𝑏𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)})
115, 8, 103sstr4d 3986 1 ((𝑆𝑇𝑇 ⊆ ℂ) → (IntgOver‘𝑆) ⊆ (IntgOver‘𝑇))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2145  wrex 3086  {crab 3412  wss 3899  cfv 6533  cc 11122  0cc0 11124  1c1 11125  Polycply 26409  coeffccoe 26411  degcdgr 26412  IntgOvercitgo 43998
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7736  ax-cnex 11180  ax-1cn 11182  ax-addcl 11184
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6299  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7416  df-oprab 7417  df-mpo 7418  df-om 7863  df-1st 7986  df-2nd 7987  df-frecs 8280  df-wrecs 8311  df-recs 8360  df-rdg 8399  df-map 8828  df-nn 12258  df-n0 12529  df-ply 26413  df-itgo 44000
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator