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

Theorem lcvnbtwn2 39226
Description: The covers relation implies no in-betweenness. (cvnbtwn2 32311 analog.) (Contributed by NM, 7-Jan-2015.)
Hypotheses
Ref Expression
lcvnbtwn.s 𝑆 = (LSubSp‘𝑊)
lcvnbtwn.c 𝐶 = ( ⋖L𝑊)
lcvnbtwn.w (𝜑𝑊𝑋)
lcvnbtwn.r (𝜑𝑅𝑆)
lcvnbtwn.t (𝜑𝑇𝑆)
lcvnbtwn.u (𝜑𝑈𝑆)
lcvnbtwn.d (𝜑𝑅𝐶𝑇)
lcvnbtwn2.p (𝜑𝑅𝑈)
lcvnbtwn2.q (𝜑𝑈𝑇)
Assertion
Ref Expression
lcvnbtwn2 (𝜑𝑈 = 𝑇)

Proof of Theorem lcvnbtwn2
StepHypRef Expression
1 lcvnbtwn2.p . 2 (𝜑𝑅𝑈)
2 lcvnbtwn2.q . 2 (𝜑𝑈𝑇)
3 lcvnbtwn.s . . . 4 𝑆 = (LSubSp‘𝑊)
4 lcvnbtwn.c . . . 4 𝐶 = ( ⋖L𝑊)
5 lcvnbtwn.w . . . 4 (𝜑𝑊𝑋)
6 lcvnbtwn.r . . . 4 (𝜑𝑅𝑆)
7 lcvnbtwn.t . . . 4 (𝜑𝑇𝑆)
8 lcvnbtwn.u . . . 4 (𝜑𝑈𝑆)
9 lcvnbtwn.d . . . 4 (𝜑𝑅𝐶𝑇)
103, 4, 5, 6, 7, 8, 9lcvnbtwn 39224 . . 3 (𝜑 → ¬ (𝑅𝑈𝑈𝑇))
11 iman 401 . . . 4 (((𝑅𝑈𝑈𝑇) → 𝑈 = 𝑇) ↔ ¬ ((𝑅𝑈𝑈𝑇) ∧ ¬ 𝑈 = 𝑇))
12 anass 468 . . . . . 6 (((𝑅𝑈𝑈𝑇) ∧ ¬ 𝑈 = 𝑇) ↔ (𝑅𝑈 ∧ (𝑈𝑇 ∧ ¬ 𝑈 = 𝑇)))
13 dfpss2 4038 . . . . . . 7 (𝑈𝑇 ↔ (𝑈𝑇 ∧ ¬ 𝑈 = 𝑇))
1413anbi2i 623 . . . . . 6 ((𝑅𝑈𝑈𝑇) ↔ (𝑅𝑈 ∧ (𝑈𝑇 ∧ ¬ 𝑈 = 𝑇)))
1512, 14bitr4i 278 . . . . 5 (((𝑅𝑈𝑈𝑇) ∧ ¬ 𝑈 = 𝑇) ↔ (𝑅𝑈𝑈𝑇))
1615notbii 320 . . . 4 (¬ ((𝑅𝑈𝑈𝑇) ∧ ¬ 𝑈 = 𝑇) ↔ ¬ (𝑅𝑈𝑈𝑇))
1711, 16bitr2i 276 . . 3 (¬ (𝑅𝑈𝑈𝑇) ↔ ((𝑅𝑈𝑈𝑇) → 𝑈 = 𝑇))
1810, 17sylib 218 . 2 (𝜑 → ((𝑅𝑈𝑈𝑇) → 𝑈 = 𝑇))
191, 2, 18mp2and 699 1 (𝜑𝑈 = 𝑇)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395   = wceq 1541  wcel 2113  wss 3899  wpss 3900   class class class wbr 5096  cfv 6490  LSubSpclss 20880  L clcv 39217
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-sep 5239  ax-nul 5249  ax-pow 5308  ax-pr 5375  ax-un 7678
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rab 3398  df-v 3440  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-br 5097  df-opab 5159  df-mpt 5178  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-iota 6446  df-fun 6492  df-fv 6498  df-lcv 39218
This theorem is referenced by:  lcvat  39229  lsatexch  39242
  Copyright terms: Public domain W3C validator