Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > lshpkrlem3 | Structured version Visualization version GIF version |
Description: Lemma for lshpkrex 33423. Defining property of 𝐺‘𝑋. (Contributed by NM, 15-Jul-2014.) |
Ref | Expression |
---|---|
lshpkrlem.v | ⊢ 𝑉 = (Base‘𝑊) |
lshpkrlem.a | ⊢ + = (+g‘𝑊) |
lshpkrlem.n | ⊢ 𝑁 = (LSpan‘𝑊) |
lshpkrlem.p | ⊢ ⊕ = (LSSum‘𝑊) |
lshpkrlem.h | ⊢ 𝐻 = (LSHyp‘𝑊) |
lshpkrlem.w | ⊢ (𝜑 → 𝑊 ∈ LVec) |
lshpkrlem.u | ⊢ (𝜑 → 𝑈 ∈ 𝐻) |
lshpkrlem.z | ⊢ (𝜑 → 𝑍 ∈ 𝑉) |
lshpkrlem.x | ⊢ (𝜑 → 𝑋 ∈ 𝑉) |
lshpkrlem.e | ⊢ (𝜑 → (𝑈 ⊕ (𝑁‘{𝑍})) = 𝑉) |
lshpkrlem.d | ⊢ 𝐷 = (Scalar‘𝑊) |
lshpkrlem.k | ⊢ 𝐾 = (Base‘𝐷) |
lshpkrlem.t | ⊢ · = ( ·𝑠 ‘𝑊) |
lshpkrlem.o | ⊢ 0 = (0g‘𝐷) |
lshpkrlem.g | ⊢ 𝐺 = (𝑥 ∈ 𝑉 ↦ (℩𝑘 ∈ 𝐾 ∃𝑦 ∈ 𝑈 𝑥 = (𝑦 + (𝑘 · 𝑍)))) |
Ref | Expression |
---|---|
lshpkrlem3 | ⊢ (𝜑 → ∃𝑧 ∈ 𝑈 𝑋 = (𝑧 + ((𝐺‘𝑋) · 𝑍))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | lshpkrlem.v | . . . . 5 ⊢ 𝑉 = (Base‘𝑊) | |
2 | lshpkrlem.a | . . . . 5 ⊢ + = (+g‘𝑊) | |
3 | lshpkrlem.n | . . . . 5 ⊢ 𝑁 = (LSpan‘𝑊) | |
4 | lshpkrlem.p | . . . . 5 ⊢ ⊕ = (LSSum‘𝑊) | |
5 | lshpkrlem.h | . . . . 5 ⊢ 𝐻 = (LSHyp‘𝑊) | |
6 | lshpkrlem.w | . . . . 5 ⊢ (𝜑 → 𝑊 ∈ LVec) | |
7 | lshpkrlem.u | . . . . 5 ⊢ (𝜑 → 𝑈 ∈ 𝐻) | |
8 | lshpkrlem.z | . . . . 5 ⊢ (𝜑 → 𝑍 ∈ 𝑉) | |
9 | lshpkrlem.x | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝑉) | |
10 | lshpkrlem.e | . . . . 5 ⊢ (𝜑 → (𝑈 ⊕ (𝑁‘{𝑍})) = 𝑉) | |
11 | lshpkrlem.d | . . . . 5 ⊢ 𝐷 = (Scalar‘𝑊) | |
12 | lshpkrlem.k | . . . . 5 ⊢ 𝐾 = (Base‘𝐷) | |
13 | lshpkrlem.t | . . . . 5 ⊢ · = ( ·𝑠 ‘𝑊) | |
14 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13 | lshpsmreu 33414 | . . . 4 ⊢ (𝜑 → ∃!𝑙 ∈ 𝐾 ∃𝑧 ∈ 𝑈 𝑋 = (𝑧 + (𝑙 · 𝑍))) |
15 | riotasbc 6526 | . . . 4 ⊢ (∃!𝑙 ∈ 𝐾 ∃𝑧 ∈ 𝑈 𝑋 = (𝑧 + (𝑙 · 𝑍)) → [(℩𝑙 ∈ 𝐾 ∃𝑧 ∈ 𝑈 𝑋 = (𝑧 + (𝑙 · 𝑍))) / 𝑙]∃𝑧 ∈ 𝑈 𝑋 = (𝑧 + (𝑙 · 𝑍))) | |
16 | 14, 15 | syl 17 | . . 3 ⊢ (𝜑 → [(℩𝑙 ∈ 𝐾 ∃𝑧 ∈ 𝑈 𝑋 = (𝑧 + (𝑙 · 𝑍))) / 𝑙]∃𝑧 ∈ 𝑈 𝑋 = (𝑧 + (𝑙 · 𝑍))) |
17 | eqeq1 2614 | . . . . . . 7 ⊢ (𝑥 = 𝑋 → (𝑥 = (𝑧 + (𝑙 · 𝑍)) ↔ 𝑋 = (𝑧 + (𝑙 · 𝑍)))) | |
18 | 17 | rexbidv 3034 | . . . . . 6 ⊢ (𝑥 = 𝑋 → (∃𝑧 ∈ 𝑈 𝑥 = (𝑧 + (𝑙 · 𝑍)) ↔ ∃𝑧 ∈ 𝑈 𝑋 = (𝑧 + (𝑙 · 𝑍)))) |
19 | 18 | riotabidv 6513 | . . . . 5 ⊢ (𝑥 = 𝑋 → (℩𝑙 ∈ 𝐾 ∃𝑧 ∈ 𝑈 𝑥 = (𝑧 + (𝑙 · 𝑍))) = (℩𝑙 ∈ 𝐾 ∃𝑧 ∈ 𝑈 𝑋 = (𝑧 + (𝑙 · 𝑍)))) |
20 | lshpkrlem.g | . . . . . 6 ⊢ 𝐺 = (𝑥 ∈ 𝑉 ↦ (℩𝑘 ∈ 𝐾 ∃𝑦 ∈ 𝑈 𝑥 = (𝑦 + (𝑘 · 𝑍)))) | |
21 | oveq1 6556 | . . . . . . . . . . . 12 ⊢ (𝑘 = 𝑙 → (𝑘 · 𝑍) = (𝑙 · 𝑍)) | |
22 | 21 | oveq2d 6565 | . . . . . . . . . . 11 ⊢ (𝑘 = 𝑙 → (𝑦 + (𝑘 · 𝑍)) = (𝑦 + (𝑙 · 𝑍))) |
23 | 22 | eqeq2d 2620 | . . . . . . . . . 10 ⊢ (𝑘 = 𝑙 → (𝑥 = (𝑦 + (𝑘 · 𝑍)) ↔ 𝑥 = (𝑦 + (𝑙 · 𝑍)))) |
24 | 23 | rexbidv 3034 | . . . . . . . . 9 ⊢ (𝑘 = 𝑙 → (∃𝑦 ∈ 𝑈 𝑥 = (𝑦 + (𝑘 · 𝑍)) ↔ ∃𝑦 ∈ 𝑈 𝑥 = (𝑦 + (𝑙 · 𝑍)))) |
25 | oveq1 6556 | . . . . . . . . . . 11 ⊢ (𝑦 = 𝑧 → (𝑦 + (𝑙 · 𝑍)) = (𝑧 + (𝑙 · 𝑍))) | |
26 | 25 | eqeq2d 2620 | . . . . . . . . . 10 ⊢ (𝑦 = 𝑧 → (𝑥 = (𝑦 + (𝑙 · 𝑍)) ↔ 𝑥 = (𝑧 + (𝑙 · 𝑍)))) |
27 | 26 | cbvrexv 3148 | . . . . . . . . 9 ⊢ (∃𝑦 ∈ 𝑈 𝑥 = (𝑦 + (𝑙 · 𝑍)) ↔ ∃𝑧 ∈ 𝑈 𝑥 = (𝑧 + (𝑙 · 𝑍))) |
28 | 24, 27 | syl6bb 275 | . . . . . . . 8 ⊢ (𝑘 = 𝑙 → (∃𝑦 ∈ 𝑈 𝑥 = (𝑦 + (𝑘 · 𝑍)) ↔ ∃𝑧 ∈ 𝑈 𝑥 = (𝑧 + (𝑙 · 𝑍)))) |
29 | 28 | cbvriotav 6522 | . . . . . . 7 ⊢ (℩𝑘 ∈ 𝐾 ∃𝑦 ∈ 𝑈 𝑥 = (𝑦 + (𝑘 · 𝑍))) = (℩𝑙 ∈ 𝐾 ∃𝑧 ∈ 𝑈 𝑥 = (𝑧 + (𝑙 · 𝑍))) |
30 | 29 | mpteq2i 4669 | . . . . . 6 ⊢ (𝑥 ∈ 𝑉 ↦ (℩𝑘 ∈ 𝐾 ∃𝑦 ∈ 𝑈 𝑥 = (𝑦 + (𝑘 · 𝑍)))) = (𝑥 ∈ 𝑉 ↦ (℩𝑙 ∈ 𝐾 ∃𝑧 ∈ 𝑈 𝑥 = (𝑧 + (𝑙 · 𝑍)))) |
31 | 20, 30 | eqtri 2632 | . . . . 5 ⊢ 𝐺 = (𝑥 ∈ 𝑉 ↦ (℩𝑙 ∈ 𝐾 ∃𝑧 ∈ 𝑈 𝑥 = (𝑧 + (𝑙 · 𝑍)))) |
32 | riotaex 6515 | . . . . 5 ⊢ (℩𝑙 ∈ 𝐾 ∃𝑧 ∈ 𝑈 𝑋 = (𝑧 + (𝑙 · 𝑍))) ∈ V | |
33 | 19, 31, 32 | fvmpt 6191 | . . . 4 ⊢ (𝑋 ∈ 𝑉 → (𝐺‘𝑋) = (℩𝑙 ∈ 𝐾 ∃𝑧 ∈ 𝑈 𝑋 = (𝑧 + (𝑙 · 𝑍)))) |
34 | dfsbcq 3404 | . . . 4 ⊢ ((𝐺‘𝑋) = (℩𝑙 ∈ 𝐾 ∃𝑧 ∈ 𝑈 𝑋 = (𝑧 + (𝑙 · 𝑍))) → ([(𝐺‘𝑋) / 𝑙]∃𝑧 ∈ 𝑈 𝑋 = (𝑧 + (𝑙 · 𝑍)) ↔ [(℩𝑙 ∈ 𝐾 ∃𝑧 ∈ 𝑈 𝑋 = (𝑧 + (𝑙 · 𝑍))) / 𝑙]∃𝑧 ∈ 𝑈 𝑋 = (𝑧 + (𝑙 · 𝑍)))) | |
35 | 9, 33, 34 | 3syl 18 | . . 3 ⊢ (𝜑 → ([(𝐺‘𝑋) / 𝑙]∃𝑧 ∈ 𝑈 𝑋 = (𝑧 + (𝑙 · 𝑍)) ↔ [(℩𝑙 ∈ 𝐾 ∃𝑧 ∈ 𝑈 𝑋 = (𝑧 + (𝑙 · 𝑍))) / 𝑙]∃𝑧 ∈ 𝑈 𝑋 = (𝑧 + (𝑙 · 𝑍)))) |
36 | 16, 35 | mpbird 246 | . 2 ⊢ (𝜑 → [(𝐺‘𝑋) / 𝑙]∃𝑧 ∈ 𝑈 𝑋 = (𝑧 + (𝑙 · 𝑍))) |
37 | fvex 6113 | . . 3 ⊢ (𝐺‘𝑋) ∈ V | |
38 | oveq1 6556 | . . . . . 6 ⊢ (𝑙 = (𝐺‘𝑋) → (𝑙 · 𝑍) = ((𝐺‘𝑋) · 𝑍)) | |
39 | 38 | oveq2d 6565 | . . . . 5 ⊢ (𝑙 = (𝐺‘𝑋) → (𝑧 + (𝑙 · 𝑍)) = (𝑧 + ((𝐺‘𝑋) · 𝑍))) |
40 | 39 | eqeq2d 2620 | . . . 4 ⊢ (𝑙 = (𝐺‘𝑋) → (𝑋 = (𝑧 + (𝑙 · 𝑍)) ↔ 𝑋 = (𝑧 + ((𝐺‘𝑋) · 𝑍)))) |
41 | 40 | rexbidv 3034 | . . 3 ⊢ (𝑙 = (𝐺‘𝑋) → (∃𝑧 ∈ 𝑈 𝑋 = (𝑧 + (𝑙 · 𝑍)) ↔ ∃𝑧 ∈ 𝑈 𝑋 = (𝑧 + ((𝐺‘𝑋) · 𝑍)))) |
42 | 37, 41 | sbcie 3437 | . 2 ⊢ ([(𝐺‘𝑋) / 𝑙]∃𝑧 ∈ 𝑈 𝑋 = (𝑧 + (𝑙 · 𝑍)) ↔ ∃𝑧 ∈ 𝑈 𝑋 = (𝑧 + ((𝐺‘𝑋) · 𝑍))) |
43 | 36, 42 | sylib 207 | 1 ⊢ (𝜑 → ∃𝑧 ∈ 𝑈 𝑋 = (𝑧 + ((𝐺‘𝑋) · 𝑍))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 195 = wceq 1475 ∈ wcel 1977 ∃wrex 2897 ∃!wreu 2898 [wsbc 3402 {csn 4125 ↦ cmpt 4643 ‘cfv 5804 ℩crio 6510 (class class class)co 6549 Basecbs 15695 +gcplusg 15768 Scalarcsca 15771 ·𝑠 cvsca 15772 0gc0g 15923 LSSumclsm 17872 LSpanclspn 18792 LVecclvec 18923 LSHypclsh 33280 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rmo 2904 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-int 4411 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-1st 7059 df-2nd 7060 df-tpos 7239 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-nn 10898 df-2 10956 df-3 10957 df-ndx 15698 df-slot 15699 df-base 15700 df-sets 15701 df-ress 15702 df-plusg 15781 df-mulr 15782 df-0g 15925 df-mgm 17065 df-sgrp 17107 df-mnd 17118 df-submnd 17159 df-grp 17248 df-minusg 17249 df-sbg 17250 df-subg 17414 df-cntz 17573 df-lsm 17874 df-cmn 18018 df-abl 18019 df-mgp 18313 df-ur 18325 df-ring 18372 df-oppr 18446 df-dvdsr 18464 df-unit 18465 df-invr 18495 df-drng 18572 df-lmod 18688 df-lss 18754 df-lsp 18793 df-lvec 18924 df-lshyp 33282 |
This theorem is referenced by: lshpkrlem6 33420 |
Copyright terms: Public domain | W3C validator |