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

Theorem lsppropd 21013
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 2773 . . . 4 (𝜑 → (Base‘𝐾) = (Base‘𝐿))
43pweqd 4558 . . 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 21012 . . . . 5 (𝜑 → (LSubSp‘𝐾) = (LSubSp‘𝐿))
1211rabeqdv 3404 . . . 4 (𝜑 → {𝑡 ∈ (LSubSp‘𝐾) ∣ 𝑠𝑡} = {𝑡 ∈ (LSubSp‘𝐿) ∣ 𝑠𝑡})
1312inteqd 4894 . . 3 (𝜑 {𝑡 ∈ (LSubSp‘𝐾) ∣ 𝑠𝑡} = {𝑡 ∈ (LSubSp‘𝐿) ∣ 𝑠𝑡})
144, 13mpteq12dv 5172 . 2 (𝜑 → (𝑠 ∈ 𝒫 (Base‘𝐾) ↦ {𝑡 ∈ (LSubSp‘𝐾) ∣ 𝑠𝑡}) = (𝑠 ∈ 𝒫 (Base‘𝐿) ↦ {𝑡 ∈ (LSubSp‘𝐿) ∣ 𝑠𝑡}))
15 lsppropd.v1 . . 3 (𝜑𝐾𝑋)
16 eqid 2736 . . . 4 (Base‘𝐾) = (Base‘𝐾)
17 eqid 2736 . . . 4 (LSubSp‘𝐾) = (LSubSp‘𝐾)
18 eqid 2736 . . . 4 (LSpan‘𝐾) = (LSpan‘𝐾)
1916, 17, 18lspfval 20968 . . 3 (𝐾𝑋 → (LSpan‘𝐾) = (𝑠 ∈ 𝒫 (Base‘𝐾) ↦ {𝑡 ∈ (LSubSp‘𝐾) ∣ 𝑠𝑡}))
2015, 19syl 17 . 2 (𝜑 → (LSpan‘𝐾) = (𝑠 ∈ 𝒫 (Base‘𝐾) ↦ {𝑡 ∈ (LSubSp‘𝐾) ∣ 𝑠𝑡}))
21 lsppropd.v2 . . 3 (𝜑𝐿𝑌)
22 eqid 2736 . . . 4 (Base‘𝐿) = (Base‘𝐿)
23 eqid 2736 . . . 4 (LSubSp‘𝐿) = (LSubSp‘𝐿)
24 eqid 2736 . . . 4 (LSpan‘𝐿) = (LSpan‘𝐿)
2522, 23, 24lspfval 20968 . . 3 (𝐿𝑌 → (LSpan‘𝐿) = (𝑠 ∈ 𝒫 (Base‘𝐿) ↦ {𝑡 ∈ (LSubSp‘𝐿) ∣ 𝑠𝑡}))
2621, 25syl 17 . 2 (𝜑 → (LSpan‘𝐿) = (𝑠 ∈ 𝒫 (Base‘𝐿) ↦ {𝑡 ∈ (LSubSp‘𝐿) ∣ 𝑠𝑡}))
2714, 20, 263eqtr4d 2781 1 (𝜑 → (LSpan‘𝐾) = (LSpan‘𝐿))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  {crab 3389  wss 3889  𝒫 cpw 4541   cint 4889  cmpt 5166  cfv 6498  (class class class)co 7367  Basecbs 17179  +gcplusg 17220  Scalarcsca 17223   ·𝑠 cvsca 17224  LSubSpclss 20926  LSpanclspn 20966
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-int 4890  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-ov 7370  df-lss 20927  df-lsp 20967
This theorem is referenced by:  lbspropd  21094  lidlrsppropd  21242  lindfpropd  33442
  Copyright terms: Public domain W3C validator