| 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 3458 | . . . . 5 ⊢ (𝑊 ∈ 𝑉 → 𝑊 ∈ V) | |
| 2 | fveq2 6828 | . . . . . . . 8 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊)) | |
| 3 | 2 | pweqd 4566 | . . . . . . 7 ⊢ (𝑤 = 𝑊 → 𝒫 (Base‘𝑤) = 𝒫 (Base‘𝑊)) |
| 4 | breq2 5097 | . . . . . . 7 ⊢ (𝑤 = 𝑊 → (( I ↾ 𝑠) LIndF 𝑤 ↔ ( I ↾ 𝑠) LIndF 𝑊)) | |
| 5 | 3, 4 | rabeqbidv 3414 | . . . . . 6 ⊢ (𝑤 = 𝑊 → {𝑠 ∈ 𝒫 (Base‘𝑤) ∣ ( I ↾ 𝑠) LIndF 𝑤} = {𝑠 ∈ 𝒫 (Base‘𝑊) ∣ ( I ↾ 𝑠) LIndF 𝑊}) |
| 6 | df-linds 21746 | . . . . . 6 ⊢ LIndS = (𝑤 ∈ V ↦ {𝑠 ∈ 𝒫 (Base‘𝑤) ∣ ( I ↾ 𝑠) LIndF 𝑤}) | |
| 7 | fvex 6841 | . . . . . . . 8 ⊢ (Base‘𝑊) ∈ V | |
| 8 | 7 | pwex 5320 | . . . . . . 7 ⊢ 𝒫 (Base‘𝑊) ∈ V |
| 9 | 8 | rabex 5279 | . . . . . 6 ⊢ {𝑠 ∈ 𝒫 (Base‘𝑊) ∣ ( I ↾ 𝑠) LIndF 𝑊} ∈ V |
| 10 | 5, 6, 9 | fvmpt 6935 | . . . . 5 ⊢ (𝑊 ∈ V → (LIndS‘𝑊) = {𝑠 ∈ 𝒫 (Base‘𝑊) ∣ ( I ↾ 𝑠) LIndF 𝑊}) |
| 11 | 1, 10 | syl 17 | . . . 4 ⊢ (𝑊 ∈ 𝑉 → (LIndS‘𝑊) = {𝑠 ∈ 𝒫 (Base‘𝑊) ∣ ( I ↾ 𝑠) LIndF 𝑊}) |
| 12 | 11 | eleq2d 2819 | . . 3 ⊢ (𝑊 ∈ 𝑉 → (𝑋 ∈ (LIndS‘𝑊) ↔ 𝑋 ∈ {𝑠 ∈ 𝒫 (Base‘𝑊) ∣ ( I ↾ 𝑠) LIndF 𝑊})) |
| 13 | reseq2 5927 | . . . . 5 ⊢ (𝑠 = 𝑋 → ( I ↾ 𝑠) = ( I ↾ 𝑋)) | |
| 14 | 13 | breq1d 5103 | . . . 4 ⊢ (𝑠 = 𝑋 → (( I ↾ 𝑠) LIndF 𝑊 ↔ ( I ↾ 𝑋) LIndF 𝑊)) |
| 15 | 14 | elrab 3643 | . . 3 ⊢ (𝑋 ∈ {𝑠 ∈ 𝒫 (Base‘𝑊) ∣ ( I ↾ 𝑠) LIndF 𝑊} ↔ (𝑋 ∈ 𝒫 (Base‘𝑊) ∧ ( I ↾ 𝑋) LIndF 𝑊)) |
| 16 | 12, 15 | bitrdi 287 | . 2 ⊢ (𝑊 ∈ 𝑉 → (𝑋 ∈ (LIndS‘𝑊) ↔ (𝑋 ∈ 𝒫 (Base‘𝑊) ∧ ( I ↾ 𝑋) LIndF 𝑊))) |
| 17 | 7 | elpw2 5274 | . . . 4 ⊢ (𝑋 ∈ 𝒫 (Base‘𝑊) ↔ 𝑋 ⊆ (Base‘𝑊)) |
| 18 | islinds.b | . . . . 5 ⊢ 𝐵 = (Base‘𝑊) | |
| 19 | 18 | sseq2i 3960 | . . . 4 ⊢ (𝑋 ⊆ 𝐵 ↔ 𝑋 ⊆ (Base‘𝑊)) |
| 20 | 17, 19 | bitr4i 278 | . . 3 ⊢ (𝑋 ∈ 𝒫 (Base‘𝑊) ↔ 𝑋 ⊆ 𝐵) |
| 21 | 20 | anbi1i 624 | . 2 ⊢ ((𝑋 ∈ 𝒫 (Base‘𝑊) ∧ ( I ↾ 𝑋) LIndF 𝑊) ↔ (𝑋 ⊆ 𝐵 ∧ ( I ↾ 𝑋) LIndF 𝑊)) |
| 22 | 16, 21 | bitrdi 287 | 1 ⊢ (𝑊 ∈ 𝑉 → (𝑋 ∈ (LIndS‘𝑊) ↔ (𝑋 ⊆ 𝐵 ∧ ( I ↾ 𝑋) LIndF 𝑊))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2113 {crab 3396 Vcvv 3437 ⊆ wss 3898 𝒫 cpw 4549 class class class wbr 5093 I cid 5513 ↾ cres 5621 ‘cfv 6486 Basecbs 17122 LIndF clindf 21743 LIndSclinds 21744 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-sep 5236 ax-nul 5246 ax-pow 5305 ax-pr 5372 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2882 df-ne 2930 df-ral 3049 df-rex 3058 df-rab 3397 df-v 3439 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4283 df-if 4475 df-pw 4551 df-sn 4576 df-pr 4578 df-op 4582 df-uni 4859 df-br 5094 df-opab 5156 df-mpt 5175 df-id 5514 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-res 5631 df-iota 6442 df-fun 6488 df-fv 6494 df-linds 21746 |
| This theorem is referenced by: linds1 21749 linds2 21750 islinds2 21752 lindsss 21763 lindsmm 21767 lsslinds 21770 islinds5 33339 lindspropd 33355 |
| Copyright terms: Public domain | W3C validator |