Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > lclkrlem2n | Structured version Visualization version GIF version |
Description: Lemma for lclkr 39547. (Contributed by NM, 12-Jan-2015.) |
Ref | Expression |
---|---|
lclkrlem2m.v | ⊢ 𝑉 = (Base‘𝑈) |
lclkrlem2m.t | ⊢ · = ( ·𝑠 ‘𝑈) |
lclkrlem2m.s | ⊢ 𝑆 = (Scalar‘𝑈) |
lclkrlem2m.q | ⊢ × = (.r‘𝑆) |
lclkrlem2m.z | ⊢ 0 = (0g‘𝑆) |
lclkrlem2m.i | ⊢ 𝐼 = (invr‘𝑆) |
lclkrlem2m.m | ⊢ − = (-g‘𝑈) |
lclkrlem2m.f | ⊢ 𝐹 = (LFnl‘𝑈) |
lclkrlem2m.d | ⊢ 𝐷 = (LDual‘𝑈) |
lclkrlem2m.p | ⊢ + = (+g‘𝐷) |
lclkrlem2m.x | ⊢ (𝜑 → 𝑋 ∈ 𝑉) |
lclkrlem2m.y | ⊢ (𝜑 → 𝑌 ∈ 𝑉) |
lclkrlem2m.e | ⊢ (𝜑 → 𝐸 ∈ 𝐹) |
lclkrlem2m.g | ⊢ (𝜑 → 𝐺 ∈ 𝐹) |
lclkrlem2n.n | ⊢ 𝑁 = (LSpan‘𝑈) |
lclkrlem2n.l | ⊢ 𝐿 = (LKer‘𝑈) |
lclkrlem2n.w | ⊢ (𝜑 → 𝑈 ∈ LVec) |
lclkrlem2n.j | ⊢ (𝜑 → ((𝐸 + 𝐺)‘𝑋) = 0 ) |
lclkrlem2n.k | ⊢ (𝜑 → ((𝐸 + 𝐺)‘𝑌) = 0 ) |
Ref | Expression |
---|---|
lclkrlem2n | ⊢ (𝜑 → (𝑁‘{𝑋, 𝑌}) ⊆ (𝐿‘(𝐸 + 𝐺))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2738 | . 2 ⊢ (LSubSp‘𝑈) = (LSubSp‘𝑈) | |
2 | lclkrlem2n.n | . 2 ⊢ 𝑁 = (LSpan‘𝑈) | |
3 | lclkrlem2n.w | . . 3 ⊢ (𝜑 → 𝑈 ∈ LVec) | |
4 | lveclmod 20368 | . . 3 ⊢ (𝑈 ∈ LVec → 𝑈 ∈ LMod) | |
5 | 3, 4 | syl 17 | . 2 ⊢ (𝜑 → 𝑈 ∈ LMod) |
6 | lclkrlem2m.f | . . . 4 ⊢ 𝐹 = (LFnl‘𝑈) | |
7 | lclkrlem2m.d | . . . 4 ⊢ 𝐷 = (LDual‘𝑈) | |
8 | lclkrlem2m.p | . . . 4 ⊢ + = (+g‘𝐷) | |
9 | lclkrlem2m.e | . . . 4 ⊢ (𝜑 → 𝐸 ∈ 𝐹) | |
10 | lclkrlem2m.g | . . . 4 ⊢ (𝜑 → 𝐺 ∈ 𝐹) | |
11 | 6, 7, 8, 5, 9, 10 | ldualvaddcl 37144 | . . 3 ⊢ (𝜑 → (𝐸 + 𝐺) ∈ 𝐹) |
12 | lclkrlem2n.l | . . . 4 ⊢ 𝐿 = (LKer‘𝑈) | |
13 | 6, 12, 1 | lkrlss 37109 | . . 3 ⊢ ((𝑈 ∈ LMod ∧ (𝐸 + 𝐺) ∈ 𝐹) → (𝐿‘(𝐸 + 𝐺)) ∈ (LSubSp‘𝑈)) |
14 | 5, 11, 13 | syl2anc 584 | . 2 ⊢ (𝜑 → (𝐿‘(𝐸 + 𝐺)) ∈ (LSubSp‘𝑈)) |
15 | lclkrlem2n.j | . . 3 ⊢ (𝜑 → ((𝐸 + 𝐺)‘𝑋) = 0 ) | |
16 | lclkrlem2m.v | . . . 4 ⊢ 𝑉 = (Base‘𝑈) | |
17 | lclkrlem2m.s | . . . 4 ⊢ 𝑆 = (Scalar‘𝑈) | |
18 | lclkrlem2m.z | . . . 4 ⊢ 0 = (0g‘𝑆) | |
19 | lclkrlem2m.x | . . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝑉) | |
20 | 16, 17, 18, 6, 12, 3, 11, 19 | ellkr2 37105 | . . 3 ⊢ (𝜑 → (𝑋 ∈ (𝐿‘(𝐸 + 𝐺)) ↔ ((𝐸 + 𝐺)‘𝑋) = 0 )) |
21 | 15, 20 | mpbird 256 | . 2 ⊢ (𝜑 → 𝑋 ∈ (𝐿‘(𝐸 + 𝐺))) |
22 | lclkrlem2n.k | . . 3 ⊢ (𝜑 → ((𝐸 + 𝐺)‘𝑌) = 0 ) | |
23 | lclkrlem2m.y | . . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝑉) | |
24 | 16, 17, 18, 6, 12, 3, 11, 23 | ellkr2 37105 | . . 3 ⊢ (𝜑 → (𝑌 ∈ (𝐿‘(𝐸 + 𝐺)) ↔ ((𝐸 + 𝐺)‘𝑌) = 0 )) |
25 | 22, 24 | mpbird 256 | . 2 ⊢ (𝜑 → 𝑌 ∈ (𝐿‘(𝐸 + 𝐺))) |
26 | 1, 2, 5, 14, 21, 25 | lspprss 20254 | 1 ⊢ (𝜑 → (𝑁‘{𝑋, 𝑌}) ⊆ (𝐿‘(𝐸 + 𝐺))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1539 ∈ wcel 2106 ⊆ wss 3887 {cpr 4563 ‘cfv 6433 (class class class)co 7275 Basecbs 16912 +gcplusg 16962 .rcmulr 16963 Scalarcsca 16965 ·𝑠 cvsca 16966 0gc0g 17150 -gcsg 18579 invrcinvr 19913 LModclmod 20123 LSubSpclss 20193 LSpanclspn 20233 LVecclvec 20364 LFnlclfn 37071 LKerclk 37099 LDualcld 37137 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-cnex 10927 ax-resscn 10928 ax-1cn 10929 ax-icn 10930 ax-addcl 10931 ax-addrcl 10932 ax-mulcl 10933 ax-mulrcl 10934 ax-mulcom 10935 ax-addass 10936 ax-mulass 10937 ax-distr 10938 ax-i2m1 10939 ax-1ne0 10940 ax-1rid 10941 ax-rnegex 10942 ax-rrecex 10943 ax-cnre 10944 ax-pre-lttri 10945 ax-pre-lttrn 10946 ax-pre-ltadd 10947 ax-pre-mulgt0 10948 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-tp 4566 df-op 4568 df-uni 4840 df-int 4880 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-riota 7232 df-ov 7278 df-oprab 7279 df-mpo 7280 df-of 7533 df-om 7713 df-1st 7831 df-2nd 7832 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-1o 8297 df-er 8498 df-map 8617 df-en 8734 df-dom 8735 df-sdom 8736 df-fin 8737 df-pnf 11011 df-mnf 11012 df-xr 11013 df-ltxr 11014 df-le 11015 df-sub 11207 df-neg 11208 df-nn 11974 df-2 12036 df-3 12037 df-4 12038 df-5 12039 df-6 12040 df-n0 12234 df-z 12320 df-uz 12583 df-fz 13240 df-struct 16848 df-sets 16865 df-slot 16883 df-ndx 16895 df-base 16913 df-plusg 16975 df-sca 16978 df-vsca 16979 df-0g 17152 df-mgm 18326 df-sgrp 18375 df-mnd 18386 df-grp 18580 df-minusg 18581 df-sbg 18582 df-cmn 19388 df-abl 19389 df-mgp 19721 df-ur 19738 df-ring 19785 df-lmod 20125 df-lss 20194 df-lsp 20234 df-lvec 20365 df-lfl 37072 df-lkr 37100 df-ldual 37138 |
This theorem is referenced by: lclkrlem2v 39542 |
Copyright terms: Public domain | W3C validator |