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

Theorem lcvbr 39522
Description: The covers relation for a left vector space (or a left module). (cvbr 32372 analog.) (Contributed by NM, 9-Jan-2015.)
Hypotheses
Ref Expression
lcvfbr.s 𝑆 = (LSubSp‘𝑊)
lcvfbr.c 𝐶 = ( ⋖L𝑊)
lcvfbr.w (𝜑𝑊𝑋)
lcvfbr.t (𝜑𝑇𝑆)
lcvfbr.u (𝜑𝑈𝑆)
Assertion
Ref Expression
lcvbr (𝜑 → (𝑇𝐶𝑈 ↔ (𝑇𝑈 ∧ ¬ ∃𝑠𝑆 (𝑇𝑠𝑠𝑈))))
Distinct variable groups:   𝑆,𝑠   𝑊,𝑠   𝑇,𝑠   𝑈,𝑠
Allowed substitution hints:   𝜑(𝑠)   𝐶(𝑠)   𝑋(𝑠)

Proof of Theorem lcvbr
Dummy variables 𝑡 𝑢 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 lcvfbr.t . . 3 (𝜑𝑇𝑆)
2 lcvfbr.u . . 3 (𝜑𝑈𝑆)
3 eleq1 2827 . . . . . 6 (𝑡 = 𝑇 → (𝑡𝑆𝑇𝑆))
43anbi1d 637 . . . . 5 (𝑡 = 𝑇 → ((𝑡𝑆𝑢𝑆) ↔ (𝑇𝑆𝑢𝑆)))
5 psseq1 4022 . . . . . 6 (𝑡 = 𝑇 → (𝑡𝑢𝑇𝑢))
6 psseq1 4022 . . . . . . . . 9 (𝑡 = 𝑇 → (𝑡𝑠𝑇𝑠))
76anbi1d 637 . . . . . . . 8 (𝑡 = 𝑇 → ((𝑡𝑠𝑠𝑢) ↔ (𝑇𝑠𝑠𝑢)))
87rexbidv 3163 . . . . . . 7 (𝑡 = 𝑇 → (∃𝑠𝑆 (𝑡𝑠𝑠𝑢) ↔ ∃𝑠𝑆 (𝑇𝑠𝑠𝑢)))
98notbid 319 . . . . . 6 (𝑡 = 𝑇 → (¬ ∃𝑠𝑆 (𝑡𝑠𝑠𝑢) ↔ ¬ ∃𝑠𝑆 (𝑇𝑠𝑠𝑢)))
105, 9anbi12d 638 . . . . 5 (𝑡 = 𝑇 → ((𝑡𝑢 ∧ ¬ ∃𝑠𝑆 (𝑡𝑠𝑠𝑢)) ↔ (𝑇𝑢 ∧ ¬ ∃𝑠𝑆 (𝑇𝑠𝑠𝑢))))
114, 10anbi12d 638 . . . 4 (𝑡 = 𝑇 → (((𝑡𝑆𝑢𝑆) ∧ (𝑡𝑢 ∧ ¬ ∃𝑠𝑆 (𝑡𝑠𝑠𝑢))) ↔ ((𝑇𝑆𝑢𝑆) ∧ (𝑇𝑢 ∧ ¬ ∃𝑠𝑆 (𝑇𝑠𝑠𝑢)))))
12 eleq1 2827 . . . . . 6 (𝑢 = 𝑈 → (𝑢𝑆𝑈𝑆))
1312anbi2d 636 . . . . 5 (𝑢 = 𝑈 → ((𝑇𝑆𝑢𝑆) ↔ (𝑇𝑆𝑈𝑆)))
14 psseq2 4023 . . . . . 6 (𝑢 = 𝑈 → (𝑇𝑢𝑇𝑈))
15 psseq2 4023 . . . . . . . . 9 (𝑢 = 𝑈 → (𝑠𝑢𝑠𝑈))
1615anbi2d 636 . . . . . . . 8 (𝑢 = 𝑈 → ((𝑇𝑠𝑠𝑢) ↔ (𝑇𝑠𝑠𝑈)))
1716rexbidv 3163 . . . . . . 7 (𝑢 = 𝑈 → (∃𝑠𝑆 (𝑇𝑠𝑠𝑢) ↔ ∃𝑠𝑆 (𝑇𝑠𝑠𝑈)))
1817notbid 319 . . . . . 6 (𝑢 = 𝑈 → (¬ ∃𝑠𝑆 (𝑇𝑠𝑠𝑢) ↔ ¬ ∃𝑠𝑆 (𝑇𝑠𝑠𝑈)))
1914, 18anbi12d 638 . . . . 5 (𝑢 = 𝑈 → ((𝑇𝑢 ∧ ¬ ∃𝑠𝑆 (𝑇𝑠𝑠𝑢)) ↔ (𝑇𝑈 ∧ ¬ ∃𝑠𝑆 (𝑇𝑠𝑠𝑈))))
2013, 19anbi12d 638 . . . 4 (𝑢 = 𝑈 → (((𝑇𝑆𝑢𝑆) ∧ (𝑇𝑢 ∧ ¬ ∃𝑠𝑆 (𝑇𝑠𝑠𝑢))) ↔ ((𝑇𝑆𝑈𝑆) ∧ (𝑇𝑈 ∧ ¬ ∃𝑠𝑆 (𝑇𝑠𝑠𝑈)))))
21 eqid 2739 . . . 4 {⟨𝑡, 𝑢⟩ ∣ ((𝑡𝑆𝑢𝑆) ∧ (𝑡𝑢 ∧ ¬ ∃𝑠𝑆 (𝑡𝑠𝑠𝑢)))} = {⟨𝑡, 𝑢⟩ ∣ ((𝑡𝑆𝑢𝑆) ∧ (𝑡𝑢 ∧ ¬ ∃𝑠𝑆 (𝑡𝑠𝑠𝑢)))}
2211, 20, 21brabg 5482 . . 3 ((𝑇𝑆𝑈𝑆) → (𝑇{⟨𝑡, 𝑢⟩ ∣ ((𝑡𝑆𝑢𝑆) ∧ (𝑡𝑢 ∧ ¬ ∃𝑠𝑆 (𝑡𝑠𝑠𝑢)))}𝑈 ↔ ((𝑇𝑆𝑈𝑆) ∧ (𝑇𝑈 ∧ ¬ ∃𝑠𝑆 (𝑇𝑠𝑠𝑈)))))
231, 2, 22syl2anc 590 . 2 (𝜑 → (𝑇{⟨𝑡, 𝑢⟩ ∣ ((𝑡𝑆𝑢𝑆) ∧ (𝑡𝑢 ∧ ¬ ∃𝑠𝑆 (𝑡𝑠𝑠𝑢)))}𝑈 ↔ ((𝑇𝑆𝑈𝑆) ∧ (𝑇𝑈 ∧ ¬ ∃𝑠𝑆 (𝑇𝑠𝑠𝑈)))))
24 lcvfbr.s . . . 4 𝑆 = (LSubSp‘𝑊)
25 lcvfbr.c . . . 4 𝐶 = ( ⋖L𝑊)
26 lcvfbr.w . . . 4 (𝜑𝑊𝑋)
2724, 25, 26lcvfbr 39521 . . 3 (𝜑𝐶 = {⟨𝑡, 𝑢⟩ ∣ ((𝑡𝑆𝑢𝑆) ∧ (𝑡𝑢 ∧ ¬ ∃𝑠𝑆 (𝑡𝑠𝑠𝑢)))})
2827breqd 5084 . 2 (𝜑 → (𝑇𝐶𝑈𝑇{⟨𝑡, 𝑢⟩ ∣ ((𝑡𝑆𝑢𝑆) ∧ (𝑡𝑢 ∧ ¬ ∃𝑠𝑆 (𝑡𝑠𝑠𝑢)))}𝑈))
291, 2jca 516 . . 3 (𝜑 → (𝑇𝑆𝑈𝑆))
3029biantrurd 537 . 2 (𝜑 → ((𝑇𝑈 ∧ ¬ ∃𝑠𝑆 (𝑇𝑠𝑠𝑈)) ↔ ((𝑇𝑆𝑈𝑆) ∧ (𝑇𝑈 ∧ ¬ ∃𝑠𝑆 (𝑇𝑠𝑠𝑈)))))
3123, 28, 303bitr4d 312 1 (𝜑 → (𝑇𝐶𝑈 ↔ (𝑇𝑈 ∧ ¬ ∃𝑠𝑆 (𝑇𝑠𝑠𝑈))))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 207  wa 396   = wceq 1547  wcel 2119  wrex 3063  wpss 3884   class class class wbr 5073  {copab 5135  cfv 6486  LSubSpclss 20922  L clcv 39519
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-sep 5219  ax-nul 5229  ax-pow 5295  ax-pr 5363  ax-un 7679
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3903  df-nul 4263  df-if 4456  df-pw 4532  df-sn 4557  df-pr 4559  df-op 4563  df-uni 4840  df-br 5074  df-opab 5136  df-mpt 5155  df-id 5514  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-iota 6442  df-fun 6488  df-fv 6494  df-lcv 39520
This theorem is referenced by:  lcvbr2  39523  lcvbr3  39524  lcvpss  39525  lcvnbtwn  39526  lsatcv0  39532  mapdcv  42161
  Copyright terms: Public domain W3C validator