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

Theorem lco0 44658
 Description: The set of empty linear combinations over a monoid is the singleton with the identity element of the monoid. (Contributed by AV, 12-Apr-2019.)
Assertion
Ref Expression
lco0 (𝑀 ∈ Mnd → (𝑀 LinCo ∅) = {(0g𝑀)})

Proof of Theorem lco0
Dummy variables 𝑣 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 0elpw 5229 . . 3 ∅ ∈ 𝒫 (Base‘𝑀)
2 eqid 2821 . . . 4 (Base‘𝑀) = (Base‘𝑀)
3 eqid 2821 . . . 4 (Scalar‘𝑀) = (Scalar‘𝑀)
4 eqid 2821 . . . 4 (Base‘(Scalar‘𝑀)) = (Base‘(Scalar‘𝑀))
52, 3, 4lcoop 44642 . . 3 ((𝑀 ∈ Mnd ∧ ∅ ∈ 𝒫 (Base‘𝑀)) → (𝑀 LinCo ∅) = {𝑣 ∈ (Base‘𝑀) ∣ ∃𝑤 ∈ ((Base‘(Scalar‘𝑀)) ↑m ∅)(𝑤 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝑣 = (𝑤( linC ‘𝑀)∅))})
61, 5mpan2 690 . 2 (𝑀 ∈ Mnd → (𝑀 LinCo ∅) = {𝑣 ∈ (Base‘𝑀) ∣ ∃𝑤 ∈ ((Base‘(Scalar‘𝑀)) ↑m ∅)(𝑤 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝑣 = (𝑤( linC ‘𝑀)∅))})
7 fvex 6656 . . . . . . 7 (Base‘(Scalar‘𝑀)) ∈ V
8 map0e 8421 . . . . . . 7 ((Base‘(Scalar‘𝑀)) ∈ V → ((Base‘(Scalar‘𝑀)) ↑m ∅) = 1o)
97, 8mp1i 13 . . . . . 6 ((𝑀 ∈ Mnd ∧ 𝑣 ∈ (Base‘𝑀)) → ((Base‘(Scalar‘𝑀)) ↑m ∅) = 1o)
10 df1o2 8091 . . . . . 6 1o = {∅}
119, 10syl6eq 2872 . . . . 5 ((𝑀 ∈ Mnd ∧ 𝑣 ∈ (Base‘𝑀)) → ((Base‘(Scalar‘𝑀)) ↑m ∅) = {∅})
1211rexeqdv 3397 . . . 4 ((𝑀 ∈ Mnd ∧ 𝑣 ∈ (Base‘𝑀)) → (∃𝑤 ∈ ((Base‘(Scalar‘𝑀)) ↑m ∅)(𝑤 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝑣 = (𝑤( linC ‘𝑀)∅)) ↔ ∃𝑤 ∈ {∅} (𝑤 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝑣 = (𝑤( linC ‘𝑀)∅))))
13 lincval0 44646 . . . . . . . 8 (𝑀 ∈ Mnd → (∅( linC ‘𝑀)∅) = (0g𝑀))
1413adantr 484 . . . . . . 7 ((𝑀 ∈ Mnd ∧ 𝑣 ∈ (Base‘𝑀)) → (∅( linC ‘𝑀)∅) = (0g𝑀))
1514eqeq2d 2832 . . . . . 6 ((𝑀 ∈ Mnd ∧ 𝑣 ∈ (Base‘𝑀)) → (𝑣 = (∅( linC ‘𝑀)∅) ↔ 𝑣 = (0g𝑀)))
1615anbi2d 631 . . . . 5 ((𝑀 ∈ Mnd ∧ 𝑣 ∈ (Base‘𝑀)) → ((∅ ∈ Fin ∧ 𝑣 = (∅( linC ‘𝑀)∅)) ↔ (∅ ∈ Fin ∧ 𝑣 = (0g𝑀))))
17 0ex 5184 . . . . . 6 ∅ ∈ V
18 breq1 5042 . . . . . . . . 9 (𝑤 = ∅ → (𝑤 finSupp (0g‘(Scalar‘𝑀)) ↔ ∅ finSupp (0g‘(Scalar‘𝑀))))
19 fvex 6656 . . . . . . . . . . 11 (0g‘(Scalar‘𝑀)) ∈ V
20 0fsupp 8831 . . . . . . . . . . 11 ((0g‘(Scalar‘𝑀)) ∈ V → ∅ finSupp (0g‘(Scalar‘𝑀)))
2119, 20ax-mp 5 . . . . . . . . . 10 ∅ finSupp (0g‘(Scalar‘𝑀))
22 0fin 8722 . . . . . . . . . 10 ∅ ∈ Fin
2321, 222th 267 . . . . . . . . 9 (∅ finSupp (0g‘(Scalar‘𝑀)) ↔ ∅ ∈ Fin)
2418, 23syl6bb 290 . . . . . . . 8 (𝑤 = ∅ → (𝑤 finSupp (0g‘(Scalar‘𝑀)) ↔ ∅ ∈ Fin))
25 oveq1 7137 . . . . . . . . 9 (𝑤 = ∅ → (𝑤( linC ‘𝑀)∅) = (∅( linC ‘𝑀)∅))
2625eqeq2d 2832 . . . . . . . 8 (𝑤 = ∅ → (𝑣 = (𝑤( linC ‘𝑀)∅) ↔ 𝑣 = (∅( linC ‘𝑀)∅)))
2724, 26anbi12d 633 . . . . . . 7 (𝑤 = ∅ → ((𝑤 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝑣 = (𝑤( linC ‘𝑀)∅)) ↔ (∅ ∈ Fin ∧ 𝑣 = (∅( linC ‘𝑀)∅))))
2827rexsng 4587 . . . . . 6 (∅ ∈ V → (∃𝑤 ∈ {∅} (𝑤 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝑣 = (𝑤( linC ‘𝑀)∅)) ↔ (∅ ∈ Fin ∧ 𝑣 = (∅( linC ‘𝑀)∅))))
2917, 28mp1i 13 . . . . 5 ((𝑀 ∈ Mnd ∧ 𝑣 ∈ (Base‘𝑀)) → (∃𝑤 ∈ {∅} (𝑤 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝑣 = (𝑤( linC ‘𝑀)∅)) ↔ (∅ ∈ Fin ∧ 𝑣 = (∅( linC ‘𝑀)∅))))
3022a1i 11 . . . . . 6 ((𝑀 ∈ Mnd ∧ 𝑣 ∈ (Base‘𝑀)) → ∅ ∈ Fin)
3130biantrurd 536 . . . . 5 ((𝑀 ∈ Mnd ∧ 𝑣 ∈ (Base‘𝑀)) → (𝑣 = (0g𝑀) ↔ (∅ ∈ Fin ∧ 𝑣 = (0g𝑀))))
3216, 29, 313bitr4d 314 . . . 4 ((𝑀 ∈ Mnd ∧ 𝑣 ∈ (Base‘𝑀)) → (∃𝑤 ∈ {∅} (𝑤 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝑣 = (𝑤( linC ‘𝑀)∅)) ↔ 𝑣 = (0g𝑀)))
3312, 32bitrd 282 . . 3 ((𝑀 ∈ Mnd ∧ 𝑣 ∈ (Base‘𝑀)) → (∃𝑤 ∈ ((Base‘(Scalar‘𝑀)) ↑m ∅)(𝑤 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝑣 = (𝑤( linC ‘𝑀)∅)) ↔ 𝑣 = (0g𝑀)))
3433rabbidva 3455 . 2 (𝑀 ∈ Mnd → {𝑣 ∈ (Base‘𝑀) ∣ ∃𝑤 ∈ ((Base‘(Scalar‘𝑀)) ↑m ∅)(𝑤 finSupp (0g‘(Scalar‘𝑀)) ∧ 𝑣 = (𝑤( linC ‘𝑀)∅))} = {𝑣 ∈ (Base‘𝑀) ∣ 𝑣 = (0g𝑀)})
35 eqid 2821 . . . 4 (0g𝑀) = (0g𝑀)
362, 35mndidcl 17905 . . 3 (𝑀 ∈ Mnd → (0g𝑀) ∈ (Base‘𝑀))
37 rabsn 4630 . . 3 ((0g𝑀) ∈ (Base‘𝑀) → {𝑣 ∈ (Base‘𝑀) ∣ 𝑣 = (0g𝑀)} = {(0g𝑀)})
3836, 37syl 17 . 2 (𝑀 ∈ Mnd → {𝑣 ∈ (Base‘𝑀) ∣ 𝑣 = (0g𝑀)} = {(0g𝑀)})
396, 34, 383eqtrd 2860 1 (𝑀 ∈ Mnd → (𝑀 LinCo ∅) = {(0g𝑀)})
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   = wceq 1538   ∈ wcel 2115  ∃wrex 3127  {crab 3130  Vcvv 3471  ∅c0 4266  𝒫 cpw 4512  {csn 4540   class class class wbr 5039  ‘cfv 6328  (class class class)co 7130  1oc1o 8070   ↑m cmap 8381  Fincfn 8484   finSupp cfsupp 8809  Basecbs 16462  Scalarcsca 16547  0gc0g 16692  Mndcmnd 17890   linC clinc 44635   LinCo clinco 44636 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2178  ax-ext 2793  ax-rep 5163  ax-sep 5176  ax-nul 5183  ax-pow 5239  ax-pr 5303  ax-un 7436 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2071  df-mo 2623  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2892  df-nfc 2960  df-ne 3008  df-ral 3131  df-rex 3132  df-reu 3133  df-rmo 3134  df-rab 3135  df-v 3473  df-sbc 3750  df-csb 3858  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-pss 3929  df-nul 4267  df-if 4441  df-pw 4514  df-sn 4541  df-pr 4543  df-tp 4545  df-op 4547  df-uni 4812  df-iun 4894  df-br 5040  df-opab 5102  df-mpt 5120  df-tr 5146  df-id 5433  df-eprel 5438  df-po 5447  df-so 5448  df-fr 5487  df-we 5489  df-xp 5534  df-rel 5535  df-cnv 5536  df-co 5537  df-dm 5538  df-rn 5539  df-res 5540  df-ima 5541  df-pred 6121  df-ord 6167  df-on 6168  df-lim 6169  df-suc 6170  df-iota 6287  df-fun 6330  df-fn 6331  df-f 6332  df-f1 6333  df-fo 6334  df-f1o 6335  df-fv 6336  df-riota 7088  df-ov 7133  df-oprab 7134  df-mpo 7135  df-om 7556  df-1st 7664  df-2nd 7665  df-supp 7806  df-wrecs 7922  df-recs 7983  df-rdg 8021  df-1o 8077  df-map 8383  df-en 8485  df-fin 8488  df-fsupp 8810  df-seq 13353  df-0g 16694  df-gsum 16695  df-mgm 17831  df-sgrp 17880  df-mnd 17891  df-linc 44637  df-lco 44638 This theorem is referenced by:  lcoel0  44659
 Copyright terms: Public domain W3C validator