Theorem islinds 21996

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 3479	. . . . 5 ⊢ (𝑊 ∈ 𝑉 → 𝑊 ∈ V)
2		fveq2 6888	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
3	2	pweqd 4584	. . . . . . 7 ⊢ (𝑤 = 𝑊 → 𝒫 (Base‘𝑤) = 𝒫 (Base‘𝑊))
4		breq2 5118	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (( I ↾ 𝑠) LIndF 𝑤 ↔ ( I ↾ 𝑠) LIndF 𝑊))
5	3, 4	rabeqbidv 3437	. . . . . 6 ⊢ (𝑤 = 𝑊 → {𝑠 ∈ 𝒫 (Base‘𝑤) ∣ ( I ↾ 𝑠) LIndF 𝑤} = {𝑠 ∈ 𝒫 (Base‘𝑊) ∣ ( I ↾ 𝑠) LIndF 𝑊})
6		df-linds 21994	. . . . . 6 ⊢ LIndS = (𝑤 ∈ V ↦ {𝑠 ∈ 𝒫 (Base‘𝑤) ∣ ( I ↾ 𝑠) LIndF 𝑤})
7		fvex 6901	. . . . . . . 8 ⊢ (Base‘𝑊) ∈ V
8	7	pwex 5356	. . . . . . 7 ⊢ 𝒫 (Base‘𝑊) ∈ V
9	8	rabex 5314	. . . . . 6 ⊢ {𝑠 ∈ 𝒫 (Base‘𝑊) ∣ ( I ↾ 𝑠) LIndF 𝑊} ∈ V
10	5, 6, 9	fvmpt 6996	. . . . 5 ⊢ (𝑊 ∈ V → (LIndS‘𝑊) = {𝑠 ∈ 𝒫 (Base‘𝑊) ∣ ( I ↾ 𝑠) LIndF 𝑊})
11	1, 10	syl 18	. . . 4 ⊢ (𝑊 ∈ 𝑉 → (LIndS‘𝑊) = {𝑠 ∈ 𝒫 (Base‘𝑊) ∣ ( I ↾ 𝑠) LIndF 𝑊})
12	11	eleq2d 2852	. . 3 ⊢ (𝑊 ∈ 𝑉 → (𝑋 ∈ (LIndS‘𝑊) ↔ 𝑋 ∈ {𝑠 ∈ 𝒫 (Base‘𝑊) ∣ ( I ↾ 𝑠) LIndF 𝑊}))
13		reseq2 5978	. . . . 5 ⊢ (𝑠 = 𝑋 → ( I ↾ 𝑠) = ( I ↾ 𝑋))
14	13	breq1d 5124	. . . 4 ⊢ (𝑠 = 𝑋 → (( I ↾ 𝑠) LIndF 𝑊 ↔ ( I ↾ 𝑋) LIndF 𝑊))
15	14	elrab 3653	. . 3 ⊢ (𝑋 ∈ {𝑠 ∈ 𝒫 (Base‘𝑊) ∣ ( I ↾ 𝑠) LIndF 𝑊} ↔ (𝑋 ∈ 𝒫 (Base‘𝑊) ∧ ( I ↾ 𝑋) LIndF 𝑊))
16	12, 15	bitrdi 290	. 2 ⊢ (𝑊 ∈ 𝑉 → (𝑋 ∈ (LIndS‘𝑊) ↔ (𝑋 ∈ 𝒫 (Base‘𝑊) ∧ ( I ↾ 𝑋) LIndF 𝑊)))
17	7	elpw2 5310	. . . 4 ⊢ (𝑋 ∈ 𝒫 (Base‘𝑊) ↔ 𝑋 ⊆ (Base‘𝑊))
18		islinds.b	. . . . 5 ⊢ 𝐵 = (Base‘𝑊)
19	18	sseq2i 3969	. . . 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 1570   ∈ wcel 2146  {crab 3419  Vcvv 3458   ⊆ wss 3908  𝒫 cpw 4567   class class class wbr 5114   I cid 5560   ↾ cres 5668  ‘cfv 6543  Basecbs 17294   LIndF clindf 21991  LIndSclinds 21992

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-res 5678  df-iota 6499  df-fun 6545  df-fv 6551  df-linds 21994

This theorem is used by:  linds1  21997  linds2  21998  islinds2  22000  lindsss  22011  lindsmm  22015  lsslinds  22018  islinds5  33713  lindspropd  33727