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

Theorem lspextmo 21382
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 2785 . . . 4 (((𝑔 ↾ 𝑋) = 𝐹 ∧ (ℎ ↾ 𝑋) = 𝐹) → (𝑔 ↾ 𝑋) = (ℎ ↾ 𝑋))
2 inss1 4136 . . . . . . . . 9 (𝑔 ∩ ℎ) ⊆ 𝑔
3 dmss 5896 . . . . . . . . 9 ((𝑔 ∩ ℎ) ⊆ 𝑔 → dom (𝑔 ∩ ℎ) ⊆ dom 𝑔)
42, 3ax-mp 5 . . . . . . . 8 dom (𝑔 ∩ ℎ) ⊆ dom 𝑔
5 lspextmo.b . . . . . . . . . . . . 13 𝐵 = (Base‘𝑆)
6 eqid 2763 . . . . . . . . . . . . 13 (Base‘𝑇) = (Base‘𝑇)
75, 6lmhmf 21360 . . . . . . . . . . . 12 (𝑔 ∈ (𝑆 LMHom 𝑇) → 𝑔:𝐵⟶(Base‘𝑇))
87ad2antrl 741 . . . . . . . . . . 11 (((𝑋 ⊆ 𝐵 ∧ (𝐾‘𝑋) = 𝐵) ∧ (𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ℎ ∈ (𝑆 LMHom 𝑇))) → 𝑔:𝐵⟶(Base‘𝑇))
98ffnd 6740 . . . . . . . . . 10 (((𝑋 ⊆ 𝐵 ∧ (𝐾‘𝑋) = 𝐵) ∧ (𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ℎ ∈ (𝑆 LMHom 𝑇))) → 𝑔 Fn 𝐵)
109adantrr 730 . . . . . . . . 9 (((𝑋 ⊆ 𝐵 ∧ (𝐾‘𝑋) = 𝐵) ∧ ((𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ℎ ∈ (𝑆 LMHom 𝑇)) ∧ 𝑋 ⊆ dom (𝑔 ∩ ℎ))) → 𝑔 Fn 𝐵)
1110fndmd 6674 . . . . . . . 8 (((𝑋 ⊆ 𝐵 ∧ (𝐾‘𝑋) = 𝐵) ∧ ((𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ℎ ∈ (𝑆 LMHom 𝑇)) ∧ 𝑋 ⊆ dom (𝑔 ∩ ℎ))) → dom 𝑔 = 𝐵)
124, 11sseqtrid 3955 . . . . . . 7 (((𝑋 ⊆ 𝐵 ∧ (𝐾‘𝑋) = 𝐵) ∧ ((𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ℎ ∈ (𝑆 LMHom 𝑇)) ∧ 𝑋 ⊆ dom (𝑔 ∩ ℎ))) → dom (𝑔 ∩ ℎ) ⊆ 𝐵)
13 simplr 781 . . . . . . . 8 (((𝑋 ⊆ 𝐵 ∧ (𝐾‘𝑋) = 𝐵) ∧ ((𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ℎ ∈ (𝑆 LMHom 𝑇)) ∧ 𝑋 ⊆ dom (𝑔 ∩ ℎ))) → (𝐾‘𝑋) = 𝐵)
14 lmhmlmod1 21359 . . . . . . . . . . 11 (𝑔 ∈ (𝑆 LMHom 𝑇) → 𝑆 ∈ LMod)
1514adantr 486 . . . . . . . . . 10 ((𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ℎ ∈ (𝑆 LMHom 𝑇)) → 𝑆 ∈ LMod)
1615ad2antrl 741 . . . . . . . . 9 (((𝑋 ⊆ 𝐵 ∧ (𝐾‘𝑋) = 𝐵) ∧ ((𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ℎ ∈ (𝑆 LMHom 𝑇)) ∧ 𝑋 ⊆ dom (𝑔 ∩ ℎ))) → 𝑆 ∈ LMod)
17 eqid 2763 . . . . . . . . . . 11 (LSubSp‘𝑆) = (LSubSp‘𝑆)
1817lmhmeql 21381 . . . . . . . . . 10 ((𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ℎ ∈ (𝑆 LMHom 𝑇)) → dom (𝑔 ∩ ℎ) ∈ (LSubSp‘𝑆))
1918ad2antrl 741 . . . . . . . . 9 (((𝑋 ⊆ 𝐵 ∧ (𝐾‘𝑋) = 𝐵) ∧ ((𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ℎ ∈ (𝑆 LMHom 𝑇)) ∧ 𝑋 ⊆ dom (𝑔 ∩ ℎ))) → dom (𝑔 ∩ ℎ) ∈ (LSubSp‘𝑆))
20 simprr 785 . . . . . . . . 9 (((𝑋 ⊆ 𝐵 ∧ (𝐾‘𝑋) = 𝐵) ∧ ((𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ℎ ∈ (𝑆 LMHom 𝑇)) ∧ 𝑋 ⊆ dom (𝑔 ∩ ℎ))) → 𝑋 ⊆ dom (𝑔 ∩ ℎ))
21 lspextmo.k . . . . . . . . . 10 𝐾 = (LSpan‘𝑆)
2217, 21lspssp 21314 . . . . . . . . 9 ((𝑆 ∈ LMod ∧ dom (𝑔 ∩ ℎ) ∈ (LSubSp‘𝑆) ∧ 𝑋 ⊆ dom (𝑔 ∩ ℎ)) → (𝐾‘𝑋) ⊆ dom (𝑔 ∩ ℎ))
2316, 19, 20, 22syl3anc 1399 . . . . . . . 8 (((𝑋 ⊆ 𝐵 ∧ (𝐾‘𝑋) = 𝐵) ∧ ((𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ℎ ∈ (𝑆 LMHom 𝑇)) ∧ 𝑋 ⊆ dom (𝑔 ∩ ℎ))) → (𝐾‘𝑋) ⊆ dom (𝑔 ∩ ℎ))
2413, 23eqsstrrd 3948 . . . . . . 7 (((𝑋 ⊆ 𝐵 ∧ (𝐾‘𝑋) = 𝐵) ∧ ((𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ℎ ∈ (𝑆 LMHom 𝑇)) ∧ 𝑋 ⊆ dom (𝑔 ∩ ℎ))) → 𝐵 ⊆ dom (𝑔 ∩ ℎ))
2512, 24eqssd 3930 . . . . . 6 (((𝑋 ⊆ 𝐵 ∧ (𝐾‘𝑋) = 𝐵) ∧ ((𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ℎ ∈ (𝑆 LMHom 𝑇)) ∧ 𝑋 ⊆ dom (𝑔 ∩ ℎ))) → dom (𝑔 ∩ ℎ) = 𝐵)
2625expr 462 . . . . 5 (((𝑋 ⊆ 𝐵 ∧ (𝐾‘𝑋) = 𝐵) ∧ (𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ℎ ∈ (𝑆 LMHom 𝑇))) → (𝑋 ⊆ dom (𝑔 ∩ ℎ) → dom (𝑔 ∩ ℎ) = 𝐵))
27 simprr 785 . . . . . . 7 (((𝑋 ⊆ 𝐵 ∧ (𝐾‘𝑋) = 𝐵) ∧ (𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ℎ ∈ (𝑆 LMHom 𝑇))) → ℎ ∈ (𝑆 LMHom 𝑇))
285, 6lmhmf 21360 . . . . . . 7 (ℎ ∈ (𝑆 LMHom 𝑇) → ℎ:𝐵⟶(Base‘𝑇))
29 ffn 6739 . . . . . . 7 (ℎ:𝐵⟶(Base‘𝑇) → ℎ Fn 𝐵)
3027, 28, 293syl 19 . . . . . 6 (((𝑋 ⊆ 𝐵 ∧ (𝐾‘𝑋) = 𝐵) ∧ (𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ℎ ∈ (𝑆 LMHom 𝑇))) → ℎ Fn 𝐵)
31 simpll 779 . . . . . 6 (((𝑋 ⊆ 𝐵 ∧ (𝐾‘𝑋) = 𝐵) ∧ (𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ℎ ∈ (𝑆 LMHom 𝑇))) → 𝑋 ⊆ 𝐵)
32 fnreseql 7078 . . . . . 6 ((𝑔 Fn 𝐵 ∧ ℎ Fn 𝐵 ∧ 𝑋 ⊆ 𝐵) → ((𝑔 ↾ 𝑋) = (ℎ ↾ 𝑋) ↔ 𝑋 ⊆ dom (𝑔 ∩ ℎ)))
339, 30, 31, 32syl3anc 1399 . . . . 5 (((𝑋 ⊆ 𝐵 ∧ (𝐾‘𝑋) = 𝐵) ∧ (𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ℎ ∈ (𝑆 LMHom 𝑇))) → ((𝑔 ↾ 𝑋) = (ℎ ↾ 𝑋) ↔ 𝑋 ⊆ dom (𝑔 ∩ ℎ)))
34 fneqeql 7076 . . . . . 6 ((𝑔 Fn 𝐵 ∧ ℎ Fn 𝐵) → (𝑔 = ℎ ↔ dom (𝑔 ∩ ℎ) = 𝐵))
359, 30, 34syl2anc 596 . . . . 5 (((𝑋 ⊆ 𝐵 ∧ (𝐾‘𝑋) = 𝐵) ∧ (𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ℎ ∈ (𝑆 LMHom 𝑇))) → (𝑔 = ℎ ↔ dom (𝑔 ∩ ℎ) = 𝐵))
3626, 33, 353imtr4d 297 . . . 4 (((𝑋 ⊆ 𝐵 ∧ (𝐾‘𝑋) = 𝐵) ∧ (𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ℎ ∈ (𝑆 LMHom 𝑇))) → ((𝑔 ↾ 𝑋) = (ℎ ↾ 𝑋) → 𝑔 = ℎ))
371, 36syl5 35 . . 3 (((𝑋 ⊆ 𝐵 ∧ (𝐾‘𝑋) = 𝐵) ∧ (𝑔 ∈ (𝑆 LMHom 𝑇) ∧ ℎ ∈ (𝑆 LMHom 𝑇))) → (((𝑔 ↾ 𝑋) = 𝐹 ∧ (ℎ ↾ 𝑋) = 𝐹) → 𝑔 = ℎ))
3837ralrimivva 3209 . 2 ((𝑋 ⊆ 𝐵 ∧ (𝐾‘𝑋) = 𝐵) → ∀𝑔 ∈ (𝑆 LMHom 𝑇)∀ℎ ∈ (𝑆 LMHom 𝑇)(((𝑔 ↾ 𝑋) = 𝐹 ∧ (ℎ ↾ 𝑋) = 𝐹) → 𝑔 = ℎ))
39 reseq1 5980 . . . 4 (𝑔 = ℎ → (𝑔 ↾ 𝑋) = (ℎ ↾ 𝑋))
4039eqeq1d 2765 . . 3 (𝑔 = ℎ → ((𝑔 ↾ 𝑋) = 𝐹 ↔ (ℎ ↾ 𝑋) = 𝐹))
4140rmo4 3691 . 2 (∃*𝑔 ∈ (𝑆 LMHom 𝑇)(𝑔 ↾ 𝑋) = 𝐹 ↔ ∀𝑔 ∈ (𝑆 LMHom 𝑇)∀ℎ ∈ (𝑆 LMHom 𝑇)(((𝑔 ↾ 𝑋) = 𝐹 ∧ (ℎ ↾ 𝑋) = 𝐹) → 𝑔 = ℎ))
4238, 41sylibr 237 1 ((𝑋 ⊆ 𝐵 ∧ (𝐾‘𝑋) = 𝐵) → ∃*𝑔 ∈ (𝑆 LMHom 𝑇)(𝑔 ↾ 𝑋) = 𝐹)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃*wrmo 3368   ⊆ wss 3900   ∩ cin 4092  dom cdm 5658   ↾ cres 5660   Fn wfn 6561  ⟶wf 6562  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  LModclmod 21186  LSubSpclss 21257  LSpanclspn 21297   LMHom clmhm 21345
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-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-cnex 11295  ax-resscn 11296  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-addrcl 11300  ax-mulcl 11301  ax-mulrcl 11302  ax-mulcom 11303  ax-addass 11304  ax-mulass 11305  ax-distr 11306  ax-i2m1 11307  ax-1ne0 11308  ax-1rid 11309  ax-rnegex 11310  ax-rrecex 11311  ax-cnre 11312  ax-pre-lttri 11313  ax-pre-lttrn 11314  ax-pre-ltadd 11315  ax-pre-mulgt0 11316
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  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-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  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-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-er 8755  df-map 8887  df-en 9012  df-dom 9013  df-sdom 9014  df-pnf 11384  df-mnf 11385  df-xr 11386  df-ltxr 11387  df-le 11388  df-sub 11582  df-neg 11583  df-nn 12376  df-2 12445  df-sets 17386  df-slot 17404  df-ndx 17416  df-base 17432  df-ress 17453  df-plusg 17486  df-0g 17662  df-mgm 18866  df-sgrp 18958  df-mnd 18974  df-mhm 19028  df-submnd 19029  df-grp 19197  df-minusg 19198  df-sbg 19199  df-subg 19383  df-ghm 19478  df-mgp 20412  df-ur 20459  df-ring 20512  df-lmod 21188  df-lss 21258  df-lsp 21298  df-lmhm 21348
This theorem is used by:  frlmup4  22162
  Copyright terms: Public domain W3C validator