Theorem lindfpropd 33937

Description: Property deduction for linearly independent families. (Contributed by Thierry Arnoux, 16-Jul-2023.)

Hypotheses

Ref	Expression
lindfpropd.1	⊢ (𝜑 → (Base‘𝐾) = (Base‘𝐿))
lindfpropd.2	⊢ (𝜑 → (Base‘(Scalar‘𝐾)) = (Base‘(Scalar‘𝐿)))
lindfpropd.3	⊢ (𝜑 → (0g‘(Scalar‘𝐾)) = (0g‘(Scalar‘𝐿)))
lindfpropd.4	⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾))) → (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦))
lindfpropd.5	⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘(Scalar‘𝐾)) ∧ 𝑦 ∈ (Base‘𝐾))) → (𝑥( ·𝑠 ‘𝐾)𝑦) ∈ (Base‘𝐾))
lindfpropd.6	⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘(Scalar‘𝐾)) ∧ 𝑦 ∈ (Base‘𝐾))) → (𝑥( ·𝑠 ‘𝐾)𝑦) = (𝑥( ·𝑠 ‘𝐿)𝑦))
lindfpropd.k	⊢ (𝜑 → 𝐾 ∈ 𝑉)
lindfpropd.l	⊢ (𝜑 → 𝐿 ∈ 𝑊)
lindfpropd.x	⊢ (𝜑 → 𝑋 ∈ 𝐴)

Assertion

Ref	Expression
lindfpropd	⊢ (𝜑 → (𝑋 LIndF 𝐾 ↔ 𝑋 LIndF 𝐿))

Distinct variable groups:   𝑥,𝐾,𝑦   𝑥,𝐿,𝑦   𝑥,𝑋,𝑦   𝜑,𝑥,𝑦

Allowed substitution hints:   𝐴(𝑥, 𝑦)   𝑉(𝑥, 𝑦)   𝑊(𝑥, 𝑦)

Proof of Theorem lindfpropd

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

