ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  lsppropd Unicode version

Theorem lsppropd 13524
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.
StepHypRef Expression
1 lsspropd.b1 . . . . 5  |-  ( ph  ->  B  =  ( Base `  K ) )
2 lsspropd.b2 . . . . 5  |-  ( ph  ->  B  =  ( Base `  L ) )
31, 2eqtr3d 2212 . . . 4  |-  ( ph  ->  ( Base `  K
)  =  ( Base `  L ) )
43pweqd 3582 . . 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 )
131, 2, 5, 6, 7, 8, 9, 10, 11, 12lsspropdg 13523 . . . . 5  |-  ( ph  ->  ( LSubSp `  K )  =  ( LSubSp `  L
) )
1413rabeqdv 2733 . . . 4  |-  ( ph  ->  { t  e.  (
LSubSp `  K )  |  s  C_  t }  =  { t  e.  (
LSubSp `  L )  |  s  C_  t }
)
1514inteqd 3851 . . 3  |-  ( ph  ->  |^| { t  e.  ( LSubSp `  K )  |  s  C_  t }  =  |^| { t  e.  ( LSubSp `  L
)  |  s  C_  t } )
164, 15mpteq12dv 4087 . 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 2177 . . . 4  |-  ( Base `  K )  =  (
Base `  K )
18 eqid 2177 . . . 4  |-  ( LSubSp `  K )  =  (
LSubSp `  K )
19 eqid 2177 . . . 4  |-  ( LSpan `  K )  =  (
LSpan `  K )
2017, 18, 19lspfval 13481 . . 3  |-  ( K  e.  X  ->  ( LSpan `  K )  =  ( s  e.  ~P ( Base `  K )  |-> 
|^| { t  e.  (
LSubSp `  K )  |  s  C_  t }
) )
2111, 20syl 14 . 2  |-  ( ph  ->  ( LSpan `  K )  =  ( s  e. 
~P ( Base `  K
)  |->  |^| { t  e.  ( LSubSp `  K )  |  s  C_  t } ) )
22 eqid 2177 . . . 4  |-  ( Base `  L )  =  (
Base `  L )
23 eqid 2177 . . . 4  |-  ( LSubSp `  L )  =  (
LSubSp `  L )
24 eqid 2177 . . . 4  |-  ( LSpan `  L )  =  (
LSpan `  L )
2522, 23, 24lspfval 13481 . . 3  |-  ( L  e.  Y  ->  ( LSpan `  L )  =  ( s  e.  ~P ( Base `  L )  |-> 
|^| { t  e.  (
LSubSp `  L )  |  s  C_  t }
) )
2612, 25syl 14 . 2  |-  ( ph  ->  ( LSpan `  L )  =  ( s  e. 
~P ( Base `  L
)  |->  |^| { t  e.  ( LSubSp `  L )  |  s  C_  t } ) )
2716, 21, 263eqtr4d 2220 1  |-  ( ph  ->  ( LSpan `  K )  =  ( LSpan `  L
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1353    e. wcel 2148   {crab 2459    C_ wss 3131   ~Pcpw 3577   |^|cint 3846    |-> cmpt 4066   ` cfv 5218  (class class class)co 5878   Basecbs 12465   +g cplusg 12539  Scalarcsca 12542   .scvsca 12543   LSubSpclss 13448   LSpanclspn 13479
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4120  ax-sep 4123  ax-pow 4176  ax-pr 4211  ax-un 4435  ax-cnex 7905  ax-resscn 7906  ax-1re 7908  ax-addrcl 7911
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2741  df-sbc 2965  df-csb 3060  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-int 3847  df-iun 3890  df-br 4006  df-opab 4067  df-mpt 4068  df-id 4295  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-rn 4639  df-res 4640  df-ima 4641  df-iota 5180  df-fun 5220  df-fn 5221  df-f 5222  df-f1 5223  df-fo 5224  df-f1o 5225  df-fv 5226  df-ov 5881  df-inn 8923  df-ndx 12468  df-slot 12469  df-base 12471  df-lssm 13449  df-lsp 13480
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator