Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > lsscl | Structured version Visualization version GIF version |
Description: Closure property of a subspace. (Contributed by NM, 8-Dec-2013.) (Revised by Mario Carneiro, 8-Jan-2015.) |
Ref | Expression |
---|---|
lsscl.f | ⊢ 𝐹 = (Scalar‘𝑊) |
lsscl.b | ⊢ 𝐵 = (Base‘𝐹) |
lsscl.p | ⊢ + = (+g‘𝑊) |
lsscl.t | ⊢ · = ( ·𝑠 ‘𝑊) |
lsscl.s | ⊢ 𝑆 = (LSubSp‘𝑊) |
Ref | Expression |
---|---|
lsscl | ⊢ ((𝑈 ∈ 𝑆 ∧ (𝑍 ∈ 𝐵 ∧ 𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑈)) → ((𝑍 · 𝑋) + 𝑌) ∈ 𝑈) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | lsscl.f | . . . 4 ⊢ 𝐹 = (Scalar‘𝑊) | |
2 | lsscl.b | . . . 4 ⊢ 𝐵 = (Base‘𝐹) | |
3 | eqid 2821 | . . . 4 ⊢ (Base‘𝑊) = (Base‘𝑊) | |
4 | lsscl.p | . . . 4 ⊢ + = (+g‘𝑊) | |
5 | lsscl.t | . . . 4 ⊢ · = ( ·𝑠 ‘𝑊) | |
6 | lsscl.s | . . . 4 ⊢ 𝑆 = (LSubSp‘𝑊) | |
7 | 1, 2, 3, 4, 5, 6 | islss 19700 | . . 3 ⊢ (𝑈 ∈ 𝑆 ↔ (𝑈 ⊆ (Base‘𝑊) ∧ 𝑈 ≠ ∅ ∧ ∀𝑥 ∈ 𝐵 ∀𝑎 ∈ 𝑈 ∀𝑏 ∈ 𝑈 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑈)) |
8 | 7 | simp3bi 1143 | . 2 ⊢ (𝑈 ∈ 𝑆 → ∀𝑥 ∈ 𝐵 ∀𝑎 ∈ 𝑈 ∀𝑏 ∈ 𝑈 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑈) |
9 | oveq1 7157 | . . . . 5 ⊢ (𝑥 = 𝑍 → (𝑥 · 𝑎) = (𝑍 · 𝑎)) | |
10 | 9 | oveq1d 7165 | . . . 4 ⊢ (𝑥 = 𝑍 → ((𝑥 · 𝑎) + 𝑏) = ((𝑍 · 𝑎) + 𝑏)) |
11 | 10 | eleq1d 2897 | . . 3 ⊢ (𝑥 = 𝑍 → (((𝑥 · 𝑎) + 𝑏) ∈ 𝑈 ↔ ((𝑍 · 𝑎) + 𝑏) ∈ 𝑈)) |
12 | oveq2 7158 | . . . . 5 ⊢ (𝑎 = 𝑋 → (𝑍 · 𝑎) = (𝑍 · 𝑋)) | |
13 | 12 | oveq1d 7165 | . . . 4 ⊢ (𝑎 = 𝑋 → ((𝑍 · 𝑎) + 𝑏) = ((𝑍 · 𝑋) + 𝑏)) |
14 | 13 | eleq1d 2897 | . . 3 ⊢ (𝑎 = 𝑋 → (((𝑍 · 𝑎) + 𝑏) ∈ 𝑈 ↔ ((𝑍 · 𝑋) + 𝑏) ∈ 𝑈)) |
15 | oveq2 7158 | . . . 4 ⊢ (𝑏 = 𝑌 → ((𝑍 · 𝑋) + 𝑏) = ((𝑍 · 𝑋) + 𝑌)) | |
16 | 15 | eleq1d 2897 | . . 3 ⊢ (𝑏 = 𝑌 → (((𝑍 · 𝑋) + 𝑏) ∈ 𝑈 ↔ ((𝑍 · 𝑋) + 𝑌) ∈ 𝑈)) |
17 | 11, 14, 16 | rspc3v 3636 | . 2 ⊢ ((𝑍 ∈ 𝐵 ∧ 𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑈) → (∀𝑥 ∈ 𝐵 ∀𝑎 ∈ 𝑈 ∀𝑏 ∈ 𝑈 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑈 → ((𝑍 · 𝑋) + 𝑌) ∈ 𝑈)) |
18 | 8, 17 | mpan9 509 | 1 ⊢ ((𝑈 ∈ 𝑆 ∧ (𝑍 ∈ 𝐵 ∧ 𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑈)) → ((𝑍 · 𝑋) + 𝑌) ∈ 𝑈) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∧ w3a 1083 = wceq 1533 ∈ wcel 2110 ≠ wne 3016 ∀wral 3138 ⊆ wss 3936 ∅c0 4291 ‘cfv 6350 (class class class)co 7150 Basecbs 16477 +gcplusg 16559 Scalarcsca 16562 ·𝑠 cvsca 16563 LSubSpclss 19697 |
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 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2156 ax-12 2172 ax-ext 2793 ax-sep 5196 ax-nul 5203 ax-pow 5259 ax-pr 5322 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3497 df-sbc 3773 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4833 df-br 5060 df-opab 5122 df-mpt 5140 df-id 5455 df-xp 5556 df-rel 5557 df-cnv 5558 df-co 5559 df-dm 5560 df-iota 6309 df-fun 6352 df-fv 6358 df-ov 7153 df-lss 19698 |
This theorem is referenced by: lssvsubcl 19709 lssvacl 19720 lssvscl 19721 islss3 19725 lssintcl 19730 lspsolvlem 19908 lbsextlem2 19925 isphld 20792 |
Copyright terms: Public domain | W3C validator |