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 39471
Description: The covers relation implies no in-betweenness. (cvnbtwn 32357 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 39467 . . . 4 (𝜑 → (𝑅𝐶𝑇 ↔ (𝑅𝑇 ∧ ¬ ∃𝑢𝑆 (𝑅𝑢𝑢𝑇))))
81, 7mpbid 232 . . 3 (𝜑 → (𝑅𝑇 ∧ ¬ ∃𝑢𝑆 (𝑅𝑢𝑢𝑇)))
98simprd 495 . 2 (𝜑 → ¬ ∃𝑢𝑆 (𝑅𝑢𝑢𝑇))
10 lcvnbtwn.u . . 3 (𝜑𝑈𝑆)
11 psseq2 4031 . . . . 5 (𝑢 = 𝑈 → (𝑅𝑢𝑅𝑈))
12 psseq1 4030 . . . . 5 (𝑢 = 𝑈 → (𝑢𝑇𝑈𝑇))
1311, 12anbi12d 633 . . . 4 (𝑢 = 𝑈 → ((𝑅𝑢𝑢𝑇) ↔ (𝑅𝑈𝑈𝑇)))
1413rspcev 3564 . . 3 ((𝑈𝑆 ∧ (𝑅𝑈𝑈𝑇)) → ∃𝑢𝑆 (𝑅𝑢𝑢𝑇))
1510, 14sylan 581 . 2 ((𝜑 ∧ (𝑅𝑈𝑈𝑇)) → ∃𝑢𝑆 (𝑅𝑢𝑢𝑇))
169, 15mtand 816 1 (𝜑 → ¬ (𝑅𝑈𝑈𝑇))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395   = wceq 1542  wcel 2114  wrex 3061  wpss 3890   class class class wbr 5085  cfv 6498  LSubSpclss 20926  L clcv 39464
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-iota 6454  df-fun 6500  df-fv 6506  df-lcv 39465
This theorem is referenced by:  lcvntr  39472  lcvnbtwn2  39473  lcvnbtwn3  39474
  Copyright terms: Public domain W3C validator