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 21092

Description: Lemma for lspprat 21096. In the first case of lsppratlem1 21090, 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 21046	. . . . . . . 8 ⊢ (𝑊 ∈ LVec → 𝑊 ∈ LMod)
3	1, 2	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝑊 ∈ LMod)
4		lspprat.y	. . . . . . . 8 ⊢ (𝜑 → 𝑌 ∈ 𝑉)
5	4	snssd 4760	. . . . . . 7 ⊢ (𝜑 → {𝑌} ⊆ 𝑉)
6		lspprat.v	. . . . . . . 8 ⊢ 𝑉 = (Base‘𝑊)
7		lspprat.n	. . . . . . . 8 ⊢ 𝑁 = (LSpan‘𝑊)
8	6, 7	lspssv 20922	. . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ {𝑌} ⊆ 𝑉) → (𝑁‘{𝑌}) ⊆ 𝑉)
9	3, 5, 8	syl2anc 584	. . . . . 6 ⊢ (𝜑 → (𝑁‘{𝑌}) ⊆ 𝑉)
10		lsppratlem3.x3	. . . . . 6 ⊢ (𝜑 → 𝑥 ∈ (𝑁‘{𝑌}))
11	9, 10	sseldd 3930	. . . . 5 ⊢ (𝜑 → 𝑥 ∈ 𝑉)
12	11	snssd 4760	. . . 4 ⊢ (𝜑 → {𝑥} ⊆ 𝑉)
13		lspprat.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝑉)
14		lspprat.p	. . . . . . . 8 ⊢ (𝜑 → 𝑈 ⊊ (𝑁‘{𝑋, 𝑌}))
15	14	pssssd 4049	. . . . . . 7 ⊢ (𝜑 → 𝑈 ⊆ (𝑁‘{𝑋, 𝑌}))
16	13	snssd 4760	. . . . . . . . . 10 ⊢ (𝜑 → {𝑋} ⊆ 𝑉)
17	12, 16	unssd 4141	. . . . . . . . 9 ⊢ (𝜑 → ({𝑥} ∪ {𝑋}) ⊆ 𝑉)
18		lspprat.s	. . . . . . . . . 10 ⊢ 𝑆 = (LSubSp‘𝑊)
19	6, 18, 7	lspcl 20915	. . . . . . . . 9 ⊢ ((𝑊 ∈ LMod ∧ ({𝑥} ∪ {𝑋}) ⊆ 𝑉) → (𝑁‘({𝑥} ∪ {𝑋})) ∈ 𝑆)
20	3, 17, 19	syl2anc 584	. . . . . . . 8 ⊢ (𝜑 → (𝑁‘({𝑥} ∪ {𝑋})) ∈ 𝑆)
21		df-pr 4578	. . . . . . . . 9 ⊢ {𝑋, 𝑌} = ({𝑋} ∪ {𝑌})
22	6, 7	lspssid 20924	. . . . . . . . . . . 12 ⊢ ((𝑊 ∈ LMod ∧ ({𝑥} ∪ {𝑋}) ⊆ 𝑉) → ({𝑥} ∪ {𝑋}) ⊆ (𝑁‘({𝑥} ∪ {𝑋})))
23	3, 17, 22	syl2anc 584	. . . . . . . . . . 11 ⊢ (𝜑 → ({𝑥} ∪ {𝑋}) ⊆ (𝑁‘({𝑥} ∪ {𝑋})))
24	23	unssbd 4143	. . . . . . . . . 10 ⊢ (𝜑 → {𝑋} ⊆ (𝑁‘({𝑥} ∪ {𝑋})))
25		ssun1 4127	. . . . . . . . . . . . . 14 ⊢ {𝑥} ⊆ ({𝑥} ∪ {𝑋})
26	25	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝜑 → {𝑥} ⊆ ({𝑥} ∪ {𝑋}))
27	6, 7	lspss 20923	. . . . . . . . . . . . 13 ⊢ ((𝑊 ∈ LMod ∧ ({𝑥} ∪ {𝑋}) ⊆ 𝑉 ∧ {𝑥} ⊆ ({𝑥} ∪ {𝑋})) → (𝑁‘{𝑥}) ⊆ (𝑁‘({𝑥} ∪ {𝑋})))
28	3, 17, 26, 27	syl3anc 1373	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑁‘{𝑥}) ⊆ (𝑁‘({𝑥} ∪ {𝑋})))
29		0ss 4349	. . . . . . . . . . . . . . 15 ⊢ ∅ ⊆ 𝑉
30	29	a1i 11	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ∅ ⊆ 𝑉)
31		uncom 4107	. . . . . . . . . . . . . . . . . 18 ⊢ (∅ ∪ {𝑌}) = ({𝑌} ∪ ∅)
32		un0 4343	. . . . . . . . . . . . . . . . . 18 ⊢ ({𝑌} ∪ ∅) = {𝑌}
33	31, 32	eqtri 2754	. . . . . . . . . . . . . . . . 17 ⊢ (∅ ∪ {𝑌}) = {𝑌}
34	33	fveq2i 6831	. . . . . . . . . . . . . . . 16 ⊢ (𝑁‘(∅ ∪ {𝑌})) = (𝑁‘{𝑌})
35	10, 34	eleqtrrdi 2842	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑥 ∈ (𝑁‘(∅ ∪ {𝑌})))
36		lsppratlem1.x2	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝑥 ∈ (𝑈 ∖ { 0 }))
37	36	eldifbd 3910	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → ¬ 𝑥 ∈ { 0 })
38		lsppratlem1.o	. . . . . . . . . . . . . . . . . 18 ⊢ 0 = (0_g‘𝑊)
39	38, 7	lsp0 20948	. . . . . . . . . . . . . . . . 17 ⊢ (𝑊 ∈ LMod → (𝑁‘∅) = { 0 })
40	3, 39	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝑁‘∅) = { 0 })
41	37, 40	neleqtrrd 2854	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ¬ 𝑥 ∈ (𝑁‘∅))
42	35, 41	eldifd 3908	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑥 ∈ ((𝑁‘(∅ ∪ {𝑌})) ∖ (𝑁‘∅)))
43	6, 18, 7	lspsolv 21086	. . . . . . . . . . . . . 14 ⊢ ((𝑊 ∈ LVec ∧ (∅ ⊆ 𝑉 ∧ 𝑌 ∈ 𝑉 ∧ 𝑥 ∈ ((𝑁‘(∅ ∪ {𝑌})) ∖ (𝑁‘∅)))) → 𝑌 ∈ (𝑁‘(∅ ∪ {𝑥})))
44	1, 30, 4, 42, 43	syl13anc 1374	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑌 ∈ (𝑁‘(∅ ∪ {𝑥})))
45		uncom 4107	. . . . . . . . . . . . . . 15 ⊢ (∅ ∪ {𝑥}) = ({𝑥} ∪ ∅)
46		un0 4343	. . . . . . . . . . . . . . 15 ⊢ ({𝑥} ∪ ∅) = {𝑥}
47	45, 46	eqtri 2754	. . . . . . . . . . . . . 14 ⊢ (∅ ∪ {𝑥}) = {𝑥}
48	47	fveq2i 6831	. . . . . . . . . . . . 13 ⊢ (𝑁‘(∅ ∪ {𝑥})) = (𝑁‘{𝑥})
49	44, 48	eleqtrdi 2841	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑌 ∈ (𝑁‘{𝑥}))
50	28, 49	sseldd 3930	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑌 ∈ (𝑁‘({𝑥} ∪ {𝑋})))
51	50	snssd 4760	. . . . . . . . . 10 ⊢ (𝜑 → {𝑌} ⊆ (𝑁‘({𝑥} ∪ {𝑋})))
52	24, 51	unssd 4141	. . . . . . . . 9 ⊢ (𝜑 → ({𝑋} ∪ {𝑌}) ⊆ (𝑁‘({𝑥} ∪ {𝑋})))
53	21, 52	eqsstrid 3968	. . . . . . . 8 ⊢ (𝜑 → {𝑋, 𝑌} ⊆ (𝑁‘({𝑥} ∪ {𝑋})))
54	18, 7	lspssp 20927	. . . . . . . 8 ⊢ ((𝑊 ∈ LMod ∧ (𝑁‘({𝑥} ∪ {𝑋})) ∈ 𝑆 ∧ {𝑋, 𝑌} ⊆ (𝑁‘({𝑥} ∪ {𝑋}))) → (𝑁‘{𝑋, 𝑌}) ⊆ (𝑁‘({𝑥} ∪ {𝑋})))
55	3, 20, 53, 54	syl3anc 1373	. . . . . . 7 ⊢ (𝜑 → (𝑁‘{𝑋, 𝑌}) ⊆ (𝑁‘({𝑥} ∪ {𝑋})))
56	15, 55	sstrd 3940	. . . . . 6 ⊢ (𝜑 → 𝑈 ⊆ (𝑁‘({𝑥} ∪ {𝑋})))
57	56	ssdifd 4094	. . . . 5 ⊢ (𝜑 → (𝑈 ∖ (𝑁‘{𝑥})) ⊆ ((𝑁‘({𝑥} ∪ {𝑋})) ∖ (𝑁‘{𝑥})))
58		lsppratlem1.y2	. . . . 5 ⊢ (𝜑 → 𝑦 ∈ (𝑈 ∖ (𝑁‘{𝑥})))
59	57, 58	sseldd 3930	. . . 4 ⊢ (𝜑 → 𝑦 ∈ ((𝑁‘({𝑥} ∪ {𝑋})) ∖ (𝑁‘{𝑥})))
60	6, 18, 7	lspsolv 21086	. . . 4 ⊢ ((𝑊 ∈ LVec ∧ ({𝑥} ⊆ 𝑉 ∧ 𝑋 ∈ 𝑉 ∧ 𝑦 ∈ ((𝑁‘({𝑥} ∪ {𝑋})) ∖ (𝑁‘{𝑥})))) → 𝑋 ∈ (𝑁‘({𝑥} ∪ {𝑦})))
61	1, 12, 13, 59, 60	syl13anc 1374	. . 3 ⊢ (𝜑 → 𝑋 ∈ (𝑁‘({𝑥} ∪ {𝑦})))
62		df-pr 4578	. . . 4 ⊢ {𝑥, 𝑦} = ({𝑥} ∪ {𝑦})
63	62	fveq2i 6831	. . 3 ⊢ (𝑁‘{𝑥, 𝑦}) = (𝑁‘({𝑥} ∪ {𝑦}))
64	61, 63	eleqtrrdi 2842	. 2 ⊢ (𝜑 → 𝑋 ∈ (𝑁‘{𝑥, 𝑦}))
65		lspprat.u	. . . . . . . 8 ⊢ (𝜑 → 𝑈 ∈ 𝑆)
66	6, 18	lssss 20875	. . . . . . . 8 ⊢ (𝑈 ∈ 𝑆 → 𝑈 ⊆ 𝑉)
67	65, 66	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝑈 ⊆ 𝑉)
68	67	ssdifssd 4096	. . . . . 6 ⊢ (𝜑 → (𝑈 ∖ (𝑁‘{𝑥})) ⊆ 𝑉)
69	68, 58	sseldd 3930	. . . . 5 ⊢ (𝜑 → 𝑦 ∈ 𝑉)
70	11, 69	prssd 4773	. . . 4 ⊢ (𝜑 → {𝑥, 𝑦} ⊆ 𝑉)
71		snsspr1 4765	. . . . 5 ⊢ {𝑥} ⊆ {𝑥, 𝑦}
72	71	a1i 11	. . . 4 ⊢ (𝜑 → {𝑥} ⊆ {𝑥, 𝑦})
73	6, 7	lspss 20923	. . . 4 ⊢ ((𝑊 ∈ LMod ∧ {𝑥, 𝑦} ⊆ 𝑉 ∧ {𝑥} ⊆ {𝑥, 𝑦}) → (𝑁‘{𝑥}) ⊆ (𝑁‘{𝑥, 𝑦}))
74	3, 70, 72, 73	syl3anc 1373	. . 3 ⊢ (𝜑 → (𝑁‘{𝑥}) ⊆ (𝑁‘{𝑥, 𝑦}))
75	74, 49	sseldd 3930	. 2 ⊢ (𝜑 → 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))
76	64, 75	jca 511	1 ⊢ (𝜑 → (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦})))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2111 ∖ cdif 3894 ∪ cun 3895 ⊆ wss 3897 ⊊ wpss 3898 ∅c0 4282 {csn 4575 {cpr 4577 ‘cfv 6487 Basecbs 17126 0_gc0g 17349 LModclmod 20799 LSubSpclss 20870 LSpanclspn 20910 LVecclvec 21042

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-rep 5219 ax-sep 5236 ax-nul 5246 ax-pow 5305 ax-pr 5372 ax-un 7674 ax-cnex 11068 ax-resscn 11069 ax-1cn 11070 ax-icn 11071 ax-addcl 11072 ax-addrcl 11073 ax-mulcl 11074 ax-mulrcl 11075 ax-mulcom 11076 ax-addass 11077 ax-mulass 11078 ax-distr 11079 ax-i2m1 11080 ax-1ne0 11081 ax-1rid 11082 ax-rnegex 11083 ax-rrecex 11084 ax-cnre 11085 ax-pre-lttri 11086 ax-pre-lttrn 11087 ax-pre-ltadd 11088 ax-pre-mulgt0 11089

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-nel 3033 df-ral 3048 df-rex 3057 df-rmo 3346 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3737 df-csb 3846 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-pss 3917 df-nul 4283 df-if 4475 df-pw 4551 df-sn 4576 df-pr 4578 df-op 4582 df-uni 4859 df-int 4898 df-iun 4943 df-br 5094 df-opab 5156 df-mpt 5175 df-tr 5201 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-pred 6254 df-ord 6315 df-on 6316 df-lim 6317 df-suc 6318 df-iota 6443 df-fun 6489 df-fn 6490 df-f 6491 df-f1 6492 df-fo 6493 df-f1o 6494 df-fv 6495 df-riota 7309 df-ov 7355 df-oprab 7356 df-mpo 7357 df-om 7803 df-1st 7927 df-2nd 7928 df-tpos 8162 df-frecs 8217 df-wrecs 8248 df-recs 8297 df-rdg 8335 df-er 8628 df-en 8876 df-dom 8877 df-sdom 8878 df-pnf 11154 df-mnf 11155 df-xr 11156 df-ltxr 11157 df-le 11158 df-sub 11352 df-neg 11353 df-nn 12132 df-2 12194 df-3 12195 df-sets 17081 df-slot 17099 df-ndx 17111 df-base 17127 df-ress 17148 df-plusg 17180 df-mulr 17181 df-0g 17351 df-mgm 18554 df-sgrp 18633 df-mnd 18649 df-grp 18855 df-minusg 18856 df-sbg 18857 df-cmn 19700 df-abl 19701 df-mgp 20065 df-rng 20077 df-ur 20106 df-ring 20159 df-oppr 20261 df-dvdsr 20281 df-unit 20282 df-invr 20312 df-drng 20652 df-lmod 20801 df-lss 20871 df-lsp 20911 df-lvec 21043

This theorem is referenced by: lsppratlem5 21094

W3C validator