Theorem islbs4 20171

Description: A basis is an independent spanning set. This could have been used as alternative definition of a basis: LBasis = (𝑤 ∈ V ↦ {𝑏 ∈ 𝒫 (Base‘𝑤) ∣ (((LSpan‘𝑤) ‘𝑏) = (Base‘𝑤) ∧ 𝑏 ∈ (LIndS‘𝑤))}). (Contributed by Stefan O'Rear, 24-Feb-2015.)

Hypotheses

Ref	Expression
islbs4.b	⊢ 𝐵 = (Base‘𝑊)
islbs4.j	⊢ 𝐽 = (LBasis‘𝑊)
islbs4.k	⊢ 𝐾 = (LSpan‘𝑊)

Assertion

Ref	Expression
islbs4	⊢ (𝑋 ∈ 𝐽 ↔ (𝑋 ∈ (LIndS‘𝑊) ∧ (𝐾‘𝑋) = 𝐵))

Proof of Theorem islbs4

Dummy variables 𝑘 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elfvex 6221	. . 3 ⊢ (𝑋 ∈ (LBasis‘𝑊) → 𝑊 ∈ V)
2		islbs4.j	. . 3 ⊢ 𝐽 = (LBasis‘𝑊)
3	1, 2	eleq2s 2719	. 2 ⊢ (𝑋 ∈ 𝐽 → 𝑊 ∈ V)
4		elfvex 6221	. . 3 ⊢ (𝑋 ∈ (LIndS‘𝑊) → 𝑊 ∈ V)
5	4	adantr 481	. 2 ⊢ ((𝑋 ∈ (LIndS‘𝑊) ∧ (𝐾‘𝑋) = 𝐵) → 𝑊 ∈ V)
6		islbs4.b	. . . 4 ⊢ 𝐵 = (Base‘𝑊)
7		eqid 2622	. . . 4 ⊢ (Scalar‘𝑊) = (Scalar‘𝑊)
8		eqid 2622	. . . 4 ⊢ ( ·𝑠 ‘𝑊) = ( ·𝑠 ‘𝑊)
9		eqid 2622	. . . 4 ⊢ (Base‘(Scalar‘𝑊)) = (Base‘(Scalar‘𝑊))
10		islbs4.k	. . . 4 ⊢ 𝐾 = (LSpan‘𝑊)
11		eqid 2622	. . . 4 ⊢ (0g‘(Scalar‘𝑊)) = (0g‘(Scalar‘𝑊))
12	6, 7, 8, 9, 2, 10, 11	islbs 19076	. . 3 ⊢ (𝑊 ∈ V → (𝑋 ∈ 𝐽 ↔ (𝑋 ⊆ 𝐵 ∧ (𝐾‘𝑋) = 𝐵 ∧ ∀𝑥 ∈ 𝑋 ∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0g‘(Scalar‘𝑊))}) ¬ (𝑘( ·𝑠 ‘𝑊)𝑥) ∈ (𝐾‘(𝑋 ∖ {𝑥})))))
13	6, 8, 10, 7, 9, 11	islinds2 20152	. . . . 5 ⊢ (𝑊 ∈ V → (𝑋 ∈ (LIndS‘𝑊) ↔ (𝑋 ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝑋 ∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0g‘(Scalar‘𝑊))}) ¬ (𝑘( ·𝑠 ‘𝑊)𝑥) ∈ (𝐾‘(𝑋 ∖ {𝑥})))))
14	13	anbi1d 741	. . . 4 ⊢ (𝑊 ∈ V → ((𝑋 ∈ (LIndS‘𝑊) ∧ (𝐾‘𝑋) = 𝐵) ↔ ((𝑋 ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝑋 ∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0g‘(Scalar‘𝑊))}) ¬ (𝑘( ·𝑠 ‘𝑊)𝑥) ∈ (𝐾‘(𝑋 ∖ {𝑥}))) ∧ (𝐾‘𝑋) = 𝐵)))
15		3anan32 1050	. . . 4 ⊢ ((𝑋 ⊆ 𝐵 ∧ (𝐾‘𝑋) = 𝐵 ∧ ∀𝑥 ∈ 𝑋 ∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0g‘(Scalar‘𝑊))}) ¬ (𝑘( ·𝑠 ‘𝑊)𝑥) ∈ (𝐾‘(𝑋 ∖ {𝑥}))) ↔ ((𝑋 ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝑋 ∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0g‘(Scalar‘𝑊))}) ¬ (𝑘( ·𝑠 ‘𝑊)𝑥) ∈ (𝐾‘(𝑋 ∖ {𝑥}))) ∧ (𝐾‘𝑋) = 𝐵))
16	14, 15	syl6rbbr 279	. . 3 ⊢ (𝑊 ∈ V → ((𝑋 ⊆ 𝐵 ∧ (𝐾‘𝑋) = 𝐵 ∧ ∀𝑥 ∈ 𝑋 ∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0g‘(Scalar‘𝑊))}) ¬ (𝑘( ·𝑠 ‘𝑊)𝑥) ∈ (𝐾‘(𝑋 ∖ {𝑥}))) ↔ (𝑋 ∈ (LIndS‘𝑊) ∧ (𝐾‘𝑋) = 𝐵)))
17	12, 16	bitrd 268	. 2 ⊢ (𝑊 ∈ V → (𝑋 ∈ 𝐽 ↔ (𝑋 ∈ (LIndS‘𝑊) ∧ (𝐾‘𝑋) = 𝐵)))
18	3, 5, 17	pm5.21nii 368	1 ⊢ (𝑋 ∈ 𝐽 ↔ (𝑋 ∈ (LIndS‘𝑊) ∧ (𝐾‘𝑋) = 𝐵))

Syntax hints:  ¬ wn 3   ↔ wb 196   ∧ wa 384   ∧ w3a 1037   = wceq 1483   ∈ wcel 1990  ∀wral 2912  Vcvv 3200   ∖ cdif 3571   ⊆ wss 3574  {csn 4177  ‘cfv 5888  (class class class)co 6650  Basecbs 15857  Scalarcsca 15944   ·_𝑠 cvsca 15945  0_gc0g 16100  LSpanclspn 18971  LBasisclbs 19074  LIndSclinds 20144

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-ov 6653  df-lbs 19075  df-lindf 20145  df-linds 20146

This theorem is referenced by:  lbslinds  20172  islinds3  20173  lmimlbs  20175  lindsenlbs  33404