lspindp2 - Metamath Proof Explorer

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

Theorem lspindp2 20312

Description: Alternate way to say 3 vectors are mutually independent (rotate right). (Contributed by NM, 12-Apr-2015.)

**Hypotheses**
Ref	Expression
lspindp1.v	⊢ 𝑉 = (Base‘𝑊)
lspindp1.o	⊢ 0 = (0_g‘𝑊)
lspindp1.n	⊢ 𝑁 = (LSpan‘𝑊)
lspindp1.w	⊢ (𝜑 → 𝑊 ∈ LVec)
lspindp2.x	⊢ (𝜑 → 𝑋 ∈ 𝑉)
lspindp2.y	⊢ (𝜑 → 𝑌 ∈ (𝑉 ∖ { 0 }))
lspindp2.z	⊢ (𝜑 → 𝑍 ∈ 𝑉)
lspindp2.q	⊢ (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))
lspindp2.e	⊢ (𝜑 → ¬ 𝑍 ∈ (𝑁‘{𝑋, 𝑌}))

**Assertion**
Ref	Expression
lspindp2	⊢ (𝜑 → ((𝑁‘{𝑍}) ≠ (𝑁‘{𝑋}) ∧ ¬ 𝑌 ∈ (𝑁‘{𝑍, 𝑋})))

**Proof of Theorem lspindp2**
Step	Hyp	Ref	Expression
1		lspindp1.v	. 2 ⊢ 𝑉 = (Base‘𝑊)
2		lspindp1.o	. 2 ⊢ 0 = (0_g‘𝑊)
3		lspindp1.n	. 2 ⊢ 𝑁 = (LSpan‘𝑊)
4		lspindp1.w	. 2 ⊢ (𝜑 → 𝑊 ∈ LVec)
5		lspindp2.y	. 2 ⊢ (𝜑 → 𝑌 ∈ (𝑉 ∖ { 0 }))
6		lspindp2.x	. 2 ⊢ (𝜑 → 𝑋 ∈ 𝑉)
7		lspindp2.z	. 2 ⊢ (𝜑 → 𝑍 ∈ 𝑉)
8		lspindp2.q	. . 3 ⊢ (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))
9	8	necomd 2998	. 2 ⊢ (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑋}))
10		lspindp2.e	. . 3 ⊢ (𝜑 → ¬ 𝑍 ∈ (𝑁‘{𝑋, 𝑌}))
11		prcom 4665	. . . . 5 ⊢ {𝑋, 𝑌} = {𝑌, 𝑋}
12	11	fveq2i 6759	. . . 4 ⊢ (𝑁‘{𝑋, 𝑌}) = (𝑁‘{𝑌, 𝑋})
13	12	eleq2i 2830	. . 3 ⊢ (𝑍 ∈ (𝑁‘{𝑋, 𝑌}) ↔ 𝑍 ∈ (𝑁‘{𝑌, 𝑋}))
14	10, 13	sylnib 327	. 2 ⊢ (𝜑 → ¬ 𝑍 ∈ (𝑁‘{𝑌, 𝑋}))
15	1, 2, 3, 4, 5, 6, 7, 9, 14	lspindp1 20310	1 ⊢ (𝜑 → ((𝑁‘{𝑍}) ≠ (𝑁‘{𝑋}) ∧ ¬ 𝑌 ∈ (𝑁‘{𝑍, 𝑋})))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1539 ∈ wcel 2108 ≠ wne 2942 ∖ cdif 3880 {csn 4558 {cpr 4560 ‘cfv 6418 Basecbs 16840 0_gc0g 17067 LSpanclspn 20148 LVecclvec 20279

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879

This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-int 4877 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-1st 7804 df-2nd 7805 df-tpos 8013 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-er 8456 df-en 8692 df-dom 8693 df-sdom 8694 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-nn 11904 df-2 11966 df-3 11967 df-sets 16793 df-slot 16811 df-ndx 16823 df-base 16841 df-ress 16868 df-plusg 16901 df-mulr 16902 df-0g 17069 df-mgm 18241 df-sgrp 18290 df-mnd 18301 df-submnd 18346 df-grp 18495 df-minusg 18496 df-sbg 18497 df-subg 18667 df-cntz 18838 df-lsm 19156 df-cmn 19303 df-abl 19304 df-mgp 19636 df-ur 19653 df-ring 19700 df-oppr 19777 df-dvdsr 19798 df-unit 19799 df-invr 19829 df-drng 19908 df-lmod 20040 df-lss 20109 df-lsp 20149 df-lvec 20280

This theorem is referenced by: mapdheq4lem 39672 mapdheq4 39673 mapdh6lem1N 39674 mapdh6lem2N 39675 mapdh6aN 39676 hdmap1l6lem1 39748 hdmap1l6lem2 39749 hdmap1l6a 39750

W3C validator