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

Theorem lsppropd 20280
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 2780 . . . 4 (𝜑 → (Base‘𝐾) = (Base‘𝐿))
43pweqd 4552 . . 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 20279 . . . . 5 (𝜑 → (LSubSp‘𝐾) = (LSubSp‘𝐿))
1211rabeqdv 3419 . . . 4 (𝜑 → {𝑡 ∈ (LSubSp‘𝐾) ∣ 𝑠𝑡} = {𝑡 ∈ (LSubSp‘𝐿) ∣ 𝑠𝑡})
1312inteqd 4884 . . 3 (𝜑 {𝑡 ∈ (LSubSp‘𝐾) ∣ 𝑠𝑡} = {𝑡 ∈ (LSubSp‘𝐿) ∣ 𝑠𝑡})
144, 13mpteq12dv 5165 . 2 (𝜑 → (𝑠 ∈ 𝒫 (Base‘𝐾) ↦ {𝑡 ∈ (LSubSp‘𝐾) ∣ 𝑠𝑡}) = (𝑠 ∈ 𝒫 (Base‘𝐿) ↦ {𝑡 ∈ (LSubSp‘𝐿) ∣ 𝑠𝑡}))
15 lsppropd.v1 . . 3 (𝜑𝐾𝑋)
16 eqid 2738 . . . 4 (Base‘𝐾) = (Base‘𝐾)
17 eqid 2738 . . . 4 (LSubSp‘𝐾) = (LSubSp‘𝐾)
18 eqid 2738 . . . 4 (LSpan‘𝐾) = (LSpan‘𝐾)
1916, 17, 18lspfval 20235 . . 3 (𝐾𝑋 → (LSpan‘𝐾) = (𝑠 ∈ 𝒫 (Base‘𝐾) ↦ {𝑡 ∈ (LSubSp‘𝐾) ∣ 𝑠𝑡}))
2015, 19syl 17 . 2 (𝜑 → (LSpan‘𝐾) = (𝑠 ∈ 𝒫 (Base‘𝐾) ↦ {𝑡 ∈ (LSubSp‘𝐾) ∣ 𝑠𝑡}))
21 lsppropd.v2 . . 3 (𝜑𝐿𝑌)
22 eqid 2738 . . . 4 (Base‘𝐿) = (Base‘𝐿)
23 eqid 2738 . . . 4 (LSubSp‘𝐿) = (LSubSp‘𝐿)
24 eqid 2738 . . . 4 (LSpan‘𝐿) = (LSpan‘𝐿)
2522, 23, 24lspfval 20235 . . 3 (𝐿𝑌 → (LSpan‘𝐿) = (𝑠 ∈ 𝒫 (Base‘𝐿) ↦ {𝑡 ∈ (LSubSp‘𝐿) ∣ 𝑠𝑡}))
2621, 25syl 17 . 2 (𝜑 → (LSpan‘𝐿) = (𝑠 ∈ 𝒫 (Base‘𝐿) ↦ {𝑡 ∈ (LSubSp‘𝐿) ∣ 𝑠𝑡}))
2714, 20, 263eqtr4d 2788 1 (𝜑 → (LSpan‘𝐾) = (LSpan‘𝐿))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1539  wcel 2106  {crab 3068  wss 3887  𝒫 cpw 4533   cint 4879  cmpt 5157  cfv 6433  (class class class)co 7275  Basecbs 16912  +gcplusg 16962  Scalarcsca 16965   ·𝑠 cvsca 16966  LSubSpclss 20193  LSpanclspn 20233
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-int 4880  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-ov 7278  df-lss 20194  df-lsp 20234
This theorem is referenced by:  lbspropd  20361  lidlrsppropd  20501  lindfpropd  31576
  Copyright terms: Public domain W3C validator