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

Theorem lsppropd 21065
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 2798 . . . 4 (𝜑 → (Base‘𝐾) = (Base‘𝐿))
43pweqd 4571 . . 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 21064 . . . . 5 (𝜑 → (LSubSp‘𝐾) = (LSubSp‘𝐿))
1211rabeqdv 3428 . . . 4 (𝜑 → {𝑡 ∈ (LSubSp‘𝐾) ∣ 𝑠𝑡} = {𝑡 ∈ (LSubSp‘𝐿) ∣ 𝑠𝑡})
1312inteqd 4909 . . 3 (𝜑 {𝑡 ∈ (LSubSp‘𝐾) ∣ 𝑠𝑡} = {𝑡 ∈ (LSubSp‘𝐿) ∣ 𝑠𝑡})
144, 13mpteq12dv 5186 . 2 (𝜑 → (𝑠 ∈ 𝒫 (Base‘𝐾) ↦ {𝑡 ∈ (LSubSp‘𝐾) ∣ 𝑠𝑡}) = (𝑠 ∈ 𝒫 (Base‘𝐿) ↦ {𝑡 ∈ (LSubSp‘𝐿) ∣ 𝑠𝑡}))
15 lsppropd.v1 . . 3 (𝜑𝐾𝑋)
16 eqid 2761 . . . 4 (Base‘𝐾) = (Base‘𝐾)
17 eqid 2761 . . . 4 (LSubSp‘𝐾) = (LSubSp‘𝐾)
18 eqid 2761 . . . 4 (LSpan‘𝐾) = (LSpan‘𝐾)
1916, 17, 18lspfval 21020 . . 3 (𝐾𝑋 → (LSpan‘𝐾) = (𝑠 ∈ 𝒫 (Base‘𝐾) ↦ {𝑡 ∈ (LSubSp‘𝐾) ∣ 𝑠𝑡}))
2015, 19syl 17 . 2 (𝜑 → (LSpan‘𝐾) = (𝑠 ∈ 𝒫 (Base‘𝐾) ↦ {𝑡 ∈ (LSubSp‘𝐾) ∣ 𝑠𝑡}))
21 lsppropd.v2 . . 3 (𝜑𝐿𝑌)
22 eqid 2761 . . . 4 (Base‘𝐿) = (Base‘𝐿)
23 eqid 2761 . . . 4 (LSubSp‘𝐿) = (LSubSp‘𝐿)
24 eqid 2761 . . . 4 (LSpan‘𝐿) = (LSpan‘𝐿)
2522, 23, 24lspfval 21020 . . 3 (𝐿𝑌 → (LSpan‘𝐿) = (𝑠 ∈ 𝒫 (Base‘𝐿) ↦ {𝑡 ∈ (LSubSp‘𝐿) ∣ 𝑠𝑡}))
2621, 25syl 17 . 2 (𝜑 → (LSpan‘𝐿) = (𝑠 ∈ 𝒫 (Base‘𝐿) ↦ {𝑡 ∈ (LSubSp‘𝐿) ∣ 𝑠𝑡}))
2714, 20, 263eqtr4d 2806 1 (𝜑 → (LSpan‘𝐾) = (LSpan‘𝐿))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1559  wcel 2141  {crab 3413  wss 3904  𝒫 cpw 4554   cint 4904  cmpt 5180  cfv 6517  (class class class)co 7392  Basecbs 17228  +gcplusg 17269  Scalarcsca 17272   ·𝑠 cvsca 17273  LSubSpclss 20978  LSpanclspn 21018
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5226  ax-sep 5245  ax-nul 5255  ax-pow 5321  ax-pr 5389
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-int 4905  df-iun 4950  df-br 5100  df-opab 5162  df-mpt 5181  df-id 5540  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-rn 5656  df-res 5657  df-ima 5658  df-iota 6473  df-fun 6519  df-fn 6520  df-f 6521  df-f1 6522  df-fo 6523  df-f1o 6524  df-fv 6525  df-ov 7395  df-lss 20979  df-lsp 21019
This theorem is referenced by:  lbspropd  21146  lidlrsppropd  21294  lindfpropd  33529
  Copyright terms: Public domain W3C validator