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

Theorem lsppropd 21326
Description: If two structures have the same components (properties), they have the same span function. (Contributed by Mario Carneiro, 9-Feb-2015.) (Revised by Mario Carneiro, 14-Jun-2015.) (Revised by AV, 24-Apr-2024.)
Hypotheses
Ref Expression
lsspropd.b1 (𝜑 → 𝐵 = (Base‘𝐾))
lsspropd.b2 (𝜑 → 𝐵 = (Base‘𝐿))
lsspropd.w (𝜑 → 𝐵 ⊆ 𝑊)
lsspropd.p ((𝜑 ∧ (𝑥 ∈ 𝑊 ∧ 𝑦 ∈ 𝑊)) → (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦))
lsspropd.s1 ((𝜑 ∧ (𝑥 ∈ 𝑃 ∧ 𝑦 ∈ 𝐵)) → (𝑥( ·𝑠 ‘𝐾)𝑦) ∈ 𝑊)
lsspropd.s2 ((𝜑 ∧ (𝑥 ∈ 𝑃 ∧ 𝑦 ∈ 𝐵)) → (𝑥( ·𝑠 ‘𝐾)𝑦) = (𝑥( ·𝑠 ‘𝐿)𝑦))
lsspropd.p1 (𝜑 → 𝑃 = (Base‘(Scalar‘𝐾)))
lsspropd.p2 (𝜑 → 𝑃 = (Base‘(Scalar‘𝐿)))
lsppropd.v1 (𝜑 → 𝐾 ∈ 𝑋)
lsppropd.v2 (𝜑 → 𝐿 ∈ 𝑌)
Assertion
Ref Expression
lsppropd (𝜑 → (LSpan‘𝐾) = (LSpan‘𝐿))
Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝐾,𝑦   𝜑,𝑥,𝑦   𝑥,𝑊,𝑦   𝑥,𝐿,𝑦   𝑥,𝑃,𝑦
Allowed substitution hints:   𝑋(𝑥, 𝑦)   𝑌(𝑥, 𝑦)

