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

Theorem lcvnbtwn 39043
Description: The covers relation implies no in-betweenness. (cvnbtwn 32267 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 (𝜑𝑅𝐶𝑇)
Assertion
Ref Expression
lcvnbtwn (𝜑 → ¬ (𝑅𝑈𝑈𝑇))

Proof of Theorem lcvnbtwn
Dummy variable 𝑢 is distinct from all other variables.
StepHypRef Expression
1 lcvnbtwn.d . . . 4 (𝜑𝑅𝐶𝑇)
2 lcvnbtwn.s . . . . 5 𝑆 = (LSubSp‘𝑊)
3 lcvnbtwn.c . . . . 5 𝐶 = ( ⋖L𝑊)
4 lcvnbtwn.w . . . . 5 (𝜑𝑊𝑋)
5 lcvnbtwn.r . . . . 5 (𝜑𝑅𝑆)
6 lcvnbtwn.t . . . . 5 (𝜑𝑇𝑆)
72, 3, 4, 5, 6lcvbr 39039 . . . 4 (𝜑 → (𝑅𝐶𝑇 ↔ (𝑅𝑇 ∧ ¬ ∃𝑢𝑆 (𝑅𝑢𝑢𝑇))))
81, 7mpbid 232 . . 3 (𝜑 → (𝑅𝑇 ∧ ¬ ∃𝑢𝑆 (𝑅𝑢𝑢𝑇)))
98simprd 495 . 2 (𝜑 → ¬ ∃𝑢𝑆 (𝑅𝑢𝑢𝑇))
10 lcvnbtwn.u . . 3 (𝜑𝑈𝑆)
11 psseq2 4066 . . . . 5 (𝑢 = 𝑈 → (𝑅𝑢𝑅𝑈))
12 psseq1 4065 . . . . 5 (𝑢 = 𝑈 → (𝑢𝑇𝑈𝑇))
1311, 12anbi12d 632 . . . 4 (𝑢 = 𝑈 → ((𝑅𝑢𝑢𝑇) ↔ (𝑅𝑈𝑈𝑇)))
1413rspcev 3601 . . 3 ((𝑈𝑆 ∧ (𝑅𝑈𝑈𝑇)) → ∃𝑢𝑆 (𝑅𝑢𝑢𝑇))
1510, 14sylan 580 . 2 ((𝜑 ∧ (𝑅𝑈𝑈𝑇)) → ∃𝑢𝑆 (𝑅𝑢𝑢𝑇))
169, 15mtand 815 1 (𝜑 → ¬ (𝑅𝑈𝑈𝑇))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395   = wceq 1540  wcel 2108  wrex 3060  wpss 3927   class class class wbr 5119  cfv 6531  LSubSpclss 20888  L clcv 39036
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-sep 5266  ax-nul 5276  ax-pow 5335  ax-pr 5402  ax-un 7729
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3416  df-v 3461  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-pss 3946  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-br 5120  df-opab 5182  df-mpt 5202  df-id 5548  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-iota 6484  df-fun 6533  df-fv 6539  df-lcv 39037
This theorem is referenced by:  lcvntr  39044  lcvnbtwn2  39045  lcvnbtwn3  39046
  Copyright terms: Public domain W3C validator