| 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 6884 | . . . . . 6 ⊢ (𝑏 = 𝑋 → (𝑏‘0) = (𝑋‘0)) | |
| 3 | 2 | eqeq1d 2767 | . . . . 5 ⊢ (𝑏 = 𝑋 → ((𝑏‘0) = 0 ↔ (𝑋‘0) = 0 )) |
| 4 | id 23 | . . . . 5 ⊢ (𝑏 = 𝑋 → 𝑏 = 𝑋) | |
| 5 | 2 | fveq2d 6889 | . . . . . 6 ⊢ (𝑏 = 𝑋 → (𝐼‘(𝑏‘0)) = (𝐼‘(𝑋‘0))) |
| 6 | 5, 4 | oveq12d 7437 | . . . . 5 ⊢ (𝑏 = 𝑋 → ((𝐼‘(𝑏‘0)) · 𝑏) = ((𝐼‘(𝑋‘0)) · 𝑋)) |
| 7 | 3, 4, 6 | ifbieq12d 4518 | . . . 4 ⊢ (𝑏 = 𝑋 → if((𝑏‘0) = 0 , 𝑏, ((𝐼‘(𝑏‘0)) · 𝑏)) = if((𝑋‘0) = 0 , 𝑋, ((𝐼‘(𝑋‘0)) · 𝑋))) |
| 8 | prjspnfv01.x | . . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 9 | ovexd 7454 | . . . . 5 ⊢ (𝜑 → ((𝐼‘(𝑋‘0)) · 𝑋) ∈ V) | |
| 10 | 8, 9 | ifexd 4538 | . . . 4 ⊢ (𝜑 → if((𝑋‘0) = 0 , 𝑋, ((𝐼‘(𝑋‘0)) · 𝑋)) ∈ V) |
| 11 | 1, 7, 8, 10 | fvmptd3 7017 | . . 3 ⊢ (𝜑 → (𝐹‘𝑋) = if((𝑋‘0) = 0 , 𝑋, ((𝐼‘(𝑋‘0)) · 𝑋))) |
| 12 | 11 | fveq1d 6887 | . 2 ⊢ (𝜑 → ((𝐹‘𝑋)‘0) = (if((𝑋‘0) = 0 , 𝑋, ((𝐼‘(𝑋‘0)) · 𝑋))‘0)) |
| 13 | iffv 6902 | . . 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 490 | . . 3 ⊢ ((𝜑 ∧ (𝑋‘0) = 0 ) → (𝑋‘0) = 0 ) | |
| 16 | prjspnfv01.w | . . . . 5 ⊢ 𝑊 = (𝐾 freeLMod (0...𝑁)) | |
| 17 | eqid 2765 | . . . . 5 ⊢ (Base‘𝑊) = (Base‘𝑊) | |
| 18 | eqid 2765 | . . . . 5 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
| 19 | ovexd 7454 | . . . . 5 ⊢ ((𝜑 ∧ ¬ (𝑋‘0) = 0 ) → (0...𝑁) ∈ V) | |
| 20 | prjspnfv01.k | . . . . . 6 ⊢ (𝜑 → 𝐾 ∈ DivRing) | |
| 21 | ovexd 7454 | . . . . . . . 8 ⊢ (𝜑 → (0...𝑁) ∈ V) | |
| 22 | prjspnfv01.b | . . . . . . . . . 10 ⊢ 𝐵 = ((Base‘𝑊) ∖ {(0g‘𝑊)}) | |
| 23 | 8, 22 | eleqtrdi 2875 | . . . . . . . . 9 ⊢ (𝜑 → 𝑋 ∈ ((Base‘𝑊) ∖ {(0g‘𝑊)})) |
| 24 | 23 | eldifad 3918 | . . . . . . . 8 ⊢ (𝜑 → 𝑋 ∈ (Base‘𝑊)) |
| 25 | 16, 18, 17 | frlmbasf 21962 | . . . . . . . 8 ⊢ (((0...𝑁) ∈ V ∧ 𝑋 ∈ (Base‘𝑊)) → 𝑋:(0...𝑁)⟶(Base‘𝐾)) |
| 26 | 21, 24, 25 | syl2anc 596 | . . . . . . 7 ⊢ (𝜑 → 𝑋:(0...𝑁)⟶(Base‘𝐾)) |
| 27 | prjspnfv01.n | . . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ ℕ0) | |
| 28 | 0elfz 13671 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ0 → 0 ∈ (0...𝑁)) | |
| 29 | 27, 28 | syl 18 | . . . . . . 7 ⊢ (𝜑 → 0 ∈ (0...𝑁)) |
| 30 | 26, 29 | ffvelcdmd 7084 | . . . . . 6 ⊢ (𝜑 → (𝑋‘0) ∈ (Base‘𝐾)) |
| 31 | neqne 2968 | . . . . . 6 ⊢ (¬ (𝑋‘0) = 0 → (𝑋‘0) ≠ 0 ) | |
| 32 | prjspnfv01.0 | . . . . . . 7 ⊢ 0 = (0g‘𝐾) | |
| 33 | prjspnfv01.i | . . . . . . 7 ⊢ 𝐼 = (invr‘𝐾) | |
| 34 | 18, 32, 33 | drnginvrcl 20909 | . . . . . 6 ⊢ ((𝐾 ∈ DivRing ∧ (𝑋‘0) ∈ (Base‘𝐾) ∧ (𝑋‘0) ≠ 0 ) → (𝐼‘(𝑋‘0)) ∈ (Base‘𝐾)) |
| 35 | 20, 30, 31, 34 | syl2an3an 1449 | . . . . 5 ⊢ ((𝜑 ∧ ¬ (𝑋‘0) = 0 ) → (𝐼‘(𝑋‘0)) ∈ (Base‘𝐾)) |
| 36 | 24 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ ¬ (𝑋‘0) = 0 ) → 𝑋 ∈ (Base‘𝑊)) |
| 37 | 29 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ ¬ (𝑋‘0) = 0 ) → 0 ∈ (0...𝑁)) |
| 38 | prjspnfv01.t | . . . . 5 ⊢ · = ( ·𝑠 ‘𝑊) | |
| 39 | eqid 2765 | . . . . 5 ⊢ (.r‘𝐾) = (.r‘𝐾) | |
| 40 | 16, 17, 18, 19, 35, 36, 37, 38, 39 | frlmvscaval 21970 | . . . 4 ⊢ ((𝜑 ∧ ¬ (𝑋‘0) = 0 ) → (((𝐼‘(𝑋‘0)) · 𝑋)‘0) = ((𝐼‘(𝑋‘0))(.r‘𝐾)(𝑋‘0))) |
| 41 | prjspnfv01.1 | . . . . . 6 ⊢ 1 = (1r‘𝐾) | |
| 42 | 18, 32, 39, 41, 33 | drnginvrl 20912 | . . . . 5 ⊢ ((𝐾 ∈ DivRing ∧ (𝑋‘0) ∈ (Base‘𝐾) ∧ (𝑋‘0) ≠ 0 ) → ((𝐼‘(𝑋‘0))(.r‘𝐾)(𝑋‘0)) = 1 ) |
| 43 | 20, 30, 31, 42 | syl2an3an 1449 | . . . 4 ⊢ ((𝜑 ∧ ¬ (𝑋‘0) = 0 ) → ((𝐼‘(𝑋‘0))(.r‘𝐾)(𝑋‘0)) = 1 ) |
| 44 | 40, 43 | eqtrd 2800 | . . 3 ⊢ ((𝜑 ∧ ¬ (𝑋‘0) = 0 ) → (((𝐼‘(𝑋‘0)) · 𝑋)‘0) = 1 ) |
| 45 | 15, 44 | ifeq12da 4523 | . 2 ⊢ (𝜑 → if((𝑋‘0) = 0 , (𝑋‘0), (((𝐼‘(𝑋‘0)) · 𝑋)‘0)) = if((𝑋‘0) = 0 , 0 , 1 )) |
| 46 | 12, 14, 45 | 3eqtrd 2804 | 1 ⊢ (𝜑 → ((𝐹‘𝑋)‘0) = if((𝑋‘0) = 0 , 0 , 1 )) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ≠ wne 2960 Vcvv 3457 ∖ cdif 3903 ifcif 4489 {csn 4591 ↦ cmpt 5194 ⟶wf 6536 ‘cfv 6540 (class class class)co 7419 0cc0 11117 ℕ0cn0 12521 ...cfz 13553 Basecbs 17293 .rcmulr 17335 ·𝑠 cvsca 17338 0gc0g 17516 1rcur 20309 invrcinvr 20517 DivRingcdr 20879 freeLMod cfrlm 21948 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-cnex 11173 ax-resscn 11174 ax-1cn 11175 ax-icn 11176 ax-addcl 11177 ax-addrcl 11178 ax-mulcl 11179 ax-mulrcl 11180 ax-mulcom 11181 ax-addass 11182 ax-mulass 11183 ax-distr 11184 ax-i2m1 11185 ax-1ne0 11186 ax-1rid 11187 ax-rnegex 11188 ax-rrecex 11189 ax-cnre 11190 ax-pre-lttri 11191 ax-pre-lttrn 11192 ax-pre-ltadd 11193 ax-pre-mulgt0 11194 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-tp 4596 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-of 7684 df-om 7869 df-1st 7992 df-2nd 7993 df-supp 8163 df-tpos 8228 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-1o 8459 df-er 8700 df-map 8832 df-ixp 8902 df-en 8950 df-dom 8951 df-sdom 8952 df-fin 8953 df-fsupp 9329 df-sup 9409 df-pnf 11262 df-mnf 11263 df-xr 11264 df-ltxr 11265 df-le 11266 df-sub 11460 df-neg 11461 df-nn 12251 df-2 12320 df-3 12321 df-4 12322 df-5 12323 df-6 12324 df-7 12325 df-8 12326 df-9 12327 df-n0 12522 df-z 12609 df-dec 12730 df-uz 12881 df-fz 13554 df-struct 17231 df-sets 17248 df-slot 17266 df-ndx 17278 df-base 17294 df-ress 17315 df-plusg 17347 df-mulr 17348 df-sca 17350 df-vsca 17351 df-ip 17352 df-tset 17353 df-ple 17354 df-ds 17356 df-hom 17358 df-cco 17359 df-0g 17518 df-prds 17524 df-pws 17526 df-mgm 18722 df-sgrp 18811 df-mnd 18827 df-grp 19049 df-minusg 19050 df-cmn 19898 df-abl 19899 df-mgp 20263 df-rng 20277 df-ur 20310 df-ring 20363 df-oppr 20467 df-dvdsr 20487 df-unit 20488 df-invr 20518 df-drng 20881 df-sra 21346 df-rgmod 21347 df-dsmm 21934 df-frlm 21949 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |