![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > islinds3 | Structured version Visualization version GIF version |
Description: A subset is linearly independent iff it is a basis of its span. (Contributed by Stefan O'Rear, 25-Feb-2015.) |
Ref | Expression |
---|---|
islinds3.b | ⊢ 𝐵 = (Base‘𝑊) |
islinds3.k | ⊢ 𝐾 = (LSpan‘𝑊) |
islinds3.x | ⊢ 𝑋 = (𝑊 ↾s (𝐾‘𝑌)) |
islinds3.j | ⊢ 𝐽 = (LBasis‘𝑋) |
Ref | Expression |
---|---|
islinds3 | ⊢ (𝑊 ∈ LMod → (𝑌 ∈ (LIndS‘𝑊) ↔ 𝑌 ∈ 𝐽)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | islinds3.b | . . . . 5 ⊢ 𝐵 = (Base‘𝑊) | |
2 | 1 | linds1 20322 | . . . 4 ⊢ (𝑌 ∈ (LIndS‘𝑊) → 𝑌 ⊆ 𝐵) |
3 | 2 | a1i 11 | . . 3 ⊢ (𝑊 ∈ LMod → (𝑌 ∈ (LIndS‘𝑊) → 𝑌 ⊆ 𝐵)) |
4 | eqid 2748 | . . . . . . 7 ⊢ (Base‘𝑋) = (Base‘𝑋) | |
5 | 4 | linds1 20322 | . . . . . 6 ⊢ (𝑌 ∈ (LIndS‘𝑋) → 𝑌 ⊆ (Base‘𝑋)) |
6 | islinds3.x | . . . . . . 7 ⊢ 𝑋 = (𝑊 ↾s (𝐾‘𝑌)) | |
7 | 6, 1 | ressbasss 16105 | . . . . . 6 ⊢ (Base‘𝑋) ⊆ 𝐵 |
8 | 5, 7 | syl6ss 3744 | . . . . 5 ⊢ (𝑌 ∈ (LIndS‘𝑋) → 𝑌 ⊆ 𝐵) |
9 | 8 | adantr 472 | . . . 4 ⊢ ((𝑌 ∈ (LIndS‘𝑋) ∧ ((LSpan‘𝑋)‘𝑌) = (Base‘𝑋)) → 𝑌 ⊆ 𝐵) |
10 | 9 | a1i 11 | . . 3 ⊢ (𝑊 ∈ LMod → ((𝑌 ∈ (LIndS‘𝑋) ∧ ((LSpan‘𝑋)‘𝑌) = (Base‘𝑋)) → 𝑌 ⊆ 𝐵)) |
11 | simpl 474 | . . . . . . . 8 ⊢ ((𝑊 ∈ LMod ∧ 𝑌 ⊆ 𝐵) → 𝑊 ∈ LMod) | |
12 | eqid 2748 | . . . . . . . . 9 ⊢ (LSubSp‘𝑊) = (LSubSp‘𝑊) | |
13 | islinds3.k | . . . . . . . . 9 ⊢ 𝐾 = (LSpan‘𝑊) | |
14 | 1, 12, 13 | lspcl 19149 | . . . . . . . 8 ⊢ ((𝑊 ∈ LMod ∧ 𝑌 ⊆ 𝐵) → (𝐾‘𝑌) ∈ (LSubSp‘𝑊)) |
15 | 1, 13 | lspssid 19158 | . . . . . . . 8 ⊢ ((𝑊 ∈ LMod ∧ 𝑌 ⊆ 𝐵) → 𝑌 ⊆ (𝐾‘𝑌)) |
16 | eqid 2748 | . . . . . . . . 9 ⊢ (LSpan‘𝑋) = (LSpan‘𝑋) | |
17 | 6, 13, 16, 12 | lsslsp 19188 | . . . . . . . 8 ⊢ ((𝑊 ∈ LMod ∧ (𝐾‘𝑌) ∈ (LSubSp‘𝑊) ∧ 𝑌 ⊆ (𝐾‘𝑌)) → (𝐾‘𝑌) = ((LSpan‘𝑋)‘𝑌)) |
18 | 11, 14, 15, 17 | syl3anc 1463 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝑌 ⊆ 𝐵) → (𝐾‘𝑌) = ((LSpan‘𝑋)‘𝑌)) |
19 | 1, 13 | lspssv 19156 | . . . . . . . 8 ⊢ ((𝑊 ∈ LMod ∧ 𝑌 ⊆ 𝐵) → (𝐾‘𝑌) ⊆ 𝐵) |
20 | 6, 1 | ressbas2 16104 | . . . . . . . 8 ⊢ ((𝐾‘𝑌) ⊆ 𝐵 → (𝐾‘𝑌) = (Base‘𝑋)) |
21 | 19, 20 | syl 17 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝑌 ⊆ 𝐵) → (𝐾‘𝑌) = (Base‘𝑋)) |
22 | 18, 21 | eqtr3d 2784 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑌 ⊆ 𝐵) → ((LSpan‘𝑋)‘𝑌) = (Base‘𝑋)) |
23 | 22 | biantrud 529 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑌 ⊆ 𝐵) → (𝑌 ∈ (LIndS‘𝑊) ↔ (𝑌 ∈ (LIndS‘𝑊) ∧ ((LSpan‘𝑋)‘𝑌) = (Base‘𝑋)))) |
24 | 12, 6 | lsslinds 20343 | . . . . . . . 8 ⊢ ((𝑊 ∈ LMod ∧ (𝐾‘𝑌) ∈ (LSubSp‘𝑊) ∧ 𝑌 ⊆ (𝐾‘𝑌)) → (𝑌 ∈ (LIndS‘𝑋) ↔ 𝑌 ∈ (LIndS‘𝑊))) |
25 | 11, 14, 15, 24 | syl3anc 1463 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝑌 ⊆ 𝐵) → (𝑌 ∈ (LIndS‘𝑋) ↔ 𝑌 ∈ (LIndS‘𝑊))) |
26 | 25 | bicomd 213 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑌 ⊆ 𝐵) → (𝑌 ∈ (LIndS‘𝑊) ↔ 𝑌 ∈ (LIndS‘𝑋))) |
27 | 26 | anbi1d 743 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑌 ⊆ 𝐵) → ((𝑌 ∈ (LIndS‘𝑊) ∧ ((LSpan‘𝑋)‘𝑌) = (Base‘𝑋)) ↔ (𝑌 ∈ (LIndS‘𝑋) ∧ ((LSpan‘𝑋)‘𝑌) = (Base‘𝑋)))) |
28 | 23, 27 | bitrd 268 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑌 ⊆ 𝐵) → (𝑌 ∈ (LIndS‘𝑊) ↔ (𝑌 ∈ (LIndS‘𝑋) ∧ ((LSpan‘𝑋)‘𝑌) = (Base‘𝑋)))) |
29 | 28 | ex 449 | . . 3 ⊢ (𝑊 ∈ LMod → (𝑌 ⊆ 𝐵 → (𝑌 ∈ (LIndS‘𝑊) ↔ (𝑌 ∈ (LIndS‘𝑋) ∧ ((LSpan‘𝑋)‘𝑌) = (Base‘𝑋))))) |
30 | 3, 10, 29 | pm5.21ndd 368 | . 2 ⊢ (𝑊 ∈ LMod → (𝑌 ∈ (LIndS‘𝑊) ↔ (𝑌 ∈ (LIndS‘𝑋) ∧ ((LSpan‘𝑋)‘𝑌) = (Base‘𝑋)))) |
31 | islinds3.j | . . 3 ⊢ 𝐽 = (LBasis‘𝑋) | |
32 | 4, 31, 16 | islbs4 20344 | . 2 ⊢ (𝑌 ∈ 𝐽 ↔ (𝑌 ∈ (LIndS‘𝑋) ∧ ((LSpan‘𝑋)‘𝑌) = (Base‘𝑋))) |
33 | 30, 32 | syl6bbr 278 | 1 ⊢ (𝑊 ∈ LMod → (𝑌 ∈ (LIndS‘𝑊) ↔ 𝑌 ∈ 𝐽)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 ∧ wa 383 = wceq 1620 ∈ wcel 2127 ⊆ wss 3703 ‘cfv 6037 (class class class)co 6801 Basecbs 16030 ↾s cress 16031 LModclmod 19036 LSubSpclss 19105 LSpanclspn 19144 LBasisclbs 19247 LIndSclinds 20317 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1859 ax-4 1874 ax-5 1976 ax-6 2042 ax-7 2078 ax-8 2129 ax-9 2136 ax-10 2156 ax-11 2171 ax-12 2184 ax-13 2379 ax-ext 2728 ax-rep 4911 ax-sep 4921 ax-nul 4929 ax-pow 4980 ax-pr 5043 ax-un 7102 ax-cnex 10155 ax-resscn 10156 ax-1cn 10157 ax-icn 10158 ax-addcl 10159 ax-addrcl 10160 ax-mulcl 10161 ax-mulrcl 10162 ax-mulcom 10163 ax-addass 10164 ax-mulass 10165 ax-distr 10166 ax-i2m1 10167 ax-1ne0 10168 ax-1rid 10169 ax-rnegex 10170 ax-rrecex 10171 ax-cnre 10172 ax-pre-lttri 10173 ax-pre-lttrn 10174 ax-pre-ltadd 10175 ax-pre-mulgt0 10176 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1073 df-3an 1074 df-tru 1623 df-ex 1842 df-nf 1847 df-sb 2035 df-eu 2599 df-mo 2600 df-clab 2735 df-cleq 2741 df-clel 2744 df-nfc 2879 df-ne 2921 df-nel 3024 df-ral 3043 df-rex 3044 df-reu 3045 df-rmo 3046 df-rab 3047 df-v 3330 df-sbc 3565 df-csb 3663 df-dif 3706 df-un 3708 df-in 3710 df-ss 3717 df-pss 3719 df-nul 4047 df-if 4219 df-pw 4292 df-sn 4310 df-pr 4312 df-tp 4314 df-op 4316 df-uni 4577 df-int 4616 df-iun 4662 df-br 4793 df-opab 4853 df-mpt 4870 df-tr 4893 df-id 5162 df-eprel 5167 df-po 5175 df-so 5176 df-fr 5213 df-we 5215 df-xp 5260 df-rel 5261 df-cnv 5262 df-co 5263 df-dm 5264 df-rn 5265 df-res 5266 df-ima 5267 df-pred 5829 df-ord 5875 df-on 5876 df-lim 5877 df-suc 5878 df-iota 6000 df-fun 6039 df-fn 6040 df-f 6041 df-f1 6042 df-fo 6043 df-f1o 6044 df-fv 6045 df-riota 6762 df-ov 6804 df-oprab 6805 df-mpt2 6806 df-om 7219 df-1st 7321 df-2nd 7322 df-wrecs 7564 df-recs 7625 df-rdg 7663 df-er 7899 df-en 8110 df-dom 8111 df-sdom 8112 df-pnf 10239 df-mnf 10240 df-xr 10241 df-ltxr 10242 df-le 10243 df-sub 10431 df-neg 10432 df-nn 11184 df-2 11242 df-3 11243 df-4 11244 df-5 11245 df-6 11246 df-ndx 16033 df-slot 16034 df-base 16036 df-sets 16037 df-ress 16038 df-plusg 16127 df-sca 16130 df-vsca 16131 df-0g 16275 df-mgm 17414 df-sgrp 17456 df-mnd 17467 df-grp 17597 df-minusg 17598 df-sbg 17599 df-subg 17763 df-mgp 18661 df-ur 18673 df-ring 18720 df-lmod 19038 df-lss 19106 df-lsp 19145 df-lbs 19248 df-lindf 20318 df-linds 20319 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |