Theorem islinds 22121

Description: Property of an independent set of vectors in terms of an independent family. (Contributed by Stefan O'Rear, 24-Feb-2015.)

Hypothesis

Ref	Expression
islinds.b	⊢ 𝐵 = (Base‘𝑊)

Assertion

Ref	Expression
islinds	⊢ (𝑊 ∈ 𝑉 → (𝑋 ∈ (LIndS‘𝑊) ↔ (𝑋 ⊆ 𝐵 ∧ ( I ↾ 𝑋) LIndF 𝑊)))

Proof of Theorem islinds

Dummy variables 𝑠 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 3471	. . . . 5 ⊢ (𝑊 ∈ 𝑉 → 𝑊 ∈ V)
2		fveq2 6886	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
3	2	pweqd 4573	. . . . . . 7 ⊢ (𝑤 = 𝑊 → 𝒫 (Base‘𝑤) = 𝒫 (Base‘𝑊))
4		breq2 5106	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (( I ↾ 𝑠) LIndF 𝑤 ↔ ( I ↾ 𝑠) LIndF 𝑊))
5	3, 4	rabeqbidv 3429	. . . . . 6 ⊢ (𝑤 = 𝑊 → {𝑠 ∈ 𝒫 (Base‘𝑤) ∣ ( I ↾ 𝑠) LIndF 𝑤} = {𝑠 ∈ 𝒫 (Base‘𝑊) ∣ ( I ↾ 𝑠) LIndF 𝑊})
6		df-linds 22119	. . . . . 6 ⊢ LIndS = (𝑤 ∈ V ↦ {𝑠 ∈ 𝒫 (Base‘𝑤) ∣ ( I ↾ 𝑠) LIndF 𝑤})
7		fvex 6899	. . . . . . . 8 ⊢ (Base‘𝑊) ∈ V
8	7	pwex 5341	. . . . . . 7 ⊢ 𝒫 (Base‘𝑊) ∈ V
9	8	rabex 5299	. . . . . 6 ⊢ {𝑠 ∈ 𝒫 (Base‘𝑊) ∣ ( I ↾ 𝑠) LIndF 𝑊} ∈ V
10	5, 6, 9	fvmpt 6994	. . . . 5 ⊢ (𝑊 ∈ V → (LIndS‘𝑊) = {𝑠 ∈ 𝒫 (Base‘𝑊) ∣ ( I ↾ 𝑠) LIndF 𝑊})
11	1, 10	syl 18	. . . 4 ⊢ (𝑊 ∈ 𝑉 → (LIndS‘𝑊) = {𝑠 ∈ 𝒫 (Base‘𝑊) ∣ ( I ↾ 𝑠) LIndF 𝑊})
12	11	eleq2d 2846	. . 3 ⊢ (𝑊 ∈ 𝑉 → (𝑋 ∈ (LIndS‘𝑊) ↔ 𝑋 ∈ {𝑠 ∈ 𝒫 (Base‘𝑊) ∣ ( I ↾ 𝑠) LIndF 𝑊}))
13		reseq2 5964	. . . . 5 ⊢ (𝑠 = 𝑋 → ( I ↾ 𝑠) = ( I ↾ 𝑋))
14	13	breq1d 5112	. . . 4 ⊢ (𝑠 = 𝑋 → (( I ↾ 𝑠) LIndF 𝑊 ↔ ( I ↾ 𝑋) LIndF 𝑊))
15	14	elrab 3644	. . 3 ⊢ (𝑋 ∈ {𝑠 ∈ 𝒫 (Base‘𝑊) ∣ ( I ↾ 𝑠) LIndF 𝑊} ↔ (𝑋 ∈ 𝒫 (Base‘𝑊) ∧ ( I ↾ 𝑋) LIndF 𝑊))
16	12, 15	bitrdi 290	. 2 ⊢ (𝑊 ∈ 𝑉 → (𝑋 ∈ (LIndS‘𝑊) ↔ (𝑋 ∈ 𝒫 (Base‘𝑊) ∧ ( I ↾ 𝑋) LIndF 𝑊)))
17	7	elpw2 5295	. . . 4 ⊢ (𝑋 ∈ 𝒫 (Base‘𝑊) ↔ 𝑋 ⊆ (Base‘𝑊))
18		islinds.b	. . . . 5 ⊢ 𝐵 = (Base‘𝑊)
19	18	sseq2i 3937	. . . 4 ⊢ (𝑋 ⊆ 𝐵 ↔ 𝑋 ⊆ (Base‘𝑊))
20	17, 19	bitr4i 281	. . 3 ⊢ (𝑋 ∈ 𝒫 (Base‘𝑊) ↔ 𝑋 ⊆ 𝐵)
21	20	anbi1i 636	. 2 ⊢ ((𝑋 ∈ 𝒫 (Base‘𝑊) ∧ ( I ↾ 𝑋) LIndF 𝑊) ↔ (𝑋 ⊆ 𝐵 ∧ ( I ↾ 𝑋) LIndF 𝑊))
22	16, 21	bitrdi 290	1 ⊢ (𝑊 ∈ 𝑉 → (𝑋 ∈ (LIndS‘𝑊) ↔ (𝑋 ⊆ 𝐵 ∧ ( I ↾ 𝑋) LIndF 𝑊)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  {crab 3412  Vcvv 3450   ⊆ wss 3895  𝒫 cpw 4556   class class class wbr 5102   I cid 5544   ↾ cres 5652  ‘cfv 6539  Basecbs 17393   LIndF clindf 22116  LIndSclinds 22117

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-res 5662  df-iota 6494  df-fun 6541  df-fv 6547  df-linds 22119

This theorem is used by:  linds1  22122  linds2  22123  islinds2  22125  lindsss  22136  lindsmm  22140  lsslinds  22143  islinds5  33970  lindspropd  33985