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

Theorem lsppropd 14511
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 2266 . . . 4  |-  ( ph  ->  ( Base `  K
)  =  ( Base `  L ) )
43pweqd 3661 . . 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 14510 . . . . 5  |-  ( ph  ->  ( LSubSp `  K )  =  ( LSubSp `  L
) )
1413rabeqdv 2797 . . . 4  |-  ( ph  ->  { t  e.  (
LSubSp `  K )  |  s  C_  t }  =  { t  e.  (
LSubSp `  L )  |  s  C_  t }
)
1514inteqd 3938 . . 3  |-  ( ph  ->  |^| { t  e.  ( LSubSp `  K )  |  s  C_  t }  =  |^| { t  e.  ( LSubSp `  L
)  |  s  C_  t } )
164, 15mpteq12dv 4176 . 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 2231 . . . 4  |-  ( Base `  K )  =  (
Base `  K )
18 eqid 2231 . . . 4  |-  ( LSubSp `  K )  =  (
LSubSp `  K )
19 eqid 2231 . . . 4  |-  ( LSpan `  K )  =  (
LSpan `  K )
2017, 18, 19lspfval 14467 . . 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 2231 . . . 4  |-  ( Base `  L )  =  (
Base `  L )
23 eqid 2231 . . . 4  |-  ( LSubSp `  L )  =  (
LSubSp `  L )
24 eqid 2231 . . . 4  |-  ( LSpan `  L )  =  (
LSpan `  L )
2522, 23, 24lspfval 14467 . . 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 2274 1  |-  ( ph  ->  ( LSpan `  K )  =  ( LSpan `  L
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1398    e. wcel 2202   {crab 2515    C_ wss 3201   ~Pcpw 3656   |^|cint 3933    |-> cmpt 4155   ` cfv 5333  (class class class)co 6028   Basecbs 13145   +g cplusg 13223  Scalarcsca 13226   .scvsca 13227   LSubSpclss 14431   LSpanclspn 14465
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-cnex 8166  ax-resscn 8167  ax-1re 8169  ax-addrcl 8172
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-ov 6031  df-inn 9186  df-ndx 13148  df-slot 13149  df-base 13151  df-lssm 14432  df-lsp 14466
This theorem is referenced by:  lidlrsppropdg  14574
  Copyright terms: Public domain W3C validator