Step	Hyp	Ref	Expression
1		lindfpropd.2	. . . . . . . 8 ⊢ (𝜑 → (Base‘(Scalar‘𝐾)) = (Base‘(Scalar‘𝐿)))
2		lindfpropd.3	. . . . . . . . 9 ⊢ (𝜑 → (0g‘(Scalar‘𝐾)) = (0g‘(Scalar‘𝐿)))
3	2	sneqd 4596	. . . . . . . 8 ⊢ (𝜑 → {(0g‘(Scalar‘𝐾))} = {(0g‘(Scalar‘𝐿))})
4	1, 3	difeq12d 4075	. . . . . . 7 ⊢ (𝜑 → ((Base‘(Scalar‘𝐾)) ∖ {(0g‘(Scalar‘𝐾))}) = ((Base‘(Scalar‘𝐿)) ∖ {(0g‘(Scalar‘𝐿))}))
5	4	ad2antrr 739	. . . . . 6 ⊢ (((𝜑 ∧ 𝑋:dom 𝑋⟶(Base‘𝐾)) ∧ 𝑖 ∈ dom 𝑋) → ((Base‘(Scalar‘𝐾)) ∖ {(0g‘(Scalar‘𝐾))}) = ((Base‘(Scalar‘𝐿)) ∖ {(0g‘(Scalar‘𝐿))}))
6		simplll 787	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑋:dom 𝑋⟶(Base‘𝐾)) ∧ 𝑖 ∈ dom 𝑋) ∧ 𝑘 ∈ ((Base‘(Scalar‘𝐾)) ∖ {(0g‘(Scalar‘𝐾))})) → 𝜑)
7		simpr 490	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑋:dom 𝑋⟶(Base‘𝐾)) ∧ 𝑖 ∈ dom 𝑋) ∧ 𝑘 ∈ ((Base‘(Scalar‘𝐾)) ∖ {(0g‘(Scalar‘𝐾))})) → 𝑘 ∈ ((Base‘(Scalar‘𝐾)) ∖ {(0g‘(Scalar‘𝐾))}))
8	7	eldifad 3911	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑋:dom 𝑋⟶(Base‘𝐾)) ∧ 𝑖 ∈ dom 𝑋) ∧ 𝑘 ∈ ((Base‘(Scalar‘𝐾)) ∖ {(0g‘(Scalar‘𝐾))})) → 𝑘 ∈ (Base‘(Scalar‘𝐾)))
9		simpr 490	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑋:dom 𝑋⟶(Base‘𝐾)) → 𝑋:dom 𝑋⟶(Base‘𝐾))
10	9	ffvelcdmda 7084	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑋:dom 𝑋⟶(Base‘𝐾)) ∧ 𝑖 ∈ dom 𝑋) → (𝑋‘𝑖) ∈ (Base‘𝐾))
11	10	adantr 486	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑋:dom 𝑋⟶(Base‘𝐾)) ∧ 𝑖 ∈ dom 𝑋) ∧ 𝑘 ∈ ((Base‘(Scalar‘𝐾)) ∖ {(0g‘(Scalar‘𝐾))})) → (𝑋‘𝑖) ∈ (Base‘𝐾))
12		lindfpropd.6	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘(Scalar‘𝐾)) ∧ 𝑦 ∈ (Base‘𝐾))) → (𝑥( ·𝑠 ‘𝐾)𝑦) = (𝑥( ·𝑠 ‘𝐿)𝑦))
13	12	oveqrspc2v 7447	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑘 ∈ (Base‘(Scalar‘𝐾)) ∧ (𝑋‘𝑖) ∈ (Base‘𝐾))) → (𝑘( ·𝑠 ‘𝐾)(𝑋‘𝑖)) = (𝑘( ·𝑠 ‘𝐿)(𝑋‘𝑖)))
14	6, 8, 11, 13	syl12anc 850	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑋:dom 𝑋⟶(Base‘𝐾)) ∧ 𝑖 ∈ dom 𝑋) ∧ 𝑘 ∈ ((Base‘(Scalar‘𝐾)) ∖ {(0g‘(Scalar‘𝐾))})) → (𝑘( ·𝑠 ‘𝐾)(𝑋‘𝑖)) = (𝑘( ·𝑠 ‘𝐿)(𝑋‘𝑖)))
15		eqidd 2762	. . . . . . . . . . 11 ⊢ (𝜑 → (Base‘𝐾) = (Base‘𝐾))
16		lindfpropd.1	. . . . . . . . . . 11 ⊢ (𝜑 → (Base‘𝐾) = (Base‘𝐿))
17		ssidd 3954	. . . . . . . . . . 11 ⊢ (𝜑 → (Base‘𝐾) ⊆ (Base‘𝐾))
18		lindfpropd.4	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾))) → (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦))
19		lindfpropd.5	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘(Scalar‘𝐾)) ∧ 𝑦 ∈ (Base‘𝐾))) → (𝑥( ·𝑠 ‘𝐾)𝑦) ∈ (Base‘𝐾))
20		eqidd 2762	. . . . . . . . . . 11 ⊢ (𝜑 → (Base‘(Scalar‘𝐾)) = (Base‘(Scalar‘𝐾)))
21		lindfpropd.k	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐾 ∈ 𝑉)
22		lindfpropd.l	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐿 ∈ 𝑊)
23	15, 16, 17, 18, 19, 12, 20, 1, 21, 22	lsppropd 21293	. . . . . . . . . 10 ⊢ (𝜑 → (LSpan‘𝐾) = (LSpan‘𝐿))
24	23	fveq1d 6887	. . . . . . . . 9 ⊢ (𝜑 → ((LSpan‘𝐾)‘(𝑋 “ (dom 𝑋 ∖ {𝑖}))) = ((LSpan‘𝐿)‘(𝑋 “ (dom 𝑋 ∖ {𝑖}))))
25	24	ad3antrrr 743	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑋:dom 𝑋⟶(Base‘𝐾)) ∧ 𝑖 ∈ dom 𝑋) ∧ 𝑘 ∈ ((Base‘(Scalar‘𝐾)) ∖ {(0g‘(Scalar‘𝐾))})) → ((LSpan‘𝐾)‘(𝑋 “ (dom 𝑋 ∖ {𝑖}))) = ((LSpan‘𝐿)‘(𝑋 “ (dom 𝑋 ∖ {𝑖}))))
26	14, 25	eleq12d 2855	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑋:dom 𝑋⟶(Base‘𝐾)) ∧ 𝑖 ∈ dom 𝑋) ∧ 𝑘 ∈ ((Base‘(Scalar‘𝐾)) ∖ {(0g‘(Scalar‘𝐾))})) → ((𝑘( ·𝑠 ‘𝐾)(𝑋‘𝑖)) ∈ ((LSpan‘𝐾)‘(𝑋 “ (dom 𝑋 ∖ {𝑖}))) ↔ (𝑘( ·𝑠 ‘𝐿)(𝑋‘𝑖)) ∈ ((LSpan‘𝐿)‘(𝑋 “ (dom 𝑋 ∖ {𝑖})))))
27	26	notbid 321	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑋:dom 𝑋⟶(Base‘𝐾)) ∧ 𝑖 ∈ dom 𝑋) ∧ 𝑘 ∈ ((Base‘(Scalar‘𝐾)) ∖ {(0g‘(Scalar‘𝐾))})) → (¬ (𝑘( ·𝑠 ‘𝐾)(𝑋‘𝑖)) ∈ ((LSpan‘𝐾)‘(𝑋 “ (dom 𝑋 ∖ {𝑖}))) ↔ ¬ (𝑘( ·𝑠 ‘𝐿)(𝑋‘𝑖)) ∈ ((LSpan‘𝐿)‘(𝑋 “ (dom 𝑋 ∖ {𝑖})))))
28	5, 27	raleqbidva 3326	. . . . 5 ⊢ (((𝜑 ∧ 𝑋:dom 𝑋⟶(Base‘𝐾)) ∧ 𝑖 ∈ dom 𝑋) → (∀𝑘 ∈ ((Base‘(Scalar‘𝐾)) ∖ {(0g‘(Scalar‘𝐾))}) ¬ (𝑘( ·𝑠 ‘𝐾)(𝑋‘𝑖)) ∈ ((LSpan‘𝐾)‘(𝑋 “ (dom 𝑋 ∖ {𝑖}))) ↔ ∀𝑘 ∈ ((Base‘(Scalar‘𝐿)) ∖ {(0g‘(Scalar‘𝐿))}) ¬ (𝑘( ·𝑠 ‘𝐿)(𝑋‘𝑖)) ∈ ((LSpan‘𝐿)‘(𝑋 “ (dom 𝑋 ∖ {𝑖})))))
29	28	ralbidva 3184	. . . 4 ⊢ ((𝜑 ∧ 𝑋:dom 𝑋⟶(Base‘𝐾)) → (∀𝑖 ∈ dom 𝑋∀𝑘 ∈ ((Base‘(Scalar‘𝐾)) ∖ {(0g‘(Scalar‘𝐾))}) ¬ (𝑘( ·𝑠 ‘𝐾)(𝑋‘𝑖)) ∈ ((LSpan‘𝐾)‘(𝑋 “ (dom 𝑋 ∖ {𝑖}))) ↔ ∀𝑖 ∈ dom 𝑋∀𝑘 ∈ ((Base‘(Scalar‘𝐿)) ∖ {(0g‘(Scalar‘𝐿))}) ¬ (𝑘( ·𝑠 ‘𝐿)(𝑋‘𝑖)) ∈ ((LSpan‘𝐿)‘(𝑋 “ (dom 𝑋 ∖ {𝑖})))))
30	29	pm5.32da 590	. . 3 ⊢ (𝜑 → ((𝑋:dom 𝑋⟶(Base‘𝐾) ∧ ∀𝑖 ∈ dom 𝑋∀𝑘 ∈ ((Base‘(Scalar‘𝐾)) ∖ {(0g‘(Scalar‘𝐾))}) ¬ (𝑘( ·𝑠 ‘𝐾)(𝑋‘𝑖)) ∈ ((LSpan‘𝐾)‘(𝑋 “ (dom 𝑋 ∖ {𝑖})))) ↔ (𝑋:dom 𝑋⟶(Base‘𝐾) ∧ ∀𝑖 ∈ dom 𝑋∀𝑘 ∈ ((Base‘(Scalar‘𝐿)) ∖ {(0g‘(Scalar‘𝐿))}) ¬ (𝑘( ·𝑠 ‘𝐿)(𝑋‘𝑖)) ∈ ((LSpan‘𝐿)‘(𝑋 “ (dom 𝑋 ∖ {𝑖}))))))
31	16	feq3d 6694	. . . 4 ⊢ (𝜑 → (𝑋:dom 𝑋⟶(Base‘𝐾) ↔ 𝑋:dom 𝑋⟶(Base‘𝐿)))
32	31	anbi1d 643	. . 3 ⊢ (𝜑 → ((𝑋:dom 𝑋⟶(Base‘𝐾) ∧ ∀𝑖 ∈ dom 𝑋∀𝑘 ∈ ((Base‘(Scalar‘𝐿)) ∖ {(0g‘(Scalar‘𝐿))}) ¬ (𝑘( ·𝑠 ‘𝐿)(𝑋‘𝑖)) ∈ ((LSpan‘𝐿)‘(𝑋 “ (dom 𝑋 ∖ {𝑖})))) ↔ (𝑋:dom 𝑋⟶(Base‘𝐿) ∧ ∀𝑖 ∈ dom 𝑋∀𝑘 ∈ ((Base‘(Scalar‘𝐿)) ∖ {(0g‘(Scalar‘𝐿))}) ¬ (𝑘( ·𝑠 ‘𝐿)(𝑋‘𝑖)) ∈ ((LSpan‘𝐿)‘(𝑋 “ (dom 𝑋 ∖ {𝑖}))))))
33	30, 32	bitrd 282	. 2 ⊢ (𝜑 → ((𝑋:dom 𝑋⟶(Base‘𝐾) ∧ ∀𝑖 ∈ dom 𝑋∀𝑘 ∈ ((Base‘(Scalar‘𝐾)) ∖ {(0g‘(Scalar‘𝐾))}) ¬ (𝑘( ·𝑠 ‘𝐾)(𝑋‘𝑖)) ∈ ((LSpan‘𝐾)‘(𝑋 “ (dom 𝑋 ∖ {𝑖})))) ↔ (𝑋:dom 𝑋⟶(Base‘𝐿) ∧ ∀𝑖 ∈ dom 𝑋∀𝑘 ∈ ((Base‘(Scalar‘𝐿)) ∖ {(0g‘(Scalar‘𝐿))}) ¬ (𝑘( ·𝑠 ‘𝐿)(𝑋‘𝑖)) ∈ ((LSpan‘𝐿)‘(𝑋 “ (dom 𝑋 ∖ {𝑖}))))))
34		lindfpropd.x	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐴)
35		eqid 2761	. . . 4 ⊢ (Base‘𝐾) = (Base‘𝐾)
36		eqid 2761	. . . 4 ⊢ ( ·𝑠 ‘𝐾) = ( ·𝑠 ‘𝐾)
37		eqid 2761	. . . 4 ⊢ (LSpan‘𝐾) = (LSpan‘𝐾)
38		eqid 2761	. . . 4 ⊢ (Scalar‘𝐾) = (Scalar‘𝐾)
39		eqid 2761	. . . 4 ⊢ (Base‘(Scalar‘𝐾)) = (Base‘(Scalar‘𝐾))
40		eqid 2761	. . . 4 ⊢ (0g‘(Scalar‘𝐾)) = (0g‘(Scalar‘𝐾))
41	35, 36, 37, 38, 39, 40	islindf 22118	. . 3 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑋 ∈ 𝐴) → (𝑋 LIndF 𝐾 ↔ (𝑋:dom 𝑋⟶(Base‘𝐾) ∧ ∀𝑖 ∈ dom 𝑋∀𝑘 ∈ ((Base‘(Scalar‘𝐾)) ∖ {(0g‘(Scalar‘𝐾))}) ¬ (𝑘( ·𝑠 ‘𝐾)(𝑋‘𝑖)) ∈ ((LSpan‘𝐾)‘(𝑋 “ (dom 𝑋 ∖ {𝑖}))))))
42	21, 34, 41	syl2anc 596	. 2 ⊢ (𝜑 → (𝑋 LIndF 𝐾 ↔ (𝑋:dom 𝑋⟶(Base‘𝐾) ∧ ∀𝑖 ∈ dom 𝑋∀𝑘 ∈ ((Base‘(Scalar‘𝐾)) ∖ {(0g‘(Scalar‘𝐾))}) ¬ (𝑘( ·𝑠 ‘𝐾)(𝑋‘𝑖)) ∈ ((LSpan‘𝐾)‘(𝑋 “ (dom 𝑋 ∖ {𝑖}))))))
43		eqid 2761	. . . 4 ⊢ (Base‘𝐿) = (Base‘𝐿)
44		eqid 2761	. . . 4 ⊢ ( ·𝑠 ‘𝐿) = ( ·𝑠 ‘𝐿)
45		eqid 2761	. . . 4 ⊢ (LSpan‘𝐿) = (LSpan‘𝐿)
46		eqid 2761	. . . 4 ⊢ (Scalar‘𝐿) = (Scalar‘𝐿)
47		eqid 2761	. . . 4 ⊢ (Base‘(Scalar‘𝐿)) = (Base‘(Scalar‘𝐿))
48		eqid 2761	. . . 4 ⊢ (0g‘(Scalar‘𝐿)) = (0g‘(Scalar‘𝐿))
49	43, 44, 45, 46, 47, 48	islindf 22118	. . 3 ⊢ ((𝐿 ∈ 𝑊 ∧ 𝑋 ∈ 𝐴) → (𝑋 LIndF 𝐿 ↔ (𝑋:dom 𝑋⟶(Base‘𝐿) ∧ ∀𝑖 ∈ dom 𝑋∀𝑘 ∈ ((Base‘(Scalar‘𝐿)) ∖ {(0g‘(Scalar‘𝐿))}) ¬ (𝑘( ·𝑠 ‘𝐿)(𝑋‘𝑖)) ∈ ((LSpan‘𝐿)‘(𝑋 “ (dom 𝑋 ∖ {𝑖}))))))
50	22, 34, 49	syl2anc 596	. 2 ⊢ (𝜑 → (𝑋 LIndF 𝐿 ↔ (𝑋:dom 𝑋⟶(Base‘𝐿) ∧ ∀𝑖 ∈ dom 𝑋∀𝑘 ∈ ((Base‘(Scalar‘𝐿)) ∖ {(0g‘(Scalar‘𝐿))}) ¬ (𝑘( ·𝑠 ‘𝐿)(𝑋‘𝑖)) ∈ ((LSpan‘𝐿)‘(𝑋 “ (dom 𝑋 ∖ {𝑖}))))))
51	33, 42, 50	3bitr4d 314	1 ⊢ (𝜑 → (𝑋 LIndF 𝐾 ↔ 𝑋 LIndF 𝐿))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3077   ∖ cdif 3896  {csn 4584   class class class wbr 5103  dom cdm 5651   “ cima 5654  ⟶wf 6534  ‘cfv 6538  (class class class)co 7420  Basecbs 17387  +_gcplusg 17428  Scalarcsca 17431   ·_𝑠 cvsca 17432  0_gc0g 17610  LSpanclspn 21246   LIndF clindf 22110

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-lss 21207  df-lsp 21247  df-lindf 22112

This theorem is used by:  lindspropd  33938