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 39597
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 6658 . . . . 5 (Base‘𝑣) ∈ V
21difexi 5196 . . . 4 ((Base‘𝑣) ∖ {(0g𝑣)}) ∈ V
32a1i 11 . . 3 (𝑣 = 𝑉 → ((Base‘𝑣) ∖ {(0g𝑣)}) ∈ V)
4 fveq2 6645 . . . . . . . . 9 (𝑣 = 𝑉 → (Base‘𝑣) = (Base‘𝑉))
5 fveq2 6645 . . . . . . . . . 10 (𝑣 = 𝑉 → (0g𝑣) = (0g𝑉))
65sneqd 4537 . . . . . . . . 9 (𝑣 = 𝑉 → {(0g𝑣)} = {(0g𝑉)})
74, 6difeq12d 4051 . . . . . . . 8 (𝑣 = 𝑉 → ((Base‘𝑣) ∖ {(0g𝑣)}) = ((Base‘𝑉) ∖ {(0g𝑉)}))
8 prjspval.b . . . . . . . 8 𝐵 = ((Base‘𝑉) ∖ {(0g𝑉)})
97, 8eqtr4di 2851 . . . . . . 7 (𝑣 = 𝑉 → ((Base‘𝑣) ∖ {(0g𝑣)}) = 𝐵)
109eqeq2d 2809 . . . . . 6 (𝑣 = 𝑉 → (𝑏 = ((Base‘𝑣) ∖ {(0g𝑣)}) ↔ 𝑏 = 𝐵))
1110biimpd 232 . . . . 5 (𝑣 = 𝑉 → (𝑏 = ((Base‘𝑣) ∖ {(0g𝑣)}) → 𝑏 = 𝐵))
1211imp 410 . . . 4 ((𝑣 = 𝑉𝑏 = ((Base‘𝑣) ∖ {(0g𝑣)})) → 𝑏 = 𝐵)
1311imdistani 572 . . . . . 6 ((𝑣 = 𝑉𝑏 = ((Base‘𝑣) ∖ {(0g𝑣)})) → (𝑣 = 𝑉𝑏 = 𝐵))
14 eleq2 2878 . . . . . . . 8 (𝑏 = 𝐵 → (𝑥𝑏𝑥𝐵))
15 eleq2 2878 . . . . . . . 8 (𝑏 = 𝐵 → (𝑦𝑏𝑦𝐵))
1614, 15anbi12d 633 . . . . . . 7 (𝑏 = 𝐵 → ((𝑥𝑏𝑦𝑏) ↔ (𝑥𝐵𝑦𝐵)))
17 fveq2 6645 . . . . . . . . . . 11 (𝑣 = 𝑉 → (Scalar‘𝑣) = (Scalar‘𝑉))
18 prjspval.s . . . . . . . . . . 11 𝑆 = (Scalar‘𝑉)
1917, 18eqtr4di 2851 . . . . . . . . . 10 (𝑣 = 𝑉 → (Scalar‘𝑣) = 𝑆)
2019fveq2d 6649 . . . . . . . . 9 (𝑣 = 𝑉 → (Base‘(Scalar‘𝑣)) = (Base‘𝑆))
21 prjspval.k . . . . . . . . 9 𝐾 = (Base‘𝑆)
2220, 21eqtr4di 2851 . . . . . . . 8 (𝑣 = 𝑉 → (Base‘(Scalar‘𝑣)) = 𝐾)
23 fveq2 6645 . . . . . . . . . . 11 (𝑣 = 𝑉 → ( ·𝑠𝑣) = ( ·𝑠𝑉))
24 prjspval.x . . . . . . . . . . 11 · = ( ·𝑠𝑉)
2523, 24eqtr4di 2851 . . . . . . . . . 10 (𝑣 = 𝑉 → ( ·𝑠𝑣) = · )
2625oveqd 7152 . . . . . . . . 9 (𝑣 = 𝑉 → (𝑙( ·𝑠𝑣)𝑦) = (𝑙 · 𝑦))
2726eqeq2d 2809 . . . . . . . 8 (𝑣 = 𝑉 → (𝑥 = (𝑙( ·𝑠𝑣)𝑦) ↔ 𝑥 = (𝑙 · 𝑦)))
2822, 27rexeqbidv 3355 . . . . . . 7 (𝑣 = 𝑉 → (∃𝑙 ∈ (Base‘(Scalar‘𝑣))𝑥 = (𝑙( ·𝑠𝑣)𝑦) ↔ ∃𝑙𝐾 𝑥 = (𝑙 · 𝑦)))
2916, 28bi2anan9r 639 . . . . . 6 ((𝑣 = 𝑉𝑏 = 𝐵) → (((𝑥𝑏𝑦𝑏) ∧ ∃𝑙 ∈ (Base‘(Scalar‘𝑣))𝑥 = (𝑙( ·𝑠𝑣)𝑦)) ↔ ((𝑥𝐵𝑦𝐵) ∧ ∃𝑙𝐾 𝑥 = (𝑙 · 𝑦))))
3013, 29syl 17 . . . . 5 ((𝑣 = 𝑉𝑏 = ((Base‘𝑣) ∖ {(0g𝑣)})) → (((𝑥𝑏𝑦𝑏) ∧ ∃𝑙 ∈ (Base‘(Scalar‘𝑣))𝑥 = (𝑙( ·𝑠𝑣)𝑦)) ↔ ((𝑥𝐵𝑦𝐵) ∧ ∃𝑙𝐾 𝑥 = (𝑙 · 𝑦))))
3130opabbidv 5096 . . . 4 ((𝑣 = 𝑉𝑏 = ((Base‘𝑣) ∖ {(0g𝑣)})) → {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝑏𝑦𝑏) ∧ ∃𝑙 ∈ (Base‘(Scalar‘𝑣))𝑥 = (𝑙( ·𝑠𝑣)𝑦))} = {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ ∃𝑙𝐾 𝑥 = (𝑙 · 𝑦))})
3212, 31qseq12d 39419 . . 3 ((𝑣 = 𝑉𝑏 = ((Base‘𝑣) ∖ {(0g𝑣)})) → (𝑏 / {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝑏𝑦𝑏) ∧ ∃𝑙 ∈ (Base‘(Scalar‘𝑣))𝑥 = (𝑙( ·𝑠𝑣)𝑦))}) = (𝐵 / {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ ∃𝑙𝐾 𝑥 = (𝑙 · 𝑦))}))
333, 32csbied 3864 . 2 (𝑣 = 𝑉((Base‘𝑣) ∖ {(0g𝑣)}) / 𝑏(𝑏 / {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝑏𝑦𝑏) ∧ ∃𝑙 ∈ (Base‘(Scalar‘𝑣))𝑥 = (𝑙( ·𝑠𝑣)𝑦))}) = (𝐵 / {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ ∃𝑙𝐾 𝑥 = (𝑙 · 𝑦))}))
34 df-prjsp 39596 . 2 ℙ𝕣𝕠𝕛 = (𝑣 ∈ LVec ↦ ((Base‘𝑣) ∖ {(0g𝑣)}) / 𝑏(𝑏 / {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝑏𝑦𝑏) ∧ ∃𝑙 ∈ (Base‘(Scalar‘𝑣))𝑥 = (𝑙( ·𝑠𝑣)𝑦))}))
35 fvex 6658 . . . . 5 (Base‘𝑉) ∈ V
3635difexi 5196 . . . 4 ((Base‘𝑉) ∖ {(0g𝑉)}) ∈ V
378, 36eqeltri 2886 . . 3 𝐵 ∈ V
3837qsex 8339 . 2 (𝐵 / {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ ∃𝑙𝐾 𝑥 = (𝑙 · 𝑦))}) ∈ V
3933, 34, 38fvmpt 6745 1 (𝑉 ∈ LVec → (ℙ𝕣𝕠𝕛‘𝑉) = (𝐵 / {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ ∃𝑙𝐾 𝑥 = (𝑙 · 𝑦))}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 399   = wceq 1538  wcel 2111  wrex 3107  Vcvv 3441  csb 3828  cdif 3878  {csn 4525  {copab 5092  cfv 6324  (class class class)co 7135   / cqs 8271  Basecbs 16475  Scalarcsca 16560   ·𝑠 cvsca 16561  0gc0g 16705  LVecclvec 19867  ℙ𝕣𝕠𝕛cprjsp 39595
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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pr 5295  ax-un 7441
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-ov 7138  df-ec 8274  df-qs 8278  df-prjsp 39596
This theorem is referenced by:  prjspval2  39607  prjspnval2  39611
  Copyright terms: Public domain W3C validator