Theorem lspss 14419

Description: Span preserves subset ordering. (Contributed by NM, 11-Dec-2013.) (Revised by Mario Carneiro, 19-Jun-2014.)

Hypotheses

Ref	Expression
lspss.v	|- V = ( Base ` W )
lspss.n	|- N = ( LSpan ` W )

Assertion

Ref	Expression
lspss	|- ( ( W e. LMod /\ U C_ V /\ T C_ U ) -> ( N ` T ) C_ ( N ` U ) )

Proof of Theorem lspss

Dummy variable t is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpl3 1028	. . . . 5 |- ( ( ( W e. LMod /\ U C_ V /\ T C_ U ) /\ t e. ( LSubSp ` W ) ) -> T C_ U )
2		sstr2 3234	. . . . 5 |- ( T C_ U -> ( U C_ t -> T C_ t ) )
3	1, 2	syl 14	. . . 4 |- ( ( ( W e. LMod /\ U C_ V /\ T C_ U ) /\ t e. ( LSubSp ` W ) ) -> ( U C_ t -> T C_ t ) )
4	3	ss2rabdv 3308	. . 3 |- ( ( W e. LMod /\ U C_ V /\ T C_ U ) -> { t e. ( LSubSp ` W ) | U C_ t } C_ { t e. ( LSubSp ` W ) | T C_ t } )
5		intss 3949	. . 3 |- ( { t e. ( LSubSp ` W ) | U C_ t } C_ { t e. ( LSubSp ` W ) | T C_ t } -> |^| { t e. ( LSubSp ` W ) | T C_ t } C_ |^| { t e. ( LSubSp ` W ) | U C_ t } )
6	4, 5	syl 14	. 2 |- ( ( W e. LMod /\ U C_ V /\ T C_ U ) -> |^| { t e. ( LSubSp ` W ) | T C_ t } C_ |^| { t e. ( LSubSp ` W ) | U C_ t } )
7		simp1 1023	. . 3 |- ( ( W e. LMod /\ U C_ V /\ T C_ U ) -> W e. LMod )
8		simp3 1025	. . . 4 |- ( ( W e. LMod /\ U C_ V /\ T C_ U ) -> T C_ U )
9		simp2 1024	. . . 4 |- ( ( W e. LMod /\ U C_ V /\ T C_ U ) -> U C_ V )
10	8, 9	sstrd 3237	. . 3 |- ( ( W e. LMod /\ U C_ V /\ T C_ U ) -> T C_ V )
11		lspss.v	. . . 4 |- V = ( Base ` W )
12		eqid 2231	. . . 4 |- ( LSubSp ` W ) = ( LSubSp ` W )
13		lspss.n	. . . 4 |- N = ( LSpan ` W )
14	11, 12, 13	lspval 14410	. . 3 |- ( ( W e. LMod /\ T C_ V ) -> ( N ` T ) = |^| { t e. ( LSubSp ` W ) | T C_ t } )
15	7, 10, 14	syl2anc 411	. 2 |- ( ( W e. LMod /\ U C_ V /\ T C_ U ) -> ( N ` T ) = |^| { t e. ( LSubSp ` W ) | T C_ t } )
16	11, 12, 13	lspval 14410	. . 3 |- ( ( W e. LMod /\ U C_ V ) -> ( N ` U ) = |^| { t e. ( LSubSp ` W ) | U C_ t } )
17	16	3adant3 1043	. 2 |- ( ( W e. LMod /\ U C_ V /\ T C_ U ) -> ( N ` U ) = |^| { t e. ( LSubSp ` W ) | U C_ t } )
18	6, 15, 17	3sstr4d 3272	1 |- ( ( W e. LMod /\ U C_ V /\ T C_ U ) -> ( N ` T ) C_ ( N ` U ) )

Syntax hints:   -> wi 4   /\ wa 104   /\ w3a 1004   = wceq 1397   e. wcel 2202   {crab 2514   C_ wss 3200   |^|cint 3928   ` cfv 5326   Basecbs 13087   LModclmod 14307   LSubSpclss 14372   LSpanclspn 14406

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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-cnex 8123  ax-resscn 8124  ax-1re 8126  ax-addrcl 8129

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5971  df-ov 6021  df-inn 9144  df-2 9202  df-3 9203  df-4 9204  df-5 9205  df-6 9206  df-ndx 13090  df-slot 13091  df-base 13093  df-plusg 13178  df-mulr 13179  df-sca 13181  df-vsca 13182  df-0g 13346  df-mgm 13444  df-sgrp 13490  df-mnd 13505  df-grp 13591  df-lmod 14309  df-lssm 14373  df-lsp 14407

This theorem is referenced by:  lspun  14422  lspssp  14423  lspprid1  14431