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

Theorem lcvbr2 39607
Description: The covers relation for a left vector space (or a left module). (cvbr2 32443 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
lcvbr2 (𝜑 → (𝑇𝐶𝑈 ↔ (𝑇𝑈 ∧ ∀𝑠𝑆 ((𝑇𝑠𝑠𝑈) → 𝑠 = 𝑈))))
Distinct variable groups:   𝑆,𝑠   𝑊,𝑠   𝑇,𝑠   𝑈,𝑠
Allowed substitution hints:   𝜑(𝑠)   𝐶(𝑠)   𝑋(𝑠)

Proof of Theorem lcvbr2
StepHypRef Expression
1 lcvfbr.s . . 3 𝑆 = (LSubSp‘𝑊)
2 lcvfbr.c . . 3 𝐶 = ( ⋖L𝑊)
3 lcvfbr.w . . 3 (𝜑𝑊𝑋)
4 lcvfbr.t . . 3 (𝜑𝑇𝑆)
5 lcvfbr.u . . 3 (𝜑𝑈𝑆)
61, 2, 3, 4, 5lcvbr 39606 . 2 (𝜑 → (𝑇𝐶𝑈 ↔ (𝑇𝑈 ∧ ¬ ∃𝑠𝑆 (𝑇𝑠𝑠𝑈))))
7 iman 405 . . . . . 6 (((𝑇𝑠𝑠𝑈) → 𝑠 = 𝑈) ↔ ¬ ((𝑇𝑠𝑠𝑈) ∧ ¬ 𝑠 = 𝑈))
8 anass 472 . . . . . . 7 (((𝑇𝑠𝑠𝑈) ∧ ¬ 𝑠 = 𝑈) ↔ (𝑇𝑠 ∧ (𝑠𝑈 ∧ ¬ 𝑠 = 𝑈)))
9 dfpss2 4039 . . . . . . . 8 (𝑠𝑈 ↔ (𝑠𝑈 ∧ ¬ 𝑠 = 𝑈))
109anbi2i 632 . . . . . . 7 ((𝑇𝑠𝑠𝑈) ↔ (𝑇𝑠 ∧ (𝑠𝑈 ∧ ¬ 𝑠 = 𝑈)))
118, 10bitr4i 280 . . . . . 6 (((𝑇𝑠𝑠𝑈) ∧ ¬ 𝑠 = 𝑈) ↔ (𝑇𝑠𝑠𝑈))
127, 11xchbinx 336 . . . . 5 (((𝑇𝑠𝑠𝑈) → 𝑠 = 𝑈) ↔ ¬ (𝑇𝑠𝑠𝑈))
1312ralbii 3107 . . . 4 (∀𝑠𝑆 ((𝑇𝑠𝑠𝑈) → 𝑠 = 𝑈) ↔ ∀𝑠𝑆 ¬ (𝑇𝑠𝑠𝑈))
14 ralnex 3087 . . . 4 (∀𝑠𝑆 ¬ (𝑇𝑠𝑠𝑈) ↔ ¬ ∃𝑠𝑆 (𝑇𝑠𝑠𝑈))
1513, 14bitri 277 . . 3 (∀𝑠𝑆 ((𝑇𝑠𝑠𝑈) → 𝑠 = 𝑈) ↔ ¬ ∃𝑠𝑆 (𝑇𝑠𝑠𝑈))
1615anbi2i 632 . 2 ((𝑇𝑈 ∧ ∀𝑠𝑆 ((𝑇𝑠𝑠𝑈) → 𝑠 = 𝑈)) ↔ (𝑇𝑈 ∧ ¬ ∃𝑠𝑆 (𝑇𝑠𝑠𝑈)))
176, 16bitr4di 291 1 (𝜑 → (𝑇𝐶𝑈 ↔ (𝑇𝑈 ∧ ∀𝑠𝑆 ((𝑇𝑠𝑠𝑈) → 𝑠 = 𝑈))))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 208  wa 399   = wceq 1559  wcel 2141  wral 3075  wrex 3085  wss 3902  wpss 3903   class class class wbr 5097  cfv 6516  LSubSpclss 20986  L clcv 39603
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5243  ax-nul 5253  ax-pow 5319  ax-pr 5387  ax-un 7713
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-br 5098  df-opab 5160  df-mpt 5179  df-id 5538  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-iota 6472  df-fun 6518  df-fv 6524  df-lcv 39604
This theorem is referenced by:  lsmcv2  39614  lsat0cv  39618
  Copyright terms: Public domain W3C validator