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

Theorem lsslsp 14875
Description: Spans in submodules correspond to spans in the containing module. (Contributed by Stefan O'Rear, 12-Dec-2014.) Terms in the equation were swapped as proposed by NM on 15-Mar-2015. (Revised by AV, 18-Apr-2025.)
Hypotheses
Ref Expression
lsslsp.x  |-  X  =  ( W ↾s  U )
lsslsp.m  |-  M  =  ( LSpan `  W )
lsslsp.n  |-  N  =  ( LSpan `  X )
lsslsp.l  |-  L  =  ( LSubSp `  W )
Assertion
Ref Expression
lsslsp  |-  ( ( W  e.  LMod  /\  U  e.  L  /\  G  C_  U )  ->  ( N `  G )  =  ( M `  G ) )

Proof of Theorem lsslsp
StepHypRef Expression
1 lsslsp.x . . . . 5  |-  X  =  ( W ↾s  U )
2 lsslsp.l . . . . 5  |-  L  =  ( LSubSp `  W )
31, 2lsslmod 14826 . . . 4  |-  ( ( W  e.  LMod  /\  U  e.  L )  ->  X  e.  LMod )
433adant3 1048 . . 3  |-  ( ( W  e.  LMod  /\  U  e.  L  /\  G  C_  U )  ->  X  e.  LMod )
5 simp1 1028 . . . . 5  |-  ( ( W  e.  LMod  /\  U  e.  L  /\  G  C_  U )  ->  W  e.  LMod )
6 simp3 1030 . . . . . 6  |-  ( ( W  e.  LMod  /\  U  e.  L  /\  G  C_  U )  ->  G  C_  U )
7 eqid 2238 . . . . . . . 8  |-  ( Base `  W )  =  (
Base `  W )
87, 2lssssg 14806 . . . . . . 7  |-  ( ( W  e.  LMod  /\  U  e.  L )  ->  U  C_  ( Base `  W
) )
983adant3 1048 . . . . . 6  |-  ( ( W  e.  LMod  /\  U  e.  L  /\  G  C_  U )  ->  U  C_  ( Base `  W
) )
106, 9sstrd 3258 . . . . 5  |-  ( ( W  e.  LMod  /\  U  e.  L  /\  G  C_  U )  ->  G  C_  ( Base `  W
) )
11 lsslsp.m . . . . . 6  |-  M  =  ( LSpan `  W )
127, 2, 11lspcl 14837 . . . . 5  |-  ( ( W  e.  LMod  /\  G  C_  ( Base `  W
) )  ->  ( M `  G )  e.  L )
135, 10, 12syl2anc 415 . . . 4  |-  ( ( W  e.  LMod  /\  U  e.  L  /\  G  C_  U )  ->  ( M `  G )  e.  L )
142, 11lspssp 14849 . . . 4  |-  ( ( W  e.  LMod  /\  U  e.  L  /\  G  C_  U )  ->  ( M `  G )  C_  U )
15 eqid 2238 . . . . . 6  |-  ( LSubSp `  X )  =  (
LSubSp `  X )
161, 2, 15lsslss 14827 . . . . 5  |-  ( ( W  e.  LMod  /\  U  e.  L )  ->  (
( M `  G
)  e.  ( LSubSp `  X )  <->  ( ( M `  G )  e.  L  /\  ( M `  G )  C_  U ) ) )
17163adant3 1048 . . . 4  |-  ( ( W  e.  LMod  /\  U  e.  L  /\  G  C_  U )  ->  (
( M `  G
)  e.  ( LSubSp `  X )  <->  ( ( M `  G )  e.  L  /\  ( M `  G )  C_  U ) ) )
1813, 14, 17mpbir2and 957 . . 3  |-  ( ( W  e.  LMod  /\  U  e.  L  /\  G  C_  U )  ->  ( M `  G )  e.  ( LSubSp `  X )
)
197, 11lspssid 14846 . . . 4  |-  ( ( W  e.  LMod  /\  G  C_  ( Base `  W
) )  ->  G  C_  ( M `  G
) )
205, 10, 19syl2anc 415 . . 3  |-  ( ( W  e.  LMod  /\  U  e.  L  /\  G  C_  U )  ->  G  C_  ( M `  G
) )
21 lsslsp.n . . . 4  |-  N  =  ( LSpan `  X )
2215, 21lspssp 14849 . . 3  |-  ( ( X  e.  LMod  /\  ( M `  G )  e.  ( LSubSp `  X )  /\  G  C_  ( M `
 G ) )  ->  ( N `  G )  C_  ( M `  G )
)
234, 18, 20, 22syl3anc 1278 . 2  |-  ( ( W  e.  LMod  /\  U  e.  L  /\  G  C_  U )  ->  ( N `  G )  C_  ( M `  G
) )
241a1i 9 . . . . . . . 8  |-  ( ( W  e.  LMod  /\  U  e.  L  /\  G  C_  U )  ->  X  =  ( W ↾s  U ) )
25 eqidd 2239 . . . . . . . 8  |-  ( ( W  e.  LMod  /\  U  e.  L  /\  G  C_  U )  ->  ( Base `  W )  =  ( Base `  W
) )
2624, 25, 5, 9ressbas2d 13481 . . . . . . 7  |-  ( ( W  e.  LMod  /\  U  e.  L  /\  G  C_  U )  ->  U  =  ( Base `  X
) )
276, 26sseqtrd 3286 . . . . . 6  |-  ( ( W  e.  LMod  /\  U  e.  L  /\  G  C_  U )  ->  G  C_  ( Base `  X
) )
28 eqid 2238 . . . . . . 7  |-  ( Base `  X )  =  (
Base `  X )
2928, 15, 21lspcl 14837 . . . . . 6  |-  ( ( X  e.  LMod  /\  G  C_  ( Base `  X
) )  ->  ( N `  G )  e.  ( LSubSp `  X )
)
304, 27, 29syl2anc 415 . . . . 5  |-  ( ( W  e.  LMod  /\  U  e.  L  /\  G  C_  U )  ->  ( N `  G )  e.  ( LSubSp `  X )
)
311, 2, 15lsslss 14827 . . . . . 6  |-  ( ( W  e.  LMod  /\  U  e.  L )  ->  (
( N `  G
)  e.  ( LSubSp `  X )  <->  ( ( N `  G )  e.  L  /\  ( N `  G )  C_  U ) ) )
32313adant3 1048 . . . . 5  |-  ( ( W  e.  LMod  /\  U  e.  L  /\  G  C_  U )  ->  (
( N `  G
)  e.  ( LSubSp `  X )  <->  ( ( N `  G )  e.  L  /\  ( N `  G )  C_  U ) ) )
3330, 32mpbid 147 . . . 4  |-  ( ( W  e.  LMod  /\  U  e.  L  /\  G  C_  U )  ->  (
( N `  G
)  e.  L  /\  ( N `  G ) 
C_  U ) )
3433simpld 112 . . 3  |-  ( ( W  e.  LMod  /\  U  e.  L  /\  G  C_  U )  ->  ( N `  G )  e.  L )
3528, 21lspssid 14846 . . . 4  |-  ( ( X  e.  LMod  /\  G  C_  ( Base `  X
) )  ->  G  C_  ( N `  G
) )
364, 27, 35syl2anc 415 . . 3  |-  ( ( W  e.  LMod  /\  U  e.  L  /\  G  C_  U )  ->  G  C_  ( N `  G
) )
372, 11lspssp 14849 . . 3  |-  ( ( W  e.  LMod  /\  ( N `  G )  e.  L  /\  G  C_  ( N `  G ) )  ->  ( M `  G )  C_  ( N `  G )
)
385, 34, 36, 37syl3anc 1278 . 2  |-  ( ( W  e.  LMod  /\  U  e.  L  /\  G  C_  U )  ->  ( M `  G )  C_  ( N `  G
) )
3923, 38eqssd 3265 1  |-  ( ( W  e.  LMod  /\  U  e.  L  /\  G  C_  U )  ->  ( N `  G )  =  ( M `  G ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1009    = wceq 1402    e. wcel 2209    C_ wss 3220   ` cfv 5380  (class class class)co 6088   Basecbs 13410   ↾s cress 13411   LModclmod 14732   LSubSpclss 14798   LSpanclspn 14832
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  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-setind 4686  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-addcom 8285  ax-addass 8287  ax-i2m1 8290  ax-0lt1 8291  ax-0id 8293  ax-rnegex 8294  ax-pre-ltirr 8297  ax-pre-lttrn 8299  ax-pre-ltadd 8301
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  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-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  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-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-pnf 8368  df-mnf 8369  df-ltxr 8371  df-inn 9314  df-2 9372  df-3 9373  df-4 9374  df-5 9375  df-6 9376  df-ndx 13413  df-slot 13414  df-base 13416  df-sets 13417  df-iress 13418  df-plusg 13503  df-mulr 13504  df-sca 13506  df-vsca 13507  df-0g 13671  df-mgm 13735  df-sgrp 13776  df-mnd 13789  df-grp 13867  df-minusg 13868  df-sbg 13869  df-subg 14032  df-mgp 14325  df-ur 14370  df-ring 14409  df-lmod 14734  df-lssm 14799  df-lsp 14833
This theorem is used by:  lss0v  14876
  Copyright terms: Public domain W3C validator