Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  linds0 Structured version   Visualization version   GIF version

Theorem linds0 49969
Description: The empty set is always a linearly independent subset. (Contributed by AV, 13-Apr-2019.) (Revised by AV, 27-Apr-2019.) (Proof shortened by AV, 30-Jul-2019.)
Assertion
Ref Expression
linds0 (𝑀 ∈ 𝑉 → ∅ linIndS 𝑀)

Proof of Theorem linds0
Dummy variables 𝑓 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ral0 4457 . . . . . 6 ∀𝑥 ∈ ∅ (∅‘𝑥) = (0g‘(Scalar‘𝑀))
212a1i 12 . . . . 5 (𝑀 ∈ 𝑉 → ((∅ finSupp (0g‘(Scalar‘𝑀)) ∧ (∅( linC ‘𝑀)∅) = (0g‘𝑀)) → ∀𝑥 ∈ ∅ (∅‘𝑥) = (0g‘(Scalar‘𝑀))))
3 0ex 5267 . . . . . 6 ∅ ∈ V
4 breq1 5111 . . . . . . . . 9 (𝑓 = ∅ → (𝑓 finSupp (0g‘(Scalar‘𝑀)) ↔ ∅ finSupp (0g‘(Scalar‘𝑀))))
5 oveq1 7458 . . . . . . . . . 10 (𝑓 = ∅ → (𝑓( linC ‘𝑀)∅) = (∅( linC ‘𝑀)∅))
65eqeq1d 2765 . . . . . . . . 9 (𝑓 = ∅ → ((𝑓( linC ‘𝑀)∅) = (0g‘𝑀) ↔ (∅( linC ‘𝑀)∅) = (0g‘𝑀)))
74, 6anbi12d 644 . . . . . . . 8 (𝑓 = ∅ → ((𝑓 finSupp (0g‘(Scalar‘𝑀)) ∧ (𝑓( linC ‘𝑀)∅) = (0g‘𝑀)) ↔ (∅ finSupp (0g‘(Scalar‘𝑀)) ∧ (∅( linC ‘𝑀)∅) = (0g‘𝑀))))
8 fveq1 6915 . . . . . . . . . 10 (𝑓 = ∅ → (𝑓‘𝑥) = (∅‘𝑥))
98eqeq1d 2765 . . . . . . . . 9 (𝑓 = ∅ → ((𝑓‘𝑥) = (0g‘(Scalar‘𝑀)) ↔ (∅‘𝑥) = (0g‘(Scalar‘𝑀))))
109ralbidv 3189 . . . . . . . 8 (𝑓 = ∅ → (∀𝑥 ∈ ∅ (𝑓‘𝑥) = (0g‘(Scalar‘𝑀)) ↔ ∀𝑥 ∈ ∅ (∅‘𝑥) = (0g‘(Scalar‘𝑀))))
117, 10imbi12d 347 . . . . . . 7 (𝑓 = ∅ → (((𝑓 finSupp (0g‘(Scalar‘𝑀)) ∧ (𝑓( linC ‘𝑀)∅) = (0g‘𝑀)) → ∀𝑥 ∈ ∅ (𝑓‘𝑥) = (0g‘(Scalar‘𝑀))) ↔ ((∅ finSupp (0g‘(Scalar‘𝑀)) ∧ (∅( linC ‘𝑀)∅) = (0g‘𝑀)) → ∀𝑥 ∈ ∅ (∅‘𝑥) = (0g‘(Scalar‘𝑀)))))
1211ralsng 4637 . . . . . 6 (∅ ∈ V → (∀𝑓 ∈ {∅} ((𝑓 finSupp (0g‘(Scalar‘𝑀)) ∧ (𝑓( linC ‘𝑀)∅) = (0g‘𝑀)) → ∀𝑥 ∈ ∅ (𝑓‘𝑥) = (0g‘(Scalar‘𝑀))) ↔ ((∅ finSupp (0g‘(Scalar‘𝑀)) ∧ (∅( linC ‘𝑀)∅) = (0g‘𝑀)) → ∀𝑥 ∈ ∅ (∅‘𝑥) = (0g‘(Scalar‘𝑀)))))
133, 12mp1i 14 . . . . 5 (𝑀 ∈ 𝑉 → (∀𝑓 ∈ {∅} ((𝑓 finSupp (0g‘(Scalar‘𝑀)) ∧ (𝑓( linC ‘𝑀)∅) = (0g‘𝑀)) → ∀𝑥 ∈ ∅ (𝑓‘𝑥) = (0g‘(Scalar‘𝑀))) ↔ ((∅ finSupp (0g‘(Scalar‘𝑀)) ∧ (∅( linC ‘𝑀)∅) = (0g‘𝑀)) → ∀𝑥 ∈ ∅ (∅‘𝑥) = (0g‘(Scalar‘𝑀)))))
142, 13mpbird 260 . . . 4 (𝑀 ∈ 𝑉 → ∀𝑓 ∈ {∅} ((𝑓 finSupp (0g‘(Scalar‘𝑀)) ∧ (𝑓( linC ‘𝑀)∅) = (0g‘𝑀)) → ∀𝑥 ∈ ∅ (𝑓‘𝑥) = (0g‘(Scalar‘𝑀))))
15 fvex 6929 . . . . . 6 (Base‘(Scalar‘𝑀)) ∈ V
16 map0e 8948 . . . . . 6 ((Base‘(Scalar‘𝑀)) ∈ V → ((Base‘(Scalar‘𝑀)) ↑m ∅) = 1o)
1715, 16mp1i 14 . . . . 5 (𝑀 ∈ 𝑉 → ((Base‘(Scalar‘𝑀)) ↑m ∅) = 1o)
18 df1o2 8521 . . . . 5 1o = {∅}
1917, 18eqtrdi 2814 . . . 4 (𝑀 ∈ 𝑉 → ((Base‘(Scalar‘𝑀)) ↑m ∅) = {∅})
2014, 19raleqtrrdv 3327 . . 3 (𝑀 ∈ 𝑉 → ∀𝑓 ∈ ((Base‘(Scalar‘𝑀)) ↑m ∅)((𝑓 finSupp (0g‘(Scalar‘𝑀)) ∧ (𝑓( linC ‘𝑀)∅) = (0g‘𝑀)) → ∀𝑥 ∈ ∅ (𝑓‘𝑥) = (0g‘(Scalar‘𝑀))))
21 0elpw 5324 . . 3 ∅ ∈ 𝒫 (Base‘𝑀)
2220, 21jctil 529 . 2 (𝑀 ∈ 𝑉 → (∅ ∈ 𝒫 (Base‘𝑀) ∧ ∀𝑓 ∈ ((Base‘(Scalar‘𝑀)) ↑m ∅)((𝑓 finSupp (0g‘(Scalar‘𝑀)) ∧ (𝑓( linC ‘𝑀)∅) = (0g‘𝑀)) → ∀𝑥 ∈ ∅ (𝑓‘𝑥) = (0g‘(Scalar‘𝑀)))))
23 eqid 2763 . . . 4 (Base‘𝑀) = (Base‘𝑀)
24 eqid 2763 . . . 4 (0g‘𝑀) = (0g‘𝑀)
25 eqid 2763 . . . 4 (Scalar‘𝑀) = (Scalar‘𝑀)
26 eqid 2763 . . . 4 (Base‘(Scalar‘𝑀)) = (Base‘(Scalar‘𝑀))
27 eqid 2763 . . . 4 (0g‘(Scalar‘𝑀)) = (0g‘(Scalar‘𝑀))
2823, 24, 25, 26, 27islininds 49950 . . 3 ((∅ ∈ V ∧ 𝑀 ∈ 𝑉) → (∅ linIndS 𝑀 ↔ (∅ ∈ 𝒫 (Base‘𝑀) ∧ ∀𝑓 ∈ ((Base‘(Scalar‘𝑀)) ↑m ∅)((𝑓 finSupp (0g‘(Scalar‘𝑀)) ∧ (𝑓( linC ‘𝑀)∅) = (0g‘𝑀)) → ∀𝑥 ∈ ∅ (𝑓‘𝑥) = (0g‘(Scalar‘𝑀))))))
293, 28mpan 703 . 2 (𝑀 ∈ 𝑉 → (∅ linIndS 𝑀 ↔ (∅ ∈ 𝒫 (Base‘𝑀) ∧ ∀𝑓 ∈ ((Base‘(Scalar‘𝑀)) ↑m ∅)((𝑓 finSupp (0g‘(Scalar‘𝑀)) ∧ (𝑓( linC ‘𝑀)∅) = (0g‘𝑀)) → ∀𝑥 ∈ ∅ (𝑓‘𝑥) = (0g‘(Scalar‘𝑀))))))
3022, 29mpbird 260 1 (𝑀 ∈ 𝑉 → ∅ linIndS 𝑀)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  Vcvv 3454  ∅c0 4281  𝒫 cpw 4560  {csn 4588   class class class wbr 5108  ‘cfv 6566  (class class class)co 7451  1oc1o 8507   ↑m cmap 8885   finSupp cfsupp 9391  Basecbs 17431  Scalarcsca 17475  0gc0g 17660   linC clinc 49908   linIndS clininds 49944
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-1o 8514  df-map 8887  df-lininds 49946
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator