Theorem lsppropd 14879

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.

Step	Hyp	Ref	Expression
1		lsspropd.b1	. . . . 5 ⊢ (𝜑 → 𝐵 = (Base‘𝐾))
2		lsspropd.b2	. . . . 5 ⊢ (𝜑 → 𝐵 = (Base‘𝐿))
3	1, 2	eqtr3d 2273	. . . 4 ⊢ (𝜑 → (Base‘𝐾) = (Base‘𝐿))
4	3	pweqd 3693	. . 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‘𝐿)))
11		lsppropd.v1	. . . . . 6 ⊢ (𝜑 → 𝐾 ∈ 𝑋)
12		lsppropd.v2	. . . . . 6 ⊢ (𝜑 → 𝐿 ∈ 𝑌)
13	1, 2, 5, 6, 7, 8, 9, 10, 11, 12	lsspropdg 14878	. . . . 5 ⊢ (𝜑 → (LSubSp‘𝐾) = (LSubSp‘𝐿))
14	13	rabeqdv 2815	. . . 4 ⊢ (𝜑 → {𝑡 ∈ (LSubSp‘𝐾) ∣ 𝑠 ⊆ 𝑡} = {𝑡 ∈ (LSubSp‘𝐿) ∣ 𝑠 ⊆ 𝑡})
15	14	inteqd 3975	. . 3 ⊢ (𝜑 → ∩ {𝑡 ∈ (LSubSp‘𝐾) ∣ 𝑠 ⊆ 𝑡} = ∩ {𝑡 ∈ (LSubSp‘𝐿) ∣ 𝑠 ⊆ 𝑡})
16	4, 15	mpteq12dv 4214	. 2 ⊢ (𝜑 → (𝑠 ∈ 𝒫 (Base‘𝐾) ↦ ∩ {𝑡 ∈ (LSubSp‘𝐾) ∣ 𝑠 ⊆ 𝑡}) = (𝑠 ∈ 𝒫 (Base‘𝐿) ↦ ∩ {𝑡 ∈ (LSubSp‘𝐿) ∣ 𝑠 ⊆ 𝑡}))
17		eqid 2238	. . . 4 ⊢ (Base‘𝐾) = (Base‘𝐾)
18		eqid 2238	. . . 4 ⊢ (LSubSp‘𝐾) = (LSubSp‘𝐾)
19		eqid 2238	. . . 4 ⊢ (LSpan‘𝐾) = (LSpan‘𝐾)
20	17, 18, 19	lspfval 14835	. . 3 ⊢ (𝐾 ∈ 𝑋 → (LSpan‘𝐾) = (𝑠 ∈ 𝒫 (Base‘𝐾) ↦ ∩ {𝑡 ∈ (LSubSp‘𝐾) ∣ 𝑠 ⊆ 𝑡}))
21	11, 20	syl 14	. 2 ⊢ (𝜑 → (LSpan‘𝐾) = (𝑠 ∈ 𝒫 (Base‘𝐾) ↦ ∩ {𝑡 ∈ (LSubSp‘𝐾) ∣ 𝑠 ⊆ 𝑡}))
22		eqid 2238	. . . 4 ⊢ (Base‘𝐿) = (Base‘𝐿)
23		eqid 2238	. . . 4 ⊢ (LSubSp‘𝐿) = (LSubSp‘𝐿)
24		eqid 2238	. . . 4 ⊢ (LSpan‘𝐿) = (LSpan‘𝐿)
25	22, 23, 24	lspfval 14835	. . 3 ⊢ (𝐿 ∈ 𝑌 → (LSpan‘𝐿) = (𝑠 ∈ 𝒫 (Base‘𝐿) ↦ ∩ {𝑡 ∈ (LSubSp‘𝐿) ∣ 𝑠 ⊆ 𝑡}))
26	12, 25	syl 14	. 2 ⊢ (𝜑 → (LSpan‘𝐿) = (𝑠 ∈ 𝒫 (Base‘𝐿) ↦ ∩ {𝑡 ∈ (LSubSp‘𝐿) ∣ 𝑠 ⊆ 𝑡}))
27	16, 21, 26	3eqtr4d 2281	1 ⊢ (𝜑 → (LSpan‘𝐾) = (LSpan‘𝐿))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   = wceq 1402   ∈ wcel 2209  {crab 2532   ⊆ wss 3220  𝒫 cpw 3688  ∩ cint 3970   ↦ cmpt 4193  ‘cfv 5380  (class class class)co 6088  Basecbs 13411  +_gcplusg 13491  Scalarcsca 13494   ·_𝑠 cvsca 13495  LSubSpclss 14799  LSpanclspn 14833

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-cnex 8277  ax-resscn 8278  ax-1re 8280  ax-addrcl 8283

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-ov 6091  df-inn 9315  df-ndx 13414  df-slot 13415  df-base 13417  df-lssm 14800  df-lsp 14834

This theorem is used by:  lidlrsppropdg  14942