![]() |
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 24175 | . . . . 5 ⊢ ((𝑆 ⊆ 𝑇 ∧ 𝑇 ⊆ ℂ) → (Poly‘𝑆) ⊆ (Poly‘𝑇)) | |
2 | ssrexv 3809 | . . . . 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 3106 | . . 3 ⊢ ((𝑆 ⊆ 𝑇 ∧ 𝑇 ⊆ ℂ) → ∀𝑎 ∈ ℂ (∃𝑏 ∈ (Poly‘𝑆)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1) → ∃𝑏 ∈ (Poly‘𝑇)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1))) |
5 | ss2rab 3820 | . . 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 224 | . 2 ⊢ ((𝑆 ⊆ 𝑇 ∧ 𝑇 ⊆ ℂ) → {𝑎 ∈ ℂ ∣ ∃𝑏 ∈ (Poly‘𝑆)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)} ⊆ {𝑎 ∈ ℂ ∣ ∃𝑏 ∈ (Poly‘𝑇)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)}) |
7 | sstr 3753 | . . 3 ⊢ ((𝑆 ⊆ 𝑇 ∧ 𝑇 ⊆ ℂ) → 𝑆 ⊆ ℂ) | |
8 | itgoval 38252 | . . 3 ⊢ (𝑆 ⊆ ℂ → (IntgOver‘𝑆) = {𝑎 ∈ ℂ ∣ ∃𝑏 ∈ (Poly‘𝑆)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)}) | |
9 | 7, 8 | syl 17 | . 2 ⊢ ((𝑆 ⊆ 𝑇 ∧ 𝑇 ⊆ ℂ) → (IntgOver‘𝑆) = {𝑎 ∈ ℂ ∣ ∃𝑏 ∈ (Poly‘𝑆)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)}) |
10 | itgoval 38252 | . . 3 ⊢ (𝑇 ⊆ ℂ → (IntgOver‘𝑇) = {𝑎 ∈ ℂ ∣ ∃𝑏 ∈ (Poly‘𝑇)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)}) | |
11 | 10 | adantl 473 | . 2 ⊢ ((𝑆 ⊆ 𝑇 ∧ 𝑇 ⊆ ℂ) → (IntgOver‘𝑇) = {𝑎 ∈ ℂ ∣ ∃𝑏 ∈ (Poly‘𝑇)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)}) |
12 | 6, 9, 11 | 3sstr4d 3790 | 1 ⊢ ((𝑆 ⊆ 𝑇 ∧ 𝑇 ⊆ ℂ) → (IntgOver‘𝑆) ⊆ (IntgOver‘𝑇)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 = wceq 1632 ∀wral 3051 ∃wrex 3052 {crab 3055 ⊆ wss 3716 ‘cfv 6050 ℂcc 10147 0cc0 10149 1c1 10150 Polycply 24160 coeffccoe 24162 degcdgr 24163 IntgOvercitgo 38248 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1871 ax-4 1886 ax-5 1989 ax-6 2055 ax-7 2091 ax-8 2142 ax-9 2149 ax-10 2169 ax-11 2184 ax-12 2197 ax-13 2392 ax-ext 2741 ax-rep 4924 ax-sep 4934 ax-nul 4942 ax-pow 4993 ax-pr 5056 ax-un 7116 ax-cnex 10205 ax-resscn 10206 ax-1cn 10207 ax-icn 10208 ax-addcl 10209 ax-addrcl 10210 ax-mulcl 10211 ax-mulrcl 10212 ax-i2m1 10217 ax-1ne0 10218 ax-rrecex 10221 ax-cnre 10222 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1073 df-3an 1074 df-tru 1635 df-ex 1854 df-nf 1859 df-sb 2048 df-eu 2612 df-mo 2613 df-clab 2748 df-cleq 2754 df-clel 2757 df-nfc 2892 df-ne 2934 df-ral 3056 df-rex 3057 df-reu 3058 df-rab 3060 df-v 3343 df-sbc 3578 df-csb 3676 df-dif 3719 df-un 3721 df-in 3723 df-ss 3730 df-pss 3732 df-nul 4060 df-if 4232 df-pw 4305 df-sn 4323 df-pr 4325 df-tp 4327 df-op 4329 df-uni 4590 df-iun 4675 df-br 4806 df-opab 4866 df-mpt 4883 df-tr 4906 df-id 5175 df-eprel 5180 df-po 5188 df-so 5189 df-fr 5226 df-we 5228 df-xp 5273 df-rel 5274 df-cnv 5275 df-co 5276 df-dm 5277 df-rn 5278 df-res 5279 df-ima 5280 df-pred 5842 df-ord 5888 df-on 5889 df-lim 5890 df-suc 5891 df-iota 6013 df-fun 6052 df-fn 6053 df-f 6054 df-f1 6055 df-fo 6056 df-f1o 6057 df-fv 6058 df-ov 6818 df-oprab 6819 df-mpt2 6820 df-om 7233 df-1st 7335 df-2nd 7336 df-wrecs 7578 df-recs 7639 df-rdg 7677 df-map 8028 df-nn 11234 df-n0 11506 df-ply 24164 df-itgo 38250 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |