lsppratlem3 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > lsppratlem3		Structured version Visualization version GIF version

Theorem lsppratlem3 19914

Description: Lemma for lspprat 19918. In the first case of lsppratlem1 19912, since 𝑥 ∉ (𝑁‘∅), also 𝑌 ∈ (𝑁‘{𝑥}), and since 𝑦 ∈ (𝑁‘{𝑋, 𝑌}) ⊆ (𝑁‘{𝑋, 𝑥}) and 𝑦 ∉ (𝑁‘{𝑥}), we have 𝑋 ∈ (𝑁‘{𝑥, 𝑦}) as desired. (Contributed by NM, 29-Aug-2014.)

**Hypotheses**
Ref	Expression
lspprat.v	⊢ 𝑉 = (Base‘𝑊)
lspprat.s	⊢ 𝑆 = (LSubSp‘𝑊)
lspprat.n	⊢ 𝑁 = (LSpan‘𝑊)
lspprat.w	⊢ (𝜑 → 𝑊 ∈ LVec)
lspprat.u	⊢ (𝜑 → 𝑈 ∈ 𝑆)
lspprat.x	⊢ (𝜑 → 𝑋 ∈ 𝑉)
lspprat.y	⊢ (𝜑 → 𝑌 ∈ 𝑉)
lspprat.p	⊢ (𝜑 → 𝑈 ⊊ (𝑁‘{𝑋, 𝑌}))
lsppratlem1.o	⊢ 0 = (0_g‘𝑊)
lsppratlem1.x2	⊢ (𝜑 → 𝑥 ∈ (𝑈 ∖ { 0 }))
lsppratlem1.y2	⊢ (𝜑 → 𝑦 ∈ (𝑈 ∖ (𝑁‘{𝑥})))
lsppratlem3.x3	⊢ (𝜑 → 𝑥 ∈ (𝑁‘{𝑌}))

**Assertion**
Ref	Expression
lsppratlem3	⊢ (𝜑 → (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦})))

**Proof of Theorem lsppratlem3**
Step	Hyp	Ref	Expression
1		lspprat.w	. . . 4 ⊢ (𝜑 → 𝑊 ∈ LVec)
2		lveclmod 19871	. . . . . . . 8 ⊢ (𝑊 ∈ LVec → 𝑊 ∈ LMod)
3	1, 2	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝑊 ∈ LMod)
4		lspprat.y	. . . . . . . 8 ⊢ (𝜑 → 𝑌 ∈ 𝑉)
5	4	snssd 4702	. . . . . . 7 ⊢ (𝜑 → {𝑌} ⊆ 𝑉)
6		lspprat.v	. . . . . . . 8 ⊢ 𝑉 = (Base‘𝑊)
7		lspprat.n	. . . . . . . 8 ⊢ 𝑁 = (LSpan‘𝑊)
8	6, 7	lspssv 19748	. . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ {𝑌} ⊆ 𝑉) → (𝑁‘{𝑌}) ⊆ 𝑉)
9	3, 5, 8	syl2anc 587	. . . . . 6 ⊢ (𝜑 → (𝑁‘{𝑌}) ⊆ 𝑉)
10		lsppratlem3.x3	. . . . . 6 ⊢ (𝜑 → 𝑥 ∈ (𝑁‘{𝑌}))
11	9, 10	sseldd 3916	. . . . 5 ⊢ (𝜑 → 𝑥 ∈ 𝑉)
12	11	snssd 4702	. . . 4 ⊢ (𝜑 → {𝑥} ⊆ 𝑉)
13		lspprat.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝑉)
14		lspprat.p	. . . . . . . 8 ⊢ (𝜑 → 𝑈 ⊊ (𝑁‘{𝑋, 𝑌}))
15	14	pssssd 4025	. . . . . . 7 ⊢ (𝜑 → 𝑈 ⊆ (𝑁‘{𝑋, 𝑌}))
16	13	snssd 4702	. . . . . . . . . 10 ⊢ (𝜑 → {𝑋} ⊆ 𝑉)
17	12, 16	unssd 4113	. . . . . . . . 9 ⊢ (𝜑 → ({𝑥} ∪ {𝑋}) ⊆ 𝑉)
18		lspprat.s	. . . . . . . . . 10 ⊢ 𝑆 = (LSubSp‘𝑊)
19	6, 18, 7	lspcl 19741	. . . . . . . . 9 ⊢ ((𝑊 ∈ LMod ∧ ({𝑥} ∪ {𝑋}) ⊆ 𝑉) → (𝑁‘({𝑥} ∪ {𝑋})) ∈ 𝑆)
20	3, 17, 19	syl2anc 587	. . . . . . . 8 ⊢ (𝜑 → (𝑁‘({𝑥} ∪ {𝑋})) ∈ 𝑆)
21		df-pr 4528	. . . . . . . . 9 ⊢ {𝑋, 𝑌} = ({𝑋} ∪ {𝑌})
22	6, 7	lspssid 19750	. . . . . . . . . . . 12 ⊢ ((𝑊 ∈ LMod ∧ ({𝑥} ∪ {𝑋}) ⊆ 𝑉) → ({𝑥} ∪ {𝑋}) ⊆ (𝑁‘({𝑥} ∪ {𝑋})))
23	3, 17, 22	syl2anc 587	. . . . . . . . . . 11 ⊢ (𝜑 → ({𝑥} ∪ {𝑋}) ⊆ (𝑁‘({𝑥} ∪ {𝑋})))
24	23	unssbd 4115	. . . . . . . . . 10 ⊢ (𝜑 → {𝑋} ⊆ (𝑁‘({𝑥} ∪ {𝑋})))
25		ssun1 4099	. . . . . . . . . . . . . 14 ⊢ {𝑥} ⊆ ({𝑥} ∪ {𝑋})
26	25	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝜑 → {𝑥} ⊆ ({𝑥} ∪ {𝑋}))
27	6, 7	lspss 19749	. . . . . . . . . . . . 13 ⊢ ((𝑊 ∈ LMod ∧ ({𝑥} ∪ {𝑋}) ⊆ 𝑉 ∧ {𝑥} ⊆ ({𝑥} ∪ {𝑋})) → (𝑁‘{𝑥}) ⊆ (𝑁‘({𝑥} ∪ {𝑋})))
28	3, 17, 26, 27	syl3anc 1368	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑁‘{𝑥}) ⊆ (𝑁‘({𝑥} ∪ {𝑋})))
29		0ss 4304	. . . . . . . . . . . . . . 15 ⊢ ∅ ⊆ 𝑉
30	29	a1i 11	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ∅ ⊆ 𝑉)
31		uncom 4080	. . . . . . . . . . . . . . . . . 18 ⊢ (∅ ∪ {𝑌}) = ({𝑌} ∪ ∅)
32		un0 4298	. . . . . . . . . . . . . . . . . 18 ⊢ ({𝑌} ∪ ∅) = {𝑌}
33	31, 32	eqtri 2821	. . . . . . . . . . . . . . . . 17 ⊢ (∅ ∪ {𝑌}) = {𝑌}
34	33	fveq2i 6648	. . . . . . . . . . . . . . . 16 ⊢ (𝑁‘(∅ ∪ {𝑌})) = (𝑁‘{𝑌})
35	10, 34	eleqtrrdi 2901	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑥 ∈ (𝑁‘(∅ ∪ {𝑌})))
36		lsppratlem1.x2	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝑥 ∈ (𝑈 ∖ { 0 }))
37	36	eldifbd 3894	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → ¬ 𝑥 ∈ { 0 })
38		lsppratlem1.o	. . . . . . . . . . . . . . . . . 18 ⊢ 0 = (0_g‘𝑊)
39	38, 7	lsp0 19774	. . . . . . . . . . . . . . . . 17 ⊢ (𝑊 ∈ LMod → (𝑁‘∅) = { 0 })
40	3, 39	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝑁‘∅) = { 0 })
41	37, 40	neleqtrrd 2912	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ¬ 𝑥 ∈ (𝑁‘∅))
42	35, 41	eldifd 3892	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑥 ∈ ((𝑁‘(∅ ∪ {𝑌})) ∖ (𝑁‘∅)))
43	6, 18, 7	lspsolv 19908	. . . . . . . . . . . . . 14 ⊢ ((𝑊 ∈ LVec ∧ (∅ ⊆ 𝑉 ∧ 𝑌 ∈ 𝑉 ∧ 𝑥 ∈ ((𝑁‘(∅ ∪ {𝑌})) ∖ (𝑁‘∅)))) → 𝑌 ∈ (𝑁‘(∅ ∪ {𝑥})))
44	1, 30, 4, 42, 43	syl13anc 1369	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑌 ∈ (𝑁‘(∅ ∪ {𝑥})))
45		uncom 4080	. . . . . . . . . . . . . . 15 ⊢ (∅ ∪ {𝑥}) = ({𝑥} ∪ ∅)
46		un0 4298	. . . . . . . . . . . . . . 15 ⊢ ({𝑥} ∪ ∅) = {𝑥}
47	45, 46	eqtri 2821	. . . . . . . . . . . . . 14 ⊢ (∅ ∪ {𝑥}) = {𝑥}
48	47	fveq2i 6648	. . . . . . . . . . . . 13 ⊢ (𝑁‘(∅ ∪ {𝑥})) = (𝑁‘{𝑥})
49	44, 48	eleqtrdi 2900	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑌 ∈ (𝑁‘{𝑥}))
50	28, 49	sseldd 3916	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑌 ∈ (𝑁‘({𝑥} ∪ {𝑋})))
51	50	snssd 4702	. . . . . . . . . 10 ⊢ (𝜑 → {𝑌} ⊆ (𝑁‘({𝑥} ∪ {𝑋})))
52	24, 51	unssd 4113	. . . . . . . . 9 ⊢ (𝜑 → ({𝑋} ∪ {𝑌}) ⊆ (𝑁‘({𝑥} ∪ {𝑋})))
53	21, 52	eqsstrid 3963	. . . . . . . 8 ⊢ (𝜑 → {𝑋, 𝑌} ⊆ (𝑁‘({𝑥} ∪ {𝑋})))
54	18, 7	lspssp 19753	. . . . . . . 8 ⊢ ((𝑊 ∈ LMod ∧ (𝑁‘({𝑥} ∪ {𝑋})) ∈ 𝑆 ∧ {𝑋, 𝑌} ⊆ (𝑁‘({𝑥} ∪ {𝑋}))) → (𝑁‘{𝑋, 𝑌}) ⊆ (𝑁‘({𝑥} ∪ {𝑋})))
55	3, 20, 53, 54	syl3anc 1368	. . . . . . 7 ⊢ (𝜑 → (𝑁‘{𝑋, 𝑌}) ⊆ (𝑁‘({𝑥} ∪ {𝑋})))
56	15, 55	sstrd 3925	. . . . . 6 ⊢ (𝜑 → 𝑈 ⊆ (𝑁‘({𝑥} ∪ {𝑋})))
57	56	ssdifd 4068	. . . . 5 ⊢ (𝜑 → (𝑈 ∖ (𝑁‘{𝑥})) ⊆ ((𝑁‘({𝑥} ∪ {𝑋})) ∖ (𝑁‘{𝑥})))
58		lsppratlem1.y2	. . . . 5 ⊢ (𝜑 → 𝑦 ∈ (𝑈 ∖ (𝑁‘{𝑥})))
59	57, 58	sseldd 3916	. . . 4 ⊢ (𝜑 → 𝑦 ∈ ((𝑁‘({𝑥} ∪ {𝑋})) ∖ (𝑁‘{𝑥})))
60	6, 18, 7	lspsolv 19908	. . . 4 ⊢ ((𝑊 ∈ LVec ∧ ({𝑥} ⊆ 𝑉 ∧ 𝑋 ∈ 𝑉 ∧ 𝑦 ∈ ((𝑁‘({𝑥} ∪ {𝑋})) ∖ (𝑁‘{𝑥})))) → 𝑋 ∈ (𝑁‘({𝑥} ∪ {𝑦})))
61	1, 12, 13, 59, 60	syl13anc 1369	. . 3 ⊢ (𝜑 → 𝑋 ∈ (𝑁‘({𝑥} ∪ {𝑦})))
62		df-pr 4528	. . . 4 ⊢ {𝑥, 𝑦} = ({𝑥} ∪ {𝑦})
63	62	fveq2i 6648	. . 3 ⊢ (𝑁‘{𝑥, 𝑦}) = (𝑁‘({𝑥} ∪ {𝑦}))
64	61, 63	eleqtrrdi 2901	. 2 ⊢ (𝜑 → 𝑋 ∈ (𝑁‘{𝑥, 𝑦}))
65		lspprat.u	. . . . . . . 8 ⊢ (𝜑 → 𝑈 ∈ 𝑆)
66	6, 18	lssss 19701	. . . . . . . 8 ⊢ (𝑈 ∈ 𝑆 → 𝑈 ⊆ 𝑉)
67	65, 66	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝑈 ⊆ 𝑉)
68	67	ssdifssd 4070	. . . . . 6 ⊢ (𝜑 → (𝑈 ∖ (𝑁‘{𝑥})) ⊆ 𝑉)
69	68, 58	sseldd 3916	. . . . 5 ⊢ (𝜑 → 𝑦 ∈ 𝑉)
70	11, 69	prssd 4715	. . . 4 ⊢ (𝜑 → {𝑥, 𝑦} ⊆ 𝑉)
71		snsspr1 4707	. . . . 5 ⊢ {𝑥} ⊆ {𝑥, 𝑦}
72	71	a1i 11	. . . 4 ⊢ (𝜑 → {𝑥} ⊆ {𝑥, 𝑦})
73	6, 7	lspss 19749	. . . 4 ⊢ ((𝑊 ∈ LMod ∧ {𝑥, 𝑦} ⊆ 𝑉 ∧ {𝑥} ⊆ {𝑥, 𝑦}) → (𝑁‘{𝑥}) ⊆ (𝑁‘{𝑥, 𝑦}))
74	3, 70, 72, 73	syl3anc 1368	. . 3 ⊢ (𝜑 → (𝑁‘{𝑥}) ⊆ (𝑁‘{𝑥, 𝑦}))
75	74, 49	sseldd 3916	. 2 ⊢ (𝜑 → 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))
76	64, 75	jca 515	1 ⊢ (𝜑 → (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦})))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 399 = wceq 1538 ∈ wcel 2111 ∖ cdif 3878 ∪ cun 3879 ⊆ wss 3881 ⊊ wpss 3882 ∅c0 4243 {csn 4525 {cpr 4527 ‘cfv 6324 Basecbs 16475 0_gc0g 16705 LModclmod 19627 LSubSpclss 19696 LSpanclspn 19736 LVecclvec 19867

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603

This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-tpos 7875 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-nn 11626 df-2 11688 df-3 11689 df-ndx 16478 df-slot 16479 df-base 16481 df-sets 16482 df-ress 16483 df-plusg 16570 df-mulr 16571 df-0g 16707 df-mgm 17844 df-sgrp 17893 df-mnd 17904 df-grp 18098 df-minusg 18099 df-sbg 18100 df-cmn 18900 df-abl 18901 df-mgp 19233 df-ur 19245 df-ring 19292 df-oppr 19369 df-dvdsr 19387 df-unit 19388 df-invr 19418 df-drng 19497 df-lmod 19629 df-lss 19697 df-lsp 19737 df-lvec 19868

This theorem is referenced by: lsppratlem5 19916

W3C validator