Mathbox for Norm Megill < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  lcvfbr Structured version   Visualization version   GIF version

Theorem lcvfbr 34625
 Description: The covers relation for a left vector space (or a left module). (Contributed by NM, 7-Jan-2015.)
Hypotheses
Ref Expression
lcvfbr.s 𝑆 = (LSubSp‘𝑊)
lcvfbr.c 𝐶 = ( ⋖L𝑊)
lcvfbr.w (𝜑𝑊𝑋)
Assertion
Ref Expression
lcvfbr (𝜑𝐶 = {⟨𝑡, 𝑢⟩ ∣ ((𝑡𝑆𝑢𝑆) ∧ (𝑡𝑢 ∧ ¬ ∃𝑠𝑆 (𝑡𝑠𝑠𝑢)))})
Distinct variable groups:   𝑡,𝑠,𝑢,𝑆   𝑊,𝑠,𝑡,𝑢
Allowed substitution hints:   𝜑(𝑢,𝑡,𝑠)   𝐶(𝑢,𝑡,𝑠)   𝑋(𝑢,𝑡,𝑠)

Proof of Theorem lcvfbr
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 lcvfbr.c . 2 𝐶 = ( ⋖L𝑊)
2 lcvfbr.w . . 3 (𝜑𝑊𝑋)
3 elex 3243 . . 3 (𝑊𝑋𝑊 ∈ V)
4 fveq2 6229 . . . . . . . . 9 (𝑤 = 𝑊 → (LSubSp‘𝑤) = (LSubSp‘𝑊))
5 lcvfbr.s . . . . . . . . 9 𝑆 = (LSubSp‘𝑊)
64, 5syl6eqr 2703 . . . . . . . 8 (𝑤 = 𝑊 → (LSubSp‘𝑤) = 𝑆)
76eleq2d 2716 . . . . . . 7 (𝑤 = 𝑊 → (𝑡 ∈ (LSubSp‘𝑤) ↔ 𝑡𝑆))
86eleq2d 2716 . . . . . . 7 (𝑤 = 𝑊 → (𝑢 ∈ (LSubSp‘𝑤) ↔ 𝑢𝑆))
97, 8anbi12d 747 . . . . . 6 (𝑤 = 𝑊 → ((𝑡 ∈ (LSubSp‘𝑤) ∧ 𝑢 ∈ (LSubSp‘𝑤)) ↔ (𝑡𝑆𝑢𝑆)))
106rexeqdv 3175 . . . . . . . 8 (𝑤 = 𝑊 → (∃𝑠 ∈ (LSubSp‘𝑤)(𝑡𝑠𝑠𝑢) ↔ ∃𝑠𝑆 (𝑡𝑠𝑠𝑢)))
1110notbid 307 . . . . . . 7 (𝑤 = 𝑊 → (¬ ∃𝑠 ∈ (LSubSp‘𝑤)(𝑡𝑠𝑠𝑢) ↔ ¬ ∃𝑠𝑆 (𝑡𝑠𝑠𝑢)))
1211anbi2d 740 . . . . . 6 (𝑤 = 𝑊 → ((𝑡𝑢 ∧ ¬ ∃𝑠 ∈ (LSubSp‘𝑤)(𝑡𝑠𝑠𝑢)) ↔ (𝑡𝑢 ∧ ¬ ∃𝑠𝑆 (𝑡𝑠𝑠𝑢))))
139, 12anbi12d 747 . . . . 5 (𝑤 = 𝑊 → (((𝑡 ∈ (LSubSp‘𝑤) ∧ 𝑢 ∈ (LSubSp‘𝑤)) ∧ (𝑡𝑢 ∧ ¬ ∃𝑠 ∈ (LSubSp‘𝑤)(𝑡𝑠𝑠𝑢))) ↔ ((𝑡𝑆𝑢𝑆) ∧ (𝑡𝑢 ∧ ¬ ∃𝑠𝑆 (𝑡𝑠𝑠𝑢)))))
1413opabbidv 4749 . . . 4 (𝑤 = 𝑊 → {⟨𝑡, 𝑢⟩ ∣ ((𝑡 ∈ (LSubSp‘𝑤) ∧ 𝑢 ∈ (LSubSp‘𝑤)) ∧ (𝑡𝑢 ∧ ¬ ∃𝑠 ∈ (LSubSp‘𝑤)(𝑡𝑠𝑠𝑢)))} = {⟨𝑡, 𝑢⟩ ∣ ((𝑡𝑆𝑢𝑆) ∧ (𝑡𝑢 ∧ ¬ ∃𝑠𝑆 (𝑡𝑠𝑠𝑢)))})
15 df-lcv 34624 . . . 4 L = (𝑤 ∈ V ↦ {⟨𝑡, 𝑢⟩ ∣ ((𝑡 ∈ (LSubSp‘𝑤) ∧ 𝑢 ∈ (LSubSp‘𝑤)) ∧ (𝑡𝑢 ∧ ¬ ∃𝑠 ∈ (LSubSp‘𝑤)(𝑡𝑠𝑠𝑢)))})
16 fvex 6239 . . . . . . 7 (LSubSp‘𝑊) ∈ V
175, 16eqeltri 2726 . . . . . 6 𝑆 ∈ V
1817, 17xpex 7004 . . . . 5 (𝑆 × 𝑆) ∈ V
19 opabssxp 5227 . . . . 5 {⟨𝑡, 𝑢⟩ ∣ ((𝑡𝑆𝑢𝑆) ∧ (𝑡𝑢 ∧ ¬ ∃𝑠𝑆 (𝑡𝑠𝑠𝑢)))} ⊆ (𝑆 × 𝑆)
2018, 19ssexi 4836 . . . 4 {⟨𝑡, 𝑢⟩ ∣ ((𝑡𝑆𝑢𝑆) ∧ (𝑡𝑢 ∧ ¬ ∃𝑠𝑆 (𝑡𝑠𝑠𝑢)))} ∈ V
2114, 15, 20fvmpt 6321 . . 3 (𝑊 ∈ V → ( ⋖L𝑊) = {⟨𝑡, 𝑢⟩ ∣ ((𝑡𝑆𝑢𝑆) ∧ (𝑡𝑢 ∧ ¬ ∃𝑠𝑆 (𝑡𝑠𝑠𝑢)))})
222, 3, 213syl 18 . 2 (𝜑 → ( ⋖L𝑊) = {⟨𝑡, 𝑢⟩ ∣ ((𝑡𝑆𝑢𝑆) ∧ (𝑡𝑢 ∧ ¬ ∃𝑠𝑆 (𝑡𝑠𝑠𝑢)))})
231, 22syl5eq 2697 1 (𝜑𝐶 = {⟨𝑡, 𝑢⟩ ∣ ((𝑡𝑆𝑢𝑆) ∧ (𝑡𝑢 ∧ ¬ ∃𝑠𝑆 (𝑡𝑠𝑠𝑢)))})
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 383   = wceq 1523   ∈ wcel 2030  ∃wrex 2942  Vcvv 3231   ⊊ wpss 3608  {copab 4745   × cxp 5141  ‘cfv 5926  LSubSpclss 18980   ⋖L clcv 34623 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-8 2032  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-sep 4814  ax-nul 4822  ax-pow 4873  ax-pr 4936  ax-un 6991 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ral 2946  df-rex 2947  df-rab 2950  df-v 3233  df-sbc 3469  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-nul 3949  df-if 4120  df-pw 4193  df-sn 4211  df-pr 4213  df-op 4217  df-uni 4469  df-br 4686  df-opab 4746  df-mpt 4763  df-id 5053  df-xp 5149  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-iota 5889  df-fun 5928  df-fv 5934  df-lcv 34624 This theorem is referenced by:  lcvbr  34626
 Copyright terms: Public domain W3C validator