Mathbox for Stefan O'Rear |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > itgoss | Structured version Visualization version GIF version |
Description: An integral element is integral over a subset. (Contributed by Stefan O'Rear, 27-Nov-2014.) |
Ref | Expression |
---|---|
itgoss | ⊢ ((𝑆 ⊆ 𝑇 ∧ 𝑇 ⊆ ℂ) → (IntgOver‘𝑆) ⊆ (IntgOver‘𝑇)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | plyss 25360 | . . . . 5 ⊢ ((𝑆 ⊆ 𝑇 ∧ 𝑇 ⊆ ℂ) → (Poly‘𝑆) ⊆ (Poly‘𝑇)) | |
2 | ssrexv 3988 | . . . . 5 ⊢ ((Poly‘𝑆) ⊆ (Poly‘𝑇) → (∃𝑏 ∈ (Poly‘𝑆)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1) → ∃𝑏 ∈ (Poly‘𝑇)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1))) | |
3 | 1, 2 | syl 17 | . . . 4 ⊢ ((𝑆 ⊆ 𝑇 ∧ 𝑇 ⊆ ℂ) → (∃𝑏 ∈ (Poly‘𝑆)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1) → ∃𝑏 ∈ (Poly‘𝑇)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1))) |
4 | 3 | ralrimivw 3104 | . . 3 ⊢ ((𝑆 ⊆ 𝑇 ∧ 𝑇 ⊆ ℂ) → ∀𝑎 ∈ ℂ (∃𝑏 ∈ (Poly‘𝑆)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1) → ∃𝑏 ∈ (Poly‘𝑇)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1))) |
5 | ss2rab 4004 | . . 3 ⊢ ({𝑎 ∈ ℂ ∣ ∃𝑏 ∈ (Poly‘𝑆)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)} ⊆ {𝑎 ∈ ℂ ∣ ∃𝑏 ∈ (Poly‘𝑇)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)} ↔ ∀𝑎 ∈ ℂ (∃𝑏 ∈ (Poly‘𝑆)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1) → ∃𝑏 ∈ (Poly‘𝑇)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1))) | |
6 | 4, 5 | sylibr 233 | . 2 ⊢ ((𝑆 ⊆ 𝑇 ∧ 𝑇 ⊆ ℂ) → {𝑎 ∈ ℂ ∣ ∃𝑏 ∈ (Poly‘𝑆)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)} ⊆ {𝑎 ∈ ℂ ∣ ∃𝑏 ∈ (Poly‘𝑇)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)}) |
7 | sstr 3929 | . . 3 ⊢ ((𝑆 ⊆ 𝑇 ∧ 𝑇 ⊆ ℂ) → 𝑆 ⊆ ℂ) | |
8 | itgoval 40986 | . . 3 ⊢ (𝑆 ⊆ ℂ → (IntgOver‘𝑆) = {𝑎 ∈ ℂ ∣ ∃𝑏 ∈ (Poly‘𝑆)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)}) | |
9 | 7, 8 | syl 17 | . 2 ⊢ ((𝑆 ⊆ 𝑇 ∧ 𝑇 ⊆ ℂ) → (IntgOver‘𝑆) = {𝑎 ∈ ℂ ∣ ∃𝑏 ∈ (Poly‘𝑆)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)}) |
10 | itgoval 40986 | . . 3 ⊢ (𝑇 ⊆ ℂ → (IntgOver‘𝑇) = {𝑎 ∈ ℂ ∣ ∃𝑏 ∈ (Poly‘𝑇)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)}) | |
11 | 10 | adantl 482 | . 2 ⊢ ((𝑆 ⊆ 𝑇 ∧ 𝑇 ⊆ ℂ) → (IntgOver‘𝑇) = {𝑎 ∈ ℂ ∣ ∃𝑏 ∈ (Poly‘𝑇)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)}) |
12 | 6, 9, 11 | 3sstr4d 3968 | 1 ⊢ ((𝑆 ⊆ 𝑇 ∧ 𝑇 ⊆ ℂ) → (IntgOver‘𝑆) ⊆ (IntgOver‘𝑇)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1539 ∀wral 3064 ∃wrex 3065 {crab 3068 ⊆ wss 3887 ‘cfv 6433 ℂcc 10869 0cc0 10871 1c1 10872 Polycply 25345 coeffccoe 25347 degcdgr 25348 IntgOvercitgo 40982 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-cnex 10927 ax-1cn 10929 ax-addcl 10931 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-ov 7278 df-oprab 7279 df-mpo 7280 df-om 7713 df-1st 7831 df-2nd 7832 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-map 8617 df-nn 11974 df-n0 12234 df-ply 25349 df-itgo 40984 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |