Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > islinds | Structured version Visualization version GIF version |
Description: Property of an independent set of vectors in terms of an independent family. (Contributed by Stefan O'Rear, 24-Feb-2015.) |
Ref | Expression |
---|---|
islinds.b | ⊢ 𝐵 = (Base‘𝑊) |
Ref | Expression |
---|---|
islinds | ⊢ (𝑊 ∈ 𝑉 → (𝑋 ∈ (LIndS‘𝑊) ↔ (𝑋 ⊆ 𝐵 ∧ ( I ↾ 𝑋) LIndF 𝑊))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elex 3440 | . . . . 5 ⊢ (𝑊 ∈ 𝑉 → 𝑊 ∈ V) | |
2 | fveq2 6756 | . . . . . . . 8 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊)) | |
3 | 2 | pweqd 4549 | . . . . . . 7 ⊢ (𝑤 = 𝑊 → 𝒫 (Base‘𝑤) = 𝒫 (Base‘𝑊)) |
4 | breq2 5074 | . . . . . . 7 ⊢ (𝑤 = 𝑊 → (( I ↾ 𝑠) LIndF 𝑤 ↔ ( I ↾ 𝑠) LIndF 𝑊)) | |
5 | 3, 4 | rabeqbidv 3410 | . . . . . 6 ⊢ (𝑤 = 𝑊 → {𝑠 ∈ 𝒫 (Base‘𝑤) ∣ ( I ↾ 𝑠) LIndF 𝑤} = {𝑠 ∈ 𝒫 (Base‘𝑊) ∣ ( I ↾ 𝑠) LIndF 𝑊}) |
6 | df-linds 20924 | . . . . . 6 ⊢ LIndS = (𝑤 ∈ V ↦ {𝑠 ∈ 𝒫 (Base‘𝑤) ∣ ( I ↾ 𝑠) LIndF 𝑤}) | |
7 | fvex 6769 | . . . . . . . 8 ⊢ (Base‘𝑊) ∈ V | |
8 | 7 | pwex 5298 | . . . . . . 7 ⊢ 𝒫 (Base‘𝑊) ∈ V |
9 | 8 | rabex 5251 | . . . . . 6 ⊢ {𝑠 ∈ 𝒫 (Base‘𝑊) ∣ ( I ↾ 𝑠) LIndF 𝑊} ∈ V |
10 | 5, 6, 9 | fvmpt 6857 | . . . . 5 ⊢ (𝑊 ∈ V → (LIndS‘𝑊) = {𝑠 ∈ 𝒫 (Base‘𝑊) ∣ ( I ↾ 𝑠) LIndF 𝑊}) |
11 | 1, 10 | syl 17 | . . . 4 ⊢ (𝑊 ∈ 𝑉 → (LIndS‘𝑊) = {𝑠 ∈ 𝒫 (Base‘𝑊) ∣ ( I ↾ 𝑠) LIndF 𝑊}) |
12 | 11 | eleq2d 2824 | . . 3 ⊢ (𝑊 ∈ 𝑉 → (𝑋 ∈ (LIndS‘𝑊) ↔ 𝑋 ∈ {𝑠 ∈ 𝒫 (Base‘𝑊) ∣ ( I ↾ 𝑠) LIndF 𝑊})) |
13 | reseq2 5875 | . . . . 5 ⊢ (𝑠 = 𝑋 → ( I ↾ 𝑠) = ( I ↾ 𝑋)) | |
14 | 13 | breq1d 5080 | . . . 4 ⊢ (𝑠 = 𝑋 → (( I ↾ 𝑠) LIndF 𝑊 ↔ ( I ↾ 𝑋) LIndF 𝑊)) |
15 | 14 | elrab 3617 | . . 3 ⊢ (𝑋 ∈ {𝑠 ∈ 𝒫 (Base‘𝑊) ∣ ( I ↾ 𝑠) LIndF 𝑊} ↔ (𝑋 ∈ 𝒫 (Base‘𝑊) ∧ ( I ↾ 𝑋) LIndF 𝑊)) |
16 | 12, 15 | bitrdi 286 | . 2 ⊢ (𝑊 ∈ 𝑉 → (𝑋 ∈ (LIndS‘𝑊) ↔ (𝑋 ∈ 𝒫 (Base‘𝑊) ∧ ( I ↾ 𝑋) LIndF 𝑊))) |
17 | 7 | elpw2 5264 | . . . 4 ⊢ (𝑋 ∈ 𝒫 (Base‘𝑊) ↔ 𝑋 ⊆ (Base‘𝑊)) |
18 | islinds.b | . . . . 5 ⊢ 𝐵 = (Base‘𝑊) | |
19 | 18 | sseq2i 3946 | . . . 4 ⊢ (𝑋 ⊆ 𝐵 ↔ 𝑋 ⊆ (Base‘𝑊)) |
20 | 17, 19 | bitr4i 277 | . . 3 ⊢ (𝑋 ∈ 𝒫 (Base‘𝑊) ↔ 𝑋 ⊆ 𝐵) |
21 | 20 | anbi1i 623 | . 2 ⊢ ((𝑋 ∈ 𝒫 (Base‘𝑊) ∧ ( I ↾ 𝑋) LIndF 𝑊) ↔ (𝑋 ⊆ 𝐵 ∧ ( I ↾ 𝑋) LIndF 𝑊)) |
22 | 16, 21 | bitrdi 286 | 1 ⊢ (𝑊 ∈ 𝑉 → (𝑋 ∈ (LIndS‘𝑊) ↔ (𝑋 ⊆ 𝐵 ∧ ( I ↾ 𝑋) LIndF 𝑊))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1539 ∈ wcel 2108 {crab 3067 Vcvv 3422 ⊆ wss 3883 𝒫 cpw 4530 class class class wbr 5070 I cid 5479 ↾ cres 5582 ‘cfv 6418 Basecbs 16840 LIndF clindf 20921 LIndSclinds 20922 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-br 5071 df-opab 5133 df-mpt 5154 df-id 5480 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-res 5592 df-iota 6376 df-fun 6420 df-fv 6426 df-linds 20924 |
This theorem is referenced by: linds1 20927 linds2 20928 islinds2 20930 lindsss 20941 lindsmm 20945 lsslinds 20948 islinds5 31465 lindspropd 31479 |
Copyright terms: Public domain | W3C validator |