| 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 3474 | . . . . 5 ⊢ (𝑊 ∈ 𝑉 → 𝑊 ∈ V) | |
| 2 | fveq2 6863 | . . . . . . . 8 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊)) | |
| 3 | 2 | pweqd 4571 | . . . . . . 7 ⊢ (𝑤 = 𝑊 → 𝒫 (Base‘𝑤) = 𝒫 (Base‘𝑊)) |
| 4 | breq2 5103 | . . . . . . 7 ⊢ (𝑤 = 𝑊 → (( I ↾ 𝑠) LIndF 𝑤 ↔ ( I ↾ 𝑠) LIndF 𝑊)) | |
| 5 | 3, 4 | rabeqbidv 3431 | . . . . . 6 ⊢ (𝑤 = 𝑊 → {𝑠 ∈ 𝒫 (Base‘𝑤) ∣ ( I ↾ 𝑠) LIndF 𝑤} = {𝑠 ∈ 𝒫 (Base‘𝑊) ∣ ( I ↾ 𝑠) LIndF 𝑊}) |
| 6 | df-linds 21839 | . . . . . 6 ⊢ LIndS = (𝑤 ∈ V ↦ {𝑠 ∈ 𝒫 (Base‘𝑤) ∣ ( I ↾ 𝑠) LIndF 𝑤}) | |
| 7 | fvex 6876 | . . . . . . . 8 ⊢ (Base‘𝑊) ∈ V | |
| 8 | 7 | pwex 5336 | . . . . . . 7 ⊢ 𝒫 (Base‘𝑊) ∈ V |
| 9 | 8 | rabex 5294 | . . . . . 6 ⊢ {𝑠 ∈ 𝒫 (Base‘𝑊) ∣ ( I ↾ 𝑠) LIndF 𝑊} ∈ V |
| 10 | 5, 6, 9 | fvmpt 6971 | . . . . 5 ⊢ (𝑊 ∈ V → (LIndS‘𝑊) = {𝑠 ∈ 𝒫 (Base‘𝑊) ∣ ( I ↾ 𝑠) LIndF 𝑊}) |
| 11 | 1, 10 | syl 17 | . . . 4 ⊢ (𝑊 ∈ 𝑉 → (LIndS‘𝑊) = {𝑠 ∈ 𝒫 (Base‘𝑊) ∣ ( I ↾ 𝑠) LIndF 𝑊}) |
| 12 | 11 | eleq2d 2847 | . . 3 ⊢ (𝑊 ∈ 𝑉 → (𝑋 ∈ (LIndS‘𝑊) ↔ 𝑋 ∈ {𝑠 ∈ 𝒫 (Base‘𝑊) ∣ ( I ↾ 𝑠) LIndF 𝑊})) |
| 13 | reseq2 5958 | . . . . 5 ⊢ (𝑠 = 𝑋 → ( I ↾ 𝑠) = ( I ↾ 𝑋)) | |
| 14 | 13 | breq1d 5109 | . . . 4 ⊢ (𝑠 = 𝑋 → (( I ↾ 𝑠) LIndF 𝑊 ↔ ( I ↾ 𝑋) LIndF 𝑊)) |
| 15 | 14 | elrab 3650 | . . 3 ⊢ (𝑋 ∈ {𝑠 ∈ 𝒫 (Base‘𝑊) ∣ ( I ↾ 𝑠) LIndF 𝑊} ↔ (𝑋 ∈ 𝒫 (Base‘𝑊) ∧ ( I ↾ 𝑋) LIndF 𝑊)) |
| 16 | 12, 15 | bitrdi 289 | . 2 ⊢ (𝑊 ∈ 𝑉 → (𝑋 ∈ (LIndS‘𝑊) ↔ (𝑋 ∈ 𝒫 (Base‘𝑊) ∧ ( I ↾ 𝑋) LIndF 𝑊))) |
| 17 | 7 | elpw2 5289 | . . . 4 ⊢ (𝑋 ∈ 𝒫 (Base‘𝑊) ↔ 𝑋 ⊆ (Base‘𝑊)) |
| 18 | islinds.b | . . . . 5 ⊢ 𝐵 = (Base‘𝑊) | |
| 19 | 18 | sseq2i 3965 | . . . 4 ⊢ (𝑋 ⊆ 𝐵 ↔ 𝑋 ⊆ (Base‘𝑊)) |
| 20 | 17, 19 | bitr4i 280 | . . 3 ⊢ (𝑋 ∈ 𝒫 (Base‘𝑊) ↔ 𝑋 ⊆ 𝐵) |
| 21 | 20 | anbi1i 633 | . 2 ⊢ ((𝑋 ∈ 𝒫 (Base‘𝑊) ∧ ( I ↾ 𝑋) LIndF 𝑊) ↔ (𝑋 ⊆ 𝐵 ∧ ( I ↾ 𝑋) LIndF 𝑊)) |
| 22 | 16, 21 | bitrdi 289 | 1 ⊢ (𝑊 ∈ 𝑉 → (𝑋 ∈ (LIndS‘𝑊) ↔ (𝑋 ⊆ 𝐵 ∧ ( I ↾ 𝑋) LIndF 𝑊))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 = wceq 1559 ∈ wcel 2141 {crab 3413 Vcvv 3453 ⊆ wss 3904 𝒫 cpw 4554 class class class wbr 5099 I cid 5539 ↾ cres 5647 ‘cfv 6517 Basecbs 17228 LIndF clindf 21836 LIndSclinds 21837 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5245 ax-nul 5255 ax-pow 5321 ax-pr 5389 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3076 df-rex 3086 df-rab 3414 df-v 3455 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-br 5100 df-opab 5162 df-mpt 5181 df-id 5540 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-res 5657 df-iota 6473 df-fun 6519 df-fv 6525 df-linds 21839 |
| This theorem is referenced by: linds1 21842 linds2 21843 islinds2 21845 lindsss 21856 lindsmm 21860 lsslinds 21863 islinds5 33514 lindspropd 33530 |
| Copyright terms: Public domain | W3C validator |