| Mathbox for Steven Nguyen |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > prjspnfv01 | Structured version Visualization version GIF version | ||
| Description: Any vector is equivalent to a vector whose zeroth coordinate is 0 or 1 (proof of the value of the zeroth coordinate). (Contributed by SN, 13-Aug-2023.) |
| Ref | Expression |
|---|---|
| prjspnfv01.f | ⊢ 𝐹 = (𝑏 ∈ 𝐵 ↦ if((𝑏‘0) = 0 , 𝑏, ((𝐼‘(𝑏‘0)) · 𝑏))) |
| prjspnfv01.b | ⊢ 𝐵 = ((Base‘𝑊) ∖ {(0g‘𝑊)}) |
| prjspnfv01.w | ⊢ 𝑊 = (𝐾 freeLMod (0...𝑁)) |
| prjspnfv01.t | ⊢ · = ( ·𝑠 ‘𝑊) |
| prjspnfv01.0 | ⊢ 0 = (0g‘𝐾) |
| prjspnfv01.1 | ⊢ 1 = (1r‘𝐾) |
| prjspnfv01.i | ⊢ 𝐼 = (invr‘𝐾) |
| prjspnfv01.k | ⊢ (𝜑 → 𝐾 ∈ DivRing) |
| prjspnfv01.n | ⊢ (𝜑 → 𝑁 ∈ ℕ0) |
| prjspnfv01.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
| Ref | Expression |
|---|---|
| prjspnfv01 | ⊢ (𝜑 → ((𝐹‘𝑋)‘0) = if((𝑋‘0) = 0 , 0 , 1 )) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | prjspnfv01.f | . . . 4 ⊢ 𝐹 = (𝑏 ∈ 𝐵 ↦ if((𝑏‘0) = 0 , 𝑏, ((𝐼‘(𝑏‘0)) · 𝑏))) | |
| 2 | fveq1 6831 | . . . . . 6 ⊢ (𝑏 = 𝑋 → (𝑏‘0) = (𝑋‘0)) | |
| 3 | 2 | eqeq1d 2736 | . . . . 5 ⊢ (𝑏 = 𝑋 → ((𝑏‘0) = 0 ↔ (𝑋‘0) = 0 )) |
| 4 | id 22 | . . . . 5 ⊢ (𝑏 = 𝑋 → 𝑏 = 𝑋) | |
| 5 | 2 | fveq2d 6836 | . . . . . 6 ⊢ (𝑏 = 𝑋 → (𝐼‘(𝑏‘0)) = (𝐼‘(𝑋‘0))) |
| 6 | 5, 4 | oveq12d 7374 | . . . . 5 ⊢ (𝑏 = 𝑋 → ((𝐼‘(𝑏‘0)) · 𝑏) = ((𝐼‘(𝑋‘0)) · 𝑋)) |
| 7 | 3, 4, 6 | ifbieq12d 4506 | . . . 4 ⊢ (𝑏 = 𝑋 → if((𝑏‘0) = 0 , 𝑏, ((𝐼‘(𝑏‘0)) · 𝑏)) = if((𝑋‘0) = 0 , 𝑋, ((𝐼‘(𝑋‘0)) · 𝑋))) |
| 8 | prjspnfv01.x | . . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 9 | ovexd 7391 | . . . . 5 ⊢ (𝜑 → ((𝐼‘(𝑋‘0)) · 𝑋) ∈ V) | |
| 10 | 8, 9 | ifexd 4526 | . . . 4 ⊢ (𝜑 → if((𝑋‘0) = 0 , 𝑋, ((𝐼‘(𝑋‘0)) · 𝑋)) ∈ V) |
| 11 | 1, 7, 8, 10 | fvmptd3 6962 | . . 3 ⊢ (𝜑 → (𝐹‘𝑋) = if((𝑋‘0) = 0 , 𝑋, ((𝐼‘(𝑋‘0)) · 𝑋))) |
| 12 | 11 | fveq1d 6834 | . 2 ⊢ (𝜑 → ((𝐹‘𝑋)‘0) = (if((𝑋‘0) = 0 , 𝑋, ((𝐼‘(𝑋‘0)) · 𝑋))‘0)) |
| 13 | iffv 6849 | . . 3 ⊢ (if((𝑋‘0) = 0 , 𝑋, ((𝐼‘(𝑋‘0)) · 𝑋))‘0) = if((𝑋‘0) = 0 , (𝑋‘0), (((𝐼‘(𝑋‘0)) · 𝑋)‘0)) | |
| 14 | 13 | a1i 11 | . 2 ⊢ (𝜑 → (if((𝑋‘0) = 0 , 𝑋, ((𝐼‘(𝑋‘0)) · 𝑋))‘0) = if((𝑋‘0) = 0 , (𝑋‘0), (((𝐼‘(𝑋‘0)) · 𝑋)‘0))) |
| 15 | simpr 484 | . . 3 ⊢ ((𝜑 ∧ (𝑋‘0) = 0 ) → (𝑋‘0) = 0 ) | |
| 16 | prjspnfv01.w | . . . . 5 ⊢ 𝑊 = (𝐾 freeLMod (0...𝑁)) | |
| 17 | eqid 2734 | . . . . 5 ⊢ (Base‘𝑊) = (Base‘𝑊) | |
| 18 | eqid 2734 | . . . . 5 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
| 19 | ovexd 7391 | . . . . 5 ⊢ ((𝜑 ∧ ¬ (𝑋‘0) = 0 ) → (0...𝑁) ∈ V) | |
| 20 | prjspnfv01.k | . . . . . 6 ⊢ (𝜑 → 𝐾 ∈ DivRing) | |
| 21 | ovexd 7391 | . . . . . . . 8 ⊢ (𝜑 → (0...𝑁) ∈ V) | |
| 22 | prjspnfv01.b | . . . . . . . . . 10 ⊢ 𝐵 = ((Base‘𝑊) ∖ {(0g‘𝑊)}) | |
| 23 | 8, 22 | eleqtrdi 2844 | . . . . . . . . 9 ⊢ (𝜑 → 𝑋 ∈ ((Base‘𝑊) ∖ {(0g‘𝑊)})) |
| 24 | 23 | eldifad 3911 | . . . . . . . 8 ⊢ (𝜑 → 𝑋 ∈ (Base‘𝑊)) |
| 25 | 16, 18, 17 | frlmbasf 21713 | . . . . . . . 8 ⊢ (((0...𝑁) ∈ V ∧ 𝑋 ∈ (Base‘𝑊)) → 𝑋:(0...𝑁)⟶(Base‘𝐾)) |
| 26 | 21, 24, 25 | syl2anc 584 | . . . . . . 7 ⊢ (𝜑 → 𝑋:(0...𝑁)⟶(Base‘𝐾)) |
| 27 | prjspnfv01.n | . . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ ℕ0) | |
| 28 | 0elfz 13538 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ0 → 0 ∈ (0...𝑁)) | |
| 29 | 27, 28 | syl 17 | . . . . . . 7 ⊢ (𝜑 → 0 ∈ (0...𝑁)) |
| 30 | 26, 29 | ffvelcdmd 7028 | . . . . . 6 ⊢ (𝜑 → (𝑋‘0) ∈ (Base‘𝐾)) |
| 31 | neqne 2938 | . . . . . 6 ⊢ (¬ (𝑋‘0) = 0 → (𝑋‘0) ≠ 0 ) | |
| 32 | prjspnfv01.0 | . . . . . . 7 ⊢ 0 = (0g‘𝐾) | |
| 33 | prjspnfv01.i | . . . . . . 7 ⊢ 𝐼 = (invr‘𝐾) | |
| 34 | 18, 32, 33 | drnginvrcl 20684 | . . . . . 6 ⊢ ((𝐾 ∈ DivRing ∧ (𝑋‘0) ∈ (Base‘𝐾) ∧ (𝑋‘0) ≠ 0 ) → (𝐼‘(𝑋‘0)) ∈ (Base‘𝐾)) |
| 35 | 20, 30, 31, 34 | syl2an3an 1424 | . . . . 5 ⊢ ((𝜑 ∧ ¬ (𝑋‘0) = 0 ) → (𝐼‘(𝑋‘0)) ∈ (Base‘𝐾)) |
| 36 | 24 | adantr 480 | . . . . 5 ⊢ ((𝜑 ∧ ¬ (𝑋‘0) = 0 ) → 𝑋 ∈ (Base‘𝑊)) |
| 37 | 29 | adantr 480 | . . . . 5 ⊢ ((𝜑 ∧ ¬ (𝑋‘0) = 0 ) → 0 ∈ (0...𝑁)) |
| 38 | prjspnfv01.t | . . . . 5 ⊢ · = ( ·𝑠 ‘𝑊) | |
| 39 | eqid 2734 | . . . . 5 ⊢ (.r‘𝐾) = (.r‘𝐾) | |
| 40 | 16, 17, 18, 19, 35, 36, 37, 38, 39 | frlmvscaval 21721 | . . . 4 ⊢ ((𝜑 ∧ ¬ (𝑋‘0) = 0 ) → (((𝐼‘(𝑋‘0)) · 𝑋)‘0) = ((𝐼‘(𝑋‘0))(.r‘𝐾)(𝑋‘0))) |
| 41 | prjspnfv01.1 | . . . . . 6 ⊢ 1 = (1r‘𝐾) | |
| 42 | 18, 32, 39, 41, 33 | drnginvrl 20687 | . . . . 5 ⊢ ((𝐾 ∈ DivRing ∧ (𝑋‘0) ∈ (Base‘𝐾) ∧ (𝑋‘0) ≠ 0 ) → ((𝐼‘(𝑋‘0))(.r‘𝐾)(𝑋‘0)) = 1 ) |
| 43 | 20, 30, 31, 42 | syl2an3an 1424 | . . . 4 ⊢ ((𝜑 ∧ ¬ (𝑋‘0) = 0 ) → ((𝐼‘(𝑋‘0))(.r‘𝐾)(𝑋‘0)) = 1 ) |
| 44 | 40, 43 | eqtrd 2769 | . . 3 ⊢ ((𝜑 ∧ ¬ (𝑋‘0) = 0 ) → (((𝐼‘(𝑋‘0)) · 𝑋)‘0) = 1 ) |
| 45 | 15, 44 | ifeq12da 4511 | . 2 ⊢ (𝜑 → if((𝑋‘0) = 0 , (𝑋‘0), (((𝐼‘(𝑋‘0)) · 𝑋)‘0)) = if((𝑋‘0) = 0 , 0 , 1 )) |
| 46 | 12, 14, 45 | 3eqtrd 2773 | 1 ⊢ (𝜑 → ((𝐹‘𝑋)‘0) = if((𝑋‘0) = 0 , 0 , 1 )) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ≠ wne 2930 Vcvv 3438 ∖ cdif 3896 ifcif 4477 {csn 4578 ↦ cmpt 5177 ⟶wf 6486 ‘cfv 6490 (class class class)co 7356 0cc0 11024 ℕ0cn0 12399 ...cfz 13421 Basecbs 17134 .rcmulr 17176 ·𝑠 cvsca 17179 0gc0g 17357 1rcur 20114 invrcinvr 20321 DivRingcdr 20660 freeLMod cfrlm 21699 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-rep 5222 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 ax-cnex 11080 ax-resscn 11081 ax-1cn 11082 ax-icn 11083 ax-addcl 11084 ax-addrcl 11085 ax-mulcl 11086 ax-mulrcl 11087 ax-mulcom 11088 ax-addass 11089 ax-mulass 11090 ax-distr 11091 ax-i2m1 11092 ax-1ne0 11093 ax-1rid 11094 ax-rnegex 11095 ax-rrecex 11096 ax-cnre 11097 ax-pre-lttri 11098 ax-pre-lttrn 11099 ax-pre-ltadd 11100 ax-pre-mulgt0 11101 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3059 df-rmo 3348 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-tp 4583 df-op 4585 df-uni 4862 df-iun 4946 df-br 5097 df-opab 5159 df-mpt 5178 df-tr 5204 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-of 7620 df-om 7807 df-1st 7931 df-2nd 7932 df-supp 8101 df-tpos 8166 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-1o 8395 df-er 8633 df-map 8763 df-ixp 8834 df-en 8882 df-dom 8883 df-sdom 8884 df-fin 8885 df-fsupp 9263 df-sup 9343 df-pnf 11166 df-mnf 11167 df-xr 11168 df-ltxr 11169 df-le 11170 df-sub 11364 df-neg 11365 df-nn 12144 df-2 12206 df-3 12207 df-4 12208 df-5 12209 df-6 12210 df-7 12211 df-8 12212 df-9 12213 df-n0 12400 df-z 12487 df-dec 12606 df-uz 12750 df-fz 13422 df-struct 17072 df-sets 17089 df-slot 17107 df-ndx 17119 df-base 17135 df-ress 17156 df-plusg 17188 df-mulr 17189 df-sca 17191 df-vsca 17192 df-ip 17193 df-tset 17194 df-ple 17195 df-ds 17197 df-hom 17199 df-cco 17200 df-0g 17359 df-prds 17365 df-pws 17367 df-mgm 18563 df-sgrp 18642 df-mnd 18658 df-grp 18864 df-minusg 18865 df-cmn 19709 df-abl 19710 df-mgp 20074 df-rng 20086 df-ur 20115 df-ring 20168 df-oppr 20271 df-dvdsr 20291 df-unit 20292 df-invr 20322 df-drng 20662 df-sra 21123 df-rgmod 21124 df-dsmm 21685 df-frlm 21700 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |