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 43923
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 26385 . . . . 5 ((𝑆𝑇𝑇 ⊆ ℂ) → (Poly‘𝑆) ⊆ (Poly‘𝑇))
2 ssrexv 4008 . . . . 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 4030 . 2 ((𝑆𝑇𝑇 ⊆ ℂ) → {𝑎 ∈ ℂ ∣ ∃𝑏 ∈ (Poly‘𝑆)((𝑏𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)} ⊆ {𝑎 ∈ ℂ ∣ ∃𝑏 ∈ (Poly‘𝑇)((𝑏𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)})
6 sstr 3946 . . 3 ((𝑆𝑇𝑇 ⊆ ℂ) → 𝑆 ⊆ ℂ)
7 itgoval 43921 . . 3 (𝑆 ⊆ ℂ → (IntgOver‘𝑆) = {𝑎 ∈ ℂ ∣ ∃𝑏 ∈ (Poly‘𝑆)((𝑏𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)})
86, 7syl 18 . 2 ((𝑆𝑇𝑇 ⊆ ℂ) → (IntgOver‘𝑆) = {𝑎 ∈ ℂ ∣ ∃𝑏 ∈ (Poly‘𝑆)((𝑏𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)})
9 itgoval 43921 . . 3 (𝑇 ⊆ ℂ → (IntgOver‘𝑇) = {𝑎 ∈ ℂ ∣ ∃𝑏 ∈ (Poly‘𝑇)((𝑏𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)})
109adantl 487 . 2 ((𝑆𝑇𝑇 ⊆ ℂ) → (IntgOver‘𝑇) = {𝑎 ∈ ℂ ∣ ∃𝑏 ∈ (Poly‘𝑇)((𝑏𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)})
115, 8, 103sstr4d 3993 1 ((𝑆𝑇𝑇 ⊆ ℂ) → (IntgOver‘𝑆) ⊆ (IntgOver‘𝑇))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2146  wrex 3091  {crab 3418  wss 3906  cfv 6540  cc 11109  0cc0 11111  1c1 11112  Polycply 26370  coeffccoe 26372  degcdgr 26373  IntgOvercitgo 43917
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7738  ax-cnex 11167  ax-1cn 11169  ax-addcl 11171
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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7419  df-oprab 7420  df-mpo 7421  df-om 7865  df-1st 7988  df-2nd 7989  df-frecs 8280  df-wrecs 8311  df-recs 8360  df-rdg 8399  df-map 8828  df-nn 12245  df-n0 12516  df-ply 26374  df-itgo 43919
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator