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

Theorem prjspval 43593
Description: Value of the projective space function, which is also known as the projectivization of 𝑉. (Contributed by Steven Nguyen, 29-Apr-2023.)
Hypotheses
Ref Expression
prjspval.b 𝐵 = ((Base‘𝑉) ∖ {(0g‘𝑉)})
prjspval.x · = ( ·𝑠 ‘𝑉)
prjspval.s 𝑆 = (Scalar‘𝑉)
prjspval.k 𝐾 = (Base‘𝑆)
Assertion
Ref Expression
prjspval (𝑉 ∈ LVec → (ℙ𝕣𝕠𝕛‘𝑉) = (𝐵 / {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ∃𝑙 ∈ 𝐾 𝑥 = (𝑙 · 𝑦))}))
Distinct variable group:   𝑥,𝑙,𝑦,𝑉
Allowed substitution hints:   𝐵(𝑥, 𝑦, 𝑙)   𝑆(𝑥, 𝑦, 𝑙)   · (𝑥, 𝑦, 𝑙)   𝐾(𝑥, 𝑦, 𝑙)

Proof of Theorem prjspval
Dummy variables 𝑏 𝑣 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fvex 6890 . . . . 5 (Base‘𝑣) ∈ V
21difexi 5292 . . . 4 ((Base‘𝑣) ∖ {(0g‘𝑣)}) ∈ V
32a1i 11 . . 3 (𝑣 = 𝑉 → ((Base‘𝑣) ∖ {(0g‘𝑣)}) ∈ V)
4 fveq2 6877 . . . . . . . . 9 (𝑣 = 𝑉 → (Base‘𝑣) = (Base‘𝑉))
5 fveq2 6877 . . . . . . . . . 10 (𝑣 = 𝑉 → (0g‘𝑣) = (0g‘𝑉))
65sneqd 4596 . . . . . . . . 9 (𝑣 = 𝑉 → {(0g‘𝑣)} = {(0g‘𝑉)})
74, 6difeq12d 4075 . . . . . . . 8 (𝑣 = 𝑉 → ((Base‘𝑣) ∖ {(0g‘𝑣)}) = ((Base‘𝑉) ∖ {(0g‘𝑉)}))
8 prjspval.b . . . . . . . 8 𝐵 = ((Base‘𝑉) ∖ {(0g‘𝑉)})
97, 8eqtr4di 2814 . . . . . . 7 (𝑣 = 𝑉 → ((Base‘𝑣) ∖ {(0g‘𝑣)}) = 𝐵)
109eqeq2d 2772 . . . . . 6 (𝑣 = 𝑉 → (𝑏 = ((Base‘𝑣) ∖ {(0g‘𝑣)}) ↔ 𝑏 = 𝐵))
1110biimpd 232 . . . . 5 (𝑣 = 𝑉 → (𝑏 = ((Base‘𝑣) ∖ {(0g‘𝑣)}) → 𝑏 = 𝐵))
1211imp 412 . . . 4 ((𝑣 = 𝑉 ∧ 𝑏 = ((Base‘𝑣) ∖ {(0g‘𝑣)})) → 𝑏 = 𝐵)
1311imdistani 579 . . . . . 6 ((𝑣 = 𝑉 ∧ 𝑏 = ((Base‘𝑣) ∖ {(0g‘𝑣)})) → (𝑣 = 𝑉 ∧ 𝑏 = 𝐵))
14 eleq2 2850 . . . . . . . 8 (𝑏 = 𝐵 → (𝑥 ∈ 𝑏 ↔ 𝑥 ∈ 𝐵))
15 eleq2 2850 . . . . . . . 8 (𝑏 = 𝐵 → (𝑦 ∈ 𝑏 ↔ 𝑦 ∈ 𝐵))
1614, 15anbi12d 644 . . . . . . 7 (𝑏 = 𝐵 → ((𝑥 ∈ 𝑏 ∧ 𝑦 ∈ 𝑏) ↔ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)))
17 fveq2 6877 . . . . . . . . . . 11 (𝑣 = 𝑉 → (Scalar‘𝑣) = (Scalar‘𝑉))
18 prjspval.s . . . . . . . . . . 11 𝑆 = (Scalar‘𝑉)
1917, 18eqtr4di 2814 . . . . . . . . . 10 (𝑣 = 𝑉 → (Scalar‘𝑣) = 𝑆)
2019fveq2d 6881 . . . . . . . . 9 (𝑣 = 𝑉 → (Base‘(Scalar‘𝑣)) = (Base‘𝑆))
21 prjspval.k . . . . . . . . 9 𝐾 = (Base‘𝑆)
2220, 21eqtr4di 2814 . . . . . . . 8 (𝑣 = 𝑉 → (Base‘(Scalar‘𝑣)) = 𝐾)
23 fveq2 6877 . . . . . . . . . . 11 (𝑣 = 𝑉 → ( ·𝑠 ‘𝑣) = ( ·𝑠 ‘𝑉))
24 prjspval.x . . . . . . . . . . 11 · = ( ·𝑠 ‘𝑉)
2523, 24eqtr4di 2814 . . . . . . . . . 10 (𝑣 = 𝑉 → ( ·𝑠 ‘𝑣) = · )
2625oveqd 7429 . . . . . . . . 9 (𝑣 = 𝑉 → (𝑙( ·𝑠 ‘𝑣)𝑦) = (𝑙 · 𝑦))
2726eqeq2d 2772 . . . . . . . 8 (𝑣 = 𝑉 → (𝑥 = (𝑙( ·𝑠 ‘𝑣)𝑦) ↔ 𝑥 = (𝑙 · 𝑦)))
2822, 27rexeqbidv 3336 . . . . . . 7 (𝑣 = 𝑉 → (∃𝑙 ∈ (Base‘(Scalar‘𝑣))𝑥 = (𝑙( ·𝑠 ‘𝑣)𝑦) ↔ ∃𝑙 ∈ 𝐾 𝑥 = (𝑙 · 𝑦)))
2916, 28bi2anan9r 651 . . . . . 6 ((𝑣 = 𝑉 ∧ 𝑏 = 𝐵) → (((𝑥 ∈ 𝑏 ∧ 𝑦 ∈ 𝑏) ∧ ∃𝑙 ∈ (Base‘(Scalar‘𝑣))𝑥 = (𝑙( ·𝑠 ‘𝑣)𝑦)) ↔ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ∃𝑙 ∈ 𝐾 𝑥 = (𝑙 · 𝑦))))
3013, 29syl 18 . . . . 5 ((𝑣 = 𝑉 ∧ 𝑏 = ((Base‘𝑣) ∖ {(0g‘𝑣)})) → (((𝑥 ∈ 𝑏 ∧ 𝑦 ∈ 𝑏) ∧ ∃𝑙 ∈ (Base‘(Scalar‘𝑣))𝑥 = (𝑙( ·𝑠 ‘𝑣)𝑦)) ↔ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ∃𝑙 ∈ 𝐾 𝑥 = (𝑙 · 𝑦))))
3130opabbidv 5171 . . . 4 ((𝑣 = 𝑉 ∧ 𝑏 = ((Base‘𝑣) ∖ {(0g‘𝑣)})) → {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝑏 ∧ 𝑦 ∈ 𝑏) ∧ ∃𝑙 ∈ (Base‘(Scalar‘𝑣))𝑥 = (𝑙( ·𝑠 ‘𝑣)𝑦))} = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ∃𝑙 ∈ 𝐾 𝑥 = (𝑙 · 𝑦))})
3212, 31qseq12d 43259 . . 3 ((𝑣 = 𝑉 ∧ 𝑏 = ((Base‘𝑣) ∖ {(0g‘𝑣)})) → (𝑏 / {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝑏 ∧ 𝑦 ∈ 𝑏) ∧ ∃𝑙 ∈ (Base‘(Scalar‘𝑣))𝑥 = (𝑙( ·𝑠 ‘𝑣)𝑦))}) = (𝐵 / {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ∃𝑙 ∈ 𝐾 𝑥 = (𝑙 · 𝑦))}))
333, 32csbied 3883 . 2 (𝑣 = 𝑉 → ⦋((Base‘𝑣) ∖ {(0g‘𝑣)}) / 𝑏⦌(𝑏 / {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝑏 ∧ 𝑦 ∈ 𝑏) ∧ ∃𝑙 ∈ (Base‘(Scalar‘𝑣))𝑥 = (𝑙( ·𝑠 ‘𝑣)𝑦))}) = (𝐵 / {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ∃𝑙 ∈ 𝐾 𝑥 = (𝑙 · 𝑦))}))
34 df-prjsp 43592 . 2 ℙ𝕣𝕠𝕛 = (𝑣 ∈ LVec ↦ ⦋((Base‘𝑣) ∖ {(0g‘𝑣)}) / 𝑏⦌(𝑏 / {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝑏 ∧ 𝑦 ∈ 𝑏) ∧ ∃𝑙 ∈ (Base‘(Scalar‘𝑣))𝑥 = (𝑙( ·𝑠 ‘𝑣)𝑦))}))
35 fvex 6890 . . . . 5 (Base‘𝑉) ∈ V
3635difexi 5292 . . . 4 ((Base‘𝑉) ∖ {(0g‘𝑉)}) ∈ V
378, 36eqeltri 2857 . . 3 𝐵 ∈ V
3837qsex 8777 . 2 (𝐵 / {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ∃𝑙 ∈ 𝐾 𝑥 = (𝑙 · 𝑦))}) ∈ V
3933, 34, 38fvmpt 6985 1 (𝑉 ∈ LVec → (ℙ𝕣𝕠𝕛‘𝑉) = (𝐵 / {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ∃𝑙 ∈ 𝐾 𝑥 = (𝑙 · 𝑦))}))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∃wrex 3087  Vcvv 3451  ⦋csb 3847   ∖ cdif 3896  {csn 4584  {copab 5167  ‘cfv 6531  (class class class)co 7412   / cqs 8700  Basecbs 17367  Scalarcsca 17411   ·𝑠 cvsca 17412  0gc0g 17590  LVecclvec 21357  ℙ𝕣𝕠𝕛cprjsp 43591
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fv 6539  df-ov 7415  df-ec 8703  df-qs 8707  df-prjsp 43592
This theorem is used by:  prjspval2  43603  prjspnval2  43608
  Copyright terms: Public domain W3C validator