prjspner01 - Mathbox for Steven Nguyen

	Mathbox for Steven Nguyen		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > prjspner01		Structured version Visualization version GIF version

Theorem prjspner01 43058

Description: Any vector is equivalent to a vector whose zeroth coordinate is 0 or 1 (proof of the equivalence). (Contributed by SN, 13-Aug-2023.)

**Hypotheses**
Ref	Expression
prjspner01.e	⊢ ∼ = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ∃𝑙 ∈ 𝑆 𝑥 = (𝑙 · 𝑦))}
prjspner01.f	⊢ 𝐹 = (𝑏 ∈ 𝐵 ↦ if((𝑏‘0) = 0 , 𝑏, ((𝐼‘(𝑏‘0)) · 𝑏)))
prjspner01.b	⊢ 𝐵 = ((Base‘𝑊) ∖ {(0_g‘𝑊)})
prjspner01.w	⊢ 𝑊 = (𝐾 freeLMod (0...𝑁))
prjspner01.t	⊢ · = ( ·_𝑠 ‘𝑊)
prjspner01.s	⊢ 𝑆 = (Base‘𝐾)
prjspner01.0	⊢ 0 = (0_g‘𝐾)
prjspner01.i	⊢ 𝐼 = (inv_r‘𝐾)
prjspner01.k	⊢ (𝜑 → 𝐾 ∈ DivRing)
prjspner01.n	⊢ (𝜑 → 𝑁 ∈ ℕ₀)
prjspner01.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)

**Assertion**
Ref	Expression
prjspner01	⊢ (𝜑 → 𝑋 ∼ (𝐹‘𝑋))

Distinct variable groups: 𝑥,𝐵,𝑦 𝑋,𝑙,𝑥,𝑦 𝑊,𝑙,𝑥,𝑦 · ,𝑙,𝑥,𝑦 𝑆,𝑙 𝐼,𝑙,𝑥,𝑦 𝑥,𝐾,𝑦 𝑥, 0 ,𝑦 𝐵,𝑏 𝑋,𝑏 0 ,𝑏 · ,𝑏 𝐼,𝑏 𝜑,𝑏 Allowed substitution hints: 𝜑(𝑥,𝑦,𝑙) 𝐵(𝑙) ∼ (𝑥,𝑦,𝑏,𝑙) 𝑆(𝑥,𝑦,𝑏) 𝐹(𝑥,𝑦,𝑏,𝑙) 𝐾(𝑏,𝑙) 𝑁(𝑥,𝑦,𝑏,𝑙) 𝑊(𝑏) 0 (𝑙)

**Proof of Theorem prjspner01**
Step	Hyp	Ref	Expression
1		prjspner01.e	. . . . . . 7 ⊢ ∼ = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ∃𝑙 ∈ 𝑆 𝑥 = (𝑙 · 𝑦))}
2		prjspner01.w	. . . . . . 7 ⊢ 𝑊 = (𝐾 freeLMod (0...𝑁))
3		prjspner01.b	. . . . . . 7 ⊢ 𝐵 = ((Base‘𝑊) ∖ {(0_g‘𝑊)})
4		prjspner01.s	. . . . . . 7 ⊢ 𝑆 = (Base‘𝐾)
5		prjspner01.t	. . . . . . 7 ⊢ · = ( ·_𝑠 ‘𝑊)
6		prjspner01.k	. . . . . . 7 ⊢ (𝜑 → 𝐾 ∈ DivRing)
7	1, 2, 3, 4, 5, 6	prjspner 43052	. . . . . 6 ⊢ (𝜑 → ∼ Er 𝐵)
8		prjspner01.x	. . . . . 6 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
9	7, 8	erref 8664	. . . . 5 ⊢ (𝜑 → 𝑋 ∼ 𝑋)
10	9	adantr 480	. . . 4 ⊢ ((𝜑 ∧ (𝑋‘0) = 0 ) → 𝑋 ∼ 𝑋)
11	7	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ ¬ (𝑋‘0) = 0 ) → ∼ Er 𝐵)
12		prjspner01.0	. . . . . 6 ⊢ 0 = (0_g‘𝐾)
13	6	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ ¬ (𝑋‘0) = 0 ) → 𝐾 ∈ DivRing)
14	8	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ ¬ (𝑋‘0) = 0 ) → 𝑋 ∈ 𝐵)
15		ovexd 7402	. . . . . . . . 9 ⊢ (𝜑 → (0...𝑁) ∈ V)
16	8, 3	eleqtrdi 2846	. . . . . . . . . 10 ⊢ (𝜑 → 𝑋 ∈ ((Base‘𝑊) ∖ {(0_g‘𝑊)}))
17	16	eldifad 3901	. . . . . . . . 9 ⊢ (𝜑 → 𝑋 ∈ (Base‘𝑊))
18		eqid 2736	. . . . . . . . . 10 ⊢ (Base‘𝑊) = (Base‘𝑊)
19	2, 4, 18	frlmbasf 21740	. . . . . . . . 9 ⊢ (((0...𝑁) ∈ V ∧ 𝑋 ∈ (Base‘𝑊)) → 𝑋:(0...𝑁)⟶𝑆)
20	15, 17, 19	syl2anc 585	. . . . . . . 8 ⊢ (𝜑 → 𝑋:(0...𝑁)⟶𝑆)
21		prjspner01.n	. . . . . . . . 9 ⊢ (𝜑 → 𝑁 ∈ ℕ₀)
22		0elfz 13578	. . . . . . . . 9 ⊢ (𝑁 ∈ ℕ₀ → 0 ∈ (0...𝑁))
23	21, 22	syl 17	. . . . . . . 8 ⊢ (𝜑 → 0 ∈ (0...𝑁))
24	20, 23	ffvelcdmd 7037	. . . . . . 7 ⊢ (𝜑 → (𝑋‘0) ∈ 𝑆)
25		neqne 2940	. . . . . . 7 ⊢ (¬ (𝑋‘0) = 0 → (𝑋‘0) ≠ 0 )
26		prjspner01.i	. . . . . . . 8 ⊢ 𝐼 = (inv_r‘𝐾)
27	4, 12, 26	drnginvrcl 20730	. . . . . . 7 ⊢ ((𝐾 ∈ DivRing ∧ (𝑋‘0) ∈ 𝑆 ∧ (𝑋‘0) ≠ 0 ) → (𝐼‘(𝑋‘0)) ∈ 𝑆)
28	6, 24, 25, 27	syl2an3an 1425	. . . . . 6 ⊢ ((𝜑 ∧ ¬ (𝑋‘0) = 0 ) → (𝐼‘(𝑋‘0)) ∈ 𝑆)
29	4, 12, 26	drnginvrn0 20731	. . . . . . 7 ⊢ ((𝐾 ∈ DivRing ∧ (𝑋‘0) ∈ 𝑆 ∧ (𝑋‘0) ≠ 0 ) → (𝐼‘(𝑋‘0)) ≠ 0 )
30	6, 24, 25, 29	syl2an3an 1425	. . . . . 6 ⊢ ((𝜑 ∧ ¬ (𝑋‘0) = 0 ) → (𝐼‘(𝑋‘0)) ≠ 0 )
31	1, 2, 3, 4, 5, 12, 13, 14, 28, 30	prjspnvs 43053	. . . . 5 ⊢ ((𝜑 ∧ ¬ (𝑋‘0) = 0 ) → ((𝐼‘(𝑋‘0)) · 𝑋) ∼ 𝑋)
32	11, 31	ersym 8656	. . . 4 ⊢ ((𝜑 ∧ ¬ (𝑋‘0) = 0 ) → 𝑋 ∼ ((𝐼‘(𝑋‘0)) · 𝑋))
33	10, 32	ifpimpda 1081	. . 3 ⊢ (𝜑 → if-((𝑋‘0) = 0 , 𝑋 ∼ 𝑋, 𝑋 ∼ ((𝐼‘(𝑋‘0)) · 𝑋)))
34		brif2 42665	. . 3 ⊢ (𝑋 ∼ if((𝑋‘0) = 0 , 𝑋, ((𝐼‘(𝑋‘0)) · 𝑋)) ↔ if-((𝑋‘0) = 0 , 𝑋 ∼ 𝑋, 𝑋 ∼ ((𝐼‘(𝑋‘0)) · 𝑋)))
35	33, 34	sylibr 234	. 2 ⊢ (𝜑 → 𝑋 ∼ if((𝑋‘0) = 0 , 𝑋, ((𝐼‘(𝑋‘0)) · 𝑋)))
36		prjspner01.f	. . 3 ⊢ 𝐹 = (𝑏 ∈ 𝐵 ↦ if((𝑏‘0) = 0 , 𝑏, ((𝐼‘(𝑏‘0)) · 𝑏)))
37		fveq1 6839	. . . . 5 ⊢ (𝑏 = 𝑋 → (𝑏‘0) = (𝑋‘0))
38	37	eqeq1d 2738	. . . 4 ⊢ (𝑏 = 𝑋 → ((𝑏‘0) = 0 ↔ (𝑋‘0) = 0 ))
39		id 22	. . . 4 ⊢ (𝑏 = 𝑋 → 𝑏 = 𝑋)
40	37	fveq2d 6844	. . . . 5 ⊢ (𝑏 = 𝑋 → (𝐼‘(𝑏‘0)) = (𝐼‘(𝑋‘0)))
41	40, 39	oveq12d 7385	. . . 4 ⊢ (𝑏 = 𝑋 → ((𝐼‘(𝑏‘0)) · 𝑏) = ((𝐼‘(𝑋‘0)) · 𝑋))
42	38, 39, 41	ifbieq12d 4495	. . 3 ⊢ (𝑏 = 𝑋 → if((𝑏‘0) = 0 , 𝑏, ((𝐼‘(𝑏‘0)) · 𝑏)) = if((𝑋‘0) = 0 , 𝑋, ((𝐼‘(𝑋‘0)) · 𝑋)))
43		ovexd 7402	. . . 4 ⊢ (𝜑 → ((𝐼‘(𝑋‘0)) · 𝑋) ∈ V)
44	8, 43	ifexd 4515	. . 3 ⊢ (𝜑 → if((𝑋‘0) = 0 , 𝑋, ((𝐼‘(𝑋‘0)) · 𝑋)) ∈ V)
45	36, 42, 8, 44	fvmptd3 6971	. 2 ⊢ (𝜑 → (𝐹‘𝑋) = if((𝑋‘0) = 0 , 𝑋, ((𝐼‘(𝑋‘0)) · 𝑋)))
46	35, 45	breqtrrd 5113	1 ⊢ (𝜑 → 𝑋 ∼ (𝐹‘𝑋))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 if-wif 1063 = wceq 1542 ∈ wcel 2114 ≠ wne 2932 ∃wrex 3061 Vcvv 3429 ∖ cdif 3886 ifcif 4466 {csn 4567 class class class wbr 5085 {copab 5147 ↦ cmpt 5166 ⟶wf 6494 ‘cfv 6498 (class class class)co 7367 Er wer 8640 0cc0 11038 ℕ₀cn0 12437 ...cfz 13461 Basecbs 17179 ·_𝑠 cvsca 17224 0_gc0g 17402 inv_rcinvr 20367 DivRingcdr 20706 freeLMod cfrlm 21726

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-ifp 1064 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-1st 7942 df-2nd 7943 df-supp 8111 df-tpos 8176 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-1o 8405 df-er 8643 df-map 8775 df-ixp 8846 df-en 8894 df-dom 8895 df-sdom 8896 df-fin 8897 df-fsupp 9275 df-sup 9355 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-nn 12175 df-2 12244 df-3 12245 df-4 12246 df-5 12247 df-6 12248 df-7 12249 df-8 12250 df-9 12251 df-n0 12438 df-z 12525 df-dec 12645 df-uz 12789 df-fz 13462 df-struct 17117 df-sets 17134 df-slot 17152 df-ndx 17164 df-base 17180 df-ress 17201 df-plusg 17233 df-mulr 17234 df-sca 17236 df-vsca 17237 df-ip 17238 df-tset 17239 df-ple 17240 df-ds 17242 df-hom 17244 df-cco 17245 df-0g 17404 df-prds 17410 df-pws 17412 df-mgm 18608 df-sgrp 18687 df-mnd 18703 df-grp 18912 df-minusg 18913 df-sbg 18914 df-subg 19099 df-cmn 19757 df-abl 19758 df-mgp 20122 df-rng 20134 df-ur 20163 df-ring 20216 df-oppr 20317 df-dvdsr 20337 df-unit 20338 df-invr 20368 df-subrg 20547 df-drng 20708 df-lmod 20857 df-lss 20927 df-lvec 21098 df-sra 21168 df-rgmod 21169 df-dsmm 21712 df-frlm 21727

This theorem is referenced by: prjspner1 43059

W3C validator