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 40442
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 6787 . . . . 5 (Base‘𝑣) ∈ V
21difexi 5252 . . . 4 ((Base‘𝑣) ∖ {(0g𝑣)}) ∈ V
32a1i 11 . . 3 (𝑣 = 𝑉 → ((Base‘𝑣) ∖ {(0g𝑣)}) ∈ V)
4 fveq2 6774 . . . . . . . . 9 (𝑣 = 𝑉 → (Base‘𝑣) = (Base‘𝑉))
5 fveq2 6774 . . . . . . . . . 10 (𝑣 = 𝑉 → (0g𝑣) = (0g𝑉))
65sneqd 4573 . . . . . . . . 9 (𝑣 = 𝑉 → {(0g𝑣)} = {(0g𝑉)})
74, 6difeq12d 4058 . . . . . . . 8 (𝑣 = 𝑉 → ((Base‘𝑣) ∖ {(0g𝑣)}) = ((Base‘𝑉) ∖ {(0g𝑉)}))
8 prjspval.b . . . . . . . 8 𝐵 = ((Base‘𝑉) ∖ {(0g𝑉)})
97, 8eqtr4di 2796 . . . . . . 7 (𝑣 = 𝑉 → ((Base‘𝑣) ∖ {(0g𝑣)}) = 𝐵)
109eqeq2d 2749 . . . . . 6 (𝑣 = 𝑉 → (𝑏 = ((Base‘𝑣) ∖ {(0g𝑣)}) ↔ 𝑏 = 𝐵))
1110biimpd 228 . . . . 5 (𝑣 = 𝑉 → (𝑏 = ((Base‘𝑣) ∖ {(0g𝑣)}) → 𝑏 = 𝐵))
1211imp 407 . . . 4 ((𝑣 = 𝑉𝑏 = ((Base‘𝑣) ∖ {(0g𝑣)})) → 𝑏 = 𝐵)
1311imdistani 569 . . . . . 6 ((𝑣 = 𝑉𝑏 = ((Base‘𝑣) ∖ {(0g𝑣)})) → (𝑣 = 𝑉𝑏 = 𝐵))
14 eleq2 2827 . . . . . . . 8 (𝑏 = 𝐵 → (𝑥𝑏𝑥𝐵))
15 eleq2 2827 . . . . . . . 8 (𝑏 = 𝐵 → (𝑦𝑏𝑦𝐵))
1614, 15anbi12d 631 . . . . . . 7 (𝑏 = 𝐵 → ((𝑥𝑏𝑦𝑏) ↔ (𝑥𝐵𝑦𝐵)))
17 fveq2 6774 . . . . . . . . . . 11 (𝑣 = 𝑉 → (Scalar‘𝑣) = (Scalar‘𝑉))
18 prjspval.s . . . . . . . . . . 11 𝑆 = (Scalar‘𝑉)
1917, 18eqtr4di 2796 . . . . . . . . . 10 (𝑣 = 𝑉 → (Scalar‘𝑣) = 𝑆)
2019fveq2d 6778 . . . . . . . . 9 (𝑣 = 𝑉 → (Base‘(Scalar‘𝑣)) = (Base‘𝑆))
21 prjspval.k . . . . . . . . 9 𝐾 = (Base‘𝑆)
2220, 21eqtr4di 2796 . . . . . . . 8 (𝑣 = 𝑉 → (Base‘(Scalar‘𝑣)) = 𝐾)
23 fveq2 6774 . . . . . . . . . . 11 (𝑣 = 𝑉 → ( ·𝑠𝑣) = ( ·𝑠𝑉))
24 prjspval.x . . . . . . . . . . 11 · = ( ·𝑠𝑉)
2523, 24eqtr4di 2796 . . . . . . . . . 10 (𝑣 = 𝑉 → ( ·𝑠𝑣) = · )
2625oveqd 7292 . . . . . . . . 9 (𝑣 = 𝑉 → (𝑙( ·𝑠𝑣)𝑦) = (𝑙 · 𝑦))
2726eqeq2d 2749 . . . . . . . 8 (𝑣 = 𝑉 → (𝑥 = (𝑙( ·𝑠𝑣)𝑦) ↔ 𝑥 = (𝑙 · 𝑦)))
2822, 27rexeqbidv 3337 . . . . . . 7 (𝑣 = 𝑉 → (∃𝑙 ∈ (Base‘(Scalar‘𝑣))𝑥 = (𝑙( ·𝑠𝑣)𝑦) ↔ ∃𝑙𝐾 𝑥 = (𝑙 · 𝑦)))
2916, 28bi2anan9r 637 . . . . . 6 ((𝑣 = 𝑉𝑏 = 𝐵) → (((𝑥𝑏𝑦𝑏) ∧ ∃𝑙 ∈ (Base‘(Scalar‘𝑣))𝑥 = (𝑙( ·𝑠𝑣)𝑦)) ↔ ((𝑥𝐵𝑦𝐵) ∧ ∃𝑙𝐾 𝑥 = (𝑙 · 𝑦))))
3013, 29syl 17 . . . . 5 ((𝑣 = 𝑉𝑏 = ((Base‘𝑣) ∖ {(0g𝑣)})) → (((𝑥𝑏𝑦𝑏) ∧ ∃𝑙 ∈ (Base‘(Scalar‘𝑣))𝑥 = (𝑙( ·𝑠𝑣)𝑦)) ↔ ((𝑥𝐵𝑦𝐵) ∧ ∃𝑙𝐾 𝑥 = (𝑙 · 𝑦))))
3130opabbidv 5140 . . . 4 ((𝑣 = 𝑉𝑏 = ((Base‘𝑣) ∖ {(0g𝑣)})) → {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝑏𝑦𝑏) ∧ ∃𝑙 ∈ (Base‘(Scalar‘𝑣))𝑥 = (𝑙( ·𝑠𝑣)𝑦))} = {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ ∃𝑙𝐾 𝑥 = (𝑙 · 𝑦))})
3212, 31qseq12d 40214 . . 3 ((𝑣 = 𝑉𝑏 = ((Base‘𝑣) ∖ {(0g𝑣)})) → (𝑏 / {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝑏𝑦𝑏) ∧ ∃𝑙 ∈ (Base‘(Scalar‘𝑣))𝑥 = (𝑙( ·𝑠𝑣)𝑦))}) = (𝐵 / {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ ∃𝑙𝐾 𝑥 = (𝑙 · 𝑦))}))
333, 32csbied 3870 . 2 (𝑣 = 𝑉((Base‘𝑣) ∖ {(0g𝑣)}) / 𝑏(𝑏 / {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝑏𝑦𝑏) ∧ ∃𝑙 ∈ (Base‘(Scalar‘𝑣))𝑥 = (𝑙( ·𝑠𝑣)𝑦))}) = (𝐵 / {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ ∃𝑙𝐾 𝑥 = (𝑙 · 𝑦))}))
34 df-prjsp 40441 . 2 ℙ𝕣𝕠𝕛 = (𝑣 ∈ LVec ↦ ((Base‘𝑣) ∖ {(0g𝑣)}) / 𝑏(𝑏 / {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝑏𝑦𝑏) ∧ ∃𝑙 ∈ (Base‘(Scalar‘𝑣))𝑥 = (𝑙( ·𝑠𝑣)𝑦))}))
35 fvex 6787 . . . . 5 (Base‘𝑉) ∈ V
3635difexi 5252 . . . 4 ((Base‘𝑉) ∖ {(0g𝑉)}) ∈ V
378, 36eqeltri 2835 . . 3 𝐵 ∈ V
3837qsex 8565 . 2 (𝐵 / {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ ∃𝑙𝐾 𝑥 = (𝑙 · 𝑦))}) ∈ V
3933, 34, 38fvmpt 6875 1 (𝑉 ∈ LVec → (ℙ𝕣𝕠𝕛‘𝑉) = (𝐵 / {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ ∃𝑙𝐾 𝑥 = (𝑙 · 𝑦))}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396   = wceq 1539  wcel 2106  wrex 3065  Vcvv 3432  csb 3832  cdif 3884  {csn 4561  {copab 5136  cfv 6433  (class class class)co 7275   / cqs 8497  Basecbs 16912  Scalarcsca 16965   ·𝑠 cvsca 16966  0gc0g 17150  LVecclvec 20364  ℙ𝕣𝕠𝕛cprjsp 40440
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pr 5352
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-iota 6391  df-fun 6435  df-fv 6441  df-ov 7278  df-ec 8500  df-qs 8504  df-prjsp 40441
This theorem is referenced by:  prjspval2  40452  prjspnval2  40457
  Copyright terms: Public domain W3C validator