Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > lkrss2N | Structured version Visualization version GIF version |
Description: Two functionals with kernels in a subset relationship. (Contributed by NM, 17-Feb-2015.) (New usage is discouraged.) |
Ref | Expression |
---|---|
lkrss2.s | ⊢ 𝑆 = (Scalar‘𝑊) |
lkrss2.r | ⊢ 𝑅 = (Base‘𝑆) |
lkrss2.f | ⊢ 𝐹 = (LFnl‘𝑊) |
lkrss2.k | ⊢ 𝐾 = (LKer‘𝑊) |
lkrss2.d | ⊢ 𝐷 = (LDual‘𝑊) |
lkrss2.t | ⊢ · = ( ·𝑠 ‘𝐷) |
lkrss2.w | ⊢ (𝜑 → 𝑊 ∈ LVec) |
lkrss2.g | ⊢ (𝜑 → 𝐺 ∈ 𝐹) |
lkrss2.h | ⊢ (𝜑 → 𝐻 ∈ 𝐹) |
Ref | Expression |
---|---|
lkrss2N | ⊢ (𝜑 → ((𝐾‘𝐺) ⊆ (𝐾‘𝐻) ↔ ∃𝑟 ∈ 𝑅 𝐻 = (𝑟 · 𝐺))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sspss 4079 | . . 3 ⊢ ((𝐾‘𝐺) ⊆ (𝐾‘𝐻) ↔ ((𝐾‘𝐺) ⊊ (𝐾‘𝐻) ∨ (𝐾‘𝐺) = (𝐾‘𝐻))) | |
2 | lkrss2.f | . . . . . . 7 ⊢ 𝐹 = (LFnl‘𝑊) | |
3 | lkrss2.k | . . . . . . 7 ⊢ 𝐾 = (LKer‘𝑊) | |
4 | lkrss2.d | . . . . . . 7 ⊢ 𝐷 = (LDual‘𝑊) | |
5 | eqid 2824 | . . . . . . 7 ⊢ (0g‘𝐷) = (0g‘𝐷) | |
6 | lkrss2.w | . . . . . . 7 ⊢ (𝜑 → 𝑊 ∈ LVec) | |
7 | lkrss2.g | . . . . . . 7 ⊢ (𝜑 → 𝐺 ∈ 𝐹) | |
8 | lkrss2.h | . . . . . . 7 ⊢ (𝜑 → 𝐻 ∈ 𝐹) | |
9 | 2, 3, 4, 5, 6, 7, 8 | lkrpssN 36303 | . . . . . 6 ⊢ (𝜑 → ((𝐾‘𝐺) ⊊ (𝐾‘𝐻) ↔ (𝐺 ≠ (0g‘𝐷) ∧ 𝐻 = (0g‘𝐷)))) |
10 | lveclmod 19881 | . . . . . . . . . . . 12 ⊢ (𝑊 ∈ LVec → 𝑊 ∈ LMod) | |
11 | 6, 10 | syl 17 | . . . . . . . . . . 11 ⊢ (𝜑 → 𝑊 ∈ LMod) |
12 | lkrss2.s | . . . . . . . . . . . 12 ⊢ 𝑆 = (Scalar‘𝑊) | |
13 | lkrss2.r | . . . . . . . . . . . 12 ⊢ 𝑅 = (Base‘𝑆) | |
14 | eqid 2824 | . . . . . . . . . . . 12 ⊢ (0g‘𝑆) = (0g‘𝑆) | |
15 | 12, 13, 14 | lmod0cl 19663 | . . . . . . . . . . 11 ⊢ (𝑊 ∈ LMod → (0g‘𝑆) ∈ 𝑅) |
16 | 11, 15 | syl 17 | . . . . . . . . . 10 ⊢ (𝜑 → (0g‘𝑆) ∈ 𝑅) |
17 | 16 | adantr 483 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐻 = (0g‘𝐷)) → (0g‘𝑆) ∈ 𝑅) |
18 | simpr 487 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐻 = (0g‘𝐷)) → 𝐻 = (0g‘𝐷)) | |
19 | lkrss2.t | . . . . . . . . . . . 12 ⊢ · = ( ·𝑠 ‘𝐷) | |
20 | 2, 12, 14, 4, 19, 5, 11, 7 | ldual0vs 36300 | . . . . . . . . . . 11 ⊢ (𝜑 → ((0g‘𝑆) · 𝐺) = (0g‘𝐷)) |
21 | 20 | adantr 483 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐻 = (0g‘𝐷)) → ((0g‘𝑆) · 𝐺) = (0g‘𝐷)) |
22 | 18, 21 | eqtr4d 2862 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐻 = (0g‘𝐷)) → 𝐻 = ((0g‘𝑆) · 𝐺)) |
23 | oveq1 7166 | . . . . . . . . . 10 ⊢ (𝑟 = (0g‘𝑆) → (𝑟 · 𝐺) = ((0g‘𝑆) · 𝐺)) | |
24 | 23 | rspceeqv 3641 | . . . . . . . . 9 ⊢ (((0g‘𝑆) ∈ 𝑅 ∧ 𝐻 = ((0g‘𝑆) · 𝐺)) → ∃𝑟 ∈ 𝑅 𝐻 = (𝑟 · 𝐺)) |
25 | 17, 22, 24 | syl2anc 586 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐻 = (0g‘𝐷)) → ∃𝑟 ∈ 𝑅 𝐻 = (𝑟 · 𝐺)) |
26 | 25 | ex 415 | . . . . . . 7 ⊢ (𝜑 → (𝐻 = (0g‘𝐷) → ∃𝑟 ∈ 𝑅 𝐻 = (𝑟 · 𝐺))) |
27 | 26 | adantld 493 | . . . . . 6 ⊢ (𝜑 → ((𝐺 ≠ (0g‘𝐷) ∧ 𝐻 = (0g‘𝐷)) → ∃𝑟 ∈ 𝑅 𝐻 = (𝑟 · 𝐺))) |
28 | 9, 27 | sylbid 242 | . . . . 5 ⊢ (𝜑 → ((𝐾‘𝐺) ⊊ (𝐾‘𝐻) → ∃𝑟 ∈ 𝑅 𝐻 = (𝑟 · 𝐺))) |
29 | 28 | imp 409 | . . . 4 ⊢ ((𝜑 ∧ (𝐾‘𝐺) ⊊ (𝐾‘𝐻)) → ∃𝑟 ∈ 𝑅 𝐻 = (𝑟 · 𝐺)) |
30 | 6 | adantr 483 | . . . . 5 ⊢ ((𝜑 ∧ (𝐾‘𝐺) = (𝐾‘𝐻)) → 𝑊 ∈ LVec) |
31 | 7 | adantr 483 | . . . . 5 ⊢ ((𝜑 ∧ (𝐾‘𝐺) = (𝐾‘𝐻)) → 𝐺 ∈ 𝐹) |
32 | 8 | adantr 483 | . . . . 5 ⊢ ((𝜑 ∧ (𝐾‘𝐺) = (𝐾‘𝐻)) → 𝐻 ∈ 𝐹) |
33 | simpr 487 | . . . . 5 ⊢ ((𝜑 ∧ (𝐾‘𝐺) = (𝐾‘𝐻)) → (𝐾‘𝐺) = (𝐾‘𝐻)) | |
34 | 12, 13, 2, 3, 4, 19, 30, 31, 32, 33 | eqlkr4 36305 | . . . 4 ⊢ ((𝜑 ∧ (𝐾‘𝐺) = (𝐾‘𝐻)) → ∃𝑟 ∈ 𝑅 𝐻 = (𝑟 · 𝐺)) |
35 | 29, 34 | jaodan 954 | . . 3 ⊢ ((𝜑 ∧ ((𝐾‘𝐺) ⊊ (𝐾‘𝐻) ∨ (𝐾‘𝐺) = (𝐾‘𝐻))) → ∃𝑟 ∈ 𝑅 𝐻 = (𝑟 · 𝐺)) |
36 | 1, 35 | sylan2b 595 | . 2 ⊢ ((𝜑 ∧ (𝐾‘𝐺) ⊆ (𝐾‘𝐻)) → ∃𝑟 ∈ 𝑅 𝐻 = (𝑟 · 𝐺)) |
37 | 6 | adantr 483 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑟 ∈ 𝑅) → 𝑊 ∈ LVec) |
38 | 7 | adantr 483 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑟 ∈ 𝑅) → 𝐺 ∈ 𝐹) |
39 | simpr 487 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑟 ∈ 𝑅) → 𝑟 ∈ 𝑅) | |
40 | 12, 13, 2, 3, 4, 19, 37, 38, 39 | lkrss 36308 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑟 ∈ 𝑅) → (𝐾‘𝐺) ⊆ (𝐾‘(𝑟 · 𝐺))) |
41 | 40 | ex 415 | . . . . 5 ⊢ (𝜑 → (𝑟 ∈ 𝑅 → (𝐾‘𝐺) ⊆ (𝐾‘(𝑟 · 𝐺)))) |
42 | fveq2 6673 | . . . . . . 7 ⊢ (𝐻 = (𝑟 · 𝐺) → (𝐾‘𝐻) = (𝐾‘(𝑟 · 𝐺))) | |
43 | 42 | sseq2d 4002 | . . . . . 6 ⊢ (𝐻 = (𝑟 · 𝐺) → ((𝐾‘𝐺) ⊆ (𝐾‘𝐻) ↔ (𝐾‘𝐺) ⊆ (𝐾‘(𝑟 · 𝐺)))) |
44 | 43 | biimprcd 252 | . . . . 5 ⊢ ((𝐾‘𝐺) ⊆ (𝐾‘(𝑟 · 𝐺)) → (𝐻 = (𝑟 · 𝐺) → (𝐾‘𝐺) ⊆ (𝐾‘𝐻))) |
45 | 41, 44 | syl6 35 | . . . 4 ⊢ (𝜑 → (𝑟 ∈ 𝑅 → (𝐻 = (𝑟 · 𝐺) → (𝐾‘𝐺) ⊆ (𝐾‘𝐻)))) |
46 | 45 | rexlimdv 3286 | . . 3 ⊢ (𝜑 → (∃𝑟 ∈ 𝑅 𝐻 = (𝑟 · 𝐺) → (𝐾‘𝐺) ⊆ (𝐾‘𝐻))) |
47 | 46 | imp 409 | . 2 ⊢ ((𝜑 ∧ ∃𝑟 ∈ 𝑅 𝐻 = (𝑟 · 𝐺)) → (𝐾‘𝐺) ⊆ (𝐾‘𝐻)) |
48 | 36, 47 | impbida 799 | 1 ⊢ (𝜑 → ((𝐾‘𝐺) ⊆ (𝐾‘𝐻) ↔ ∃𝑟 ∈ 𝑅 𝐻 = (𝑟 · 𝐺))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∨ wo 843 = wceq 1536 ∈ wcel 2113 ≠ wne 3019 ∃wrex 3142 ⊆ wss 3939 ⊊ wpss 3940 ‘cfv 6358 (class class class)co 7159 Basecbs 16486 Scalarcsca 16571 ·𝑠 cvsca 16572 0gc0g 16716 LModclmod 19637 LVecclvec 19877 LFnlclfn 36197 LKerclk 36225 LDualcld 36263 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-rep 5193 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 ax-un 7464 ax-cnex 10596 ax-resscn 10597 ax-1cn 10598 ax-icn 10599 ax-addcl 10600 ax-addrcl 10601 ax-mulcl 10602 ax-mulrcl 10603 ax-mulcom 10604 ax-addass 10605 ax-mulass 10606 ax-distr 10607 ax-i2m1 10608 ax-1ne0 10609 ax-1rid 10610 ax-rnegex 10611 ax-rrecex 10612 ax-cnre 10613 ax-pre-lttri 10614 ax-pre-lttrn 10615 ax-pre-ltadd 10616 ax-pre-mulgt0 10617 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-nel 3127 df-ral 3146 df-rex 3147 df-reu 3148 df-rmo 3149 df-rab 3150 df-v 3499 df-sbc 3776 df-csb 3887 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-pss 3957 df-nul 4295 df-if 4471 df-pw 4544 df-sn 4571 df-pr 4573 df-tp 4575 df-op 4577 df-uni 4842 df-int 4880 df-iun 4924 df-br 5070 df-opab 5132 df-mpt 5150 df-tr 5176 df-id 5463 df-eprel 5468 df-po 5477 df-so 5478 df-fr 5517 df-we 5519 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-pred 6151 df-ord 6197 df-on 6198 df-lim 6199 df-suc 6200 df-iota 6317 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-riota 7117 df-ov 7162 df-oprab 7163 df-mpo 7164 df-of 7412 df-om 7584 df-1st 7692 df-2nd 7693 df-tpos 7895 df-wrecs 7950 df-recs 8011 df-rdg 8049 df-1o 8105 df-oadd 8109 df-er 8292 df-map 8411 df-en 8513 df-dom 8514 df-sdom 8515 df-fin 8516 df-pnf 10680 df-mnf 10681 df-xr 10682 df-ltxr 10683 df-le 10684 df-sub 10875 df-neg 10876 df-nn 11642 df-2 11703 df-3 11704 df-4 11705 df-5 11706 df-6 11707 df-n0 11901 df-z 11985 df-uz 12247 df-fz 12896 df-struct 16488 df-ndx 16489 df-slot 16490 df-base 16492 df-sets 16493 df-ress 16494 df-plusg 16581 df-mulr 16582 df-sca 16584 df-vsca 16585 df-0g 16718 df-mgm 17855 df-sgrp 17904 df-mnd 17915 df-submnd 17960 df-grp 18109 df-minusg 18110 df-sbg 18111 df-subg 18279 df-cntz 18450 df-lsm 18764 df-cmn 18911 df-abl 18912 df-mgp 19243 df-ur 19255 df-ring 19302 df-oppr 19376 df-dvdsr 19394 df-unit 19395 df-invr 19425 df-drng 19507 df-lmod 19639 df-lss 19707 df-lsp 19747 df-lvec 19878 df-lshyp 36117 df-lfl 36198 df-lkr 36226 df-ldual 36264 |
This theorem is referenced by: lcfrvalsnN 38681 |
Copyright terms: Public domain | W3C validator |