Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > mapdpglem3 | Structured version Visualization version GIF version |
Description: Lemma for mapdpg 39343. Baer p. 45, line 3: "infer...the existence of a number g in G and of an element z in (Fy)* such that t = gx'-z." (We scope $d 𝑔𝑤𝑧𝜑 locally to avoid clashes with later substitutions into 𝜑.) (Contributed by NM, 18-Mar-2015.) |
Ref | Expression |
---|---|
mapdpglem.h | ⊢ 𝐻 = (LHyp‘𝐾) |
mapdpglem.m | ⊢ 𝑀 = ((mapd‘𝐾)‘𝑊) |
mapdpglem.u | ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊) |
mapdpglem.v | ⊢ 𝑉 = (Base‘𝑈) |
mapdpglem.s | ⊢ − = (-g‘𝑈) |
mapdpglem.n | ⊢ 𝑁 = (LSpan‘𝑈) |
mapdpglem.c | ⊢ 𝐶 = ((LCDual‘𝐾)‘𝑊) |
mapdpglem.k | ⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) |
mapdpglem.x | ⊢ (𝜑 → 𝑋 ∈ 𝑉) |
mapdpglem.y | ⊢ (𝜑 → 𝑌 ∈ 𝑉) |
mapdpglem1.p | ⊢ ⊕ = (LSSum‘𝐶) |
mapdpglem2.j | ⊢ 𝐽 = (LSpan‘𝐶) |
mapdpglem3.f | ⊢ 𝐹 = (Base‘𝐶) |
mapdpglem3.te | ⊢ (𝜑 → 𝑡 ∈ ((𝑀‘(𝑁‘{𝑋})) ⊕ (𝑀‘(𝑁‘{𝑌})))) |
mapdpglem3.a | ⊢ 𝐴 = (Scalar‘𝑈) |
mapdpglem3.b | ⊢ 𝐵 = (Base‘𝐴) |
mapdpglem3.t | ⊢ · = ( ·𝑠 ‘𝐶) |
mapdpglem3.r | ⊢ 𝑅 = (-g‘𝐶) |
mapdpglem3.g | ⊢ (𝜑 → 𝐺 ∈ 𝐹) |
mapdpglem3.e | ⊢ (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐺})) |
Ref | Expression |
---|---|
mapdpglem3 | ⊢ (𝜑 → ∃𝑔 ∈ 𝐵 ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = ((𝑔 · 𝐺)𝑅𝑧)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mapdpglem3.te | . . . 4 ⊢ (𝜑 → 𝑡 ∈ ((𝑀‘(𝑁‘{𝑋})) ⊕ (𝑀‘(𝑁‘{𝑌})))) | |
2 | mapdpglem3.e | . . . . 5 ⊢ (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐺})) | |
3 | 2 | oveq1d 7185 | . . . 4 ⊢ (𝜑 → ((𝑀‘(𝑁‘{𝑋})) ⊕ (𝑀‘(𝑁‘{𝑌}))) = ((𝐽‘{𝐺}) ⊕ (𝑀‘(𝑁‘{𝑌})))) |
4 | 1, 3 | eleqtrd 2835 | . . 3 ⊢ (𝜑 → 𝑡 ∈ ((𝐽‘{𝐺}) ⊕ (𝑀‘(𝑁‘{𝑌})))) |
5 | r19.41v 3251 | . . . . . . 7 ⊢ (∃𝑔 ∈ 𝐵 (𝑤 = (𝑔 · 𝐺) ∧ ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧)) ↔ (∃𝑔 ∈ 𝐵 𝑤 = (𝑔 · 𝐺) ∧ ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧))) | |
6 | mapdpglem.h | . . . . . . . . . . 11 ⊢ 𝐻 = (LHyp‘𝐾) | |
7 | mapdpglem.c | . . . . . . . . . . 11 ⊢ 𝐶 = ((LCDual‘𝐾)‘𝑊) | |
8 | mapdpglem.k | . . . . . . . . . . 11 ⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) | |
9 | 6, 7, 8 | lcdlmod 39229 | . . . . . . . . . 10 ⊢ (𝜑 → 𝐶 ∈ LMod) |
10 | mapdpglem3.g | . . . . . . . . . 10 ⊢ (𝜑 → 𝐺 ∈ 𝐹) | |
11 | eqid 2738 | . . . . . . . . . . 11 ⊢ (Scalar‘𝐶) = (Scalar‘𝐶) | |
12 | eqid 2738 | . . . . . . . . . . 11 ⊢ (Base‘(Scalar‘𝐶)) = (Base‘(Scalar‘𝐶)) | |
13 | mapdpglem3.f | . . . . . . . . . . 11 ⊢ 𝐹 = (Base‘𝐶) | |
14 | mapdpglem3.t | . . . . . . . . . . 11 ⊢ · = ( ·𝑠 ‘𝐶) | |
15 | mapdpglem2.j | . . . . . . . . . . 11 ⊢ 𝐽 = (LSpan‘𝐶) | |
16 | 11, 12, 13, 14, 15 | lspsnel 19894 | . . . . . . . . . 10 ⊢ ((𝐶 ∈ LMod ∧ 𝐺 ∈ 𝐹) → (𝑤 ∈ (𝐽‘{𝐺}) ↔ ∃𝑔 ∈ (Base‘(Scalar‘𝐶))𝑤 = (𝑔 · 𝐺))) |
17 | 9, 10, 16 | syl2anc 587 | . . . . . . . . 9 ⊢ (𝜑 → (𝑤 ∈ (𝐽‘{𝐺}) ↔ ∃𝑔 ∈ (Base‘(Scalar‘𝐶))𝑤 = (𝑔 · 𝐺))) |
18 | mapdpglem.u | . . . . . . . . . . 11 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊) | |
19 | mapdpglem3.a | . . . . . . . . . . 11 ⊢ 𝐴 = (Scalar‘𝑈) | |
20 | mapdpglem3.b | . . . . . . . . . . 11 ⊢ 𝐵 = (Base‘𝐴) | |
21 | 6, 18, 19, 20, 7, 11, 12, 8 | lcdsbase 39237 | . . . . . . . . . 10 ⊢ (𝜑 → (Base‘(Scalar‘𝐶)) = 𝐵) |
22 | 21 | rexeqdv 3317 | . . . . . . . . 9 ⊢ (𝜑 → (∃𝑔 ∈ (Base‘(Scalar‘𝐶))𝑤 = (𝑔 · 𝐺) ↔ ∃𝑔 ∈ 𝐵 𝑤 = (𝑔 · 𝐺))) |
23 | 17, 22 | bitrd 282 | . . . . . . . 8 ⊢ (𝜑 → (𝑤 ∈ (𝐽‘{𝐺}) ↔ ∃𝑔 ∈ 𝐵 𝑤 = (𝑔 · 𝐺))) |
24 | 23 | anbi1d 633 | . . . . . . 7 ⊢ (𝜑 → ((𝑤 ∈ (𝐽‘{𝐺}) ∧ ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧)) ↔ (∃𝑔 ∈ 𝐵 𝑤 = (𝑔 · 𝐺) ∧ ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧)))) |
25 | 5, 24 | bitr4id 293 | . . . . . 6 ⊢ (𝜑 → (∃𝑔 ∈ 𝐵 (𝑤 = (𝑔 · 𝐺) ∧ ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧)) ↔ (𝑤 ∈ (𝐽‘{𝐺}) ∧ ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧)))) |
26 | 25 | exbidv 1928 | . . . . 5 ⊢ (𝜑 → (∃𝑤∃𝑔 ∈ 𝐵 (𝑤 = (𝑔 · 𝐺) ∧ ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧)) ↔ ∃𝑤(𝑤 ∈ (𝐽‘{𝐺}) ∧ ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧)))) |
27 | df-rex 3059 | . . . . 5 ⊢ (∃𝑤 ∈ (𝐽‘{𝐺})∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧) ↔ ∃𝑤(𝑤 ∈ (𝐽‘{𝐺}) ∧ ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧))) | |
28 | 26, 27 | bitr4di 292 | . . . 4 ⊢ (𝜑 → (∃𝑤∃𝑔 ∈ 𝐵 (𝑤 = (𝑔 · 𝐺) ∧ ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧)) ↔ ∃𝑤 ∈ (𝐽‘{𝐺})∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧))) |
29 | mapdpglem3.r | . . . . 5 ⊢ 𝑅 = (-g‘𝐶) | |
30 | mapdpglem1.p | . . . . 5 ⊢ ⊕ = (LSSum‘𝐶) | |
31 | eqid 2738 | . . . . . . . 8 ⊢ (LSubSp‘𝐶) = (LSubSp‘𝐶) | |
32 | 31 | lsssssubg 19849 | . . . . . . 7 ⊢ (𝐶 ∈ LMod → (LSubSp‘𝐶) ⊆ (SubGrp‘𝐶)) |
33 | 9, 32 | syl 17 | . . . . . 6 ⊢ (𝜑 → (LSubSp‘𝐶) ⊆ (SubGrp‘𝐶)) |
34 | 13, 31, 15 | lspsncl 19868 | . . . . . . 7 ⊢ ((𝐶 ∈ LMod ∧ 𝐺 ∈ 𝐹) → (𝐽‘{𝐺}) ∈ (LSubSp‘𝐶)) |
35 | 9, 10, 34 | syl2anc 587 | . . . . . 6 ⊢ (𝜑 → (𝐽‘{𝐺}) ∈ (LSubSp‘𝐶)) |
36 | 33, 35 | sseldd 3878 | . . . . 5 ⊢ (𝜑 → (𝐽‘{𝐺}) ∈ (SubGrp‘𝐶)) |
37 | mapdpglem.m | . . . . . . 7 ⊢ 𝑀 = ((mapd‘𝐾)‘𝑊) | |
38 | eqid 2738 | . . . . . . 7 ⊢ (LSubSp‘𝑈) = (LSubSp‘𝑈) | |
39 | 6, 18, 8 | dvhlmod 38747 | . . . . . . . 8 ⊢ (𝜑 → 𝑈 ∈ LMod) |
40 | mapdpglem.y | . . . . . . . 8 ⊢ (𝜑 → 𝑌 ∈ 𝑉) | |
41 | mapdpglem.v | . . . . . . . . 9 ⊢ 𝑉 = (Base‘𝑈) | |
42 | mapdpglem.n | . . . . . . . . 9 ⊢ 𝑁 = (LSpan‘𝑈) | |
43 | 41, 38, 42 | lspsncl 19868 | . . . . . . . 8 ⊢ ((𝑈 ∈ LMod ∧ 𝑌 ∈ 𝑉) → (𝑁‘{𝑌}) ∈ (LSubSp‘𝑈)) |
44 | 39, 40, 43 | syl2anc 587 | . . . . . . 7 ⊢ (𝜑 → (𝑁‘{𝑌}) ∈ (LSubSp‘𝑈)) |
45 | 6, 37, 18, 38, 7, 31, 8, 44 | mapdcl2 39293 | . . . . . 6 ⊢ (𝜑 → (𝑀‘(𝑁‘{𝑌})) ∈ (LSubSp‘𝐶)) |
46 | 33, 45 | sseldd 3878 | . . . . 5 ⊢ (𝜑 → (𝑀‘(𝑁‘{𝑌})) ∈ (SubGrp‘𝐶)) |
47 | 29, 30, 36, 46 | lsmelvalm 18894 | . . . 4 ⊢ (𝜑 → (𝑡 ∈ ((𝐽‘{𝐺}) ⊕ (𝑀‘(𝑁‘{𝑌}))) ↔ ∃𝑤 ∈ (𝐽‘{𝐺})∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧))) |
48 | 28, 47 | bitr4d 285 | . . 3 ⊢ (𝜑 → (∃𝑤∃𝑔 ∈ 𝐵 (𝑤 = (𝑔 · 𝐺) ∧ ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧)) ↔ 𝑡 ∈ ((𝐽‘{𝐺}) ⊕ (𝑀‘(𝑁‘{𝑌}))))) |
49 | 4, 48 | mpbird 260 | . 2 ⊢ (𝜑 → ∃𝑤∃𝑔 ∈ 𝐵 (𝑤 = (𝑔 · 𝐺) ∧ ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧))) |
50 | ovex 7203 | . . . . 5 ⊢ (𝑔 · 𝐺) ∈ V | |
51 | oveq1 7177 | . . . . . . 7 ⊢ (𝑤 = (𝑔 · 𝐺) → (𝑤𝑅𝑧) = ((𝑔 · 𝐺)𝑅𝑧)) | |
52 | 51 | eqeq2d 2749 | . . . . . 6 ⊢ (𝑤 = (𝑔 · 𝐺) → (𝑡 = (𝑤𝑅𝑧) ↔ 𝑡 = ((𝑔 · 𝐺)𝑅𝑧))) |
53 | 52 | rexbidv 3207 | . . . . 5 ⊢ (𝑤 = (𝑔 · 𝐺) → (∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧) ↔ ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = ((𝑔 · 𝐺)𝑅𝑧))) |
54 | 50, 53 | ceqsexv 3445 | . . . 4 ⊢ (∃𝑤(𝑤 = (𝑔 · 𝐺) ∧ ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧)) ↔ ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = ((𝑔 · 𝐺)𝑅𝑧)) |
55 | 54 | rexbii 3161 | . . 3 ⊢ (∃𝑔 ∈ 𝐵 ∃𝑤(𝑤 = (𝑔 · 𝐺) ∧ ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧)) ↔ ∃𝑔 ∈ 𝐵 ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = ((𝑔 · 𝐺)𝑅𝑧)) |
56 | rexcom4 3163 | . . 3 ⊢ (∃𝑔 ∈ 𝐵 ∃𝑤(𝑤 = (𝑔 · 𝐺) ∧ ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧)) ↔ ∃𝑤∃𝑔 ∈ 𝐵 (𝑤 = (𝑔 · 𝐺) ∧ ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧))) | |
57 | 55, 56 | bitr3i 280 | . 2 ⊢ (∃𝑔 ∈ 𝐵 ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = ((𝑔 · 𝐺)𝑅𝑧) ↔ ∃𝑤∃𝑔 ∈ 𝐵 (𝑤 = (𝑔 · 𝐺) ∧ ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = (𝑤𝑅𝑧))) |
58 | 49, 57 | sylibr 237 | 1 ⊢ (𝜑 → ∃𝑔 ∈ 𝐵 ∃𝑧 ∈ (𝑀‘(𝑁‘{𝑌}))𝑡 = ((𝑔 · 𝐺)𝑅𝑧)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 = wceq 1542 ∃wex 1786 ∈ wcel 2114 ∃wrex 3054 ⊆ wss 3843 {csn 4516 ‘cfv 6339 (class class class)co 7170 Basecbs 16586 Scalarcsca 16671 ·𝑠 cvsca 16672 -gcsg 18221 SubGrpcsubg 18391 LSSumclsm 18877 LModclmod 19753 LSubSpclss 19822 LSpanclspn 19862 HLchlt 36987 LHypclh 37621 DVecHcdvh 38715 LCDualclcd 39223 mapdcmpd 39261 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1975 ax-7 2020 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2162 ax-12 2179 ax-ext 2710 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5232 ax-pr 5296 ax-un 7479 ax-cnex 10671 ax-resscn 10672 ax-1cn 10673 ax-icn 10674 ax-addcl 10675 ax-addrcl 10676 ax-mulcl 10677 ax-mulrcl 10678 ax-mulcom 10679 ax-addass 10680 ax-mulass 10681 ax-distr 10682 ax-i2m1 10683 ax-1ne0 10684 ax-1rid 10685 ax-rnegex 10686 ax-rrecex 10687 ax-cnre 10688 ax-pre-lttri 10689 ax-pre-lttrn 10690 ax-pre-ltadd 10691 ax-pre-mulgt0 10692 ax-riotaBAD 36590 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1787 df-nf 1791 df-sb 2075 df-mo 2540 df-eu 2570 df-clab 2717 df-cleq 2730 df-clel 2811 df-nfc 2881 df-ne 2935 df-nel 3039 df-ral 3058 df-rex 3059 df-reu 3060 df-rmo 3061 df-rab 3062 df-v 3400 df-sbc 3681 df-csb 3791 df-dif 3846 df-un 3848 df-in 3850 df-ss 3860 df-pss 3862 df-nul 4212 df-if 4415 df-pw 4490 df-sn 4517 df-pr 4519 df-tp 4521 df-op 4523 df-uni 4797 df-int 4837 df-iun 4883 df-iin 4884 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5429 df-eprel 5434 df-po 5442 df-so 5443 df-fr 5483 df-we 5485 df-xp 5531 df-rel 5532 df-cnv 5533 df-co 5534 df-dm 5535 df-rn 5536 df-res 5537 df-ima 5538 df-pred 6129 df-ord 6175 df-on 6176 df-lim 6177 df-suc 6178 df-iota 6297 df-fun 6341 df-fn 6342 df-f 6343 df-f1 6344 df-fo 6345 df-f1o 6346 df-fv 6347 df-riota 7127 df-ov 7173 df-oprab 7174 df-mpo 7175 df-of 7425 df-om 7600 df-1st 7714 df-2nd 7715 df-tpos 7921 df-undef 7968 df-wrecs 7976 df-recs 8037 df-rdg 8075 df-1o 8131 df-er 8320 df-map 8439 df-en 8556 df-dom 8557 df-sdom 8558 df-fin 8559 df-pnf 10755 df-mnf 10756 df-xr 10757 df-ltxr 10758 df-le 10759 df-sub 10950 df-neg 10951 df-nn 11717 df-2 11779 df-3 11780 df-4 11781 df-5 11782 df-6 11783 df-n0 11977 df-z 12063 df-uz 12325 df-fz 12982 df-struct 16588 df-ndx 16589 df-slot 16590 df-base 16592 df-sets 16593 df-ress 16594 df-plusg 16681 df-mulr 16682 df-sca 16684 df-vsca 16685 df-0g 16818 df-mre 16960 df-mrc 16961 df-acs 16963 df-proset 17654 df-poset 17672 df-plt 17684 df-lub 17700 df-glb 17701 df-join 17702 df-meet 17703 df-p0 17765 df-p1 17766 df-lat 17772 df-clat 17834 df-mgm 17968 df-sgrp 18017 df-mnd 18028 df-submnd 18073 df-grp 18222 df-minusg 18223 df-sbg 18224 df-subg 18394 df-cntz 18565 df-oppg 18592 df-lsm 18879 df-cmn 19026 df-abl 19027 df-mgp 19359 df-ur 19371 df-ring 19418 df-oppr 19495 df-dvdsr 19513 df-unit 19514 df-invr 19544 df-dvr 19555 df-drng 19623 df-lmod 19755 df-lss 19823 df-lsp 19863 df-lvec 19994 df-lsatoms 36613 df-lshyp 36614 df-lcv 36656 df-lfl 36695 df-lkr 36723 df-ldual 36761 df-oposet 36813 df-ol 36815 df-oml 36816 df-covers 36903 df-ats 36904 df-atl 36935 df-cvlat 36959 df-hlat 36988 df-llines 37135 df-lplanes 37136 df-lvols 37137 df-lines 37138 df-psubsp 37140 df-pmap 37141 df-padd 37433 df-lhyp 37625 df-laut 37626 df-ldil 37741 df-ltrn 37742 df-trl 37796 df-tgrp 38380 df-tendo 38392 df-edring 38394 df-dveca 38640 df-disoa 38666 df-dvech 38716 df-dib 38776 df-dic 38810 df-dih 38866 df-doch 38985 df-djh 39032 df-lcdual 39224 df-mapd 39262 |
This theorem is referenced by: mapdpglem24 39341 |
Copyright terms: Public domain | W3C validator |