Proof of Theorem lsppropd
Dummy variables 𝑠 𝑡 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 lsspropd.b1 . . . . 5 (𝜑 → 𝐵 = (Base‘𝐾))
2 lsspropd.b2 . . . . 5 (𝜑 → 𝐵 = (Base‘𝐿))
31, 2eqtr3d 2800 . . . 4 (𝜑 → (Base‘𝐾) = (Base‘𝐿))
43pweqd 4577 . . 3 (𝜑 → 𝒫 (Base‘𝐾) = 𝒫 (Base‘𝐿))
5 lsspropd.w . . . . . 6 (𝜑 → 𝐵 ⊆ 𝑊)
6 lsspropd.p . . . . . 6 ((𝜑 ∧ (𝑥 ∈ 𝑊 ∧ 𝑦 ∈ 𝑊)) → (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦))
7 lsspropd.s1 . . . . . 6 ((𝜑 ∧ (𝑥 ∈ 𝑃 ∧ 𝑦 ∈ 𝐵)) → (𝑥( ·𝑠 ‘𝐾)𝑦) ∈ 𝑊)
8 lsspropd.s2 . . . . . 6 ((𝜑 ∧ (𝑥 ∈ 𝑃 ∧ 𝑦 ∈ 𝐵)) → (𝑥( ·𝑠 ‘𝐾)𝑦) = (𝑥( ·𝑠 ‘𝐿)𝑦))
9 lsspropd.p1 . . . . . 6 (𝜑 → 𝑃 = (Base‘(Scalar‘𝐾)))
10 lsspropd.p2 . . . . . 6 (𝜑 → 𝑃 = (Base‘(Scalar‘𝐿)))
111, 2, 5, 6, 7, 8, 9, 10lsspropd 21325 . . . . 5 (𝜑 → (LSubSp‘𝐾) = (LSubSp‘𝐿))
1211rabeqdv 3431 . . . 4 (𝜑 → {𝑡 ∈ (LSubSp‘𝐾) ∣ 𝑠 ⊆ 𝑡} = {𝑡 ∈ (LSubSp‘𝐿) ∣ 𝑠 ⊆ 𝑡})
1312inteqd 4915 . . 3 (𝜑 → ∩ {𝑡 ∈ (LSubSp‘𝐾) ∣ 𝑠 ⊆ 𝑡} = ∩ {𝑡 ∈ (LSubSp‘𝐿) ∣ 𝑠 ⊆ 𝑡})
144, 13mpteq12dv 5196 . 2 (𝜑 → (𝑠 ∈ 𝒫 (Base‘𝐾) ↦ ∩ {𝑡 ∈ (LSubSp‘𝐾) ∣ 𝑠 ⊆ 𝑡}) = (𝑠 ∈ 𝒫 (Base‘𝐿) ↦ ∩ {𝑡 ∈ (LSubSp‘𝐿) ∣ 𝑠 ⊆ 𝑡}))
15 lsppropd.v1 . . 3 (𝜑 → 𝐾 ∈ 𝑋)
16 eqid 2763 . . . 4 (Base‘𝐾) = (Base‘𝐾)
17 eqid 2763 . . . 4 (LSubSp‘𝐾) = (LSubSp‘𝐾)
18 eqid 2763 . . . 4 (LSpan‘𝐾) = (LSpan‘𝐾)
1916, 17, 18lspfval 21281 . . 3 (𝐾 ∈ 𝑋 → (LSpan‘𝐾) = (𝑠 ∈ 𝒫 (Base‘𝐾) ↦ ∩ {𝑡 ∈ (LSubSp‘𝐾) ∣ 𝑠 ⊆ 𝑡}))
2015, 19syl 18 . 2 (𝜑 → (LSpan‘𝐾) = (𝑠 ∈ 𝒫 (Base‘𝐾) ↦ ∩ {𝑡 ∈ (LSubSp‘𝐾) ∣ 𝑠 ⊆ 𝑡}))
21 lsppropd.v2 . . 3 (𝜑 → 𝐿 ∈ 𝑌)
22 eqid 2763 . . . 4 (Base‘𝐿) = (Base‘𝐿)
23 eqid 2763 . . . 4 (LSubSp‘𝐿) = (LSubSp‘𝐿)
24 eqid 2763 . . . 4 (LSpan‘𝐿) = (LSpan‘𝐿)
2522, 23, 24lspfval 21281 . . 3 (𝐿 ∈ 𝑌 → (LSpan‘𝐿) = (𝑠 ∈ 𝒫 (Base‘𝐿) ↦ ∩ {𝑡 ∈ (LSubSp‘𝐿) ∣ 𝑠 ⊆ 𝑡}))
2621, 25syl 18 . 2 (𝜑 → (LSpan‘𝐿) = (𝑠 ∈ 𝒫 (Base‘𝐿) ↦ ∩ {𝑡 ∈ (LSubSp‘𝐿) ∣ 𝑠 ⊆ 𝑡}))
2714, 20, 263eqtr4d 2808 1 (𝜑 → (LSpan‘𝐾) = (LSpan‘𝐿))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  {crab 3416   ⊆ wss 3900  𝒫 cpw 4560  ∩ cint 4910   ↦ cmpt 5190  ‘cfv 6561  (class class class)co 7446  Basecbs 17419  +gcplusg 17460  Scalarcsca 17463   ·𝑠 cvsca 17464  LSubSpclss 21239  LSpanclspn 21279
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 5236  ax-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396
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-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  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 4839  df-uni 4871  df-int 4911  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ov 7449  df-lss 21240  df-lsp 21280
This theorem is used by:  lbspropd  21407  lidlrsppropd  21565  lindfpropd  34021
  Copyright terms: Public domain W3C validator