Theorem lsppropd 14769

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	|- ( ph -> B = ( Base ` K ) )
lsspropd.b2	|- ( ph -> B = ( Base ` L ) )
lsspropd.w	|- ( ph -> B C_ W )
lsspropd.p	|- ( ( ph /\ ( x e. W /\ y e. W ) ) -> ( x ( +g ` K ) y ) = ( x ( +g ` L ) y ) )
lsspropd.s1	|- ( ( ph /\ ( x e. P /\ y e. B ) ) -> ( x ( .s ` K ) y ) e. W )
lsspropd.s2	|- ( ( ph /\ ( x e. P /\ y e. B ) ) -> ( x ( .s ` K ) y ) = ( x ( .s ` L ) y ) )
lsspropd.p1	|- ( ph -> P = ( Base ` (Scalar ` K ) ) )
lsspropd.p2	|- ( ph -> P = ( Base ` (Scalar ` L ) ) )
lsppropd.v1	|- ( ph -> K e. X )
lsppropd.v2	|- ( ph -> L e. Y )

Assertion

Ref	Expression
lsppropd	|- ( ph -> ( LSpan ` K ) = ( LSpan ` L ) )

Distinct variable groups:   x, y, B   x, K, y   ph, x, y   x, W, y   x, L, y   x, P, y

Allowed substitution hints:   X( x, y)   Y( x, y)

Proof of Theorem lsppropd

Dummy variables s t are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		lsspropd.b1	. . . . 5 |- ( ph -> B = ( Base ` K ) )
2		lsspropd.b2	. . . . 5 |- ( ph -> B = ( Base ` L ) )
3	1, 2	eqtr3d 2273	. . . 4 |- ( ph -> ( Base ` K ) = ( Base ` L ) )
4	3	pweqd 3693	. . 3 |- ( ph -> ~P ( Base ` K ) = ~P ( Base ` L ) )
5		lsspropd.w	. . . . . 6 |- ( ph -> B C_ W )
6		lsspropd.p	. . . . . 6 |- ( ( ph /\ ( x e. W /\ y e. W ) ) -> ( x ( +g ` K ) y ) = ( x ( +g ` L ) y ) )
7		lsspropd.s1	. . . . . 6 |- ( ( ph /\ ( x e. P /\ y e. B ) ) -> ( x ( .s ` K ) y ) e. W )
8		lsspropd.s2	. . . . . 6 |- ( ( ph /\ ( x e. P /\ y e. B ) ) -> ( x ( .s ` K ) y ) = ( x ( .s ` L ) y ) )
9		lsspropd.p1	. . . . . 6 |- ( ph -> P = ( Base ` (Scalar ` K ) ) )
10		lsspropd.p2	. . . . . 6 |- ( ph -> P = ( Base ` (Scalar ` L ) ) )
11		lsppropd.v1	. . . . . 6 |- ( ph -> K e. X )
12		lsppropd.v2	. . . . . 6 |- ( ph -> L e. Y )
13	1, 2, 5, 6, 7, 8, 9, 10, 11, 12	lsspropdg 14768	. . . . 5 |- ( ph -> ( LSubSp ` K ) = ( LSubSp ` L ) )
14	13	rabeqdv 2815	. . . 4 |- ( ph -> { t e. ( LSubSp ` K ) | s C_ t } = { t e. ( LSubSp ` L ) | s C_ t } )
15	14	inteqd 3975	. . 3 |- ( ph -> |^| { t e. ( LSubSp ` K ) | s C_ t } = |^| { t e. ( LSubSp ` L ) | s C_ t } )
16	4, 15	mpteq12dv 4213	. 2 |- ( ph -> ( s e. ~P ( Base ` K ) |-> |^| { t e. ( LSubSp ` K ) | s C_ t } ) = ( s e. ~P ( Base ` L ) |-> |^| { t e. ( LSubSp ` L ) | s C_ t } ) )
17		eqid 2238	. . . 4 |- ( Base ` K ) = ( Base ` K )
18		eqid 2238	. . . 4 |- ( LSubSp ` K ) = ( LSubSp ` K )
19		eqid 2238	. . . 4 |- ( LSpan ` K ) = ( LSpan ` K )
20	17, 18, 19	lspfval 14725	. . 3 |- ( K e. X -> ( LSpan ` K ) = ( s e. ~P ( Base ` K ) |-> |^| { t e. ( LSubSp ` K ) | s C_ t } ) )
21	11, 20	syl 14	. 2 |- ( ph -> ( LSpan ` K ) = ( s e. ~P ( Base ` K ) |-> |^| { t e. ( LSubSp ` K ) | s C_ t } ) )
22		eqid 2238	. . . 4 |- ( Base ` L ) = ( Base ` L )
23		eqid 2238	. . . 4 |- ( LSubSp ` L ) = ( LSubSp ` L )
24		eqid 2238	. . . 4 |- ( LSpan ` L ) = ( LSpan ` L )
25	22, 23, 24	lspfval 14725	. . 3 |- ( L e. Y -> ( LSpan ` L ) = ( s e. ~P ( Base ` L ) |-> |^| { t e. ( LSubSp ` L ) | s C_ t } ) )
26	12, 25	syl 14	. 2 |- ( ph -> ( LSpan ` L ) = ( s e. ~P ( Base ` L ) |-> |^| { t e. ( LSubSp ` L ) | s C_ t } ) )
27	16, 21, 26	3eqtr4d 2281	1 |- ( ph -> ( LSpan ` K ) = ( LSpan ` L ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   = wceq 1402   e. wcel 2209   {crab 2532   C_ wss 3220   ~Pcpw 3688   |^|cint 3970   |-> cmpt 4192   ` cfv 5377  (class class class)co 6085   Basecbs 13352   +g cplusg 13431  Scalarcsca 13434   .scvsca 13435   LSubSpclss 14689   LSpanclspn 14723

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 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-cnex 8270  ax-resscn 8271  ax-1re 8273  ax-addrcl 8276

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 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-inn 9305  df-ndx 13355  df-slot 13356  df-base 13358  df-lssm 14690  df-lsp 14724

This theorem is used by:  lidlrsppropdg  14832