MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  lspextmo Structured version   Visualization version   GIF version

Theorem lspextmo 21014
Description: A linear function is completely determined (or overdetermined) by its values on a spanning subset. (Contributed by Stefan O'Rear, 7-Mar-2015.) (Revised by NM, 17-Jun-2017.)
Hypotheses
Ref Expression
lspextmo.b 𝐵 = (Base‘𝑆)
lspextmo.k 𝐾 = (LSpan‘𝑆)
Assertion
Ref Expression
lspextmo ((𝑋𝐵 ∧ (𝐾𝑋) = 𝐵) → ∃*𝑔 ∈ (𝑆 LMHom 𝑇)(𝑔𝑋) = 𝐹)
Distinct variable groups:   𝐵,𝑔   𝑔,𝐹   𝑔,𝐾   𝑆,𝑔   𝑇,𝑔   𝑔,𝑋

Proof of Theorem lspextmo
Dummy variable is distinct from all other variables.
StepHypRef Expression
1 eqtr3 2757 . . . 4 (((𝑔𝑋) = 𝐹 ∧ (𝑋) = 𝐹) → (𝑔𝑋) = (𝑋))
2 inss1 4212 . . . . . . . . 9 (𝑔) ⊆ 𝑔
3 dmss 5882 . . . . . . . . 9 ((𝑔) ⊆ 𝑔 → dom (𝑔) ⊆ dom 𝑔)
42, 3ax-mp 5 . . . . . . . 8 dom (𝑔) ⊆ dom 𝑔
5 lspextmo.b . . . . . . . . . . . . 13 𝐵 = (Base‘𝑆)
6 eqid 2735 . . . . . . . . . . . . 13 (Base‘𝑇) = (Base‘𝑇)
75, 6lmhmf 20992 . . . . . . . . . . . 12 (𝑔 ∈ (𝑆 LMHom 𝑇) → 𝑔:𝐵⟶(Base‘𝑇))
87ad2antrl 728 . . . . . . . . . . 11 (((𝑋𝐵 ∧ (𝐾𝑋) = 𝐵) ∧ (𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ∈ (𝑆 LMHom 𝑇))) → 𝑔:𝐵⟶(Base‘𝑇))
98ffnd 6707 . . . . . . . . . 10 (((𝑋𝐵 ∧ (𝐾𝑋) = 𝐵) ∧ (𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ∈ (𝑆 LMHom 𝑇))) → 𝑔 Fn 𝐵)
109adantrr 717 . . . . . . . . 9 (((𝑋𝐵 ∧ (𝐾𝑋) = 𝐵) ∧ ((𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ∈ (𝑆 LMHom 𝑇)) ∧ 𝑋 ⊆ dom (𝑔))) → 𝑔 Fn 𝐵)
1110fndmd 6643 . . . . . . . 8 (((𝑋𝐵 ∧ (𝐾𝑋) = 𝐵) ∧ ((𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ∈ (𝑆 LMHom 𝑇)) ∧ 𝑋 ⊆ dom (𝑔))) → dom 𝑔 = 𝐵)
124, 11sseqtrid 4001 . . . . . . 7 (((𝑋𝐵 ∧ (𝐾𝑋) = 𝐵) ∧ ((𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ∈ (𝑆 LMHom 𝑇)) ∧ 𝑋 ⊆ dom (𝑔))) → dom (𝑔) ⊆ 𝐵)
13 simplr 768 . . . . . . . 8 (((𝑋𝐵 ∧ (𝐾𝑋) = 𝐵) ∧ ((𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ∈ (𝑆 LMHom 𝑇)) ∧ 𝑋 ⊆ dom (𝑔))) → (𝐾𝑋) = 𝐵)
14 lmhmlmod1 20991 . . . . . . . . . . 11 (𝑔 ∈ (𝑆 LMHom 𝑇) → 𝑆 ∈ LMod)
1514adantr 480 . . . . . . . . . 10 ((𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ∈ (𝑆 LMHom 𝑇)) → 𝑆 ∈ LMod)
1615ad2antrl 728 . . . . . . . . 9 (((𝑋𝐵 ∧ (𝐾𝑋) = 𝐵) ∧ ((𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ∈ (𝑆 LMHom 𝑇)) ∧ 𝑋 ⊆ dom (𝑔))) → 𝑆 ∈ LMod)
17 eqid 2735 . . . . . . . . . . 11 (LSubSp‘𝑆) = (LSubSp‘𝑆)
1817lmhmeql 21013 . . . . . . . . . 10 ((𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ∈ (𝑆 LMHom 𝑇)) → dom (𝑔) ∈ (LSubSp‘𝑆))
1918ad2antrl 728 . . . . . . . . 9 (((𝑋𝐵 ∧ (𝐾𝑋) = 𝐵) ∧ ((𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ∈ (𝑆 LMHom 𝑇)) ∧ 𝑋 ⊆ dom (𝑔))) → dom (𝑔) ∈ (LSubSp‘𝑆))
20 simprr 772 . . . . . . . . 9 (((𝑋𝐵 ∧ (𝐾𝑋) = 𝐵) ∧ ((𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ∈ (𝑆 LMHom 𝑇)) ∧ 𝑋 ⊆ dom (𝑔))) → 𝑋 ⊆ dom (𝑔))
21 lspextmo.k . . . . . . . . . 10 𝐾 = (LSpan‘𝑆)
2217, 21lspssp 20945 . . . . . . . . 9 ((𝑆 ∈ LMod ∧ dom (𝑔) ∈ (LSubSp‘𝑆) ∧ 𝑋 ⊆ dom (𝑔)) → (𝐾𝑋) ⊆ dom (𝑔))
2316, 19, 20, 22syl3anc 1373 . . . . . . . 8 (((𝑋𝐵 ∧ (𝐾𝑋) = 𝐵) ∧ ((𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ∈ (𝑆 LMHom 𝑇)) ∧ 𝑋 ⊆ dom (𝑔))) → (𝐾𝑋) ⊆ dom (𝑔))
2413, 23eqsstrrd 3994 . . . . . . 7 (((𝑋𝐵 ∧ (𝐾𝑋) = 𝐵) ∧ ((𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ∈ (𝑆 LMHom 𝑇)) ∧ 𝑋 ⊆ dom (𝑔))) → 𝐵 ⊆ dom (𝑔))
2512, 24eqssd 3976 . . . . . 6 (((𝑋𝐵 ∧ (𝐾𝑋) = 𝐵) ∧ ((𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ∈ (𝑆 LMHom 𝑇)) ∧ 𝑋 ⊆ dom (𝑔))) → dom (𝑔) = 𝐵)
2625expr 456 . . . . 5 (((𝑋𝐵 ∧ (𝐾𝑋) = 𝐵) ∧ (𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ∈ (𝑆 LMHom 𝑇))) → (𝑋 ⊆ dom (𝑔) → dom (𝑔) = 𝐵))
27 simprr 772 . . . . . . 7 (((𝑋𝐵 ∧ (𝐾𝑋) = 𝐵) ∧ (𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ∈ (𝑆 LMHom 𝑇))) → ∈ (𝑆 LMHom 𝑇))
285, 6lmhmf 20992 . . . . . . 7 ( ∈ (𝑆 LMHom 𝑇) → :𝐵⟶(Base‘𝑇))
29 ffn 6706 . . . . . . 7 (:𝐵⟶(Base‘𝑇) → Fn 𝐵)
3027, 28, 293syl 18 . . . . . 6 (((𝑋𝐵 ∧ (𝐾𝑋) = 𝐵) ∧ (𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ∈ (𝑆 LMHom 𝑇))) → Fn 𝐵)
31 simpll 766 . . . . . 6 (((𝑋𝐵 ∧ (𝐾𝑋) = 𝐵) ∧ (𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ∈ (𝑆 LMHom 𝑇))) → 𝑋𝐵)
32 fnreseql 7038 . . . . . 6 ((𝑔 Fn 𝐵 Fn 𝐵𝑋𝐵) → ((𝑔𝑋) = (𝑋) ↔ 𝑋 ⊆ dom (𝑔)))
339, 30, 31, 32syl3anc 1373 . . . . 5 (((𝑋𝐵 ∧ (𝐾𝑋) = 𝐵) ∧ (𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ∈ (𝑆 LMHom 𝑇))) → ((𝑔𝑋) = (𝑋) ↔ 𝑋 ⊆ dom (𝑔)))
34 fneqeql 7036 . . . . . 6 ((𝑔 Fn 𝐵 Fn 𝐵) → (𝑔 = ↔ dom (𝑔) = 𝐵))
359, 30, 34syl2anc 584 . . . . 5 (((𝑋𝐵 ∧ (𝐾𝑋) = 𝐵) ∧ (𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ∈ (𝑆 LMHom 𝑇))) → (𝑔 = ↔ dom (𝑔) = 𝐵))
3626, 33, 353imtr4d 294 . . . 4 (((𝑋𝐵 ∧ (𝐾𝑋) = 𝐵) ∧ (𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ∈ (𝑆 LMHom 𝑇))) → ((𝑔𝑋) = (𝑋) → 𝑔 = ))
371, 36syl5 34 . . 3 (((𝑋𝐵 ∧ (𝐾𝑋) = 𝐵) ∧ (𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ∈ (𝑆 LMHom 𝑇))) → (((𝑔𝑋) = 𝐹 ∧ (𝑋) = 𝐹) → 𝑔 = ))
3837ralrimivva 3187 . 2 ((𝑋𝐵 ∧ (𝐾𝑋) = 𝐵) → ∀𝑔 ∈ (𝑆 LMHom 𝑇)∀ ∈ (𝑆 LMHom 𝑇)(((𝑔𝑋) = 𝐹 ∧ (𝑋) = 𝐹) → 𝑔 = ))
39 reseq1 5960 . . . 4 (𝑔 = → (𝑔𝑋) = (𝑋))
4039eqeq1d 2737 . . 3 (𝑔 = → ((𝑔𝑋) = 𝐹 ↔ (𝑋) = 𝐹))
4140rmo4 3713 . 2 (∃*𝑔 ∈ (𝑆 LMHom 𝑇)(𝑔𝑋) = 𝐹 ↔ ∀𝑔 ∈ (𝑆 LMHom 𝑇)∀ ∈ (𝑆 LMHom 𝑇)(((𝑔𝑋) = 𝐹 ∧ (𝑋) = 𝐹) → 𝑔 = ))
4238, 41sylibr 234 1 ((𝑋𝐵 ∧ (𝐾𝑋) = 𝐵) → ∃*𝑔 ∈ (𝑆 LMHom 𝑇)(𝑔𝑋) = 𝐹)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1540  wcel 2108  wral 3051  ∃*wrmo 3358  cin 3925  wss 3926  dom cdm 5654  cres 5656   Fn wfn 6526  wf 6527  cfv 6531  (class class class)co 7405  Basecbs 17228  LModclmod 20817  LSubSpclss 20888  LSpanclspn 20928   LMHom clmhm 20977
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-rep 5249  ax-sep 5266  ax-nul 5276  ax-pow 5335  ax-pr 5402  ax-un 7729  ax-cnex 11185  ax-resscn 11186  ax-1cn 11187  ax-icn 11188  ax-addcl 11189  ax-addrcl 11190  ax-mulcl 11191  ax-mulrcl 11192  ax-mulcom 11193  ax-addass 11194  ax-mulass 11195  ax-distr 11196  ax-i2m1 11197  ax-1ne0 11198  ax-1rid 11199  ax-rnegex 11200  ax-rrecex 11201  ax-cnre 11202  ax-pre-lttri 11203  ax-pre-lttrn 11204  ax-pre-ltadd 11205  ax-pre-mulgt0 11206
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3061  df-rmo 3359  df-reu 3360  df-rab 3416  df-v 3461  df-sbc 3766  df-csb 3875  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-pss 3946  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-int 4923  df-iun 4969  df-br 5120  df-opab 5182  df-mpt 5202  df-tr 5230  df-id 5548  df-eprel 5553  df-po 5561  df-so 5562  df-fr 5606  df-we 5608  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-pred 6290  df-ord 6355  df-on 6356  df-lim 6357  df-suc 6358  df-iota 6484  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-riota 7362  df-ov 7408  df-oprab 7409  df-mpo 7410  df-om 7862  df-1st 7988  df-2nd 7989  df-frecs 8280  df-wrecs 8311  df-recs 8385  df-rdg 8424  df-er 8719  df-map 8842  df-en 8960  df-dom 8961  df-sdom 8962  df-pnf 11271  df-mnf 11272  df-xr 11273  df-ltxr 11274  df-le 11275  df-sub 11468  df-neg 11469  df-nn 12241  df-2 12303  df-sets 17183  df-slot 17201  df-ndx 17213  df-base 17229  df-ress 17252  df-plusg 17284  df-0g 17455  df-mgm 18618  df-sgrp 18697  df-mnd 18713  df-mhm 18761  df-submnd 18762  df-grp 18919  df-minusg 18920  df-sbg 18921  df-subg 19106  df-ghm 19196  df-mgp 20101  df-ur 20142  df-ring 20195  df-lmod 20819  df-lss 20889  df-lsp 20929  df-lmhm 20980
This theorem is referenced by:  frlmup4  21761
  Copyright terms: Public domain W3C validator